research-article

Mining high utility patterns in incremental databases

Authors:

Chowdhury Farhan Ahmed,

Syed Khairuzzaman Tanbeer,

Byeong-Soo Jeong,

Young-Koo LeeAuthors Info & Claims

ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication

Pages 656 - 663

https://doi.org/10.1145/1516241.1516357

Published: 15 February 2009 Publication History

Abstract

Frequent pattern mining techniques treat all items in the database equally by taking into consideration only the presence of an item within a transaction. However, the customer may purchase more than one of the same item, and the unit price may vary among items. High utility pattern mining approaches have been proposed to overcome this problem. As a result, it becomes a very important research issue in data mining and knowledge discovery. On the other hand, incremental and interactive data mining provides the ability to use previous data structures and mining results in order to reduce unnecessary calculations when the database is updated, or when the minimum threshold is changed. In this paper, we propose a tree structure, called IIUT (incremental and interactive utility tree), to solve these problems together. It uses a pattern growth mining approach to avoid the level-wise candidate set generation-and-test problem, and it can efficiently capture the incremental data without any restructuring operation. Moreover, IIUT has the "build once mine many" property and therefore it is highly suitable for interactive mining. Experimental results show that our tree structure is very efficient and scalable for incremental and interactive high utility pattern mining.

References

[1]

Agrawal, R., Imieliński, T., and Swami, A. Mining association rules between sets of items in large databases. In ACM SIGMOD Int. Conf. on Management of Data, pp. 207--216, 1993.

Digital Library

[2]

Agrawal, R., and Srikant, R. Fast Algorithms for Mining Association Rules. In 20^th Int. Conf. on Very Large Data Bases, pp. 487--499, 1994.

Digital Library

[3]

Yun, U. Efficient Mining of weighted interesting patterns with a strong weight and/or support affinity. Information Sciences, vol. 177, pp. 3477--3499, 2007.

Digital Library

[4]

Yao, H., Hamilton, H. J., and C. J. Butz. A Foundational Approach to Mining Itemset Utilities from Databases, In Proceedings of the Third SIAM International Conference on Data Mining, pp. 482--486, 2004.

[5]

Yao, H., and Hamilton, H. J. Mining itemset utilities from transaction databases, Data & Knowledge Engineering, vol. 59, pp. 603--626, 2006.

Digital Library

[6]

Liu, Y., Liao, W.-K., and Choudhary, A. A Two Phase algorithm for fast discovery of High Utility of Itemsets, In Proceedings of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'05), pp. 689--695. 2005.

Digital Library

[7]

Barber, B., and Hamilton, H. J. Extracting share frequent itemsets with infrequent subsets, Data Mining and Knowledge Discovery, vol. 7, pp. 153--185, 2003.

Digital Library

[8]

Chan, R., Yang, Q., and Shen, Y. D. Mining High Utility Itemsets, In Proceedings of the Third IEEE International Conference on Data Mining, pp. 19--26, 2003.

Digital Library

[9]

Tao, F. Weighted association rule mining using weighted support and significant framework. In 9^th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 661--666, 2003.

Digital Library

[10]

Wang, W., Yang, J., and Yu, P. S. WAR: weighted association rules for item intensities. Knowledge Information and Systems, vol. 6, pp. 203--229, 2004.

Digital Library

[11]

Han, J., Pei, J., Yin, Y., and Mao, R. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery, vol. 8, pp. 53--87, 2004.

Digital Library

[12]

Grahne, G., and Zhu, J. Fast Algorithms for frequent itemset mining using FP-Trees. IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 10, pp. 1347--1362, 2005.

Digital Library

[13]

Han, J., Cheng, H., Xin, D., and Yan, X. Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery, vol. 15, pp. 55--86, 2007.

Digital Library

[14]

