Sciweavers

277 search results - page 8 / 56
» Using minimum description length for process mining
Sort
View
CORR
2002
Springer
126views Education» more  CORR 2002»
13 years 8 months ago
Unsupervised Discovery of Morphemes
We present two methods for unsupervised segmentation of words into morphemelike units. The model utilized is especially suited for languages with a rich morphology, such as Finnis...
Mathias Creutz, Krista Lagus
ICPR
2008
IEEE
14 years 3 months ago
MDL region-based image registration
We propose a new image registration criterion that uses segmented versions of the images to exploit both the geometric and photometric characteristics of the distinct regions they...
Maria-João Rendas, Adrien Barral
MLDM
2007
Springer
14 years 3 months ago
Kernel MDL to Determine the Number of Clusters
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...
Ivan O. Kyrgyzov, Olexiy O. Kyrgyzov, Henri Ma&ici...
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 10 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
PKDD
2010
Springer
177views Data Mining» more  PKDD 2010»
13 years 7 months ago
ITCH: Information-Theoretic Cluster Hierarchies
Hierarchical clustering methods are widely used in various scientific domains such as molecular biology, medicine, economy, etc. Despite the maturity of the research field of hie...
Christian Böhm, Frank Fiedler, Annahita Oswal...