131 search results - page 20 / 27 » Efficient Mining of Indirect Associations Using HI-Mine |
KDD
2002
ACM
14 years 7 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 ...
ACSC
2008
IEEE
13 years 9 months ago
2008
IEEE
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such a...
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
KDD
1995
ACM
13 years 11 months ago
1995
ACM
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
JMLR
2008
13 years 7 months ago
2008
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...