{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:20:23Z","timestamp":1737436823806,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443100"},{"type":"electronic","value":"9783540458326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45832-8_26","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:13:34Z","timestamp":1188314014000},"page":"351-362","source":"Crossref","is-referenced-by-count":7,"title":["Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery"],"prefix":"10.1007","author":[{"given":"John L.","family":"Pfaltz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"26_CR1","volume-title":"Data Mining for Association Rules and Sequential Patterns","author":"J.-M. Adamo","year":"2000","unstructured":"Jean-Mark Adamo. Data Mining for Association Rules and Sequential Patterns. Springer Verlag, New York, 2000."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013216, Washington, DC, May 1993.","DOI":"10.1145\/170035.170072"},{"key":"26_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BFb0017382","volume-title":"Graph Grammars and their Application to Computer Science","author":"S. Arnborg","year":"1990","unstructured":"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\u201383, Bremen, Germany, 1990. Springer-Verlag."},{"key":"26_CR4","unstructured":"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\u2013296, Crete, Greece, July 2001. Satellite Workshop of ICALP 2001."},{"key":"26_CR5","first-page":"192","volume-title":"Current Trends in Theoretical Computer Science: Entering the 21st Century","author":"H. Ehrig","year":"2001","unstructured":"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\u2013201. World Scientific, Singapore, 2001."},{"key":"26_CR6","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"Graph Grammars and their Application to Computer Science","author":"G. Engels","year":"1986","unstructured":"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\u2013201, Warrenton, VA, 1986. Springer-Verlag."},{"key":"26_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis-Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Bernard Ganter and Rudolf Wille. Formal Concept Analysis-Mathematical Foundations. Springer Verlag, Heidelberg, 1999."},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0304-3975(94)90195-3","volume":"133","author":"R. Godin","year":"1994","unstructured":"Robert Godin and Rokia Missaoui. An incremental concept formation approach for learning from databases. In Theoretical Comp. Sci., volume 133, pages 387\u2013419, 1994.","journal-title":"Theoretical Comp. Sci."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Reiko Heckel, Hartmut Ehrig, Gregor Engels, and Gabriele Taentzer. Classification and Comparison of Modularity Concepts for Graph Transformation Systems, 1999.","DOI":"10.1142\/9789812815149_0017"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013359, Boston, MA, May 1997.","DOI":"10.1145\/253228.253354"},{"key":"26_CR11","volume-title":"The Theory of Relational Databases","author":"D. Maier","year":"1983","unstructured":"David Maier. The Theory of Relational Databases. Computer Science Press, Rockville, MD, 1983."},{"key":"26_CR12","series-title":"Lect Notes Comput Sci","first-page":"53","volume-title":"Graph Grammars and their Application to Computer Science","author":"B. Mayoh","year":"1990","unstructured":"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."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013440, 2001.","DOI":"10.1109\/ICDM.2001.989549"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1017\/S0960129500000724","volume":"5","author":"J. Padberg","year":"1995","unstructured":"J. Padberg, H. Ehrig, and L. Riberio. Algebraic High-Level Net Transformation Systems. Math. Structures in Computer Science, 5:217\u2013256, 1995.","journal-title":"Math. Structures in Computer Science"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013416, Jan. 1999.","DOI":"10.1007\/3-540-49257-7_25"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0012-365X(96)00043-X","volume":"154","author":"J. L. Pfaltz","year":"1996","unstructured":"John L. Pfaltz. Closure Lattices. Discrete Mathematics, 154:217\u2013236, 1996.","journal-title":"Discrete Mathematics"},{"key":"26_CR17","unstructured":"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\u2013326, Crete, Greece, July 2001. Satellite Workshop of ICALP 2001."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0020-0255(01)00169-4","volume":"139","author":"J. L. Pfaltz","year":"2001","unstructured":"John L. Pfaltz and Robert E. Jamison. Closure Systems and their Structure. Information Sciences, 139:275\u2013286, 2001.","journal-title":"Information Sciences"},{"key":"26_CR19","unstructured":"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\u201374, Arlington, VA, Apr. 2002."},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Terrence W. Pratt. Pair grammars, graph languages, string to graph translations. JCSS, 5(6):760\u2013795, Dec. 1971.","DOI":"10.1016\/S0022-0000(71)80016-8"},{"key":"26_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/BFb0017419","volume-title":"Graph Grammars and their Application to Computer Science","author":"A. Schurr","year":"1990","unstructured":"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\u2013659, Bremen, Germany, 1990. Springer-Verlag."},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"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\u201312, Montreal, Quebec, June 1996.","DOI":"10.1145\/233269.233311"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Aliki Tsiolakis. Integrating Model Information in UML Sequence Diagrams. In 2nd International Workshop on Graph Transformation and Visual Modeling Techniques, pages 268\u2013276, Crete, Greece, July 2001. Satellite Workshop of ICALP 2001.","DOI":"10.1016\/S1571-0661(04)00178-1"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Mohammed J. Zaki. Generating Non-Redundant Association Rules. In 6th ACM SIGKDD Intern\u2019l Conf. on Knowledge Discovery and Data Mining, pages 34\u201343, Boston, MA, Aug. 2000.","DOI":"10.1145\/347090.347101"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45832-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:14:13Z","timestamp":1737396853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45832-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443100","9783540458326"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45832-8_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}