Classification of symbolic objects: A lazy learning approach

Intelligent Data Analysis

Volumn 10, Issue 4, 2006, Pages 301-324

  Appice, Annalisa ^a   D'Amato, Claudia ^a   Esposito, Floriana ^a   Malerba, Donato ^a  

^a UNIVERSITY OF BARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; DATA MINING; NEAREST NEIGHBOR SEARCH; SYSTEMS ENGINEERING;

CLASSIFICATION TASKS; INFORMATION CONCERNING; NEAREST NEIGHBORS; RELATIONAL DATABASE; STATISTICAL DATAS; SYMBOLIC DATA ANALYSIS; SYMBOLIC OBJECTS; WEIGHTED K-NEAREST NEIGHBORS;

POPULATION STATISTICS;

EID: 79960889644     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2006-10402     Document Type: Article

References (44)

1. D. Aha, D. Kibler and M. Albert, Instance-based learning algorithms, Machine Learning 6(1) (1991), 37-66.
2. S.M. Ali and S.D. Silvey, A general class of coefficient of divergence of one distribution from another, Journal of the Royal Statistical Society B2 (1966), 131-142.
3. A. Appice, M. Ceci, A. Lanza, F.A. Lisi and D. Malerba, Discovery of spatial association rules in geo-referenced census data: A relational mining approach, Intelligent Data Analysis 7(6) (2003), 541-566.
4. K.J. Beirlant, L. Devroye, L. Gÿorfi and I. Vajda, Large deviations of divergence measures on partitions, Journal of Statistical Planning and Inference 93 (2001), 1-16.
5. H.H. Bock and E. Diday, Symbolic Objects, in: Analysis of Symbolic Data. Exploratory Methods for extracting Statistical Information from Complex Data, H.H. Bock and E. Diday, eds, Series: Studies in Classification, Data Analysis, and Knowledge Organisation, 15, Springer-Verlag: Berlin, 2000.
6. M.C. Bravo, Strata Decision Tree Symbolic Data Analysis Software, in: Data Analysis, Classification and Related Methods, H.A.L. Kiers, J.P. Rasson, P.J.F. Groenen and M. Shader, eds, Series: Studies in Classification, Data Analysis, and Knowledge Organization, Springer-Verlag: Berlin, 2000, 409-415.
7. L. Breiman, J.H. Friedman, R.A. Olshen and C.J. Stone, Classification and Regression Trees, Wadsworth Inc., Belmont, California, 1984.
8. J. Catlett, On changing continuous attributes into ordered discrete attributes, in Proceedings of the European Working Session on Learning, 1991, 164-178.
9. A. Ciampi, E. Diday, J. Lebbe, E. Ṕerinel and R. Vignes, Recursive partitioning with probabilistically imprecise data, in: Ordinal and Symbolic Data analysis, E. Diday and Y. Lechevallier, eds, Series: Studies in Classification Data Analysis and Knowledge Organization, Springer-Verlag: Berlin, 1996, pp. 201-212.
10. A. Ciampi, E. Diday, J. Lebbe, E. Ṕerinel and R.Vignes, Growing a tree classifier with imprecise data, Pattern Recognition Letters 21(9) (2000), 787-803.
11. I. Csisźar, Information-type measures of difference of probability distributions and indirect observatons, Studia Scient Math Hung 2 (1967), 299-318.
12. F.A.T. de Carvalho, Proximity coefficients between Boolean symbolic objects, in: New Approaches in Classification and Data Analysis, E. Diday et al., eds, Series: Studies in Classification, Data Analysis, and Knowledge Organization, 5, Springer-Verlag: Berlin, 1994, pp. 387-394.
13. F.A.T. de Carvalho, Extension based proximity coefficients between constrained Boolean symbolic objects, in: Proceedings of the 5th Conference of the International Federation of Classification Societies, C. Hayashi et al., eds, Springer-Verlag: Berlin, 1998, pp. 370-378.
14. E. Diday and F. Esposito, An introduction to Symbolic Data Analysis and the SODAS software, Intelligent Data Analysis 7(6) (2003), 583-602, IOS Press.
15. F. Esposito, D. Malerba and V. Tamma, Dissimilarity Measures for symbolic objects, in: Analysis of Symbolic Data. Exploratory Methods for extracting Statistical Information from Complex Data, H.H. Bock and E. Diday, eds, Series Studies in Classification, Data Analysis and Knowledge Organisation, 15, Springer-Verlag: Berlin, 2000, pp. 165-185.
16. F. Esposito, D. Malerba and F.A. Lisi, Matching Symbolic Objects. Chapter 8.4 in H.-H. Bock and E. Diday (Eds.), Analysis of Symbolic Data. Exploratory methods for extracting statistical information from complex data, Series: Studies in Classification, Data Analysis, and Knowledge Organization, 15, Springer-Verlag: Berlin, 2000, pp. 186-197.
17. S. German, E. Bienenenstock and R. Doursat, Neural networks and the bias/variance dilemma, Neural Computation 4 (1992), 1-58.
18. G. Gora and A. Wojna, RIONA: A Classifier Combining Rule Induction and k-NN Method with Automated Selection of Optimal Neighbourhood, in: Proceedings of the 13th European Conference on Machine Learning, T. Elomaa, H. Mannila and H.T.T. Toivonen, eds, Springer-Verlag: Berlin, 2430, 2002, pp. 111-123.
19. K.C. Gowda and E. Diday, Symbolic clustering using a new dissimilarity measure, Pattern Recognition 24(6) (1991), 567-578.
20. M. Ichino and H. Yaguchi, Generalized Minkowski Metrics for Mixed Feature-Type Data Analysis, IEEE Transactions on Systems, Man, and Cybernetics 24(4) (1994), 698-707.
21. K. Kang and H. Sompolinsky, Mutual Information of Population Codes and Distance Measures in Probability Space, Physical Review Letters 86 (2001), 4958-4961.
22. R. Kohavi, A study of cross-validation and bootstrap for Accuracy estimation and model selection, Proceedings of the 14th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, 1995, 1137-1143.
23. R.E. Krichevsky and V.K. Trofimov, The performance of universal encoding, IEEE Transaction Information Theory IT-27 (1981), 199-207.
24. S. Kullback and R.A. Leibler, On information and sufficiency, Annals of Mathematical Statistics 22 (1951), 76-86.
25. C. Lauro, R. Verde and F. Palombo, Factorial Discriminant Analysis on Symbolic Objects, in: Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data, H.H. Boch and E. Diday, eds, Series Studies in Classification Data Analysis and Knowledge Organization, 15, Springer-Verlag: Berlin, 2000, pp. 212-233.
26. J. Lin, Divergence Measures Based on the Shannon Entropy, IEEE Transactions on Information Theory 37(1) (1991), 145-151.
27. M.C. Ludl and G. Widmer, Relative Unsupervised Discretization for Association Rule Mining, in: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, D.A., Zighed, H.J. Komorowski and J.M. Zytkow, eds, Springer-Verlag: Berlin, 1910, 2000, 148-158.
28. D. Malerba, F. Esposito, V. Gioviale and V. Tamma, Comparing Dissimilarity Measures for Symbolic Data Analysis, Proceedings of Exchange of Technology and Know-how and New Techniques and Technologies for Statistics 1 (2001), 473-481.
29. D. Malerba, F. Esposito and M. Monopoli, Comparing dissimilarity measures for probabilistic symbolic objects, in: Data Mining III, (Vol. 6), A. Zanasi, C.A. Brebbia, N.F.F. Ebecken and P. Melli, eds, Series Management Information Systems, WIT Press, Southampton, UK, 2002, 31-40.
30. D. Malerba, F. Esposito, F.A. Lisi and A. Appice, Mining spatial association rules in census data, Research in Official Statistics 5(1) (2002), 19-44.
31. D. Malerba, F. Esposito, M. Ceci and A. Appice, Top-Down Induction of model Trees with Regression and Splitting Nodes, IEEE Transactions on Pattern Analysis and Machine Intelligence 26(5) (2004), 612-625.
32. T. Mitchell, Machine Learning, McGraw Hill, New York, USA, 1997.
33. B.Ö hman, Statistics as an Investment-Free forUsers, Proceedings of the 4th InternationalConference onMethodological Issues in Official Statistics, Stockholm October, 2000, 12-13.
34. M. Orkin and R. Drogin, Vital Statistics, McGraw Hill, New York, 1990.
35. J.R. Quinlan, Induction of Decision Trees, Machine Learning 1 (1986), 81-106.
36. Z. Rached, F. Alajaji and L.L. Campbell, Ŕenyi's Divergence and Entropy Rates for Finite Alphabet Markov Sources, IEEE Transactions on Information Theory 47(4) (2001), 1553-1561.
37. J.P. Rasson, P. Lallemand and S. Adans, Bayesian Decision Tree: Discriminant Analysis on interval data and the Bayesian tree visualization by using the modules SBTREE and VTREE, A Short Tutorial for Users, Version 1, December 15, 2003.
38. F. Rossi and B. Conan-Guez, Multi-layer Perceptron on Interval Data, in: Classification, Clustering, and Data Analysis (IFCS 2002), K. Jajuga, A. Sokolowski and H.H. Bock, eds, 2002, pp. 427-434.
39. J.J.W. Sammon,Anonlinear mapping for data structure analysis, IEEE Transactions on Computers C-18 (1969), 401-409.
40. G. Saporta, Data mining and official statistics, Proceedings of the 5th Italian National Conference of Statistics, ISTAT, 2000.
41. V. St́ephan, G. H́ebrail and Y. Lechevallier, Generation of Symbolic Objects from Relational Databases, in: Analysis of Symbolic Data. Exploratory Methods for extracting Statistical Information from Complex Data, H.H. Bock and E. Diday, eds, Series: Studies in Classification, Data Analysis and Knowledge Organisation, 15, Springer-Verlag: Berlin, 2000, pp. 78-105.
42. C.W. Therrien, Decision, estimation and classification, John Wiley & Sons, 1989.
43. V.S. Verykios, E. Bertino, I.N. Fovino, L.P. Provenza, Y. Saygin and Y. Theodoridis, State-of-the-art in privacy preserving data mining, SIGMOD Record 33(1) (2004), 50-57.
44. D. Wetteschereck, A study of Distance-Based Machine Learning Algorithms, Doctor of Philosophy dissertation in Computer Science, Oregon State University.