Hit miss networks with applications to instance selection

Journal of Machine Learning Research

Volumn 9, Issue , 2008, Pages 997-1017

  Marchiori, Elena ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Graph based training set representation; Instance selection for instance based learning; Nearest neighbor

Indexed keywords

BOOLEAN FUNCTIONS; CLASSIFICATION (OF INFORMATION); CLASSIFIERS; EDUCATION; ITERATIVE METHODS; LEARNING ALGORITHMS; LEARNING SYSTEMS; STORAGE (MATERIALS); STRUCTURAL PROPERTIES;

(PL) PROPERTIES; (SPM) CLASSES; APPLIED (CO); BALANCE (WEIGHTING); CARDINALITY; CENTRAL POINT; CLASS LABELS; DATA SETS; DECISION RULES; GENERAL (CO); GENERALIZATION PERFORMANCE; GRAPH-BASED REPRESENTATIONS; INSTANCE BASED LEARNING (IBL); INSTANCE SELECTION; NEAREST NEIGHBOR (NN); NN CLASSIFIERS; REDUNDANT VARIABLES; STORAGE REDUCTION; STORAGE REQUIREMENTS; TRAINING SETS;

SET THEORY;

EID: 46249122128     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (38)

1. D.W. Aha, D. Kibler, and M.K. Albert. Instance-based learning algorithms. Machine Learning, 6: 37-66, 1991.
2. F. Angiulli. Fast nearest neighbor condensation for large data sets classification. IEEE Transactions on Knowledge and Data Engineering, 19(11): 1450-1464, 2007. ISSN 1041-4347.
3. V. Barnett. The ordering of multivariate data. J. Roy. Statist. Soc., Ser. A 139(3):318-355, 1976.
4. B. Bhattacharya and D. Kaller. Reference set thinning for the k-nearest neighbor decision rule. Proceedings of the 14th International Conference on Pattern Recognition, (1):238-243, 1998.
5. B. Bhattacharya, K. Mukherjee, and G. Toussaint. Geometric decision rules for instance-based learning problems. In Proceedings of the 1st International Conference on Pattern Recognition and Machine Intelligence (PReMI,05), number LNCS 3776, pages 60-69. Springer, 2005.
6. B.K. Bhattacharya. Application of computational geometry to pattern recognition problems. PhD Thesis. Simon Fraser University, School of Computing Science, Technical Report, TR 82-3, 1982.
7. H. Brighton and C. Mellish. On the consistency of information filters for lazy learning algorithms. In PKDD '99: Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery, pages 283-288. Springer-Verlag, 1999.
8. H. Brighton and C. Mellish. Advances in instance selection for instance-based learning algorithms. Data Mining and Knowledge Discovery, (6): 153-172, 2002.
9. R.M. Cameron-Jones. Instance selection by encoding length heuristic with random mutation hill climbing. In Proceedings of the Eighth Australian Joint Conference on Artificial Intelligence, pages 99-106, 1995.
10. O. Chapelle and A. Zien. Semi-supervised classification by low density separation. In Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, pages 57-64, 2005.
11. T. Cover and P. Hart. Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13:21-27, 1967.
12. B. V. Dasarathy. Minimal consistent set (mes) identification for optimal nearest neighbor decision systems design. IEEE Transactions on Systems, Man, and Cybernetics, 24(3):511-517, 1994.
13. J. Demsar. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1-30, 2006.
14. J. DeVinney and C.E. Priebe. The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association. Statistics and Probability Letters, 73 (1):37-50, 2005.
15. J. DeVinney and C.E. Priebe. A new family of proximity graphs: Class cover catch digraphs. Discrete Applied Mathematics, 154(14): 1975-1982, 2006.
16. E.J. Wegman D.J. Marchette and C.E. Priebe. Fast algorithms for classification using class cover catch digraphs. Handbook of Statistics, 24:331-358, 2005.
17. S.N. Dorogovtsev and J.F.F. Mendes. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, 2003.
18. P.J. Grother, G.T. Candela, and J.L. Blue. Fast implementation of nearest neighbor classifiers. Pattern Recognition, 30:459-465, 1997.
19. P. E. Hart. The condensed nearest neighbor rule. IEEE Transactions on Information Theory, 14: 515-516, 1968.
20. N. Jankowski and M. Grochowski. Comparison of instances selection algorithms i. algorithms survey. In Artificial Intelligence and Soft Computing, pages 598-603. Springer, 2004a.
21. N. Jankowski and M. Grochowski. Comparison of instances selection algorithms ii. results and comments. In Artificial Intelligence and Soft Computing, pages 580-585. Springer, 2004b.
22. J.W. Jaromczyk and G.T. Toussaint. Relative neighborhood graphs and their relatives. P-IEEE, 80: 1502-1517, 1992.
23. C.D.J. Marchette, C.E. Priebe, D.A. Socolinsky, and J.G. DeVinney. Classification using class cover catch digraphs. Journal of classification, 20(1):3-23, 2003.
24. K. Mukherjee. Application of the gabriel graph to instance-based learning. In M.sc. project, School of Computing Science, Simon Fraser University, 2004.
25. E. Pekalska, R.P. W. Duin, and P. Paclík. Prototype selection for dissimilarity-based classifiers. Pattern Recognition, 39(2): 189-208, 2006.
26. G. Ratsch, T. Onoda, and K.-R. Müller. Soft margins for AdaBoost. Machine Learning, 42(3): 287-320, 2001.
27. G.L. Ritter, H.B. Woodruff, S.R. Lowry, and T.L. Isenhour. An algorithm for a selective nearest neighbor decision rule. IEEE Transactions on Information Theory, 21(6):665-669, 1975.
28. J.S. Sánchez, F. Pia, and F.J. Ferri. Prototype selection for the nearest neighbour rule through proximity graphs. Pattern Recognition Letters, 18:507-513, 1997.
29. J. Sankaranarayanan, H. Samet, and A. Varshney. A fast all nearest neighbor algorithm for applications involving large point-clouds. Comput. Graph., 31(2): 157-174, 2007.
30. H. Shin and S. Cho. Neighborhood property based pattern selection for support vector machines. Neural Computation, (19):816-855, 2007.
31. I. Tomek. An experiment with the edited nearest-neighbor rule. IEEE Transactions on Systems, Man, and Cybernetics, 6(6):448-452, 1976.
32. G.T. Toussaint. Proximity graphs for nearest neighbor decision rules: recent progress. In Interface2002, 34th Symposium on Computing and Statistics, pages 83-106, 2002.
33. G.T. Toussaint, B.K. Bhattacharya, and R.S. Poulsen. The application of voronoi diagrams to nonparametric decision rules. In Proceedings of the 16th Symposium on Computer Science and Statistics, pages 97 -108, 1984.
34. A. Vezhnevets and O. Barinova. Avoiding boosting overfitting by removing "confusing" samples. In Proceedings of the 18th European Conference on Machine Learning (ECML), volume 4701, pages 430-441. LNCS, 2007.
35. D. L. Wilson. Asymptotic properties of nearest neighbor rules using edited data. IEEE Transactions on Systems, Man and Cybernetics, (2):408-420, 1972.
36. D.R. Wilson and T.R. Martinez. Instance pruning techniques. In Proc. 14th International Conference on Machine Learning, pages 403-411. Morgan Kaufmann, 1997.
37. D.R. Wilson and T.R. Martinez. Reduction techniques for instance-based learning algorithms. Machine Learning, 38(3):257-286, 2000.
38. D.A. Zighed, S. Lallich, and F. Muhlenbach. Separability index in supervised learning. In PKDD '02: Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery, pages 475-487. Springer-Verlag, 2002.