完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChu, Chun-Jungen_US
dc.contributor.authorTseng, Vincent S.en_US
dc.contributor.authorLiang, Tyneen_US
dc.date.accessioned2014-12-08T15:08:43Z-
dc.date.available2014-12-08T15:08:43Z-
dc.date.issued2009-09-15en_US
dc.identifier.issn0096-3003en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.amc.2009.05.066en_US
dc.identifier.urihttp://hdl.handle.net/11536/6676-
dc.description.abstractUtility itemsets typically consist of items with different values such as utilities, and the aim of utility mining is to identify the itemsets with highest utilities. In the past studies on utility mining, the values of utility itemsets were considered as positive. In some applications, however, an itemset may be associated with negative item values. Hence, discovery of high utility itemsets with negative item values is important for mining interesting patterns like association rules. In this paper, we propose a novel method, namely HUINIV (High Utility Itemsets with Negative Item Values)-Mine, for efficiently and effectively mining high utility itemsets from large databases with consideration of negative item values. To the best of our knowledge, this is the first work that considers the concept of negative item values in utility mining. The novel contribution of HUINIV-Mine is that it can effectively identify high utility itemsets by generating fewer high transaction-weighted utilization itemsets such that the execution time can be reduced substantially in mining the high utility itemsets. In this way, the process of discovering all high utility itemsets with consideration of negative item values can be accomplished effectively with less requirements on memory space and CPU I/O. This meets the critical requirements of temporal and spatial efficiency for mining high utility itemsets with negative item values. Through experimental evaluation, it is shown that HUINIV-Mine outperforms other methods substantially by generating much less candidate itemsets under different experimental conditions. (C) 2009 Elsevier Inc. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectUtility miningen_US
dc.subjectHigh utility itemsetsen_US
dc.subjectAssociation rulesen_US
dc.titleAn efficient algorithm for mining high utility itemsets with negative item values in large databasesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.amc.2009.05.066en_US
dc.identifier.journalAPPLIED MATHEMATICS AND COMPUTATIONen_US
dc.citation.volume215en_US
dc.citation.issue2en_US
dc.citation.spage767en_US
dc.citation.epage778en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000269198600036-
dc.citation.woscount4-
顯示於類別:期刊論文


文件中的檔案:

  1. 000269198600036.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。