Sciweavers

110 search results - page 1 / 22
» A Foundational Approach to Mining Itemset Utilities from Dat...
Sort
View
SDM
2004
SIAM
271views Data Mining» more  SDM 2004»
13 years 5 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
IEAAIE
2009
Springer
13 years 10 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...
AUSDM
2007
Springer
131views Data Mining» more  AUSDM 2007»
13 years 9 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
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
14 years 4 months ago
Probabilistic frequent itemset mining in uncertain databases
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
Andreas Züfle, Florian Verhein, Hans-Peter Kr...
SAC
2010
ACM
13 years 9 months ago
Mining interesting sets and rules in relational databases
In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain i...
Bart Goethals, Wim Le Page, Michael Mampaey