Efficient mining of interesting weighted patterns from directed graph traversals

Integrated Computer-Aided Engineering

Volumn 16, Issue 1, 2009, Pages 21-49

  Geng, Runian ^a,b   Xu, Wenbo ^a   Dong, Xiangjun ^b  

^a JIANGNAN UNIVERSITY   (China)

^b QILU UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Closed pattern mining; Data mining; Frequent pattern mining; Support bound; Traversal patterns; Weighted directed graph

Indexed keywords

DATA MINING; GRAPH THEORY; INFORMATION MANAGEMENT; MINERS;

APPLICATIONS.; CLOSED PATTERN MINING; CLOSURE PROPERTIES; DECISION PROBLEMS; DIRECTED GRAPHS; DOWNWARD CLOSURE PROPERTIES; FREQUENT PATTERN MINING; FREQUENT PATTERNS; IMPROVED MODELS; LOSSLESS; MONOTONE PROPERTIES; PATTERN GROWTHS; PATTERN MININGS; PERFORMANCE STUDIES; SEARCH SPACES; SUPPORT MEASURES; TRANSFORMATIONAL MODELS; TRAVERSAL PATTERNS; WEIGHTED DIRECTED GRAPH;

MINING;

EID: 58149513224     PISSN: 10692509     EISSN: None     Source Type: Journal    
DOI: 10.3233/ICA-2009-0299     Document Type: Article

References (29)

1. R, Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, in: Proceedings of VLDB'94, 1994, 487-499.
2. C.H. Cai, Ada W.C. Fu, C.H. Cheng and W.W, Kwong, Mining association rules with weighted items, in: Proceedings of IDEAS'98, 1998, 68-77.
3. M.S. Chen, J.S. Park and P.S, Yu, Efficient data mining for path traversal patterns, IEEE Trans on Knowledge and Data Engineering 10 (1998), 209-221.
4. F. Bonchi and C. Lunnhese, On closed constrained frequent pattern mining, in: Proceedings of ICDM'04, 2004, 35-42.
5. F. Tao, F. Murtagh and M. Farid, Weighted association rule mining using weighted support and significance framework, in: Proceedings of SIGKDD'03, 2003, 661-666.
6. G. Grahne and J. Zhu, Fast algorithms for frequent itemset mining using FP-trees, IEEE Transactions on Knowledge and Data Engineering 17 (2005), 1347-1362.
7. S. Madria, S. Bhowmick, W. Ng and P. Lim, Research issues in web data mining, in: Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery (DaWaK'99), 1999, 303-312.
8. K. Joshi, A. Joshi, Y. Yesha and R. Krishnapuram, Warehousing and mining Web logs, in: Proceedings of the 2nd international workshop on Web information and data management (WIDM'99), 1999, 63-68.
9. J. Pei and J. Han, CLOSET: an efficient algorithm for mining frequent closed itemsets, in: Proceedings of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000, 21-30.
10. J. Wang, J. Han and J. Pei, Closet+: searching for the best strategies for mining frequent closed itemsets, in: Proceedings of SIGKDD '03, 236-245.
11. J.S. Park, M.S. Chen and P.S. Yu, An effective hash based algorithm for mining association rules, in: Proceedings of SIGMOD ICMD'95, 1995, 175-186.
12. M.J. Zaki and K. Gouda, Fast vertical mining using diffsets, in: Proceedings of SIGKDD'03, 2003, 326-335.
13. M.J. Zaki and C.-J. Hsiao, Charm: an efficient algorithm for closed itemsets mining, in: Proceedings of SDM'02, 2002, 12-28.
14. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, Discovering frequent closed itemsets for association rules, in: Proceedings of ICDT'99, 1999, 398-416.
15. A. Nanopoulos and Y. Manolopoulos, Mining patterns from graph traversals, Data and Knowledge Engineering 37 (2001), 243-266.
16. M. Seno and G. Karypis, Finding frequent patterns using length-decreasing support constraints, Data Mining and Knowledge Discovery 10 (2005), 197-228.
17. W. Shi and Y. Fu, Algorithm for frequent pattern mining based on FP-reference-tree/list, Computer Science 6 (2006), 206-209 (in Chinese).
18. U. Yun and J.J. Leggett, WLPMiner: weighted frequent pattern mining with length-decreasing support constraints, in: Proceedings of PAKDD '05, 2005, 555-567.
19. W. Wang, J. Yang and P.S. Yu, Efficient mining of weighted association rules (WAR), in: Proceedings of SIGKDD '00, 2000, 270-274.
20. R. Geng, W. Xu and X. Dong, WTPMiner: efficient mining of weighted frequent patterns based on graph traversals. in:Proceedings of KSEM'07, 2007, 412-424.
21. J. Han, J. Pei and Y. Yin, Mining frequent patterns without candidate generation, in: Proceeding of SIGMOD ICMD'00, Maggie Dunham, ed., ACM Press. New York, 2000, pp. 1-12.
22. J. Liu, Y. Pan, K. Wang and J. Han, Mining frequent item sets by opportunistic projection, in: Proceedings of SIGKDD'02, 2002, 229-238.
23. O. Zaiane, M. Xin and J. Han, Discovering web access patterns and trends by applying OLAP and data mining technology on web logs, in: Proceedings of the Advances in Digital Libraries Conference (ADL'99), 1998, 19-29.
24. J. Han and M. Kamber, Data Mining: Concepts and Techniques, (2nd ed.), Morgan Kaufmann Publishers, 2006.
25. X. Wu and W. Xu, Constraint-based mining of frequent patterns using FP-tree, Journal of Beijing Jiaotong University 6 (2005), 23-27 (in Chinese).
26. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal and M.-C. Hsu, PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth, in: Proceedings of ICDE'01, 2001, 215-224.
27. A. Nanopoulos and Y. Manolopoulos, Finding generalized path patterns for web log data mining, in: Proceedings of ADBIS-DASFAA '00, 2000, 215-228.
28. D. Reinhard, Graph Theory, (3rd ed.), Berlin, New York: Springer-Verlag Press, 2005.
29. S.-J. Yen and A.L.P Chen, A graph-based approach for discovering various types of association rules, IEEE Trans on Knowledge and Data Engineer 13 (2001), 839-845.