3245 search results - page 40 / 649 » Mining Transformed Data Sets |
FIMI
2003
14 years 11 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
106
click to vote
ADMA
2009
Springer
14 years 7 months ago
2009
Springer
Comparison and data analysis to the similarity measures and entropy for fuzzy sets are studied. The distance proportional value between the fuzzy set and the corresponding crisp se...
KDD
2002
ACM
15 years 10 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 ...
146
click to vote
RSFDGRC
2011
Springer
14 years 18 days ago
2011
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In interval comp...
SIGMOD
1993
ACM
15 years 1 months ago
1993
ACM
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...