Sciweavers

80 search results - page 9 / 16
» icdm 2005
Sort
View
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
14 years 3 months ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...
ICDM
2005
IEEE
137views Data Mining» more  ICDM 2005»
14 years 3 months ago
Leveraging Relational Autocorrelation with Latent Group Models
The presence of autocorrelation provides a strong motivation for using relational learning and inference techniques. Autocorrelation is a statistical dependence between the values...
Jennifer Neville, David Jensen
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 3 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
ICDM
2005
IEEE
125views Data Mining» more  ICDM 2005»
14 years 3 months ago
A Thorough Experimental Study of Datasets for Frequent Itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
Frédéric Flouvat, Fabien De Marchi, ...
ICDM
2005
IEEE
166views Data Mining» more  ICDM 2005»
14 years 3 months ago
Sequential Pattern Mining in Multiple Streams
In this paper, we deal with mining sequential patterns in multiple data streams. Building on a state-of-the-art sequential pattern mining algorithm PrefixSpan for mining transact...
Gong Chen, Xindong Wu, Xingquan Zhu