Bottom-up discovery of frequent rooted unordered subtrees

Information Sciences

Volumn 179, Issue 1-2, 2009, Pages 70-88

  Bei, Yijun ^a   Chen, Gang ^a   Shou, Lidan ^a   Li, Xiaoyan ^a   Dong, Jinxiang ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Bottom up mining; Frequent tree; Rooted unordered tree; Tree mining; XML mining

Indexed keywords

DATA MINING; MANAGEMENT INFORMATION SYSTEMS; MARKUP LANGUAGES; MINING; WEBSITES; WORLD WIDE WEB; XML;

BOTTOM-UP MINING; FREQUENT TREE; ROOTED UNORDERED TREE; TREE MINING; XML MINING;

TREES (MATHEMATICS);

EID: 55249119970     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2008.08.020     Document Type: Article

References (31)

1. R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the ACM SIGMOD Conference, 1993, pp. 207-216.
2. R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: Proceedings of the 20th International Conference on Very Large Data Bases, 1994, pp. 487-499.
3. R. Agrawal, R. Srikant, Mining sequential patterns, in: Proceedings of the International Conference on Data Engineering, 1995, pp. 3-14.
4. S. Al-Khalifa, H.V. Jagadish, N. Koudas, J.M. Patel, D. Srivastava, Y. Wu, Structural joins: a primitive for efficient XML query pattern matching, in: Proceedings of the IEEE International Conference on Data Engineering, 2002, pp. 141-152.
5. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Satamoto, S. Arikawa, Efficient substructure discovery from large semi-structured data, in: Proceedings of the Second SIAM International Conference on Data Mining, 2002, pp. 158-174.
6. T. Asai, H. Arimura, T. Uno, S. Nakano, Discovering frequent substructures in large unordered trees, in: Proceedings of the Sixth International Conference on Discovery Science, 2003, pp. 47-67.
7. Y.J. Bei, G. Chen, J.X. Dong, BUXMiner: an efficient bottom-up approach to mining XML query patterns, in: Proceedings of APWEB/WAIM, 2007, pp. 709-720.
8. Braga D., Campi A., Ceri S., Klemettinen M., and Lanzi P. Discovering interesting information in XML data with association rules. Proceedings of SAC (2003), ACM Press 450-454
9. Chen E., Cao H., Li Q., and Qian T. Efficient strategies for tough aggregate constraint-based sequential pattern mining. Information Sciences 178 6 (2008) 1498-1518
10. L. Chen, E.A. Rundensteiner, S. Wang, Xcache - a semantic caching system for XML queries, in: ACM SIGMOD, 2002, p. 618.
11. L. Chen, S.S. Bhowmick, L.T. Chia, Mining positive and negative association rules from XML query patterns for caching, in: Proceedings of the 10th DASFAA, 2005, pp. 736-747.
12. C. Chenier, J.J. Jun, J. Zhang, T. Ozyer, R. Alhajj, Association-rules mining based broadcasting approach for XML data, in: Proceedings of ADVIS, 2006, pp. 207-216.
13. Y. Chi, Y. Yang, R.R. Muntz, Indexing and mining free trees, in: Proceedings of the Third IEEE International Conference on Data Mining, 2003, pp. 509-512.
14. Y. Chi, Y. Yang, R.R. Muntz, HybridTreeMiner: an efficient algorithm for mining frequent rooted trees and free trees using canonical forms, in: Proceedings of the 16th International Conference on Scientific and Statistical Database Management, 2004, pp. 11-20.
15. Denoyer L., and Gallinari P. Report on the XML mining track at INEX 2005 and INEX 2006: categorization and clustering of XML documents. SIGIR Forum 41 1 (2007) 79-90
16. M.S. Gu, J.H. Hwang, K.H. Ryu, Frequent XML query pattern mining based on FP-Tree, in: Proceedings of DEXA Workshops, 2007, pp. 555-559.
17. J.W. Hong, H. Kang, Data integration and cache-answerability of queries through XML view of data source on the web, in: Proceedings of IMSA, 2005, pp. 242-247.
18. V. Hristidis, M. Petropoulos, Semantic caching of XML databases, in: Proceedings of the Fifth WebDB, 2002, pp. 25-30.
19. F. Ling, T.S. Dillon, Mining interesting XML-enabled association rules with templates, in: Proceedings of KDID, 2004, pp. 66-88.
20. Lee A.J.T., and Wang C.S. An efficient algorithm for mining frequent inter-transaction patterns. Information Sciences 177 17 (2007) 3453-3476
21. Lee Y.S., and Yen S.J. Incremental and interactive mining of web traversal patterns. Information Sciences 178 2 (2008) 287-306
22. F. Luccio, A.M. Enriquez, P.O. Rieumont, L. Pagli, Exact rooted subtree matching in sublinear time, Technical Report TR-01-14, 2001.
23. J.W.W. Wan, G. Dobbie, Extracting association rules from XML documents using XQuery, in: Proceedings of WIDM, 2003, pp. 94-97.
24. L.H. Yang, M.L. Lee, W. Hsu, Efficient mining of XML query patterns for caching, in: Proceedings of the 29th VLDB, 2003, pp. 69-80.
25. L.H. Yang, M.L. Lee, W. Hsu, S. Acharya, Mining frequent query patterns from XML queries, in: Proceedings of the eighth DASFAA, 2003, pp. 355-362.
26. Yang L.H., Lee M.L., Hsu W., Huang D., and Wong L. Efficient mining of frequent XML query patterns with repeating-siblings. Information and Software Technology 50 5 (2008) 375-389
27. M.J. Zaki, Efficiently mining frequent trees in a forest, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002, pp. 71-80.
28. Zaki M.J. Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae 65 (2005) 1-20
29. Zaki M.J. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering 12 3 (2000) 372-390
30. Zhao Q.K., Chen L., Bhowmick S.S., and Madria S.K. XML structural delta mining: issues and challenges. Data and Knowledge Engineering (DKE) 59 3 (2006) 627-651
31. Available at: .