Maintaining class membership information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2426 LNCS, Issue , 2002, Pages 13-23

  Berry, Anne ^a   Sigayret, Alain ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Binary Relation; Class Hierarchy; Concept Lattice; Hierarchy Organization; Property Domination

Indexed keywords

DATA MINING; INFORMATION USE;

BINARY RELATION; CLASS HIERARCHIES; CONCEPT LATTICES; GALOIS LATTICES; GALOIS SUB-HIERARCHIES; MEMBERSHIP INFORMATION; PROPERTY DOMINATION; UNDERLYING GRAPHS;

INFORMATION SYSTEMS;

EID: 33644938922     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46105-1_3     Document Type: Conference Paper

References (15)

1. Berry, A., Bordat, J.–P.: Orthotreillis et séparabilité dans un graphe non-orienté. Mathématiques, Informatique et Sciences Humaines, 146 (1999) 5–17. 16
2. Berry, A., Sigayret, A.: Representing a concept lattice by a graph. Workshop on Discrete Mathematics for Data Mining, Proc. 2nd SIAM Workshop on Data Mining, Arlington (VA), April 11–13, (2002). 14, 15, 16
3. Chen, J.–B., Lee, S. C.: Generation and Reorganization of Subtype Hierarchies. Journal of Object Oriented Programming, 8(8) (1996). 15
4. Godin, R.: Complexité de Structures de Treillis. Annales des Sciences Mathématiques du Québec, 13(1) (1989) 19–38. 13
5. Godin, R., Mili, H.: Building and Maintaining Analysis-Level Class Hierarchies Using Galois Lattices. Proceedings of ACM OOPSLA’93, Special issue of Sigplan Notice, 28(10) (1993) 394–410. 13, 15
6. Godin, R., Missaoui, R., April, A.: Experimental Comparison of Navigation in a Galois Lattice with Conventional Information Retrieval Methods. International Journal of Man-Machine Studies, 38 (1993) 747–767. 13
7. Godin, R., Saunders, E., Gecsei, J.: Lattice Model of Browsable Data Spaces. Information Sciences, 40 (1986) 89–116. 13
8. Hager, M.: On Halin-Lattices in Graphs. Discrete Mathematics, 47 (1983) 235–246. 16
9. Halin, R.: Lattices of cuts in graphs. Abh. Math. Sem. Univ. Hamburg, 61 (1991) 217–230. 16
10. Huchard, M., Dicky, H., Leblanc, H.: Galois lattice as a framework to specify building class hierarchies algorithms. Theoretical Informatics and Applications, 34 (2000) 521–548. 13, 15
11. Pfaltz, J. L., Taylor, C. M.: Scientific Knowledge Discovery through Iterative Transformation of Concept Lattices. Workshop on Discrete Mathematics for Data Mining, Proc. 2nd SIAM Workshop on Data Mining, Arlington (VA), April 11–13, (2002). 13
12. Polat, N.: Treillis de séparation des graphes. Can. J. Math., vol. XXVIII No 4 (1976) 725–752. 16
13. Valtchef, P., Missaoui, R., Godin, R.: A Framework for Incremental Generation of Frequent Closed Item Sets. Workshop on Discrete Mathematics for Data Mining, Proc. 2nd SIAM Workshop on Data Mining, Arlington (VA), April 11–13, (2002). 13
14. Yahia, A., Lakhal, L., Bordat, J.–P.: Designing Class Hierarchies of Object Database Schemes. Proceedings 13e journées Bases de Données avancées (BDA’97), (1997). 13
15. Zaki, M. J., Parthasarathy, S., Ogihara M., Li, W.: New Algorithms for Fast Discovery of Association Rules. Proceedings of 3rd Int. Conf. on Database Systems for Advanced Applications, April, (1997). 13