573 search results - page 61 / 115 » Mining Frequent Itemsets from Uncertain Data |
KDD
1999
ACM
14 years 1 days ago
1999
ACM
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
FIMI
2003
13 years 9 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...
JDWM
2010
13 years 6 months ago
2010
The Web is a continuously evolving environment, since its content is updated on a regular basis. As a result, the traditional usagebased approach to generate recommendations that ...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises t...
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 ...