Sciweavers

1544 search results - page 8 / 309
» Data Mining and Database Systems: Where is the Intersection
Sort
View
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 11 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
JCS
2000
148views more  JCS 2000»
13 years 7 months ago
Using Sample Size to Limit Exposure to Data Mining
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "prob abilistic&...
Chris Clifton
PAKDD
2009
ACM
103views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Hot Item Detection in Uncertain Data
Abstract. An object o of a database D is called a hot item, if there is a sufficiently large population of other objects in D that are similar to o. In other words, hot items are ...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
SIGMOD
1998
ACM
199views Database» more  SIGMOD 1998»
13 years 11 months ago
MultiMediaMiner: A System Prototype for Multimedia Data Mining
Multimedia data mining is the mining of high-level multimedia information and knowledge from large multimedia databases. A multimedia data mining system prototype, MultiMediaMiner...
Osmar R. Zaïane, Jiawei Han, Ze-Nian Li, Sonn...
EDBT
2002
ACM
123views Database» more  EDBT 2002»
14 years 7 months ago
UMiner: A Data Mining System Handling Uncertainty and Quality
In this paper we present UMiner, a new data mining system, which improves the quality of the data analysis results, handles uncertainty in the clustering & classification proce...
Christos Amanatidis, Maria Halkidi, Michalis Vazir...