Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism
ICDM '03 Proceedings of the Third 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
Frequent free tree discovery in graph data
Proceedings of the 2004 ACM symposium on Applied computing
Mining Frequent Labeled and Partially Labeled Graph Patterns
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Diagonally Subgraphs Pattern Mining
Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Scalable mining of large disk-based graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
SPIN: mining maximal frequent subgraphs from graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
From sequential pattern mining to structured pattern mining: a pattern-growth approach
Journal of Computer Science and Technology
Knowledge Discovery from Transportation Network Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Mining tree queries in a graph
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Mining closed relational graphs with connectivity constraints
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Finding Frequent Patterns in a Large Sparse Graph*
Data Mining and Knowledge Discovery
Graph indexing based on discriminative frequent structure analysis
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Coordinated perspectives and enhanced force-directed layout for the analysis of network motifs
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Discovering Frequent Graph Patterns Using Disjoint Paths
IEEE Transactions on Knowledge and Data Engineering
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
Graph-Based Procedural Abstraction
Proceedings of the International Symposium on Code Generation and Optimization
Discovering frequent geometric subgraphs
Information Systems
GADDI: distance index based subgraph matching in biological networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Identifying bug signatures using discriminative graph mining
Proceedings of the eighteenth international symposium on Software testing and analysis
Mining globally distributed frequent subgraphs in a single labeled graph
Data & Knowledge Engineering
gPrune: a constraint pushing framework for graph pattern mining
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Towards proximity pattern mining in large graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
IEEE Computational Intelligence Magazine
MARGIN: Maximal frequent subgraph mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
TGP: mining top-K frequent closed graph pattern without minimum support
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Structure and attribute index for approximate graph matching in large graphs
Information Systems
Frequency concepts and pattern detection for the analysis of motifs in networks
Transactions on Computational Systems Biology III
EGDIM: evolving graph database indexing method
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
An efficiently computable support measure for frequent subgraph pattern mining
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Mining dense structures to uncover anomalous behaviour in financial network data
MSM'11 Proceedings of the 2011 international conference on Modeling and Mining Ubiquitous Social Media
Efficiently mining frequent subpaths
AusDM '09 Proceedings of the Eighth Australasian Data Mining Conference - Volume 101
A multiobjective evolutionary programming framework for graph-based data mining
Information Sciences: an International Journal
Predicting the social influence of upcoming contents in large social networks
Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
Mining frequent neighborhood patterns in a large labeled graph
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Frequent subgraph summarization with error control
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.00 |
Whereas data mining in structured data focuses on frequentdata values, in semi-structured and graph data theemphasis is on frequent labels and common topologies.Here, the structure of the data is just as important as its content.We study the problem of discovering typical patterns ofgraph data. The discovered patterns can be useful for manyapplications, including: compact representation of sourceinformation and a road-map for browsing and querying informationsources. Difficulties arise in the discovery taskfrom the complexity of some of the required sub-tasks, suchas sub-graph isomorphism. This paper proposes a new algorithmfor mining graph data, based on a novel definitionof support. Empirical evidence shows practical, as well astheoretical, advantages of our approach.