The Computer Journal · 2004 · 31 citations · 26 references
ComputingComputer ScienceData MiningInformation TheoryMachine LearningNearest Neighbor SearchScientific EvidenceK-nearest Neighbor PartitioningK-nearest Neighbor SearchK-nearest NeighborsNearest Neighbor Matching
An evidence theoretic classification method is proposed in this paper. In order to classify a pattern we consider its neighbours, which are taken as parts of a single source of evidence to support the class membership of the pattern. A single mass function or basic belief assignment is then derived, and the belief function and the pignistic ("betting rates") probability function can be calculated. Then the (posterior) conditional pignistic probability function is calculated and used to decide the class label for the pattern.
26
Chih-Chung Chang, Chih‐Jen Lin · ACM Transactions on Intelligent Systems and Technology · 2011 · 41.3K citations
Nearest neighbor pattern classification
Thomas M. Cover, Peter E. Hart · IEEE Transactions on Information Theory · 1967 · 16.1K citations
Josef Kittler, M. Hatef, Robert P. W. Duin et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1998 · 5.3K citations
David J. Hand, Heikki Mannila, Padhraic Smyth · 2001 · 2.4K citations