87 search results - page 13 / 18 » Mining Frequent Generalized Itemsets and Generalized Associa... |
SAC
2005
ACM
14 years 1 months ago
2005
ACM
In this paper, we describe a new approach for mining concept associations from large text collections. The concepts are short sequences of words that occur frequently together acr...
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
AAI
2007
13 years 7 months ago
2007
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
KDD
2002
ACM
14 years 8 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 ...