Incremental transformation of lattices: A key to effective knowledge discovery

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

Volumn 2505, Issue , 2002, Pages 351-362

  Pfaltz, John L ^a  

^a University of Virginia   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; GRAPH THEORY;

BINARY RELATION; CLOSED SET; CLOSURE OPERATORS; FORMAL CONCEPT LATTICES; INCREMENTAL GROWTH; INCREMENTAL TRANSFORMATION; MATHEMATICAL PROPERTIES; ORDERS OF MAGNITUDE;

MATHEMATICAL TRANSFORMATIONS;

EID: 84937203666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45832-8_26     Document Type: Conference Paper

References (24)

1. Jean-Mark Adamo. Data Mining for Association Rules and Sequential Patterns. Springer Verlag, New York, 2000.
2. Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. Mining Association Rules between Sets of Items in Large Databases. In Proc. 1993 ACM SIGMOD Conf., pages 207–216, Washington, DC, May 1993.
3. Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, and Detlef Seese. An Algebraic Theory of Graph Reduction. In Hartmut Ehrig, Hans-Jorg Kreowsik, and Gregor Rozenberg, editors, Graph Grammars and their Application to Computer Science, Lecture Notes in Computer Science, #532, pages 70–83, Bremen, Germany, 1990. Springer-Verlag.
4. R. Bardohl, T. Schultzke, and G. Taentzer. Visual Language Parsing in GenGEd. In 2nd International Workshop on Graph Transformation and Visual Modeling Techniques, pages 291–296, Crete, Greece, July 2001. SatelliteWorkshop of ICALP 2001.
5. H. Ehrig and F. Orejas. Integration Paradigm for Data Type and Process Specification Techniques. In G. Paun, G. Rozengerg, and A. Salomaa, editors, Current Trends in Theoretical Computer Science: Entering the 21st Century, pages 192–201. World Scientific, Singapore, 2001.
6. Gregor Engels, Claus Lewerentz, and Wilhelm Schafer. Graph Grammar Engineering: A Software Specification Method. In Hartmut Ehrig, Manfred Nagl, Gregor Rozenberg, and Azriel Rosenfeld, editors, Graph Grammars and their Application to Computer Science, Lecture Notes in Computer Science, #291, pages 186–201, Warrenton, VA, 1986. Springer-Verlag.
7. Bernard Ganter and Rudolf Wille. Formal Concept Analysis - Mathematical Foundations. Springer Verlag, Heidelberg, 1999.
8. Robert Godin and Rokia Missaoui. An incremental concept formation approach for learning from databases. In Theoretical Comp. Sci., volume 133, pages 387–419, 1994.
9. Reiko Heckel, Hartmut Ehrig, Gregor Engels, and Gabriele Taentzer. Classification and Comparison of Modularity Concepts for Graph Transformation Systems, 1999.
10. Christian Lindig and Gregor Snelting. Assessing Modular Structure of Legacy Code Based on Mathematical Concept Analysis. In Proc of 1997 International Conf. on Software Engineering, pages 349–359, Boston, MA, May 1997.
11. David Maier. The Theory of Relational Databases. Computer Science Press, Rockville, MD, 1983.
12. Brian Mayoh. Graph Grammars for Knowledge Representation. In Hartmut Ehrig, Hans-Jorg Kreowsik, and Gregor Rozenberg, editors, Graph Grammars and their Application to Computer Science, Lecture Notes in Computer Science, #532, page 53, Bremen, Germany, 1990. Springer-Verlag.
13. Carlos Ordonez, Edward Omiecinski, Levien de Braal, Cesar A. Santana, Norberto Ezquerra, Jose A. Taboada, David Cooke, Elizabeth Krawczynska, and Ernst V. Garcia. Mining Constrained Association Rules to Predict Heart Disease. In IEEE International Conf. on Data Mining, ICDM, pages 433–440, 2001.
14. J. Padberg, H. Ehrig, and L. Riberio. Algebraic High-Level Net Transformation Systems. Math. Structures in Computer Science, 5:217–256, 1995.
15. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lofti Lakhal. Discovering Frequent Closed Itemsets for Association Rules. In Proc. 7th International Conf. on Database Theory (ICDT), pages 398–416, Jan. 1999.
16. John L. Pfaltz. Closure Lattices. Discrete Mathematics, 154:217–236, 1996.
17. John L. Pfaltz. Transformations of Concept Graphs: An Approach to Empirical Induction. In 2nd International Workshop on Graph Transformation and Visual Modeling Techniques, pages 320–326, Crete, Greece, July 2001. Satellite Workshop of ICALP 2001.
18. John L. Pfaltz and Robert E. Jamison. Closure Systems and their Structure. Information Sciences, 139:275–286, 2001.
19. John L. Pfaltz and Christopher M. Taylor. Concept Lattices as a Scientific Knowledge Discovery Technique. In 2nd SIAM International Conference on Data Mining, pages 65–74, Arlington, VA, Apr. 2002.
20. Terrence W. Pratt. Pair grammars, graph languages, string to graph translations. JCSS, 5(6):760–795, Dec. 1971.
21. Andy Schurr. PROGRESS, A VHL-Language Based on Graph Grammars. In Hartmut Ehrig, Hans-Jorg Kreowsik, and Gregor Rozenberg, editors, Graph Grammars and their Application to Computer Science, Lecture Notes in Computer Science, #532, pages 641–659, Bremen, Germany, 1990. Springer-Verlag.
22. Ramakrishnan Srikant and Rakesh Agrawal. Mining Quantitative Association Rules in Large Relational Tables. In Proc. of 1996 SIGMOD Conference on Management of Data, pages 1–12, Montreal, Quebec, June 1996.
23. Aliki Tsiolakis. Integrating Model Information in UML Sequence Diagrams. In 2nd International Workshop on Graph Transformation and Visual Modeling Techniques, pages 268–276, Crete, Greece, July 2001. Satellite Workshop of ICALP 2001.
24. Mohammed J. Zaki. Generating Non-Redundant Association Rules. In 6th ACM SIGKDD Intern’l Conf. on Knowledge Discovery and Data Mining, pages 34–43, Boston, MA, Aug. 2000.