Discovering typical structures of documents: a road map approach
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Storing semistructured data with STORED
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
APEX: an adaptive path index for XML data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
Efficient Data Mining for Path Traversal Patterns
IEEE Transactions on Knowledge and Data Engineering
Finding Patterns in Three-Dimensional Graphs: Algorithms and Applications to Scientific Data Mining
IEEE Transactions on Knowledge and Data Engineering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment
TOOLS '99 Proceedings of the 31st International Conference on Technology of Object-Oriented Language and Systems
Computing Frequent Graph Patterns from Semistructured Data
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
XQuery: a query language for XML
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
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
State of the art of graph-based data mining
ACM SIGKDD Explorations Newsletter
Mining Frequent Labeled and Partially Labeled Graph Patterns
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
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
An Efficient Algorithm for Discovering Frequent Subgraphs
IEEE Transactions on Knowledge and Data Engineering
Support measures for graph data*
Data Mining and Knowledge Discovery
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Preference-based configuration of web page content
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
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
RAP: a conceptual business intelligence framework
COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
Mining frequent trajectory patterns in spatial-temporal databases
Information Sciences: an International Journal
APPT '09 Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies
Frequent subgraph pattern mining on uncertain graph data
Proceedings of the 18th ACM conference on Information and knowledge management
Mining frequent closed patterns in pointset databases
Information Systems
Rule-chain incremental mining algorithm based on directed graph
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
Efficient discovery of frequent subgraph patterns in uncertain graph databases
Proceedings of the 14th International Conference on Extending Database Technology
Privacy-preserving frequent itemsets mining via secure collaborative framework
Security and Communication Networks
Privacy-preserving subgraph discovery
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
The VLDB Journal — The International Journal on Very Large Data Bases
NODAR: mining globally distributed substructures from a single labeled graph
Journal of Intelligent Information Systems
Interrelation analysis of celestial spectra data using constrained frequent pattern trees
Knowledge-Based Systems
The complexity of mining maximal frequent subgraphs
Proceedings of the 32nd symposium on Principles of database systems
Weighted path as a condensed pattern in a single attributed DAG
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Mining frequent correlated graphs with a new measure
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Whereas data mining in structured data focuses on frequent data values, in semistructured and graph data mining, the issue is frequent labels and common specific topologies. Here, the structure of the data is just as important as its content. We study the problem of discovering typical patterns of graph data, a task made difficult because of the complexity of required subtasks, especially subgraph isomorphism. In this paper, we propose a new Apriori-based algorithm for mining graph data, where the basic building blocks are relatively large, disjoint paths. The algorithm is proven to be sound and complete. Empirical evidence shows practical advantages of our approach for certain categories of graphs.