Indexing
All Issues
Submission
Author Guidelines
Reviewers
Editorial Members
Publication Fee
Vol.4 , No. 6, Publication Date: Dec. 7, 2017, Page: 58-63
 is to identify efficient and helpful information from large databases and provide automated analysis and solutions. In particular, finding association rules from transaction databases is most commonly seen in data mining. There are several algorithms have been developed to solve the problem to analysis the basket of the customer. These are mainly based on apriori. In fact mining pattern does not meet all the requirement of the business. Utility Mining is one of the extensions of Frequent Item set mining, which discovers item sets that occur frequently. In many real-life applications where utility item sets provide useful information in different decision-making domains such as business transactions, medical, security, fraudulent transactions, retail communities. Many algorithms have been developed to find high-utility patterns (HUPs) from databases without considering timestamp of patterns, especially in recent intervals. A pattern may not be a HUP in an entire database but may be a HUP in recent intervals. In this paper, an improved up-to-date high-utility pattern (UDHUP) is designed. It considers not only utility measure but also timestamp factor to discover the recent HUPs. In this paper the UDHUP- list algorithm is discussed. A new data structure, called up-to-date utility-list (UDU-list), is used to efficiently speed up the performance for mining UDHUPs.&picture=http://www.aascit.org/aascit/decorators/img/journal/912.jpg)
| [1] | Shaikh Nikhat Fatma, Department of Computer Engineering, Pillai HOC of Engineering and Technology, Rasayani, India. |
Knowledge discovery in databases (KDD) is to identify efficient and helpful information from large databases and provide automated analysis and solutions. In particular, finding association rules from transaction databases is most commonly seen in data mining. There are several algorithms have been developed to solve the problem to analysis the basket of the customer. These are mainly based on apriori. In fact mining pattern does not meet all the requirement of the business. Utility Mining is one of the extensions of Frequent Item set mining, which discovers item sets that occur frequently. In many real-life applications where utility item sets provide useful information in different decision-making domains such as business transactions, medical, security, fraudulent transactions, retail communities. Many algorithms have been developed to find high-utility patterns (HUPs) from databases without considering timestamp of patterns, especially in recent intervals. A pattern may not be a HUP in an entire database but may be a HUP in recent intervals. In this paper, an improved up-to-date high-utility pattern (UDHUP) is designed. It considers not only utility measure but also timestamp factor to discover the recent HUPs. In this paper the UDHUP- list algorithm is discussed. A new data structure, called up-to-date utility-list (UDU-list), is used to efficiently speed up the performance for mining UDHUPs.
Keywords
Association Rule Mining, Minimum Utility Threshold, High Utility Pattern Mining, High Utility Pattern, Up-to-Date High Utility Pattern, Utility List, Up-to-Date Utility List, Frequent Item Set Mining
Reference
| [01] | R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in: International conference on Very Large Data Bases, 1994, pp. 487-499. |
| [02] | R. Agrawal, R. Srikant, Mining sequential patterns, in: International Conference on Data Engineering, 1995, pp. 3-14. |
| [03] | S. B. Kotsiantis, Supervised machine learning: a review of classification techniques, in: The Conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies, 2007, pp. 3-24. |
| [04] | P. Berkhin, A survey of clustering data mining techniques, Group. Multidimens. Data (2006) 25-71. |
| [05] | R. Chan, Q. Yang, Y. D. Shen, Mining high utility itemsets, in: IEEE International Conference on Data Mining, 2003, pp. 19-26. |
| [06] | J. M. Ale, G. H. Rossi, An approach to discovering temporal association rules, in: ACM symposium on Applied computing, vol. 1, 2000, pp. 294-300. |
| [07] | C. Y. Chang, M. S. Chen, C. H. Lee, Mining general temporal association rules for items with different exhibition periods, in: IEEE International Conference on Data Mining, 2002, pp. 59-66. |
| [08] | S. Chi, S. J. Suk, Y. Kang, S. P. Mulva, Development of a data mining-based analysis framework for multi-attribute construction project information, Adv. Eng. Inform. 26 (3) (2012) 574-581. |
| [09] | O. AbuOmar, S. Nouranian, R. King, J. L. Bouvard, H. Toghiani, T. E. Lacy, et al., Data mining and knowledge discovery in materials science and engineering: a polymer nanocomposites case study, Adv. Eng. Inform. 27 (4) (2013) 615-624. |
| [10] | C. W. Lin, T. P. Hong, G. C. Lan, J. W. Wong, W. Y. Lin, Efficient updating of discovered high-utility itemsets for transaction deletion in dynamic databases, Adv. Eng. Inform. 29 (1) (2015) 16-27. |
| [11] | H. F. Li, H. Y. Huang, Y. C. Chen, Y. J. Liu, S. Y. Lee, Fast and memory efficient mining of high utility itemsets in data streams, in: IEEE International Conference on Data Mining, 2008, pp. 881-886. |
