Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
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
Text mining for finding functional community of related genes using TCM knowledge
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Finding Frequent Patterns in a Large Sparse Graph*
Data Mining and Knowledge Discovery
NeMoFinder: dissecting genome-wide protein-protein interactions with meso-scale network motifs
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering Frequent Graph Patterns Using Disjoint Paths
IEEE Transactions on Knowledge and Data Engineering
Artificial Intelligence in Medicine
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
gApprox: Mining Frequent Approximate Patterns from a Massive Network
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Substructure discovery using minimum description length and background knowledge
Journal of Artificial Intelligence Research
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
Frequency concepts and pattern detection for the analysis of motifs in networks
Transactions on Computational Systems Biology III
An iterative MapReduce approach to frequent subgraph mining in biological datasets
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Inexact subgraph isomorphism in MapReduce
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Network motifs are basic building blocks in complex networks. Motif detection has recently attracted much attention as a topic to uncover structural design principles of complex networks. Pattern finding is the most computationally expensive step in the process of motif detection. In this paper, we design a pattern finding algorithm based on Google MapReduce to improve the efficiency. Performance evaluation shows our algorithm can facilitates the detection of larger motifs in large size networks and has good scalability. We apply it in the prescription network and find some commonly used prescription network motifs that provide the possibility to further discover the law of prescription compatibility.