Pattern recognition via projection-based kNN rules

详细信息    查看全文

• 作者：Ricardo Fraiman ; Ana Justel ; Marcela Svarc
• 关键词：High-dimensional data ; ; none ; color ; black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6V8V-4Y34V27-1&_mathId=mml39&_user=10&_cdi=5880&_pii=S0167947309004617&_rdoc=18&_issn=01679473&_acct=C000050221&_vers
• 刊名：Computational Statistics and Data Analysis
• 出版年：2010
• 出版时间：1 May 2010
• 年：2010
• 卷：54
• 期：5
• 页码：1390-1403
• 全文大小：981 K

文摘

A new procedure for pattern recognition is introduced based on the concepts of random projections and nearest neighbors. It can be considered as an improvement of the classical nearest neighbor classification rules. Besides the concept of neighbors, the notion of district, a larger set into which the data will be projected, is introduced. Then a one-dimensional kNN method is applied to the projected data on randomly selected directions. This method, which is more accurate to handle high-dimensional data, has some robustness properties. The procedure is also universally consistent. Moreover, the method is challenged with the Isolet data set where a very high classification score is obtained.