Sciweavers

352 search results - page 3 / 71
» Non-derivable itemset mining
Sort
View
IEAAIE
2009
Springer
14 years 2 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
ADMA
2006
Springer
137views Data Mining» more  ADMA 2006»
13 years 11 months ago
SA-IFIM: Incrementally Mining Frequent Itemsets in Update Distorted Databases
Abstract. The issue of maintaining privacy in frequent itemset mining has attracted considerable attentions. In most of those works, only distorted data are available which may bri...
Jinlong Wang, Congfu Xu, Hongwei Dan, Yunhe Pan
AUSDM
2007
Springer
131views Data Mining» more  AUSDM 2007»
14 years 1 months ago
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
Alva Erwin, Raj P. Gopalan, N. R. Achuthan
SDM
2004
SIAM
271views Data Mining» more  SDM 2004»
13 years 8 months ago
A Foundational Approach to Mining Itemset Utilities from Databases
Most approaches to mining association rules implicitly consider the utilities of the itemsets to be equal. We assume that the utilities of itemsets may differ, and identify the hi...
Hong Yao, Howard J. Hamilton, Cory J. Butz
PAKDD
2004
ACM
164views Data Mining» more  PAKDD 2004»
14 years 25 days ago
FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
Francesco Bonchi, Bart Goethals