Jieh-Shan Yeh
ABSTRACT
Temporal data mining is the activity of finding interesting correlations or patterns in large temporal data sets. On the other hand, utility mining aims at identifying the itemsets with high utilities. In 2006, Tseng et al. introduced the temporal utility mining which is extended from both temporal association rule mining and utility mining. In this study, we investigated the incremental utility mining which can identify all high temporal utility itemsets in a specified time period on an incremental transaction database. Two efficient algorithms, Incremental Utility Mining (IUM) and Fast Incremental Utility Mining (FIUM), were proposed. The experimental results also showed that both algorithms are efficient.
- Agrawal, R. and Srikant, R. 1994. Fast Algorithms for Mining Association Rules. In Proceedings of the 20th VLDB Conference (Santiago, Chile). 487--499. Google Scholar
Digital Library
- Park, J. S., Chen, M. S., and Yu, P. S. 1995. An Effective Hash-based Algorithm for Mining Association Rules. In Proceedings of ACM SIGMOD Conf. on Management of Data. 175--186. Google ScholarDigital Library
- Savasere, A., Oiecinski, E., and Navathe, S. 1995. An Efficient Algorithm for Mining Association Rules in Large Databases. In Proceedings of the 20th Int. Conf. on Very Large Data Bases. 432--444. Google ScholarDigital Library
- Agrawal, R. and Srikant, R. 1996. Parallel Mining of Association Rules. IEEE Transactions on Knowledge and Data Engineering. 8, 6, 962--969. Google ScholarDigital Library
- Agrawal, R. and Shim, K. 1996. Developing Tightly-Coupled Data Mining Applications on a Relational Database System. In Proceedings of the 2nd Int. Conf. on Knowledge Discovery in Databases and Data Mining (Portland, Oregon). 287--290.Google Scholar
- Agrawal, R., Srikant, R., and Vu, Q. 1997. Mining Association Rules with Item Constraints. In Proceedings of the 3rd Int. Conf. on Knowledge Discovery in Database and Data Mining (Newport Beach, California). 67--73.Google Scholar
- Cheung, D., Han, J., Ng V., and Wong, C. Y. 1996. Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In Proceedings of the 12th Int. Conf. on Data Engineering (ICDE96). 106--114. Google ScholarDigital Library
- Cheung, D., Lee, S. D., and Kao, B. 1997. A General Incremental Technique for Updating Discovered Association Rules. In Proceedings of Int. Conf. on Database Systems for Advanced Applications. 185--194. Google ScholarDigital Library
- Hong, T. P., Wang, C. Y., and Tao, Y. H. 2000. Incremental Data Mining Based on Two Support Thresholds. In Proceedings of the 4th Int. Conf. on Knowledge-Based Intelligent Engineering Systems and Allied Technologies. 436--439.Google Scholar
- Lee, C. H., Lin, C. R., and Chen, M. S. 2001. Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining. In Proceedings of the 10th Int. Conf. on Information and Knowledge Management. 263--270. Google ScholarDigital Library
- Chang, C. H., Lin, C. R., and Chen, M. S. 2001. On Mining General Temporal Association Rules in A Publication Database. In Proceedings of 2001 IEEE Int. Conf. on Data Mining. 337--344. Google ScholarDigital Library
- Masseglia, F., Poncelet, P., and Teisseire, M. 2003. Incremental Mining of Sequential Patterns in Large Databases. Data & Knowledge Engineering. 46. 97--121. Google ScholarDigital Library
- Cheng, H., Yang, X., and Han, J. 2004. IncSpan: Incremental Mining of Sequential Patterns in Large Database. In Proceedings of the 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining. 527--532. Google ScholarDigital Library
- Yao, H., Hamilton, H. J., and Butz, C. J. 2004. A Foundational Approach to Mining Itemset Utilities from Databases. In Proceedings of the 4th SIAM Int. Conf. on Data Mining. 428--486.Google Scholar
- Tseng, V. S., Chu, C. J., and Liang, T. 2006. Efficient Mining of Temporal High Utility Itemsets from Data Streams. In Proceedings of ACM KDD Workshop on Utility-Based Data Mining.Google Scholar
- Liu, Y., Liao W. K., and Choudhary, A. 2005. A Fast High Utility Itemsets Mining Algorithm. In Proceedings of the 11th ACM SIGKDD Workshop on Utility-Based Data Mining. Google ScholarDigital Library
- Liu, Y., Liao, W. K., and Choudhary, A. 2005. A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets. LECTURE NOTES IN COMPUTER SCIENCE 3518, Springer-Verlag, Berlin Heidelberg. 689--695. Google ScholarDigital Library
- Li, Y. C., Yeh, J. S., and Chang, C. C. 2005. A Fast Algorithm for Mining Share-Frequent Itemsets. In Proceedings of the 7th Asia Pacific Web Conference, Springer-Verlag, Germany. 417--428. Google ScholarDigital Library
- Li, Y. C., Yeh, J. S., and Chang, C. C. 2005. Efficient Algorithm for Mining Share-Frequent Itemsets. In Proceedings of Fuzzy Logic, Soft Computing and Computational Intelligence (IFSA 2005), Springer Tsinghua, China. 534--539.Google Scholar
- IBM Almaden Research Center, http://www.almaden.ibm.com/cs/projects/iis/hdb/Projects/data_mining/mining.shtmlGoogle Scholar
Index Terms
- Efficient algorithms for incremental utility mining
Recommendations
Incrementally mining high utility patterns based on pre-large concept
In traditional association rule mining, most algorithms are designed to discover frequent itemsets from a binary database. Utility mining was thus proposed to measure the utility values of purchased items for revealing high utility itemsets from a ...
Efficient incremental high utility pattern mining based on pre-large concept
AbstractHigh utility pattern mining has been actively researched in recent years, because it treats real world databases better than traditional pattern mining approaches. Retail data of markets and web access information data are ...
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