Sciweavers

10 search results - page 1 / 2
» Mining for Strong Negative Associations in a Large Database ...
Sort
View
ICDE
1998
IEEE
154views Database» more  ICDE 1998»
14 years 6 months ago
Mining for Strong Negative Associations in a Large Database of Customer Transactions
Ashok Savasere, Edward Omiecinski, Shamkant B. Nav...
SIGMOD
1993
ACM
134views Database» more  SIGMOD 1993»
13 years 9 months ago
Mining Association Rules between Sets of Items in Large Databases
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an e cient algorithm that generates all s...
Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami
ESWA
2006
139views more  ESWA 2006»
13 years 4 months ago
An efficient data mining approach for discovering interesting knowledge from customer transactions
Mining association rules and mining sequential patterns both are to discover customer purchasing behaviors from a transaction database, such that the quality of business decision ...
Show-Jane Yen, Yue-Shi Lee
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
13 years 9 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...
ICDM
2007
IEEE
155views Data Mining» more  ICDM 2007»
13 years 8 months ago
Transitional Patterns and Their Significant Milestones
Mining frequent patterns in transaction databases has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithms do not con...
Qian Wan, Aijun An