InstanceRank: Bringing order to datasets

Pattern Recognition Letters

Volumn 31, Issue 2, 2010, Pages 133-142

  Vallejo, Carlos G ^a   Troyano, José A ^a   Ortega, F Javier ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Classification; Instance reduction; Instance based learning; Nearest neighbor; PageRank

Indexed keywords

DATA SETS; GOOGLE SEARCH ENGINE; INSTANCE BASED LEARNING; INSTANCE SELECTION; LEARNING DATABASE; NEAREST NEIGHBOR; NEAREST NEIGHBORS; PAGERANK; RANKING ALGORITHM; REDUCTION TECHNIQUES; SIMILAR SOLUTION; WEB PAGE;

SEARCH ENGINES; WORLD WIDE WEB;

LEARNING ALGORITHMS;

EID: 71549160037     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2009.09.022     Document Type: Article

References (26)

1. Aha D.W., Kibler D., and Albert M.K. Instance-based learning algorithms. Mach. Learn. 6 (1991) 37-66
2. Asuncion, A., Newman, D., 2007. UCI machine learning repository. URL:.
3. Bezdek J.C., and Kuncheva L.I. Nearest prototype classifier designs: An experimental study. Internat. J. Intell. Syst. 16 (2001) 1445-1473
4. Brighton H., and Mellish C. Advances in instance selection in instance-based learning algorithms. Data Min. Knowl. Disc. 6 2 (2002) 153-172
5. Brin, S., 1995. Near neighbor search in large metric spaces. In: Proceedings of the 21st VLDB Conference, pp. 574-584.
6. Brin S., and Page L. The anatomy of a large-scale hypertextual Web search engine. Comput. Networks ISDN Syst. 30 1-7 (1998) 107-117
7. Cameron-Jones, R.M., 1995. Instance selection by encoding length heuristic with random mutation hill climbing. In: Proceedings of the Eighth Australian Joint Conference on Artificial Intelligence. pp. 293-301.
8. Cost S., and Salzberg S. A weighted nearest neighbor algorithm for learning with symbolic features. Mach. Learn. 10 (1993) 57-78
9. Demšar J. Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7 (2006) 1-30
10. García S., and Herrera F. An extension on statistical comparisons of classifiers over multiple data sets for all pairwise comparisons. J. Mach. Learn. Res. 9 (2008) 2677-2694
11. Gómez-Ballester E., Micó L., and Oncina J. Some approaches to improve tree-based nearest neighbour search algorithms. Pattern Recogn. 39 2 (2006) 171-179
12. Hall, M.A., 1998. Correlation-based feature subset selection for machine learning. Ph.D. Thesis, University of Waikato, Hamilton, New Zealand.
13. Mihalcea, R., Tarau, P., 2004. Textrank: Bringing order into texts. In: Lin, D., Wu, D. (Eds.), Proceedings of EMNLP 2004. Association for Computational Linguistics, Barcelona, Spain, pp. 404-411.
14. Morring B.D., and Martinez T.R. Weighted instance typicality search (WITS): A nearest neighbor data reduction algorithm. Intell. Data Anal. 8 1 (2004) 61-78
15. Page, L., Brin, S., Motwani, R., Winograd, T., 1998. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project.
16. Papadimitriu C.H., and Bentley J.L. A worst-case analysis of nearest neighbor searching by projection. Lect. Notes Comput. Sci. 85 (1980) 470-482
17. Paredes R. Learning weighted metrics to minimize nearest-neighbor classification error. IEEE Trans. Pattern Anal. Machine Intell. 28 7 (2006) 1100-1110
18. Paredes R., and Vidal E. Learning prototypes and distances: A prototype reduction technique based on nearest neighbor error minimization. Pattern Recogn. 39 2 (2006) 180-188
19. Sproull R.F. Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica 6 (1991) 579-589
20. Vallejo, C.G., Troyano, J.A., Ortega, F.J., 2007. WIRS: Un algoritmo de reducción de instancias basado en ranking. In: CAEPIA'07: Proceeding of the 12th Conference of the Spanish Association for Artificial Intelligence, pp. 327-336.
21. Vidal E. An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recogn. Lett. 4 (1986) 145-157
22. Wilson D.R., and Martinez T.R. Improved heterogeneous distance functions. J. Artif. Intell. Res. 6 (1997) 1-34
23. Wilson D.R., and Martinez T.R. Reduction techniques for instance-based learning algorithms. Mach. Learn. 38 (2000) 257-286
24. Witten I.H., and Frank E. Data Mining: Practical Machine Learning Tools and Techniques. Second edition (2005), Morgan Kaufmann
25. Yianilos, P.N., 1993. Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA '93: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 311-321.
26. Zhang, J., 1992. Selecting typical instances in instance-based learning. In: ML92: Proceedings of the Ninth International Workshop on Machine Learning. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 470-479.