Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

SDM
2004
SIAM

favoriteEmaildiscussreport

271views Data Mining» more SDM 2004»

A Foundational Approach to Mining Itemset Utilities from Databases

13 years 5 months ago

A Foundational Approach to Mining Itemset Utilities from Databases

Download siam.org

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 high utility itemsets based on information in the transaction database and external information about utilities. Our theoretical analysis of the resulting problem lays the foundation for future utility mining algorithms.

Hong Yao, Howard J. Hamilton, Cory J. Butz

Real-time Traffic

Data Mining | Most Approaches | SDM 2004 | Utilities | Utility Mining Algorithms |

claim paper

Related Content

» An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream

» A BottomUp Projection Based Algorithm for Mining High Utility Itemsets

» Probabilistic frequent itemset mining in uncertain databases

» Mining interesting sets and rules in relational databases

» Generating nonredundant association rules

» Algorithms for Discovery of Frequent Superset Rather than Frequent Subset

» Cartesian contour a concise representation for a collection of frequent sets

» Mining Frequent Itemsets from Secondary Memory

» A TwoPhase Algorithm for Fast Discovery of High Utility Itemsets

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	SDM
Authors	Hong Yao, Howard J. Hamilton, Cory J. Butz

Comments (0)