Similarity-based data reduction techniques

Journal of Research and Practice in Information Technology

Volumn 37, Issue 2, 2005, Pages 211-231

  Guo, Gongde ^a,b   Wang, Hui ^a   Bell, David ^c  

^a UNIVERSITY OF ULSTER   (United Kingdom)

^b UNIVERSITY OF BRADFORD   (United Kingdom)

^c QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLASSIFICATION (OF INFORMATION); COMPUTATIONAL METHODS; DATA STRUCTURES; MATHEMATICAL MODELS; PATTERN RECOGNITION;

CLASSIFICATION METHOD; CONCEPTUAL SIMPLICITY; DESIGN METHODOLOGY; SIMILARITY-BASED DATA REDUCTION METHOD (SBMODEL);

DATA REDUCTION;

EID: 18344368209     PISSN: 1443458X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. AHA, D.W., KIELER, K. and ALBERT, M.K. (1991): Instance-based learning algorithms, Machine Learning, 6: 37-66.
2. APA, D.W. (1992): Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms, International Journal of Man-Machine Studies, 36: 267-287.
3. BEZDEK, J.C., REICHHERZER, T.R., LIM, G.S. and ATTIKIOUZEL, Y. (1998): Multiple-prototype classifier design, IEEE Transactions on Systems, Man and Cybernetics, 28(1): 67-79.
4. CAMERON-JONES, R.M. (1995): Instance selection by encoding length heuristic with random mutation hill climbing, Proc. of the 8th Australian Joint Conference on Artificial Intelligence, 99-106.
5. CHANG, C.L. (1974): Finding prototypes for nearest neighbour classifiers, IEEE Transactions on Computers, 23(11): 1179-1184.
6. DEVIJVER, P. and KITTLER, J. (1982): Pattern recognition: A statistical approach, Prentice-Hall, Englewood Cliffs, NJ.
7. DOMINGOS, P. (1995): Rule induction and instance-based learning: A unified approach. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Canada: Morgan Kaufmann, 1226-1232.
8. GATES, G. (1972): The reduced nearest neighbour rule, IEEE Transactions on Information Theory, 18: 431-433.
9. HAND, D., MANNILA, H. and SMYTH, P. (2001): Principles of data mining, MIT Press.
10. HART, P. (1968): The condensed nearest neighbour rule, IEEE Transactions on Information Theory, 14: 515-516.
11. KUNCHEVA, L.I. and BEZDEK, J.C. (1998): Nearest prototype classification: Clustering, generic algorithm, or random search? IEEE Trans. System Man Cybernet, 28: 160-164.
12. MOLLINEDA, R.A., FERRI, F.J. and VIDAL, E. (2002): An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering, Pattern Recognition 35: 2771-2782.
13. RITTER, G.L., WOODRUFF, H.B., LOWRY, S .R. et al. (1975): An algorithm for a selective nearest neighbour decision rule. IEEE Transactions on Information Theory, November, 665-669.
14. SEBASTIANI, F. (2002): Machine learning in automated text categorization. In ACM Computing Surveys, 34(1): 1-47.
15. STANFILL, C. and WALTZ, D. (1986): Toward memory-based reasoning communications of the ACM, 29: 1213-1228.
16. TOMEK, A. (1976): An experiment with the edited nearest-neighbour rule. IEEE Transactions on Systems, Man, and Cybernetics, 6(6): 448-452.
17. WANG, H. (2003): Contextual probability, in Journal of Telecommunications and Information Technology, 4(3):92-97.
18. WETTSCHERECK, D. and THOMAS, G.D. (1995): An experimental comparison of nearest-neighbour and nearest-hyperrectangle algorithms. Machine Learning, 19(1): 5-28.
19. WILSON, D.L. (1972): Asymptotic properties of nearest neighbour rules using edited data, IEEE Transactions on Systems, Man, and Cybernetics, 2(3): 408-421.
20. WILSON, D.R. and MARTINEZ, T.R. (1997): Improved heterogeneous distance functions, Journal of Artificial Intelligence Research (JAIR), 6(1): 1-34.
21. WILSON, D.R. and MARTINEZ, T. R. (2000): Reduction techniques for instance-based learning algorithms, Machine Learning, 38(3): 257-286.