arrow
Return

Incremental high utility pattern mining with static and dynamic databases

delete2014-10-12
delete74
PRE
AI
U
Unil Yun *
DOI:10.1007/s10489-014-0601-6delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Pattern mining is a data mining technique used for discovering significant patterns and has been applied to various applications such as disease analysis in medical databases and decision making in business. Frequent pattern mining based on item frequencies is the most fundamental topic in the pattern mining field. However, it is difficult to discover the important patterns on the basis of only frequencies since characteristics of real-world databases such as relative importance of items and non-binary transactions are not reflected. In this regard, utility pattern mining has been considered as an emergent research topic that deals with the characteristics. In real-world applications, meanwhile newly generated data by continuous operation or data in other databases for integration analysis can be gradually added to the current database. To efficiently deal with both existing and new data as a database, it is necessary to reflect increased data to previous analysis results without analyzing the whole database again. In this paper, we propose an algorithm called HUPID-Growth (High Utility Patterns in Incremental Databases Growth) for mining high utility patterns in incremental databases. Moreover, we suggest a tree structure constructed with a single database scan named HUPID-Tree (High Utility Patterns in Incremental Databases Tree), and a restructuring method with a novel data structure called TIList (Tail-node Information List) in order to process incremental databases more efficiently. We conduct various experiments for performance evaluation with state-of-the-art algorithms. The experimental results show that the proposed algorithm more efficiently processes real datasets compared to previous ones.
Keywords:
Data mining
High utility patterns
Incremental mining
Frequent pattern mining
Static and dynamic databases
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Intelligence cover
Applied Intelligence
IF:
3.5
Papers:
7.6K
Citations:
1.7W

Organization

S
Sejong University
Scholars:
8.3K
Papers: 1.1W
Citations: 1.5W
Cited Papers

Cited Papers

Indenyl and fluorenyl transition element complexes
err1978-10-01
err0
PREAI
errA.N. Nesmeyanov; N.A. Ustynyuk; L.G. Makarova; V.G. Andrianov; Yu.T. Struchkov; Steffen Andrae; Yu.A. Ustynyuk; S.G. Malyugina
errShare
errSave
An efficient algorithm for incrementally mining frequent closed itemsets
err2013-12-22
err16
PREAI
errYen, Show-Jane; Lee, Yue-Shi; Wang, Chiu-Kuang
errShare
errSave
Web warehouse - a new web information fusion tool for web mining
err2008-10-01
err6
PREAI
errYu, Lean; Huang, Wei; Wang, Shouyang; Lai, Kin Keung
errShare
errSave
Efficient frequent pattern mining based on Linear Prefix tree
err2014-01-01
err88
PREAI
errPyun, Gwangbum; Yun, Unil; Ryu, Keun Ho
errShare
errSave
errShare
errSave
Single-pass incremental and interactive mining for weighted frequent patterns
err2012-07-01
err57
PREAI
errAhmed, Chowdhury Farhan; Tanbeer, Syed Khairuzzaman; Jeong, Byeong-Soo; Lee, Young-Koo; Choi, Ho-Jin
errShare
errSave
Photoresponse of n-type semiconductor NiTiO3
err1982-01-15
err0
PREAI
errP. Salvador; Claudio Gutierrez; J. B. Goodenough
errShare
errSave
Mining frequent itemsets in a stream
err2014-01-01
err46
PREAI
errCalders, Toon; Dexters, Nele; Gillis, Joris J. M.; Goethals, Bart
errShare
errSave
researcher View more