Sciweavers

499 search results - page 56 / 100
» PRICES: An Efficient Algorithm for Mining Association Rules
Sort
View
PAKDD
2007
ACM
121views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Two-Phase Algorithms for a Novel Utility-Frequent Mining Model
When companies seek for the combination of products which can constantly generate high profit, the association rule mining (ARM) or the utility mining will not achieve such task. ...
Jieh-Shan Yeh, Yu-Chiang Li, Chin-Chen Chang
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
CORR
2004
Springer
146views Education» more  CORR 2004»
13 years 7 months ago
Mining Frequent Itemsets from Secondary Memory
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
Gösta Grahne, Jianfei Zhu
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
EUSFLAT
2007
103views Fuzzy Logic» more  EUSFLAT 2007»
13 years 9 months ago
Measuring Variation Strength in Gradual Dependencies
In this paper we extend a previous definition of gradual dependence as a special kind of (crisp) association rule, in order to measure not only the existence of a tendency, but i...
Carlos Molina, José-María Serrano, D...