Sciweavers

922 search results - page 52 / 185
» A data mining approach to database compression
Sort
View
PAKDD
2009
ACM
103views Data Mining» more  PAKDD 2009»
15 years 4 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...
IEAAIE
2000
Springer
15 years 1 months ago
Dynamic Data Mining
Business information received from advanced data analysis and data mining is a critical success factor for companies wishing to maximize competitive advantage. The use of tradition...
Vijay V. Raghavan, Aladdin Hafez
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
15 years 10 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
ICDM
2005
IEEE
157views Data Mining» more  ICDM 2005»
15 years 3 months ago
Blocking Anonymity Threats Raised by Frequent Itemset Mining
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
15 years 10 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...