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
Transversing itemset lattices with statistical metric pruning
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Performance Evaluation of the VF Graph Matching Algorithm
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
A quickstart in frequent structure mining can make a difference
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and 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
Discovering Emerging Graph Patterns from Chemicals
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Condensed Representation of Sequential Patterns According to Frequency-Based Measures
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
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
Condensed representation of EPs and patterns quantified by frequency-based measures
KDID'04 Proceedings of the Third 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
A survey on condensed representations for frequent sets
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
| Hi-index | 0.00 |
Emerging patterns are patterns of great interest for discovering information from data and characterizing classes. Mining emerging patterns 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. Moreover, we show that the closed graph patterns are a condensed representation of the frequent emerging graph patterns and we propose a new condensed representation based on the representative pruned graph patterns: by providing shorter patterns, it is especially dedicated to represent a set of graph patterns. Experiments on a real-world database composed of chemicals show the feasibility and the efficiency of our approach.