Inferring decision trees using the minimum description length principle
Information and Computation
Part segmentation for object recognition
Neural Computation
Graph clustering and model learning by data compression
Proceedings of the seventh international conference (1990) on Machine learning
Concept formation in structured domains
Concept formation knowledge and experience in unsupervised learning
Pattern recognition: statistical, structural and neural approaches
Pattern recognition: statistical, structural and neural approaches
Spatial analogy and subsumption
ML92 Proceedings of the ninth international workshop on Machine learning
ML92 Proceedings of the ninth international workshop on Machine learning
Stochastic Complexity in Statistical Inquiry Theory
Stochastic Complexity in Statistical Inquiry Theory
Discrete Mathematical Structures for Computer Science
Discrete Mathematical Structures for Computer Science
Knowledge Acquisition Via Incremental Conceptual Clustering
Machine Learning
Discovery of Inexact Concepts from Structural Data
IEEE Transactions on Knowledge and Data Engineering
Grammatical Inference Based on Hyperedge Replacement
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers
Abstractions for Knowledge Organization of Relational Descriptions
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Extension of Graph-Based Induction for General Graph Structured Data
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Discovery of Definition Patterns by Compressing Dictionary Sentences
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
DS '00 Proceedings of the Third International Conference on Discovery Science
Parallel Organization Algorithm for Graph Matching and Subgraph Isomorphism Detection
DS '98 Proceedings of the First International Conference on Discovery Science
Unordered Tree Mining with Applications to Phylogeny
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Knowledge Discovery from Transportation Network Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient mining of frequent XML query patterns with repeating-siblings
Information and Software Technology
Arc Consistency Projection: A New Generalization Relation for Graphs
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
User Assisted Substructure Extraction in Molecular Data Mining
MDA '08 Proceedings of the 3rd international conference on Advances in Mass Data Analysis of Images and Signals in Medicine, Biotechnology, Chemistry and Food Industry
Mining Intervals of Graphs to Extract Characteristic Reaction Patterns
DS '08 Proceedings of the 11th International Conference on Discovery Science
Pruning Strategies Based on the Upper Bound of Information Gain for Discriminative Subgraph Mining
Knowledge Acquisition: Approaches, Algorithms and Applications
Mining globally distributed frequent subgraphs in a single labeled graph
Data & Knowledge Engineering
APPT '09 Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
Inferring Graph Grammars by Detecting Overlap in Frequent Subgraphs
International Journal of Applied Mathematics and Computer Science - Special Section: Selected Topics in Biological Cybernetics, Special Editors: Andrzej Kasiński and Filip Ponulak
An efficient algorithm of frequent connected subgraph extraction
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Propositionalization for clustering symbolic relational descriptions
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Document layout substructure discovery
SAMT'07 Proceedings of the semantic and digital media technologies 2nd international conference on Semantic Multimedia
Frequent subgraph discovery in dynamic networks
Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Diagnosing memory leaks using graph mining on heap dumps
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
MARGIN: Maximal frequent subgraph mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
Frequent subgraph mining in outerplanar graphs
Data Mining and Knowledge Discovery
Vs-star: A visual interpretation system for visual surveillance
Pattern Recognition Letters
Efficient algorithms based on relational queries to mine frequent graphs
PIKM '10 Proceedings of the 3rd workshop on Ph.D. students in information and knowledge management
Frequent sub-graph mining on edge weighted graphs
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
New application of graph mining to video analysis
IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
Characterizing compressibility of disjoint subgraphs with NLC grammars
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
K-means based approaches to clustering nodes in annotated graphs
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
SISP: a new framework for searching the informative subgraph based on PSO
Proceedings of the 20th ACM international conference on Information and knowledge management
Proceedings of the 20th ACM international conference on Information and knowledge management
A quantitative comparison of the subgraph miners mofa, gspan, FFSM, and gaston
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Mining common patterns on graphs
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Cl-GBI: a novel approach for extracting typical patterns from graph-structured data
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Mining constrained graphs: the case of workflow systems
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
A structural learning algorithm and its application to predictive toxicology evaluation
BVAI'05 Proceedings of the First international conference on Brain, Vision, and Artificial Intelligence
Extracting discriminative patterns from graph structured data using constrained search
PKAW'06 Proceedings of the 9th Pacific Rim Knowledge Acquisition international conference on Advances in Knowledge Acquisition and Management
Patterns and logic for reasoning with networks
Bisociative Knowledge Discovery
Review of bisonet abstraction techniques
Bisociative Knowledge Discovery
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
A General Framework for Mining Frequent Subgraphs from Labeled Graphs
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Graph-based Relational Learning with Application to Security
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
An iterative MapReduce approach to frequent subgraph mining in biological datasets
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Mining Induced/Embedded Subtrees using the Level of Embedding Constraint
Fundamenta Informaticae
Inexact subgraph isomorphism in MapReduce
Journal of Parallel and Distributed Computing
MultiAspectForensics: mining large heterogeneous networks using tensor
International Journal of Web Engineering and Technology
Detecting common scientific workflow fragments using templates and execution provenance
Proceedings of the seventh international conference on Knowledge capture
A multiobjective evolutionary programming framework for graph-based data mining
Information Sciences: an International Journal
Three-objective subgraph mining using multiobjective evolutionary programming
Journal of Computer and System Sciences
Weighted path as a condensed pattern in a single attributed DAG
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.01 |
The ability to identify interesting and repetitive substructures is an essential component to discovering knowledge in structural data. We describe a new version of our SUBDUE substructure discovery system based on the minimum description length principle. The SUBDUE system discovers substructures that compress the original data and represent structural concepts in the data. By replacing previously-discovered substructures in the data, multiple passes of SUBDUE produce a hierarchical description of the structural regularities in the data. SUBDUE uses a computationally-bounded inexact graph match that identifies similar, but not identical, instances of a substructure and finds an approximate measure of closeness of two substructures when under computational constraints. In addition to the minimumdescription length principle, other background knowledge can be used by SUBDUE to guide the search towards more appropriate substructures. Experiments in a variety of domains demonstrate SUBDUE's ability to find substructures capable of compressing the original data and to discover structural concepts important to the domain.