Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining
暂无分享,去创建一个
[1] Gordon T. Wilfong. Nearest neighbor problems , 1991, SCG '91.
[2] Filiberto Pla,et al. Prototype selection for the nearest neighbour rule through proximity graphs , 1997, Pattern Recognit. Lett..
[3] Rich Caruana,et al. Greedy Attribute Selection , 1994, ICML.
[4] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.
[5] Josef Kittler,et al. Pattern recognition : a statistical approach , 1982 .
[6] Simon Kasif,et al. The Complexity of Finding Minimal Voronoi Covers with Applications to Machine Learning , 1993, Comput. Geom..
[7] Marek Grochowski,et al. Comparison of Instance Selection Algorithms II. Results and Comments , 2004, ICAISC.
[8] Prosenjit Bose,et al. On simplifying dot maps , 2004, Comput. Geom..
[9] Belur V. Dasarathy,et al. Tandem fusion of nearest neighbor editing and condensing algorithms - data dimensionality effects , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.
[10] Luc Devroye,et al. On the Inequality of Cover and Hart in Nearest Neighbor Discrimination , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[11] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[12] Miroslav Kubat,et al. Voting Nearest-Neighbor Subclassifiers , 2000, International Conference on Machine Learning.
[13] David W. Aha,et al. Weighting Features , 1995, ICCBR.
[14] S. G. Smyth,et al. Designing multilayer perceptrons from nearest-neighbor systems , 1992, IEEE Trans. Neural Networks.
[15] Nirmal K. Bose,et al. Neural network design using Voronoi diagrams , 1993, IEEE Trans. Neural Networks.
[16] Jack Koplowitz,et al. On the relation of performance to editing in nearest neighbor rules , 1981, Pattern Recognit..
[17] Ramón López de Mántaras,et al. Machine Learning from Examples: Inductive and Lazy Methods , 1998, Data Knowl. Eng..
[18] Godfried Toussaint,et al. Geometric Decision Rules for High Dimensions , .
[19] Stephen D. Bay,et al. Mining distance-based outliers in near linear time with randomization and a simple pruning rule , 2003, KDD '03.
[20] Randy L. Brown. Accelerated template matching using template trees grown by condensation , 1995, IEEE Trans. Syst. Man Cybern..
[21] Christopher J. C. Burges,et al. Simplified Support Vector Decision Rules , 1996, ICML.
[22] Mihaela Scuturici,et al. Topological Query in Image Databases , 2003, CIARP.
[23] Demetri Psaltis,et al. On the finite sample performance of the nearest neighbor classifier , 1993, IEEE Trans. Inf. Theory.
[24] John D. Radke,et al. On the Shape of a Set of Points , 1988 .
[25] W. Eric L. Grimson,et al. Prototype optimization for nearest-neighbor classification , 2002, Pattern Recognit..
[26] Raymond T. Ng,et al. Distance-based outliers: algorithms and applications , 2000, The VLDB Journal.
[27] Fabrice Muhlenbach,et al. Separability Index in Supervised Learning , 2002, PKDD.
[28] Francesco Ricci,et al. Advanced metrics for class-driven similarity search , 1999, Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99.
[29] Godfried T. Toussaint,et al. Some new algorithms and software implementation methods for pattern recognition research , 1979, COMPSAC.
[30] Tom Downs,et al. Exact Simplification of Support Vector Solutions , 2002, J. Mach. Learn. Res..
[31] Ivan Tomek,et al. A Generalization of the k-NN Rule , 1976, IEEE Transactions on Systems, Man, and Cybernetics.
[32] Jack Snoeyink,et al. Almost-Delaunay simplices: nearest neighbor relations for imprecise points , 2004, SODA '04.
[33] Jianping Zhang,et al. Selecting Typical Instances in Instance-Based Learning , 1992, ML.
[34] Thomas M. Cover,et al. Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..
[35] Matthew B. Squire,et al. A Multivariate Two-Sample Test Using the Voronoi Diagram , 2003 .
[36] Chin-Liang Chang,et al. Finding Prototypes For Nearest Neighbor Classifiers , 1974, IEEE Transactions on Computers.
[37] Francesc J. Ferri,et al. An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering , 2002, Pattern Recognit..
[38] Masaki Nakagawa,et al. Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition , 2001, Pattern Recognit..
[39] Luisa Micó,et al. A modification of the LAESA algorithm for approximated k-NN classification , 2003, Pattern Recognit. Lett..
[40] Kazuo Hattori,et al. A new edited k-nearest neighbor rule in the pattern classification problem , 2000, Pattern Recognit..
[41] Luisa Micó,et al. A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements , 1994, Pattern Recognit. Lett..
[42] Kuhu Pal,et al. Breast cancer detection using rank nearest neighbor classification rules , 2003, Pattern Recognit..
[43] C. J. Stone,et al. Optimal Rates of Convergence for Nonparametric Estimators , 1980 .
[44] Fabrice Muhlenbach,et al. Improving Classification by Removing or Relabeling Mislabeled Instances , 2002, ISMIS.
[45] Bruce W. Weide,et al. Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.
[46] Wolfgang Maass,et al. On the Computational Power of Winner-Take-All , 2000, Neural Computation.
[47] Filiberto Pla,et al. On the use of neighbourhood-based non-parametric classifiers , 1997, Pattern Recognit. Lett..
[48] David W. Aha,et al. Instance-Based Learning Algorithms , 1991, Machine Learning.
[49] Thomas M. Cover,et al. The Best Two Independent Measurements Are Not the Two Best , 1974, IEEE Trans. Syst. Man Cybern..
[50] Simon Kasif,et al. Best-Case Results for Nearest-Neighbor Learning , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[51] Godfried T. Toussaint,et al. PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .
[52] Thomas Reinartz,et al. A Unifying View on Instance Selection , 2002, Data Mining and Knowledge Discovery.
[53] Anil K. Jain,et al. A k-nearest neighbor artificial neural network classifier , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.
[54] Wolfgang Maass,et al. Neural Computation with Winner-Take-All as the Only Nonlinear Operation , 1999, NIPS.
[55] Zhi-Hua Zhou,et al. Editing Training Data for kNN Classifiers with Neural Network Ensemble , 2004, ISNN.
[56] Peter E. Hart,et al. Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.
[57] Binay K. Bhattacharya,et al. Reference set thinning for the k-nearest neighbor decision rule , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).
[58] K. Fukuda. Frequently Asked Questions in Polyhedral Computation , 2000 .
[59] David J. Hand,et al. Ten More Years of Error Rate Research , 2000 .
[60] Christos H. Papadimitriou,et al. A Worst-Case Analysis of Nearest Neighbor Searching by Projection , 1980, ICALP.
[61] Belur V. Dasarathy,et al. Nearest Neighbour Editing and Condensing Tools–Synergy Exploitation , 2000, Pattern Analysis & Applications.
[62] Chris Mellish,et al. Identifying Competence-Critical Instances for Instance-Based Learners , 2001 .
[63] Godfried T. Toussaint,et al. Pattern recognition , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[64] Jan Vahrenhold,et al. Reverse Nearest Neighbor Queries , 2002, Encyclopedia of GIS.
[65] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[66] Theofanis Sapatinas,et al. Discriminant Analysis and Statistical Pattern Recognition , 2005 .
[67] Wai Lam,et al. Prototype Generation Based on Instance Filtering and Averaging , 2000, PAKDD.
[68] Uri Lipowezky. Selection of the optimal prototype subset for 1-NN classification , 1998, Pattern Recognit. Lett..
[69] Lakhmi C. Jain,et al. Nearest neighbor classifier: Simultaneous editing and feature selection , 1999, Pattern Recognit. Lett..
[70] J. Friedman,et al. Multivariate generalizations of the Wald--Wolfowitz and Smirnov two-sample tests , 1979 .
[71] C. Decaestecker,et al. How to "secure" the decisions of a NN classifier , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).
[72] Sanjeev R. Kulkarni,et al. Learning Pattern Classification - A Survey , 1998, IEEE Trans. Inf. Theory.
[73] Godfried T. Toussaint,et al. Algorithms for bivariate medians and a fermat-torricelli problem for lines , 2001, CCCG.
[74] David W. Aha,et al. Comparing Instance-Averaging with Instance-Filtering Learning Algorithms , 1988, EWSL.
[75] B. John Oommen,et al. Enhancing prototype reduction schemes with LVQ3-type algorithms , 2003, Pattern Recognit..
[76] Terry J. Wagner. Convergence of the edited nearest neighbor (Corresp.) , 1973, IEEE Trans. Inf. Theory.
[77] Vic Barnett,et al. Outliers in Statistical Data , 1980 .
[78] Marek Grochowski,et al. Comparison of Instances Seletion Algorithms I. Algorithms Survey , 2004, ICAISC.
[79] Belur V. Dasarathy. Nearest unlike neighbor (NUN): an aid to decision confidence estimation , 1995 .
[80] Hong Yan. Prototype optimization for nearest neighbor classifiers using a two-layer perceptron , 1993, Pattern Recognit..
[81] Shigeo Abe DrEng. Pattern Classification , 2001, Springer London.
[82] Sergio Bermejo,et al. Adaptive soft k-nearest-neighbor classifiers , 1999, Pattern Recognit..
[83] J. Klostermeyer,et al. Comments on a Paper by C. O. Hines, ‘A critique of multilayer analyses in application to the propagation of acoustic‐gravity waves’ , 1973 .
[84] Francesco Ricci,et al. Data Compression and Local Metrics for Nearest Neighbor Classification , 1999, IEEE Trans. Pattern Anal. Mach. Intell..
[85] Barry Smyth,et al. Remembering To Forget: A Competence-Preserving Case Deletion Policy for Case-Based Reasoning Systems , 1995, IJCAI.
[86] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..
[87] James C. Bezdek,et al. Nearest prototype classification: clustering, genetic algorithms, or random search? , 1998, IEEE Trans. Syst. Man Cybern. Part C.
[88] Sahibsingh A. Dudani. The Distance-Weighted k-Nearest-Neighbor Rule , 1976, IEEE Transactions on Systems, Man, and Cybernetics.
[89] Sergio Bermejo,et al. Adaptive soft k-nearest-neighbour classifiers , 2000, Pattern Recognit..
[90] Godfried T. Toussaint,et al. Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.
[91] David W. Aha,et al. Tolerating Noisy, Irrelevant and Novel Attributes in Instance-Based Learning Algorithms , 1992, Int. J. Man Mach. Stud..
[92] Keinosuke Fukunaga,et al. The optimal distance measure for nearest neighbor classification , 1981, IEEE Trans. Inf. Theory.
[93] Manuel Castejón Limas,et al. Outlier Detection and Data Cleaning in Multivariate Non-Normal Samples: The PAELLA Algorithm , 2004, Data Mining and Knowledge Discovery.
[94] Godfried T. Toussaint. ALGORITHMS FOR COMPUTING RELATIVE NEIGHBOURHOOD GRAPH. , 1980 .
[95] Owen Murphy,et al. Computing Nearest Neighbor Pattern Classification Perceptrons , 1995, Inf. Sci..
[96] Anil K. Jain,et al. NOTE ON DISTANCE-WEIGHTED k-NEAREST NEIGHBOR RULES. , 1978 .
[97] Roberto Alejo,et al. Analysis of new techniques to obtain quality training sets , 2003, Pattern Recognit. Lett..
[98] Atsuyuki Okabe,et al. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.
[99] Robert I. Damper,et al. On neural-network implementations of k-nearest neighbor pattern classifiers , 1997 .
[100] Raimund Seidel,et al. Exact Upper Bounds for the Number of Faces in d-Dimensional Voronoi Diagrams , 1990, Applied Geometry And Discrete Mathematics.
[101] Asish Mukhopadhyay,et al. Fast algorithms for computing Beta-skeletons and their relatives , 2001, Pattern Recognit..
[102] Shaul Markovitch,et al. Information filtering: Selection mechanisms in learning systems , 1993, Mach. Learn..
[103] Miguel Toro,et al. Finding representative patterns with ordered projections , 2003, Pattern Recognit..
[104] Marc Sebban,et al. Selection and Statistical Validation of Features and Prototypes , 1999, PKDD.
[105] László Györfi,et al. A Probabilistic Theory of Pattern Recognition , 1996, Stochastic Modelling and Applied Probability.
[106] Hugh B. Woodruff,et al. An algorithm for a selective nearest neighbor decision rule (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[107] Sridhar Ramaswamy,et al. Efficient algorithms for mining outliers from large data sets , 2000, SIGMOD '00.
[108] Sung-Yang Bang,et al. A new neural network model based on nearest neighbor classifier , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.
[109] José Salvador Sánchez,et al. High training set size reduction by space partitioning and prototype abstraction , 2004, Pattern Recognit..
[110] Godfried T. Toussaint,et al. Bibliography on estimation of misclassification , 1974, IEEE Trans. Inf. Theory.
[111] Richard Lippmann,et al. Using Genetic Algorithms to Improve Pattern Classification Performance , 1990, NIPS.
[112] Peter E. Hart,et al. The condensed nearest neighbor rule (Corresp.) , 1968, IEEE Trans. Inf. Theory.
[113] Charles X. Ling,et al. Computing Optimal Attribute Weight Settings for Nearest Neighbor Algorithms , 1997, Artificial Intelligence Review.
[114] Sandip Sen,et al. A Genetic Prototype Learner , 1995, IJCAI.
[115] Martin E. Hellman,et al. The Nearest Neighbor Classification Rule with a Reject Option , 1970, IEEE Trans. Syst. Sci. Cybern..
[116] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.
[117] Mansur R. Kabuka,et al. Design of Supervised Classifiers Using Boolean Neural Networks , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[118] I. I. Esat,et al. Neural network design based on decomposition of decision space , 1999, ICONIP'99. ANZIIS'99 & ANNES'99 & ACNN'99. 6th International Conference on Neural Information Processing. Proceedings (Cat. No.99EX378).
[119] K. Fukunaga,et al. Nonparametric Data Reduction , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[120] G. Toussaint. An upper bound on the probability of misclassification in terms of the affinity , 1977, Proceedings of the IEEE.
[121] Kuldip K. Paliwal,et al. Voronoi Projection-Based Fast Nearest-Neighbor Search Algorithms: Box-Search and Mapping Table-Based Search Techniques , 1997, Digit. Signal Process..
[122] Clara Pizzuti,et al. Fast Outlier Detection in High Dimensional Spaces , 2002, PKDD.
[123] M. A. Wong,et al. A Hybrid Clustering Method for Identifying High-Density Clusters , 1982 .
[124] Camillo Gentile,et al. An improved Voronoi-diagram based neural net for pattern classification , 1999, IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339).
[125] Bryan L. Shader,et al. Sphere-of-influence graphs using the sup-norm , 2000 .
[126] Freddy Fierens,et al. The effects of data filtering on neural network learning , 1998, Neurocomputing.
[127] Richard Nock,et al. Advances in Adaptive Prototype Weighting and Selection , 2001, Int. J. Artif. Intell. Tools.
[128] Christian Posse,et al. Likelihood-Based Data Squashing: A Modeling Approach to Instance Construction , 2002, Data Mining and Knowledge Discovery.
[129] M. R. Brito,et al. Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection , 1997 .
[130] David G. Stork,et al. Pattern Classification , 1973 .
[131] Venu Govindaraju,et al. Improved k-nearest neighbor classification , 2002, Pattern Recognit..
[132] Thomas Ottmann,et al. Enumerating Extreme Points in Higher Dimensions , 2001, Nord. J. Comput..
[133] Teuvo Kohonen,et al. Self-Organizing Maps , 2010 .
[134] Sunil Arya,et al. Accounting for boundary effects in nearest-neighbor searching , 1996, Discret. Comput. Geom..
[135] Tony R. Martinez,et al. An Integrated Instance‐Based Learning Algorithm , 2000, Comput. Intell..
[136] M. Narasimha Murty,et al. An incremental prototype set building technique , 2002, Pattern Recognit..
[137] Joseph ORourke,et al. Computational Geometry in C Second Edition , 1998 .
[138] Christine Decaestecker,et al. Finding prototypes for nearest neighbour classification by means of gradient descent and deterministic annealing , 1997, Pattern Recognit..
[139] T. Wagner,et al. Another Look at the Edited Nearest Neighbor Rule. , 1976 .
[140] R. Bareiss. Exemplar-Based Knowledge Acquisition , 1989 .
[141] Mihaela Scuturici,et al. Topological representation model for image database query , 2005, J. Exp. Theor. Artif. Intell..
[142] Michael A. Soss. The Size of the Open Sphere of Influence Graph in Linfty Metric Spaces , 1998, GD.
[143] Bilge Karaçali,et al. Fast minimization of structural risk by nearest neighbor rule , 2003, IEEE Trans. Neural Networks.
[144] G. Gates. The Reduced Nearest Neighbor Rule , 1998 .
[145] K. Matusita. On the notion of affinity of several distributions and some of its applications , 1967 .
[146] D. Kirkpatrick,et al. A Framework for Computational Morphology , 1985 .
[147] Peter L. Hammer,et al. Distance-Based Classification Methods , 1999 .
[148] Vicente Cerverón,et al. Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem , 1998, RANDOM.
[149] Larry D. Hostetler,et al. k-nearest-neighbor Bayes-risk estimation , 1975, IEEE Trans. Inf. Theory.
[150] David W. Aha,et al. Learning Representative Exemplars of Concepts: An Initial Case Study , 1987 .
[151] Tatsuo Higuchi,et al. Evolutionary learning of nearest-neighbor MLP , 1996, IEEE Trans. Neural Networks.
[152] Nikhil R. Pal,et al. Cluster validation using graph theoretic concepts , 1997, Pattern Recognit..
[153] Michael A. Soss. On the size of the euclidean sphere of influence graph , 1999, CCCG.
[154] Francisco Casacuberta,et al. Median strings for k-nearest neighbour classification , 2003, Pattern Recognit. Lett..
[155] Shinn-Ying Ho,et al. Design of an optimal nearest neighbor classifier using an intelligent genetic algorithm , 2002, Pattern Recognit. Lett..
[156] Fabrice Muhlenbach,et al. Outlier Handling in the Neighbourhood-Based Learning of a Continuous Class , 2004, Discovery Science.
[157] Tony R. Martinez,et al. Reduction Techniques for Instance-Based Learning Algorithms , 2000, Machine Learning.
[158] Mark L. Nagurka,et al. A vector quantization method for nearest neighbor classifier design , 2004, Pattern Recognit. Lett..
[159] Jerome H. Friedman,et al. Flexible Metric Nearest Neighbor Classification , 1994 .
[160] Robert P. W. Duin,et al. K-nearest Neighbors Directed Noise Injection in Multilayer Perceptron Training , 2000, IEEE Trans. Neural Networks Learn. Syst..
[161] Dennis L. Wilson,et al. Asymptotic Properties of Nearest Neighbor Rules Using Edited Data , 1972, IEEE Trans. Syst. Man Cybern..
[162] Kenneth L. Clarkson,et al. Nearest Neighbor Queries in Metric Spaces , 1997, STOC '97.
[163] H. Tahani,et al. A new data reduction algorithm for pattern classification , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.
[164] Godfried T. Toussaint,et al. Feature Evaluation with Quadratic Mutual Information , 1972, Inf. Process. Lett..
[165] Rajeev Rastogi,et al. Efficient algorithms for mining outliers from large data sets , 2000, SIGMOD 2000.
[166] Yuen-Hsien Tseng,et al. On a Constant-Time, Low-Complexity Winner-Take-All Neural Network , 1995, IEEE Trans. Computers.
[167] K. Florek,et al. Sur la liaison et la division des points d'un ensemble fini , 1951 .
[168] Ray Bareiss,et al. Exemplar-Based Knowledge Acquisition: A Unified Approach to Concept Representation, Classification, and Learning , 1990 .
[169] G. Krishna,et al. The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[170] Fabrice Muhlenbach,et al. A statistical approach for separability of classes , 2005 .
[171] Richard Nock,et al. Boosting Neighborhood-Based Classifiers , 2001, ICML.
[172] Tetsuya Hoya,et al. Graph theoretic techniques for pruning data and their applications , 1998, IEEE Trans. Signal Process..
[173] Roderick Urquhart,et al. Graph theoretical clustering based on limited neighbourhood sets , 1982, Pattern Recognition.
[174] Marina L. Gavrilova. On a Nearest-Neighbor Problem Under Minkowski and Power Metrics for Large Data Sets , 2004, The Journal of Supercomputing.
[175] Pat Langley,et al. Selection of Relevant Features and Examples in Machine Learning , 1997, Artif. Intell..
[176] C. J. Stone,et al. Consistent Nonparametric Regression , 1977 .
[177] James C. Bezdek,et al. Multiple-prototype classifier design , 1998, IEEE Trans. Syst. Man Cybern. Part C.
[178] G. Gates,et al. The reduced nearest neighbor rule (Corresp.) , 1972, IEEE Trans. Inf. Theory.
[179] Francesc J. Ferri,et al. Another move toward the minimum consistent subset: a tabu search approach to the condensed nearest neighbor rule , 2001, IEEE Trans. Syst. Man Cybern. Part B.
[180] Robert Tibshirani,et al. Discriminant Adaptive Nearest Neighbor Classification , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[181] Mineichi Kudo,et al. Piecewise linear classifiers with an appropriate number of hyperplanes , 1998, Pattern Recognit..
[182] Qiangfu Zhao. Stable online evolutionary learning of NN-MLP , 1997, IEEE Trans. Neural Networks.
[183] Jan M. Van Campenhout,et al. On the Possible Orderings in the Measurement Selection Problem , 1977, IEEE Transactions on Systems, Man, and Cybernetics.
[184] Huan Liu,et al. On Issues of Instance Selection , 2002, Data Mining and Knowledge Discovery.
[185] Pat Morin,et al. Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries , 2003, WADS.
[186] Ethem Alpaydin,et al. Voting over Multiple Condensed Nearest Neighbors , 1997, Artificial Intelligence Review.
[187] Douglas M. Hawkins. Identification of Outliers , 1980, Monographs on Applied Probability and Statistics.
[188] Carla E. Brodley,et al. Identifying Mislabeled Training Data , 1999, J. Artif. Intell. Res..
[189] Godfried T. Toussaint,et al. Comments on 'A modified figure of merit for feature selection in pattern recognition' by Paul, J. E., Jr., et al , 1971, IEEE Trans. Inf. Theory.
[190] Godfried T. Toussaint,et al. Note on optimal selection of independent binary-valued features for pattern recognition (Corresp.) , 1971, IEEE Trans. Inf. Theory.
[191] I. Tomek,et al. Two Modifications of CNN , 1976 .
[192] Jack Sklansky,et al. Locally Trained Piecewise Linear Classifiers , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[193] I. Vajda. A CONTRIBUTION TO THE INFORMATIONAL ANALYSIS OF PATTERN , 1969 .
[194] Divyakant Agrawal,et al. Reverse Nearest Neighbor Queries for Dynamic Databases , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.
[195] Zengyou He,et al. Mining class outliers: concepts, algorithms and applications in CRM , 2004, Expert Syst. Appl..
[196] Jon M. Kleinberg,et al. Two algorithms for nearest-neighbor search in high dimensions , 1997, STOC '97.
[197] Chris Mellish,et al. Advances in Instance Selection for Instance-Based Learning Algorithms , 2002, Data Mining and Knowledge Discovery.
[198] Amar Mitiche,et al. Pattern classification by a condensed neural network , 2001, Neural Networks.
[199] M. Schilling. Multivariate Two-Sample Tests Based on Nearest Neighbors , 1986 .
[200] G. Toussaint. A Graph-Theoretical Primal Sketch , 1988 .
[201] Yoram Baram,et al. A geometric approach to consistent classification , 2000, Pattern Recognit..
[202] David Eppstein,et al. On Nearest-Neighbor Graphs , 1992, ICALP.
[203] P. J. Huber. The 1972 Wald Lecture Robust Statistics: A Review , 1972 .
[204] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[205] J. Sklansky,et al. Automated design of multiple-class piecewise linear classifiers , 1989 .
[206] Dennis F. Kibler,et al. Symbolic Nearest Mean Classifiers , 1997, AAAI/IAAI.
[207] Carey E. Priebe,et al. Classification Using Class Cover Catch Digraphs , 2003, J. Classif..
[208] Pascal Vincent,et al. K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms , 2001, NIPS.
[209] Godfried T. Toussaint,et al. Some properties of Matusita's measure of affinity of several distributions , 1974 .
[210] D. Avis,et al. REMARKS ON THE SPHERE OF INFLUENCE GRAPH , 1985 .
[211] Ned Glick,et al. Additive estimators for probabilities of correct classification , 1978, Pattern Recognit..
[212] Hongbin Zhang,et al. Optimal reference subset selection for nearest neighbor classification by tabu search , 2002, Pattern Recognit..
[213] Pravin M. Vaidya,et al. AnO(n logn) algorithm for the all-nearest-neighbors Problem , 1989, Discret. Comput. Geom..
[214] G. Rota. Basic Concepts in Information Theory and Statistics, A.M. Mathai, P.N. Rathie. Wiley (1975), 137 pp , 1977 .
[215] Ching Y. Suen,et al. A new method of optimizing prototypes for nearest neighbor classifiers using a multi-layer network , 1995, Pattern Recognit. Lett..
[216] Divesh Srivastava,et al. Reverse Nearest Neighbor Aggregates Over Data Streams , 2002, VLDB.
[217] S. Muthukrishnan,et al. Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD '00.
[218] G. Toussaint. Probability of error, expected divergence, and the affinity of several distributions , 1978 .
[219] O. J. Murphy,et al. Nearest neighbor pattern classification perceptrons , 1990, Proc. IEEE.
[220] L. A. Goodman,et al. Measures of association for cross classifications , 1979 .
[221] Greg Aloupis,et al. Lower Bounds for Computing Statistical Depth , 2002 .
[222] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1976, TOMS.
[223] Anil K. Jain,et al. Bootstrap Techniques for Error Estimation , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[224] M. Sharir,et al. Sphere-of-influence graphs in higher dimensions , 1994 .
[225] Abdelhamid Djouadi. On the Reduction of the Nearest-Neighbor Variation for More Accurate Classification and Error Estimates , 1998, IEEE Trans. Pattern Anal. Mach. Intell..
[226] Belur V. Dasarathy,et al. Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design , 1994, IEEE Trans. Syst. Man Cybern..
[227] Rex A. Dwyer. The Expected Size of the Sphere-of-influence Graph , 1995, Comput. Geom..
[228] C. G. Hilborn,et al. The Condensed Nearest Neighbor Rule , 1967 .
[229] Ludmila I. Kuncheva,et al. Fitness functions in editing k-NN reference set by genetic algorithms , 1997, Pattern Recognit..
[230] T. S. Michael,et al. Sphere of influence graphs in general metric spaces , 1999 .
[231] C. A. Murthy,et al. Finding a Subset of Representative Points in a Data Set , 1994, IEEE Trans. Syst. Man Cybern. Syst..
[232] Lee J. White,et al. A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them , 1978, Pattern Recognit..
[233] Godfried T. Toussaint,et al. A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule , 1994, Pattern Recognit. Lett..
[234] Forest Baskett,et al. An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.
[235] E. Chavez,et al. Pivot selection techniques for proximity searching in metric spaces , 2001, SCCC 2001. 21st International Conference of the Chilean Computer Science Society.
[236] Manabu Ichino,et al. The relative neighborhood graph for mixed feature variables , 1985, Pattern Recognit..
[237] Ruei-Chuan Chang,et al. On constructing the relative neighborhood graphs in EuclideanK-dimensional spaces , 2005, Computing.
[238] King-Ip Lin,et al. An index structure for efficient reverse nearest neighbor queries , 2001, Proceedings 17th International Conference on Data Engineering.
[239] K. R. Ramakrishnan,et al. Voronoi networks and their probability of misclassification , 2000, IEEE Trans. Neural Networks Learn. Syst..
[240] Nils J. Nilsson,et al. The Mathematical Foundations of Learning Machines , 1990 .
[241] B. Bhattacharya. Application of computational geometry to pattern recognition problems , 1982 .
[242] F. Pla,et al. Improving the k-NCN classification rule through heuristic modifications , 1998, Pattern Recognit. Lett..
[243] Belur V. Dasarathy,et al. Nearest neighbor (NN) norms: NN pattern classification techniques , 1991 .
[244] David L. Waltz,et al. Trading MIPS and memory for knowledge engineering , 1992, CACM.
[245] Wai Lam,et al. Learning good prototypes for classification using filtering and abstraction of instances , 2002, Pattern Recognit..
[246] Richard Nock,et al. A hybrid filter/wrapper approach of feature selection using information theory , 2002, Pattern Recognit..
[247] S. Salzberg. A nearest hyperrectangle learning method , 2004, Machine Learning.
[248] Martin E. Hellman,et al. Probability of error, equivocation, and the Chernoff bound , 1970, IEEE Trans. Inf. Theory.
[249] Wei Liu,et al. Efficient exemplars for classifier design , 1995 .
[250] C. Priebe,et al. On the distribution of the domination number for random class cover catch digraphs , 2001 .
[251] Leo Breiman,et al. Classification and Regression Trees , 1984 .
[252] Changhwan Lee,et al. Using Hellinger distance in a nearest neighbour classifier for relational databases , 1999, Knowl. Based Syst..
[253] Richard Nock,et al. Sharper Bounds for the Hardness of Prototype and Feature Selection , 2000, ALT.
[254] Hung-Ming Chen,et al. Design of nearest neighbor classifiers: multi-objective approach , 2005, Int. J. Approx. Reason..
[255] John S. Baras,et al. Combined compression and classification with learning vector quantization , 1999, IEEE Trans. Inf. Theory.
[256] David B. Skalak,et al. Using a Genetic Algorithm to Learn Prototypes for Case Retrieval and Classification , 1993 .
[257] David W. Aha,et al. A Review and Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms , 1997, Artificial Intelligence Review.
[258] Diogo Vieira Andrade,et al. Good approximations for the relative neighbourhood graph , 2001, CCCG.
[259] J. Davenport. Editor , 1960 .
[260] Chris Mellish,et al. On the Consistency of Information Filters for Lazy Learning Algorithms , 1999, PKDD.
[261] David B. Skalak,et al. Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms , 1994, ICML.
[262] Rex A. Dwyer. Higher-dimensional voronoi diagrams in linear expected time , 1989, SCG '89.
[263] Anil K. Jain,et al. Algorithms for Clustering Data , 1988 .
[264] Huan Liu,et al. A study of support vectors on model independent example selection , 1999, KDD '99.
[265] L. Devroye. THE EXPECTED SIZE OF SOME GRAPHS IN COMPUTATIONAL GEOMETRY , 1988 .
[266] Francisco Herrera,et al. Stratification for scaling up evolutionary prototype selection , 2005, Pattern Recognit. Lett..
[267] Pierre A. Devijver,et al. On a New Class of Bounds on Bayes Risk in Multihypothesis Pattern Recognition , 1974, IEEE Transactions on Computers.
[268] Fabrice Muhlenbach,et al. Identifying and Handling Mislabelled Instances , 2004, Journal of Intelligent Information Systems.
[269] Jack Sklansky,et al. Automated design of linear tree classifiers , 1990, Pattern Recognit..
[270] Salvatore J. Stolfo,et al. A Geometric Framework for Unsupervised Anomaly Detection , 2002, Applications of Data Mining in Computer Security.
[271] David L. Waltz,et al. Toward memory-based reasoning , 1986, CACM.
[272] Godfried T. Toussaint,et al. Sharper lower bounds for discrimination information in terms of variation (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[273] Godfried T. Toussaint. Comment: Algorithms for computing relative neighbourhood graph , 1980 .
[274] M. Narasimha Murty,et al. Bootstrapping for efficient handwritten digit recognition , 2001, Pattern Recognit..
[275] Vladimir Vapnik,et al. Statistical learning theory , 1998 .