Sciweavers

277 search results - page 15 / 56
» Using minimum description length for process mining
Sort
View
ITSL
2008
13 years 11 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
ICCV
2011
IEEE
12 years 10 months ago
Recursive MDL via Graph Cuts: Application to Segmentation
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
Lena Gorelick, Andrew Delong, Olga Veksler, Yuri B...
ICASSP
2011
IEEE
13 years 1 months ago
Performance analysis of MDL criterion for the detection of noncircular or/and nonGaussian components
This paper presents an asymptotic analysis of the eigen value decomposition (EVD) of the sample covariance matrix associated with independent identically distributed (IID) non nec...
Jean Pierre Delmas, Yann Meurisse
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
14 years 10 months ago
Using retrieval measures to assess similarity in mining dynamic web clickstreams
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
Olfa Nasraoui, Cesar Cardona, Carlos Rojas
PAKDD
2010
ACM
158views Data Mining» more  PAKDD 2010»
14 years 2 months ago
Integrative Parameter-Free Clustering of Data with Mixed Type Attributes
Abstract. Integrative mining of heterogeneous data is one of the major challenges for data mining in the next decade. We address the problem of integrative clustering of data with ...
Christian Böhm, Sebastian Goebl, Annahita Osw...