Concept lattice based composite classifiers for high predictability

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 14, Issue 2-3, 2002, Pages 143-156

  Xie, Zhipeng ^a   Hsu, Wynne ^a   Liu, Zongtian ^b   Lee, Mong Li ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

Classification; Concept lattice; Na ve Bayes; Nearest neighbour algorithm

Indexed keywords

ALGORITHMS; DATA MINING; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS;

CONCEPT LATTICES;

SOFTWARE ENGINEERING;

EID: 0036555987     PISSN: 0952813X     EISSN: None     Source Type: Journal    
DOI: 10.1080/09528130210164206     Document Type: Article

References (23)

1. Aha, D.W., 1997, Lazy Learning (Dordrecht: Kluwer Academic Publishers).
2. Blanzieri, E., and Ricci, F., 1999, A minimum risk metric for nearest neighbor classification, In Proceedings of the Sixteenth International Conference on Machine Learning, Bled, Slovenia, pp. 22-31.
3. Breiman, L., 1996, Bagging predictors. Machine Learning, 24 (2): 123-140.
4. Dasarathy, B. (ed.), 1991, Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques (Los Alamitos CA: IEEE Computer Society Press).
5. Domingos, P., and Pazzani, M., 1997, On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29 (2-3): 103-130.
6. Duda, R., and Hart, P., 1973, Pattern Classification and Scene Analysis (New York: John Wiley & Sons).
7. Fayyad, U.M., and Irani, K.B., 1993, Multi-interval discretization of continuous-valued attributes for classification learning, In Proceedings of IJCAI-93, pp. 1022-1027.
8. Freund, Y., 1996, Boosting a weak learning algorithm by majority. Information and Computation, 121 (2): 256-285.
9. Friedman, N., Geiger, D., and Goldszmidt, M., 1997, Bayesian network classifiers. Machine Learning, 29 (2): 131-163.
10. Ganter, B., and Wille, R., 1999, Formal Concept Analysis: Mathematical Foundations (New York: Springer-Verlag).
11. Godin, R., and Missaoui, R., 1994, An incremental concept formation approach for learning from databases. Theoretical Computer Science, Special Issue on Formal Methods in Databases and Software Engineering, 133 (2): 387-419.
12. Kohavi, R., 1996, Scaling up the accuracy of Naïve-Bayes classifiers: A decision-tree hybrid, In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Menlo Park, CA: The AAAI Press, pp. 202-207.
13. Liu, B., Hsu, W., and Ma, Y., 1998, Integrating classification and association rule mining, In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, New York, USA, pp. 80-86.
14. Mephu-Nguifo, E., 1994, Galois lattice: a framework for concept learning, design, evaluation and refinement, In Proceedings of 6th International Conference on Tools with Artificial Intelligence, New Orleans, USA, IEEE Press, pp. 461-467.
15. Merz, C.J., and Murphy, P., 1996, UCI repository of machine learning database. Available online: http://www.cs.uci.edu/̃mlearn/MLRepository.html.
16. Myles, J.P., and Hand, D.J., 1990, The multiclass metric problem in nearest neighbour discrimination rules. Pattern Recognition, 23 (11): 1291-1297.
17. Njiwoua, P., and Mephu-Nguifo, E., 1996, Back from experimentation: a study of learning bias in LEGAL-E. In Proceedings of BENELEARN-96, University of Limburg, Maastricht, pp. 57-68.
18. Pasquier, N., Bastide, J., Taouil, R., and Lakhal, L., 1999, Efficient mining of association rules using closed itemset lattices. Information Systems, 19 (4): 33-54.
19. Quinlan, J.R., 1993, C4.5: Programs for Machine Learning (San Mateo CA: Morgan Kaufmann).
20. Sahami, M., 1995, Learning classification rules using lattices (Extended Abstract), In Proceedings of the Eighth European Conference on Machine Learning, Berlin, Germany: Springe-Verlag, pp. 343-346.
21. Short, R.D., and Fukunaga, K., 1981, The optimal distance measure for nearest neighbour classification. IEEE Transactions on Information Theory, 27 (5): 622-627.
22. Wille, R., 1982, Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival (ed.) Ordered Sets (Dordrecht: Reidel), pp. 445-470.
23. Zheng, Z., and Webb, G.I., 2000, Lazy learning of Bayesian rules. Machine Learning, 41 (1): 53-84.