Sciweavers

165 search results - page 19 / 33
» Discovering Frequent Closed Itemsets for Association Rules
Sort
View
ASUNAM
2009
IEEE
14 years 2 months ago
Modeling a Store's Product Space as a Social Network
A market basket is a set of products that form a single retail transaction. This purchase data of products can shed important light on how product(s) might influence sales of oth...
Troy Raeder, Nitesh V. Chawla
DASFAA
2004
IEEE
125views Database» more  DASFAA 2004»
13 years 11 months ago
Reducing Communication Cost in a Privacy Preserving Distributed Association Rule Mining
Data mining is a process that analyzes voluminous digital data in order to discover hidden but useful patterns from digital data. However, discovery of such hidden patterns has sta...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 8 months ago
Weighted Association Rule Mining using weighted support and significance framework
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
Feng Tao, Fionn Murtagh, Mohsen Farid
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
14 years 1 months ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis