Diagonally subgraphs pattern mining

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2004, Pages 51-58

  Cohen, Moti ^a   Gudes, Ehud ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

frequent subgraphs; graph mining; pattern discovery

Indexed keywords

APRIORI ALGORITHMS; CANDIDATE GENERATION; EFFECTIVE ALGORITHMS; EFFICIENT ALGORITHM; FREQUENT PATTERNS; FREQUENT SUBGRAPHS; GRAPH MINING; PATTERN DISCOVERY; PATTERN MINING; SEARCH SPACES; STATE OF THE ART; SUBGRAPHS;

DATA MINING;

ALGORITHMS;

EID: 77953973364     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1008694.1008702     Document Type: Conference Paper

References (14)

1. A. Inokuchi, T. Washio, and H. M otoda. An Apriori-based algorithm for mining frequent substructures from graph data. In PKDD'00.
2. Michihiro Kuramochi and George Karypis. An efficient algorithm for discovering frequent subgraphs. Technical report, 2002. http://www.cs.umn.edu/ ~kuram/papers/fsglong. pdf.
3. N. Vanetik, E. Gudes, and S. E. Shimony. Computing frequent graph patterns from semistructured data. In ICDM'02.
4. C. Borgelt and M. R. Berthold. Mining molecular fragments: Finging relevant substructures of molecules. In ICDM'02.
5. X. Yan, J. Han. gSpan: Graph-based substructure pattern mining. UIUC-CS Tech. Report: R-2002-2296 (a 4-page short version in ICDM'02).
6. Jun Huan, Wei Wang, Jan Prins. Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. In. ICDM'03.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001, Second Edition.
8. M. J. Zaki. Efficiently mining frequent trees in a forest. In SIGKDD'02.
9. R. Goldman and J. Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In VLDB'97.
10. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94, pages 487-499, Sept. 1994.
11. N. Vanetik, E. Gudes. Mining Frequent Labeled and Partially Labeled Graph Patterns. In ICDE'04.
12. M. Kuramochi and G. Karypis, Finding Frequent Patterns in a Large Sparse Graph, SIAM International Conference on Data Mining, 2004.
13. Jiawei Han and Micheline Kamber, "Data mining Concepts and Techniques", Morgan Kaufman Publications, 2001
14. D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: A maximal frequent itemset algorithm for transactional databases. In ICDE, pages 443-452, 2001.