Incremental Mining Top-rank-k Erasable Patterns with an Inverted-Subsume Table in the Incremental Product Database
碩士 === 國立中山大學 === 資訊工程學系研究所 === 107 === Erasable patterns mining in the product database is a popular topic in data mining nowadays. An erasable pattern means the itemsets with profits lower than the threshold. Mining erasable patterns can help managers of retail stores or factories to reduce the co...
Main Authors: | Kuan-Chieh Lin, 林冠傑 |
---|---|
Other Authors: | Ye-In Chang |
Format: | Others |
Language: | en_US |
Published: |
2019
|
Online Access: | http://ndltd.ncl.edu.tw/handle/4um36z |
Similar Items
Similar Items
-
The Study of Incremental Erasable-Itemset Mining
by: LIN, KUN-YI, et al.
Published: (2016) -
The Study of Incremental Quasi-erasable Itemset Mining
by: CHEN, LU-HUNG, et al.
Published: (2017) -
ICQ-Tree: An Inverted Code Quadtree for the Top-K Spatial Keyword Query over the Incremental Database
by: I-Hsiang Su Wang, et al.
Published: (2018) -
An InvP-List Algorithm with the Local Estimated Factor for Mining Weighted Erasable Itemsets over the Incremental Database
by: Siang-Jia Du, et al.
Published: (2018) -
An Efficient Algorithm for Incremental Mining of Frequent Patterns
by: Yu-Chieh Lien, et al.
Published: (2008)