High utility itemsets mining

International Journal of Information Technology and Decision Making

Volumn 9, Issue 6, 2010, Pages 905-934

  Liu, Ying ^a   Li, Jianwei ^b   Liao, Wei Keng ^c   Choudhary, Alok ^c   Shi, Yong ^d,e  

^a UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

^b Bloomberg LP   (United States)

^c Northwestern University   (United States)

^d INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^e UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

business intelligence; Data mining; utility mining

Indexed keywords

EID: 78149261542     PISSN: 02196220     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219622010004159     Document Type: Article

References (30)

1. D. Olson and Y. Shi, Introduction to Business Data Mining (McGraw-Hill/Irwin, 2007).
2. W. Huang, K. K. Lai, Y. Nakamori, S. Wang and L. Yu, Neural networks in finance and economics forcasting, J. Inform. Technol. Decis. Making 6 (1) (2007) 113-140.
3. Y. Peng, G. Kou, Y. Shi and Z. Chen, A descriptive framework for the field of data mining and knowledge discovery, J. Inform. Technol. Decis. Making 7 (4) (2008) 639-682.
4. H. Yao, H. J. Hamilton and C. J. Butz, A foundational approach to mining itemset utilities from databases, in Proc. 4th SIAM Int. Conf. Data Mining (Florida, in 2004), pp. 482-486.
5. H. Yao and H. J. Hamilton, Mining itemset utilities from transaction databases, Data Knowl. Eng. 59 (3) (2006) 603-626.
6. Y. Liu, W. K. Liao and A. Choudhary, A two-phase algorithm for fast discovery of high utility itemsets, in Proc. 9th Pacific-Asia Conf. on Knowledge Discovery and Data Mining (Hanoi, Vietnam, 2005), pp. 689-695.
7. Y. Liu, W. K. Liao and A. Choudhary, A fast high utility itemsets mining algorithm, in Workshop on Utility-Based Data Mining in Conjunction with the 11th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (Chicago, 2005).
8. M. A. Rappa, The utility business model and the future of computing services, IBM Syst. J. Utility Comput. 43 (1) (2004) 32-52.
9. R. Agrawal and R. Srikant, Fast algorithms for mining association rules, in Proc. 20th Int. Conf. Very Large Data Bases (Sep. 1994), pp. 487-499.
10. J. S. Park, M. Chen and P. S. Yu, An effective hash based algorithm for mining association rules, in Proc. ACM SIGMOD Int. Conf. on Management of Data (May 1995), pp. 175-186.
11. S. Brin, R. Motwani, J. D. UIIman and S. Tsur, Dynamic itemset counting and implication rules for market basket data, in Proc. ACM SIGMOD Int. Conf. on Management of Data (Arizona, May 1997), pp. 207-216.
12. M. Zaki, S. Parthasarathy, M. Ogihara and W. Li, New algorithms for fast discovery of association rules, in Proc. 3rd Conf. on Knowledge Discovery and Data Mining (California, Aug. 1997), pp. 283-287.
13. J. Han, J. Pei and Y. Yin, Mining frequent patterns without candidate generation, in Proc. SIGMOD Int. Conf. on Management of Data (Texas, May 2000), pp. 1-12.
14. Y. Aumann and Y. Lindell, A statistical theory for quantitative association rules, in Proc. 5th Conf. on Knowledge Discovery and Data Mining (California, Aug. 1999), pp. 261-270.
15. G. I. Webb, Discovering associations with numeric variables, in Proc. 7th Conf. on Knowledge Discovery and Data Mining (California, Aug. 2001), pp. 383-388.
16. C. H. Cai, W. C. Ada, C. H. Cheng and W. W. Kwong, Mining association rules with weighted items, in Proc. Int. Database Engineering and Applications Symposium (IDEAS) (UK, 1998), pp. 68-77.
17. W. Wang, J. Yang and P. S. Yu, Efficient mining of weighted association rules (WAR), in Proc. 6th Conf. on Knowledge Discovery and Data Mining (Massachusetts, Aug. 2000), pp. 270-274.
18. F. Tao, F. Murtagh and M. Farid, Weighted association rule mining using weighted support and significance framework, in Proc. Conf. on Knowledge Discovery and Data mining (Washington DC, Aug. 2003), pp. 661-666.
19. S. Lu, H. Hu and F. Li, Mining weighted association rules, Intell. Data Anal. 5 (3) (2001) 211-225.
20. T. Y. Lin, Y. Y. Yao and E. Louie, Value added association rules, in Proc. 6th Pacific-Asia Conf. on Advances in Knowledge Discovery (Taipei, May 2002) pp. 328-333.
21. C. Bucila, J. Gehrke, D. Kifer and W. M. White. DualMiner: A Dual-pruning algorithm for itemsets with constraints, Data Mining Know. Discov. 7 (3) (2003) 241-272.
22. R. T. Ng, L. V. S. Lakshmanan, J. Han and A. Pang, Exploratory mining and pruning optimization of constrained association rule, in Proc. ACM SIGMOD Int. Conf. on Management of Data, (Washington, Jun. 1998), pp. 13-24.
23. J. Pei, J. Han and L. V. S. Lakshmanan, Mining frequent itemsets with convertible constraints, in Proc. Int. Conf. on Data Engineering, (Heidelberg, Germany, 2001) pp. 433-443.
24. A. Silberschatz and A. Tuzhilin, What makes patterns interesting in knowledge discovery systems, IEEE Trans. Know. Data Eng. 8 (6) (1996).
25. Lev. Utkin, Risk analysis under partial prior information and nonmonotone utility functions, J. Inform. Technol. Decis. Making 6 (4) (2007) 625-641.
26. C. Theetranont, P. Haddawy and D. Krairit, Integrating visualization and multiattribute utility theory for online product selection, J. Inform. Technol. Decis. Making 6 (4) (2007) 723-750.
27. B. Barber and H. J. Hamilton, Extracting share frequent itemsets with infrequent subsets, Data Mining Know. Discov. 7 (2) (2003) 153-185.
28. R. Chan, Q. Yang and Y. Shen, Mining high utility itemsets, in Proc. IEEE Int. Conf. on Data Mining (Florida, Nov. 2003), pp. 19-26.
29. J. Hu and A. Mojsilovic, High-utility pattern mining: A method for discovery of highutility item sets, Pattern Recogn. 40 (11) (2007) 3317-3324.
30. IBM, IBM synthetic data generation code, http://www.almaden. ibm.com/software/quest/Resources/index.shtml.