Sciweavers

137 search results - page 5 / 28
» Mining Association Rules between Sets of Items in Large Data...
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 2 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
74
Voted
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
15 years 1 months ago
An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases
Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...
Shiby Thomas, Sreenath Bodagala, Khaled Alsabti, S...
AUSDM
2007
Springer
164views Data Mining» more  AUSDM 2007»
15 years 3 months ago
SemGrAM - Integrating Semantic Graphs into Association Rule Mining
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
John F. Roddick, Peter Fule
SIGMOD
1997
ACM
148views Database» more  SIGMOD 1997»
15 years 1 months ago
Beyond Market Baskets: Generalizing Association Rules to Correlations
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confi...
Sergey Brin, Rajeev Motwani, Craig Silverstein
SIGMOD
1996
ACM
110views Database» more  SIGMOD 1996»
15 years 1 months ago
Mining Quantitative Association Rules in Large Relational Tables
We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be...
Ramakrishnan Srikant, Rakesh Agrawal