IEEE Transactions on Information Theory · 2005 · 141 citations · 18 references
ComputingComputer ScienceMathematicsData MiningMachine LearningStatistical LearningClassificationDigital Signal ProcessingDimensionality ReductionNearest Neighbor SearchPattern RecognitionSignal ProcessingConsistencyFourier Series AnalysisInfinite-dimensional Hilbert SpacesK-nearest NeighborsNearest-neighbor ClassificationSeparable SpacesStrong ConsistencyWeak Consistency
Let X be a random variable taking values in a separable Hilbert space X, with label Y/spl isin/{0,1}. We establish universal weak consistency of a nearest neighbor-type classifier based on n independent copies (X/sub i/,Y/sub i/) of the pair (X,Y), extending the classical result of Stone to infinite-dimensional Hilbert spaces. Under a mild condition on the distribution of X, we also prove strong consistency. We reduce the infinite dimension of X by considering only the first d coefficients of a Fourier series expansion of each X/sub i/, and then we perform k-nearest neighbor classification in /spl Ropf//sup d/. Both the dimension and the number of neighbors are automatically selected from the data using a simple data-splitting device. An application of this technique to a signal discrimination problem involving speech recordings is presented.
18
Nearest neighbor pattern classification
Thomas M. Cover, Peter E. Hart · IEEE Transactions on Information Theory · 1967 · 16.1K citations
Independent component analysis, A new concept?
Pierre Comon · Signal Processing · 1994 · 8.2K citations · Full text
Consistent Nonparametric Regression
Charles J. Stone · The Annals of Statistics · 1977 · 1.8K citations · Full text
Natural Sciences, Educational Measurement, Stochastic Modeling +8