DHUI: A new algorithm for mining high utility itemsets

Proceedings of the 2009 International Conference on Machine Learning and Cybernetics

Volumn 1, Issue , 2009, Pages 173-177

  Ma, Chuan Xiang ^a   Zhang, Jie ^a  

^a HUBEI UNIVERSITY   (China)

Author keywords

Data mining; High utility mining; Pattern growth

Indexed keywords

CANDIDATE GENERATION; HIGH UTILITY MINING; ITEM SETS; PATTERN GROWTH; SET GENERATION; SUPPORT VALUE; TREE STRUCTURES;

ASSOCIATIVE PROCESSING; CONTROL THEORY; CYBERNETICS; PROFITABILITY; ROBOT LEARNING;

MINING;

EID: 70350738798     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLC.2009.5212570     Document Type: Conference Paper

References (10)

1. R. Agrawal et al., Mining association rules between sets of items in large databases, in: Proceedings 1993 ACMSIGMOD Intl. Conf. on Management of Data, Washington, DC, May 1993, pp. 207-216.
2. C.H.Cai,et al., Mining associationrules with weighted items, in:Proceedings 1998 Intl.Database Engineering and Application Symposium, Cardiff, Wales, UK,July 1998,pp.68-77.
3. H. Yao et al., Mining itemset utilities from transaction databases, Data & Knowledge Engineering 59 (2006)603-626.
4. Y.-C. et al. Chang, A fast algorithm for mining share-frequent itemsets, in: Y. Zhang, K. Tanaka, J.X. Yu, S. Wang,M. Li (Eds.), 7th Asia-Pacific Web Conference on Web Technologies Research and Development(APWeb 2005), Lecture Notes in Computer Science, vol. 3399, Springer-Verlag, Berlin, 2005, pp. 417-428.
5. Y.-C. et al., Chang, Efficient algorithms for mining share-frequent itemsets, in: Proceedings 11th World Congress of Intl.Fuzzy Systems Association, Beijing, China, July 2005, pp. 534-539.
6. Y.-C. et al,. Chang, Direct candidates generation: a novel algorithm for discovering complete share-frequent itemsets, 2nd Intl. Conf. On Fuzzy Systems and knowledge Discovery (FSKD 2005), lecture Notes in Artificial Intelligence, vol. 3614, Springer-Verlag, Berlin, 2005, pp. 551-560.
7. Y. Liu et al., A two-phase algorithm for fast discovery of high utility itemsets, in: T.B. Ho, D. Cheung, H. Liu(Eds.), 9th Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining (PAKDD 2005), Lecture Notes in ComputerScience, vol. 3518, Springer-Verlag, Berlin, 2005, pp. 689-695.
8. Yu-Chiang Li et al., Isolated items discarding strategy for discovering high utility itemsets, Data & Knowledge Engineering 64 (2008)198-217.
9. JIAWEI HAN,et al., Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern TreeApproach, Data Mining and Knowledge Discovery, 8, 53-87, 2004
10. IBM Almaden Research Center, Synthetic data generation code for associations and sequential patterns, Available from: http://www.almaden.ibm. com/software/projects/hdb/res-ources.shtml