Cheung, W., and Zaïane, O. R. Incremental Mining of Frequent Patterns Without Candidate Generation or Support Constraint, In Proceedings of the Seventh International Database Engineering and Applications Symposium (IDEAS'03), pp.111--116, 2003.

[15]

Koh, J.-L., Shieh, S.-F. An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-tree Structures. In Proceedings of DASFAA 2004. LNCS, vol. 2973, pp. 417--424, 2004.

[16]

Li, X., Deng, Z. -H., and Tang, S. A fast algorithm for maintenance of association rules in incremental databases. Advanced Data Mining and Applications (ADMA), vol. 4093, pp. 56--63, 2006.

Digital Library

[17]

Lee, Y. -S., Yen, and S. -J. Incremental and interactive mining of web traversal patterns, Information Science, vol. 178, pp. 287--306, 2008.

Digital Library

[18]

Leung, C. K. -S., Khan, Q. I., Li, Z., and Hoque, T. CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowledge and Information Systems, vol. 11, no. 3, pp. 287--311, 2007.

Digital Library

[19]

Yun, U. Mining lossless closed frequent patterns with weight constraints. Knowledge-Based Systems, vol. 210, pp. 86--97, 2007.

Digital Library

[20]

Erwin, A., Gopalan, R. P., and Achuthan, N. R. CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach. In Proceedings of the Seventh IEEE International Conference on Computer and Information Technology (CIT'07), pp. 71--76, 2007.

Digital Library

[21]

Hu, J., and Mojsilovic, A. High Utility Pattern Mining: A method for discovery of high utility item sets, Pattern Recognition, vol. 40, pp. 3317--3324, 2007.

Digital Library

[22]

Zhang, S., Zhang, J., and Zhang, C. EDUA: An efficient algorithm for dynamic database mining, Information Sciences, vol. 177, pp. 2756--2767, 2007.

Digital Library

[23]

Li, Y. -C., Yeh, J. -S., and Chang, C. -C. Isolated items discarding strategy for discovering high utility itemsets, Data & Knowledge Engineering 64, pp. 198--217, 2008.

Digital Library

[24]

Tanbeer, S. K., Ahmed, C. F., Jeong, B. -S., Lee, Y. -K. CP-tree: A tree structure for single pass frequent pattern mining. In: 12th Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD), pp. 1022--1027, 2008.

Digital Library

Cited By

Truong TDuong HLe BFournier-Viger PYun U(2019)Efficient high average-utility itemset mining using novel vertical weak upper-boundsKnowledge-Based Systems10.1016/j.knosys.2019.07.018183:COnline publication date: 1-Nov-2019
https://dl.acm.org/doi/10.1016/j.knosys.2019.07.018
Islam SFariha AAhmed CJeong BLee SHanzo LIsmail RKim DChung MLee S(2012)EGDIMProceedings of the 6th International Conference on Ubiquitous Information Management and Communication10.1145/2184751.2184820(1-10)Online publication date: 20-Feb-2012
https://dl.acm.org/doi/10.1145/2184751.2184820

Index Terms

Mining high utility patterns in incremental databases
1. Information systems
  1. Information systems applications

Recommendations

Interactive mining of high utility patterns over data streams

High utility pattern (HUP) mining over data streams has become a challenging research issue in data mining. When a data stream flows through, the old information may not be interesting in the current time period. Therefore, incremental HUP mining is ...
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases

Recently, high utility pattern (HUP) mining is one of the most important research issues in data mining due to its ability to consider the nonbinary frequency values of items in transactions and different profit values for every item. On the other hand, ...
A survey of incremental high-utility itemset mining

Traditional association rule mining has been widely studied. But it is unsuitable for real-world applications where factors such as unit profits of items and purchase quantities must be considered. High-utility itemset mining HUIM is designed to find ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication

February 2009

704 pages

ISBN:9781605584058

DOI:10.1145/1516241

General Chairs:
Won Kim
Sungkyunkwan University, Korea
,
Hyung Jin Choi
Sungkyunkwan University, Korea
,
Dongho Won
SungKyunkwan University, Korea

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 February 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Ministry of Health and Welfare

Conference

ICUIMC '09

Sponsor:

SIGKDD

ICUIMC '09: The 3rd International Conference on Ubiquitous Information Management and Communication

January 15 - 16, 2009

Suwon, Korea

Acceptance Rates

Overall Acceptance Rate 251 of 941 submissions, 27%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
507
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Truong TDuong HLe BFournier-Viger PYun U(2019)Efficient high average-utility itemset mining using novel vertical weak upper-boundsKnowledge-Based Systems10.1016/j.knosys.2019.07.018183:COnline publication date: 1-Nov-2019
https://dl.acm.org/doi/10.1016/j.knosys.2019.07.018
Islam SFariha AAhmed CJeong BLee SHanzo LIsmail RKim DChung MLee S(2012)EGDIMProceedings of the 6th International Conference on Ubiquitous Information Management and Communication10.1145/2184751.2184820(1-10)Online publication date: 20-Feb-2012
https://dl.acm.org/doi/10.1145/2184751.2184820

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten