Inferring dependencies from relations: A conceptual clustering approach

Computational Intelligence

Volumn 15, Issue 4, 1999, Pages 415-441

  Carpineto, Claudio ^a   Romano, Giovanni ^a   D'Adamo, Paolo ^a  

^a FONDAZIONE UGO BORDONI   (Italy)

Author keywords

Computational complexity; Conceptual clustering; Empirical evaluation; Functional dependencies; Galois lattices; Implication rules; Knowledge discovery

Indexed keywords

EID: 0012111672     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/0824-7935.00100     Document Type: Article

References (44)

1. AGRAWAL, R., and R. SRIKANT. 1994. Fast algorithms for mining association rules. In Proc. of the 20th VLDB Conference, Santiago, 487-499.
2. BELL, S., and P. BROCKHAUSEN. 1995. Discovery of data dependencies in relational databases. In Working Notes of the MLnet Workshop on Statistics, Machine Learning and Knowledge Discovery in Databases. Crete, pp. 53-58.
3. BORDAT, J. 1986. Calcul pratique du treillis de Galois d'une correspondance. Mathématiques et Sciences Humaines 96:31-47.
4. CAI, Y., N. CERCONE, and J. HAN. 1991. Learning in relational databases: An attribute-oriented approach. Computational Intelligence 7: 119-132.
5. CARPINETO, C., and G. ROMANO. 1993. Galois: An order-theoretic approach to conceptual clustering. In Proc. of the 10th International Conference on Machine Learning, Arnherst, MA. Morgan Kauffmann, San Mateo, CA, pp. 33-40.
6. CARPINETO, C., and G. ROMANO. 1996. A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning 24:95-122.
7. CASELLA, G., and R. BERGER. 1990. Statistical Inference. Wadsworth & Brooks/Cole, Duxbury Press.
8. COSMADAKIS, S., P. KANELLAKIS, and N. SPYRATOS. 1986. Partition semantics for relations. Journal of Computer and System Sciences 33:203-233.
9. DAVEY, B., and H. PRIESTLY. 1990. Introduction to lattices and order. Cambridge University Press, Cambridge, England.
10. DEMETROVICS, J., and G. GYEPESI. 1981. On the functional dependency and some generalizations of it. Acta Cybernetica 8(3):273-278.
11. GANTER, B. 1988. Composition and decomposition of data in formal concept analysis. In Classification and Related Methods of Data Analysis. Edited by H. Bock. North Holland, Amsterdam, pp. 561-566.
12. GODIN, R., and R MISSAOUI. 1994. An incremental concept formation approach for learning from databases. Theoretical Computer Science: Special Issue on Formal Methods in Databases and Software Engineering 133:387-419.
13. GODIN, R., R. MISSAOUI, and H. ALAOUI. 1991. Learning algorithms using a Galois lattice structure. In Proc. of the 1991 IEEE International Conference on Tools for AI, San Jose. IEEE Computer Society Press, pp. 22-29.
14. GODIN, R., R. MISSAOUI, and H. ALAOUI. 1995. Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence 11(2):246-267.
15. GODIN, R., E. SAUNDERS, and J. GECSEI. 1986. Lattice model of browsable data spaces. Information Sciences 40:89-116.
16. GUIGES, J. L., and V. DUQUENNE. 1986. Famille non redondante d'implications informatives résultant d'un tableau de données binaires. Mathématique and Sciences Humaines 95:5-18.
17. JOHN, G. and P. LANGLEY. 1996. Static versus dynamic sampling for data mining. In Proc. of the 2nd International Conference on Knowledge Discovery and Data Mining, Portland. AAAI Press, Menlo Park, CA, pp. 367-370.
18. KIVINEN, J., and H. MANNILA. 1995. Approximate inference of functional dependencies from relations. Theoretical Computer Science: Special Issue on Formal Methods in Databases and Software Engineering 149:129-149.
19. MAIER, D. 1983. The theory of relational databases. Computer Science Press, Rockville, MD.
20. MANNILA, H., and K. RÄHIÄ. 1986. Design by example: An application of Armstrong relations. Journal of Computer and System Sciences 33:126-141.
21. MANNILA, H., and K. RÄHIÄ. 1994. Algorithms for inferring functional dependencies from relations. Data & Knowledge Engineering 12(1):83-99.
22. MELLISH, C. 1991. The description identification problem. Artificial Intelligence 52(2):151-168.
23. MICHALSKI, R. 1983. A theory and methodology of inductive learning. Artificial Intelligence 20:111-161.
24. MISSAOUI, R., and R. GODIN. 1994. Search for concepts and dependencies in databases. In Rough Sets, Fuzzy Sets and Knowledge Discovery. Edited by W. Ziarko. Workshops in Computing series. Springer-Verlag, pp. 16-23.
25. MITCHELL, T. 1982. Generalization as search. Artificial Intelligence 18:203-226.
26. MURPHY, P., and D. AHA. 1995. UCI repository of machine learning databases (Machine-readable data repository). Working paper, University of California at Irvine, Department of Information and Computer Science.
27. OOSTHUIZEN, D. 1994. The application of concept lattices to machine learning. Technical Report CSTR 94/01, University of Pretoria.
28. ORLOWSKA, M., and M. ORLOWSKI. 1992. Maintenance of knowledge in dynamic information systems. In Handbook of Applications and Advances of the Rough Sets Theory. Edited by R. Slowinski. Kluwer Academic Publishers, Dordrecht, pp. 315-329.
29. PAWLAK, Z. 1991. Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht.
30. PIATETSKY-SHAPIRO, J. 1991. Discovery, analysis and presentation of strong rules. In Knowledge Discovery in Databases. Edited by G. Piatetsky-Shapiro and W. Frawley. AAAI Press, Menlo Park, CA, pp. 229-248.
31. QUINLAN, R. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA.
32. RUSSEL, S. 1986. Preliminary steps toward the automation of induction. In Proc. of the 5th National Conference on Artificial Intelligence, Philadelphia. AAAI Press, Menlo Park, CA, pp. 477-484.
33. SAVNIK, I., and P. FLACH. 1993. Bottom-up induction of functional dependencies from relations. In Proc. of the AAAI-93 Workshop on Knowledge Discovery in Databases, pp.174-185.
34. SCHLIMMER, J. 1993. Efficiently inducing determinations: A complete and systematic search algorithm that uses optimal pruning. In Proc. of the 10th International Machine Learning Conference, Amherst, MA. Morgan Kaufmann, San Mateo, CA, pp.284-290.
35. SHAN, N., W. ZIARKO, H. HAMILTON, and N. CERCONE. 1995. Using rough sets as tools for knowledge discovery. In Proc. of the 1st International Conference on Knowledge Discovery and Data Mining, Montreal. AAAI Press, Menlo Park, CA, pp. 263-268.
36. SKOWRON, A., and L. POLKOWSKI. 1997. Synthesis of decision systems from data tables. In Rough Sets and Data Mining. Analysis of Imprecise Data. Edited by T. Y. Lin and N. Gercone. Kluwer Academic Publishers, Dordrecht, pp. 259-299.
37. SKOWRON, A., and C. RAUSZER. 1992. The discernibility matrices and functions in information systems. In Intelligent Decision Support. Handbook of Applications and Advances of the Rough Sets Theory. Edited by R. Slowinski. Kluwer Academic Publishers, Dordrecht, pp. 331-362.
38. TOIVONEN, H., M. KLEMETTINEN, P. RONKAINEN, K. HAETOENEN, and H. MANNILA. 1995. Pruning and grouping of discovered association rules. In Working Notes of the MLnet Workshop on Statistics, Machine Learning and Knowledge Discovery in Databases. Crete, pp. 47-52.
39. ULLMAN, I. 1988. Principles of Database and Knowledge-Base Systems, Vol. I. Computer Science Press. Rockville, MD.
40. WILLE, R. 1984. Line diagrams of hierarchical concept systems. International Classification 2:77-86.
41. WILLE, R. 1992. Concept lattice and conceptual knowledge systems. Computer & Mathematics with Applications 23(6-9):493-515.
42. WILLE, R. 1995. The basic theorem of triadic concept analysis. Order 12:149-158.
43. ZIARKO, W. 1991. The discovery, analysis and representation of data dependencies in databases. In Knowledge Discovery in Databases. Edited by G. Piatetski-Shapiro and W. Frawley. AAAI Press, Menlo Park, CA, pp. 195-209.
44. ZIARKO, W., and N. SHAN. 1996. A method for computing all maximally general rules in attribute-value systems. Computational Intelligence 12(2):223-234.