基于稀疏学习和流形学习的KNN算法研究-计算机应用技术专业论文.docxVIP

Research Research on KNN Algorithm based on Sparse Learning and Manifold Learning Grade：2013 Tutor：Professor Zhang Shichao Name：Sun Ke Major：Computer Application Technology Research Direction：Data Mining Abstract The purpose of data mining is to extract useful rules from a large number of complex data, and form useful model．With the development of science and technology，especially the big data concept proposed recent year，we are entering an era of data resources development．Data mining technology is getting more and more popular,and it plays all important role in many fields，such as industrial development，health care，information industry and SO on． KNN(k—nearest neighbor)algorithm is one of the”ten classic algorithms of data mining”， because of its simplicity and clarity,easy operation and superior performance characteristics of complex data sets，in machine learning，data mining and other fields has been widely used．But there are some disadvantages in KNN algorithm itself．For example，the determination of K value is an open problem，usually,K value is determined by the user，but this method has a strong randomness，to some extent，rely on the experience of user．Some other method gets the value of K by ten·fold cross method．Although this method Can avoid the blindness of selecting K value tO determine the specific value of K，there are shortcomings such as large amount of calculation，low efficiency,and not taking into account the structural characteristics of the data itself．In addition，in real sample data itself,it may contain noise，traditional KNN algorithm does not consider removing noise samples，thus a lot of noise samples will affect rule model and the accuracy of the formation．Secondly,during the projection transformation， KNN algorithm does not consider the sample the manifold structure problem of the sample space，sample space projection transformation in spatial position will change，but the sample manifold structure is maintained relatively constant，the relatively