Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient mining of emerging patterns: discovering trends and differences
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Molecular feature mining in HIV data
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Making use of the most expressive jumping emerging patterns for classification
Knowledge and Information Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Mining Graph Data
MoSS: a program for molecular substructure mining
Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
Mining constraint-based patterns using automatic relaxation
Intelligent Data Analysis
The levelwise version space algorithm and its application to molecular fragment finding
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Efficient mining under rich constraints derived from various datasets
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
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
On the stimulation of patterns: definitions, calculation method and first usages
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
Two new graph kernels and applications to chemoinformatics
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
Journal of Intelligent Information Systems
Two new graphs kernels in chemoinformatics
Pattern Recognition Letters
| Hi-index | 0.00 |
Emerging patterns are patterns of a great interest for characterizing classes. This task remains a challenge, especially with graph data. In this paper, we propose a method to mine the whole set of frequent emerging graph patterns, given a frequency threshold and an emergence threshold. Our results are achieved thanks to a change of the description of the initial problem so that we are able to design a process combining efficient algorithmic and data mining methods. Experiments on a real-world database composed of chemicals show the feasibility and the efficiency of our approach.