Sciweavers

59 search results - page 1 / 12
» Mining for Mutually Exclusive Items in Transaction Databases
Sort
View
JDWM
2007
90views more  JDWM 2007»
13 years 4 months ago
Mining for Mutually Exclusive Items in Transaction Databases
Association rule mining is a popular task that involves the discovery of co-occurences of items in transaction databases. Several extensions of the traditional association rule mi...
George Tzanis, Christos Berberidis
SIGMOD
1993
ACM
134views Database» more  SIGMOD 1993»
13 years 8 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
DAWAK
2009
Springer
13 years 8 months ago
TidFP: Mining Frequent Patterns in Different Databases with Transaction ID
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...
C. I. Ezeife, Dan Zhang
ICDM
2008
IEEE
156views Data Mining» more  ICDM 2008»
13 years 11 months ago
Mining Allocating Patterns in One-Sum Weighted Items
An Association Rule (AR) is a common knowledge model in data mining that describes an implicative cooccurring relationship between two disjoint sets of binary-valued transaction d...
Yanbo J. Wang, Xinwei Zheng, Frans Coenen, Cindy Y...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 8 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...