The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
gSpan: graph-based substructure pattern mining
Abstract
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based substructure pattern mining), which discovers frequent substructures without candidate generation. gSpan builds a new lexicographic order among graphs, and maps each graph to a unique minimum DFS code as its canonical label. Based on this lexicographic order gSpan adopts the depth-first search strategy to mine frequent connected subgraphs efficiently. Our performance study shows that gSpan substantially outperforms previous algorithms, sometimes by an order of magnitude.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.-C. (2005) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914830 · Cited by 1,791
Self-citationKuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Inokuchi, A., Washio, T., & Motoda, H. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45372-5_2 · Cited by 1,039
Efficiently mining frequent trees in a forest
Zaki, M. J. (2002) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775047.775058 · Cited by 472
Cutler, J., & Dickenson, M. (2020) · Textbooks on Political Analysis · doi:10.1007/978-3-030-36826-5_4 · Cited by 458
Efficient Substructure Discovery from Large Semi-structured Data
Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., & Arikawa, S. (2002) · Proceedings of the 2002 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.10 · Cited by 364
Efficiently mining frequent trees in a forest
Zaki, M. J. (2002) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775056.775058 · Cited by 144
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Top 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
“(5) using richer expressions than itemset: Many algorithms have been proposed for sequences, tree and graphs to enable mining from more complex data structure [90,42].”
BackgroundFrequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
Self-citationMining sequential patterns by pattern-growth: the PrefixSpan approach
Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.-C. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.77 · Cited by 1,340
Self-citationGetoor, L., & Diehl, C. P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 973
Preserving Privacy in Social Networks Against Neighborhood Attacks
Zhou, B., & Pei, J. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497459 · Cited by 719
Graph indexing: a frequent structure-based approach
Yan, X., Yu, P. S., & Han, J. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007607 · Cited by 637
Self-citationPEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.14 · Cited by 628
Efficient mining of frequent subgraphs in the presence of isomorphism
Huan, J., Wang, W., & Prins, J. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250974 · Cited by 614
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
Managing and Mining Graph Data
(2010) · Advances in Database Systems · doi:10.1007/978-1-4419-6045-0 · Cited by 594
oddball: Spotting Anomalies in Weighted Graphs
Akoglu, L., McGlohon, M., & Faloutsos, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13672-6_40 · Cited by 533
State of the art of graph-based data mining
Washio, T., & Motoda, H. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959249 · Cited by 448
Efficient aggregation for graph summarization
Tian, Y., Hankins, R. A., & Patel, J. M. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376675 · Cited by 442
A brief survey on anonymization techniques for privacy preserving publishing of social network data
Zhou, B., Pei, J., & Luk, W. (2008) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1540276.1540279 · Cited by 420
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Shang, H., Zhang, Y., Lin, X., & Yu, J. X. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453899 · Cited by 401
Comparing stars: on approximating graph edit distance
Zeng, Z., Tung, A. K. H., Wang, J., Feng, J., & Zhou, L. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687631 · Cited by 399
Netprobe: a fast and scalable system for fraud detection in online auction networks
Pandit, S., Chau, D. H., Wang, S., & Faloutsos, C. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242600 · Cited by 382
Frequent substructure-based approaches for classifying chemical compounds
Deshpande, M., Kuramochi, M., Wale, N., & Karypis, G. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.127 · Cited by 371
Finding Frequent Patterns in a Large Sparse Graph*
Kuramochi, M., & Karypis, G. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0003-9 · Cited by 371
Discriminative Frequent Pattern Analysis for Effective Classification
Cheng, H., Yan, X., Han, J., & Hsu, C.-W. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367917 · Cited by 357
Self-citationDGCNN: A convolutional neural network over large-scale labeled graphs
Phan, A. V., Nguyen, M. L., Nguyen, Y. L. H., & Bui, L. T. (2018) · Neural Networks · doi:10.1016/j.neunet.2018.09.001 · Cited by 355
An efficient algorithm for discovering frequent subgraphs
Kuramochi, M., & Karypis, G. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.33 · Cited by 352
A survey of frequent subgraph mining algorithms
Jiang, C., Coenen, F., & Zito, M. (2013) · The Knowledge Engineering Review · doi:10.1017/s0269888912000331 · Cited by 346
GraMi: frequent subgraph and pattern mining in a single large graph
Elseidy, M., Abdelhamid, E., Skiadopoulos, S., & Kalnis, P. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2732286.2732289 · Cited by 315
A Joinless Approach for Mining Spatial Colocation Patterns
Yoo, J. S., & Shekhar, S. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.150 · Cited by 315
Patterns of Influence in a Recommendation Network
Leskovec, J., Singh, A., & Kleinberg, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11731139_44 · Cited by 307
Efficiently mining frequent trees in a forest: algorithms and applications
Zaki, M. J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.125 · Cited by 306
Mining significant graph patterns by leap search
Yan, X., Cheng, H., Han, J., & Yu, P. S. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376662 · Cited by 291
Self-citationFg-index: towards verification-free query processing on graph databases
Cheng, J., Ke, Y., Ng, W., & Lu, A. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247574 · Cited by 265
Frequent Subtree Mining - An Overview
Chi, Y., Muntz, R. R., Nijssen, S., & Kok, J. N. (2004) · doi:10.5555/1227174.1227182 · Cited by 262
Finding and characterizing communities in multidimensional networks
Berlingerio, M., Coscia, M., & Giannotti, F. (2011) · 2011 International Conference on Advances in Social Networks Analysis and Mining · doi:10.1109/asonam.2011.104 · Cited by 122
Lin, W., Ma, M., Pan, D., & Wang, P. (2018) · 2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) · doi:10.1109/pccc.2018.8711092 · Cited by 29
“There are lots of methods based on candidate set expansion being proposed [15, 16, 17, 18, 19].”
Method
Metadata
- Authors
- Yan, X., & Han, J.
- Venue
- 2002 IEEE International Conference on Data Mining, 2002. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-26
- Pages
- 721-724
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2170726034
- Cited by
- 2,013
- References
- 8
- FWCI
- 64.19
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.