59 search results - page 2 / 12 » Mining for Mutually Exclusive Items in Transaction Databases |
14
Voted
KDD
2002
ACM
14 years 5 months ago
2002
ACM
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 ...
ADC
2003
Springer
13 years 10 months ago
2003
Springer
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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
DKE
2008
13 years 5 months ago
2008
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...