Structured Concept Discovery: Theory and Methods (1994)

by Darrell Conklin
Citations:4 - 0 self

Documents Related by Co-Citation

2655 Fast Algorithms for Mining Association Rules – Rakesh Agrawal, Ramakrishnan Srikant - 1994
138 Graph-Based Data Mining – Diane J. Cook, Lawrence B. Holder - 2000
204 Adding structure to unstructured data – Peter Buneman, Susan Davidson, Mary Fernandez, Dan Suciu - 1997
118 Mining associations between sets of items in massive databases – R Agarwal, T Imielinski, A Swami - 1993
10 Unifying learning methods by colored digraphs – K Yoshida, H Motoda, N Indurkhya - 1993
234 An Apriori-based Algorithm for Mining Frequent Substructures from Graph Data – Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda - 2000
303 Frequent Subgraph Discovery – Michihiro Kuramochi, George Karypis - 2001
11 SEuS: Structure extraction using summaries – Shayan Ghazizadeh, Sudarshan S. Chawathe - 2002
10 Spatial analogy and subsumption – D Conklin, J Glasgow - 1992
86 Representative Objects: Concise Representations of Semistructured Hierarchical Data – Svetlozar Nestorov, Jeffrey Ullman, Janet Wiener, Sudarshan Chawathe - 1997
27 A self-organizing retrieval system for graphs – R Levinson - 1984
76 Inferring Structure in Semistructured Data – Svetlozar Nestorov, Serge Abiteboul, Rajeev Motwani - 1997
98 Experiments with incremental concept formation – M LEBOWITZ - 1987
503 DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases – Roy Goldman, Jennifer Widom - 1997
640 Knowledge acquisition via incremental conceptual clustering – Douglas H. Fisher - 1987
304 Learning structural descriptions from examples. In The psychology of computer vision – P H Winston - 1975
166 nauty user’s guide (version 1.5 – Brendan D McKay - 1990
112 Extracting Schema from Semistructured Data – Svetlozar Nestorov , Serge Abiteboul, Rajeev Motwani - 1998
64 The Graph Isomorphism Problem – Scott Fortin - 1996