Efficiently mining frequent trees in a forest

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2002, Pages 71-80

  Zaki, Mohammed J ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA FLOW ANALYSIS; DATA STRUCTURES; PATTERN MATCHING; TREES (MATHEMATICS);

FREQUENT STRUCTURE MINING; TREE MINING ALGORITHM;

DATA MINING;

EID: 0242709382     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775047.775058     Document Type: Conference Paper

References (23)

1. S. Abiteboul, H. Kaplan, and T. Milo. Compact labeling schemes for ancestor queries. In ACM Symp. on Discrete Algorithms, January 2001.
2. S. Abiteboul and V. Vianu. Regular path expressions with constraints. In ACM Int'l Conf. on Principles of Database Systems, May 1997.
3. R. Agrawal et al. Fast discovery of association rules. In U. Fayyad and et al, editors, Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, Menlo Park, CA, 1996.
4. R. Agrawal and R. Srikant. Mining sequential patterns. In 11th Intl. Conf. on Data Engg., 1995.
5. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Satamoto, and S. Arikawa. Efficient substructure discovery from large semi-structured data. In 2nd SIAM Int'l Conference on Data Mining, April 2002.
6. M.S. Chen, J.S. Park, and P.S. Yu. Data mining for path traversal patterns in a web environment. In International Conference on Distributed Computing Systems, 1996.
7. Z. Chen et al. Counting twig matches in a tree. In 17th Intl. Conf. on Data Engineering, 2001.
8. 3 n)-time. In 10th Symposium on Discrete Algorithms, 1999.
9. D. Cook and L. Holder. Substructure discovery using minimal description length and background knowledge. Journal of Artificial Intelligence Research, 1:231-255, 1994.
10. L. Dehaspe, H. Toivonen, and R. King. Finding frequent substructures in chemical compounds. In 4th Intl. Conf. Knowledge Discovery and Data Mining, August 1998.
11. M. Fernandez and D. Suciu. Optimizing regular path expressions using graph schemes. In IEEE Int'l Conf. on Data Engineering, February 1998.
12. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In 4th European Conference on Principles of Knowledge Discovery and Data Mining, September 2000.
13. K. Kilpelainen and H. Mannila. Ordered and unordered tree inclusion. SIAM J. of Computing, 24(2):340-356, 1995.
14. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In 1st IEEE Int'l Conf. on Data Mining, November 2001.
15. Q. Li and B. Moon. Indexing and querying XML data for regular path expressions. In 27th Int'l Conf. on Very Large Data Bases, 2001.
16. J. Punin, M. Krishnamoorthy, and M. Zaki. LOGML: Log markup language for web usage mining. In ACM SIGKDD Workshop on Mining Log Data Across All Customer TouchPoints, August 2001.
17. R. Cooley, B. Mobasher, and J. Srivastava. Web Mining: Information and Pattern Discovery on the World Wide Web. In 8th IEEE Intl. Conf. on Tools with AI, 1997.
18. R. Shamir and D. Tsur. Faster subtree isomorphism. Journal of Algorithms, 33:267-280, 1999.
19. B. Shapiro and K. Zhang. Comparing multiple rna secondary structures using tree comparisons. Computer Applications in Biosciences, 6(4):309-318, 1990.
20. K. Wang and H. Liu. Discovering typical structures of documents: A road map approach. In ACM SIGIR Conference on Information Retrieval, 1998.
21. K. Yoshida and H. Motoda. CLIP: Concept learning from inference patterns. Artificial Intelligence, 75(1):63-92, 1995.
22. M. J. Zaki. Efficiently mining trees in a forest. Tech. Report 01-7, CS Dept., RPI, July 2001.
23. C. Zhang et al. On supporting containment queries in relational database management systems. In ACM Int'l Conf. on Management of Data, May 2001.