Sciweavers

1861 search results - page 274 / 373
» 1.6-Bit Pattern Databases
Sort
View
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 1 months ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri
KDD
2010
ACM
218views Data Mining» more  KDD 2010»
15 years 1 months ago
Online multiscale dynamic topic models
We propose an online topic model for sequentially analyzing the time evolution of topics in document collections. Topics naturally evolve with multiple timescales. For example, so...
Tomoharu Iwata, Takeshi Yamada, Yasushi Sakurai, N...
GIS
2009
ACM
15 years 1 months ago
Dynamic network data exploration through semi-supervised functional embedding
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
Alexei Pozdnoukhov
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
15 years 1 months ago
Preserving Privacy through Data Generation
Many databases will not or can not be disclosed without strong guarantees that no sensitive information can be extracted. To address this concern several data perturbation techniq...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
CINQ
2004
Springer
116views Database» more  CINQ 2004»
15 years 1 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...