Abstract
In instance-based learning, the ‘nearness’ between two instances—used for pattern classification—is generally determined by some similarity functions, such as the Euclidean or Value Difference Metric (VDM). However, Euclidean-like similarity functions are normally only suitable for domains with numeric attributes. The VDM metrics are mainly applicable to domains with symbolic attributes, and their complexity increases with the number of classes in a specific application domain. This paper proposes an instance-based learning approach to alleviate these shortcomings. Grey relational analysis is used to precisely describe the entire relational structure of all instances in a specific domain. By using the grey relational structure, new instances can be classified with high accuracy. Moreover, the total number of classes in a specific domain does not affect the complexity of the proposed approach. Forty classification problems are used for performance comparison. Experimental results show that the proposed approach yields higher performance over other methods that adopt one of the above similarity functions or both. Meanwhile, the proposed method can yield higher performance, compared to some other classification algorithms.
Similar content being viewed by others
References
Aha DW, Kibler D, Albert MK (1991) Instance-based learning algorithms. Mach Learn 6:37–66
Aha DW (1992) Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms. Int J Man-Mach Stud 36(2):267–287
An A (2003) Learning classification rules from data. Comp Math Appl 45:737–748
Bay SD (1999) Nearest neighbor classification from multiple feature subsets. Intell Data Anal 3:191–209
Blake CL, Merz CJ (1998) UCI Repository of machine learning databases [http://www.ics.uci.edu/~mlearn/MLRepository.html]. Irvine, CA: Department of Information and Computer Science, University of California
Brouwer RK (1997) Automatic growing of a hopfield style network during training for classification. Neur Netw 10:529–537
Cover TM, Hart PE (1967) Nearest neighbor pattern classification. IEEE Trans Inform Theory 13(1):21–27
Deng J (1984) The theory and method of socioeconomic grey systems. Soc Sci China 6:47–60 (in Chinese)
Deng J (1989) Introduction to grey system theory. J Grey Syst 1:1–24
Deng J (1989) Grey information space. J Grey Syt 1:103–117
Elouedi Z, Mellouli K, Smets P (2001) Belief decision trees: Theoretical foundations. Int J Appr Reas on 28:91–124
Fix E, Hodges JL (1951) Discriminatory analysis: nonparametric discrimination: consistency properties. Technical Report Project 21-49-004, Report Number 4, USAF School of Aviation Medicine, Randolph Field, Texas
Freund Y, Mason L (1999) The alternating decision tree learning algorithm. In: Proc. of the 16th International Conference on Machine Learning, Bled, Slovenia, pp 124–133
Friedman JH (1977) A recursive partitioning decision rule for nonparametric classification. IEEE Trans Comp, pp 404–408
Hattori K, Takahashi M (2000) A new edited k-nearest neighbor rule in the pattern classification problem. Pattern Recog 33:521–528
Hewett R, Leuchner J (2003) Restructuring decision tables for elucidation of knowledge. Data Knowl Engin 46:271–290
Hickey RJ, Martin RG (2001) An instance-based approach to pattern association learning with application to the English past tense verb domain. Knowl-Based Syst 14:131–136
Holte RC (1993) Very simple classification rules perform well on most commonly used datasets. Mach Learn 11:63–91
Hu YC, Chen RS, Hsu YT, Tzeng GW (2002) Grey self-organizing feature maps. Neurocomputing 48:863–877
Huang CC, Lee HM (2001) A Grey-based Nearest Neighbor Approach for Predicting Missing Attribute Values. In: Proc. of 2001 National Computer Symposium, Taiwan, pp B153–159
Huang CC, Lee HM (2003) A Partial-Memory Learning System based on Grey Relational Structure. In: Berthold MR et al (eds) Advanced in intelligent data analysis V, Lecture Notes in Computer Science 2810, Springer-Verlag, pp 68–75
Huang YP, Huang CH (1997) Real-valued genetic algorithms for fuzzy grey prediction system. Fuzzy Sets Syst 87:265–276
Hullermeier E (2003) Possibilistic instance-based learning. Art Intell 148:335–383
Ignizio JP, Soltys JR (1996) Simultaneous design and training of ontogenic neural network classifiers. Comp Oper Res 23:535–546
John GH, Langley P (1995) Estimating continuous distributions in bayesian classifiers. In: Proc. of the Eleventh Conference on Uncertainty in Artificial Intelligence, pp 338–345
Kibler D, Aha DW (1987) Learning Representative Exemplars of Concepts: An Initial Case Study. In: Proc. of the Fourth International Workshop on Machine Learning. Morgan Kaufmann, CA, Irvine, pp 24–30
Kohavi R (1995) The power of decision tables. In: European Conference on Machine Learning, pp 174–189
Langley P, Simon HA (1995) Applications of machine learning and rule induction. Commun ACM 38(11):55–64
Lin CT, Yang SY (1999) Selection of home mortgage loans using grey relational analysis. J Grey Syst 4:359–368
Quinlan JR (1986) Induction of decision trees. Mach Learn 1:81–106
Quinlan JR (1993) C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Mateo, CA
Rachlin J, Kasif S, Salzberg S, Aha DW (1994) Towards a Better Understanding of Memory-Based and Bayesian Classifiers. In: Proc. of the Eleventh International Machine Learning Conference, NJ, Morgan Kaufmann, New Brunswick, pp 242–250
Salzberg S (1988) Exemplar-based learning: theory and implementation. Technical Report TR-10-88, Center for Research in Computing Technology, Harvard University
Stanfill C, Waltz D (1986) Towards memory-based reasoning. Commun ACM 29(12):1213–1228
Stone M (1974) Cross-validatory choice and assessment of statistical predictions. J Royal Stat Soc B 36:111–147
Tsumoto S (2003) Automated extraction of hierarchical decision rules from clinical databases using rough set model. Expert Syst Appl 24:189–197
Watson CJ, Billingsley P, Croft DJ, Huntsberger DV (1993) Statistics for management and economics, 5th edn. Allyn and Bacon, Boston
Watson I (1999) Case-based reasoning is a methodology not a technology. Knowl-Based Syst 12:303–308
Wilson DR, Martinez TR (1997) Improved heterogeneous distance functions. J Art Intell Res 6:1–34
Wilson DR, Martinez TR (2000) Reduction techniques for exemplar-based learning algorithms. Mach Learn 38:257–268
Witten I, Frank E (2000) Data mining—practical machine learning tools and techniques with java implementations. Morgan Kaufmann, San Francisco, CA
Author information
Authors and Affiliations
Corresponding author
Additional information
Chi-Chun Huang is currently Assistant Professor in the Department of Information Management at National Kaohsiung Marine University, Kaohsiung, Taiwan. He received the Ph.D. degree from the Department of Electronic Engineering at National Taiwan University of Science and Technology in 2003. His research includes intelligent Internet systems, grey theory, machine learning, neural networks and pattern recognition.
Hahn-Ming Lee is currently Professor in the Department of Computer Science and Information Engineering at National Taiwan University of Science and Technology, Taipei, Taiwan. He received the B.S. degree and Ph.D. degree from the Department of Computer Science and Information Engineering at National Taiwan University in 1984 and 1991, respectively. His research interests include, intelligent Internet systems, fuzzy computing, neural networks and machine learning. He is a member of IEEE, TAAI, CFSA and IICM.
Rights and permissions
About this article
Cite this article
Huang, CC., Lee, HM. An instance-based learning approach based on grey relational structure. Appl Intell 25, 243–251 (2006). https://doi.org/10.1007/s10489-006-0105-0
Issue Date:
DOI: https://doi.org/10.1007/s10489-006-0105-0