Sciweavers

277 search results - page 6 / 56
» Using minimum description length for process mining
Sort
View
PKDD
2010
Springer
124views Data Mining» more  PKDD 2010»
13 years 7 months ago
Summarising Data by Clustering Items
Abstract. For a book, the title and abstract provide a good first impression of what to expect from it. For a database, getting a first impression is not so straightforward. Whil...
Michael Mampaey, Jilles Vreeken
ICDM
2005
IEEE
133views Data Mining» more  ICDM 2005»
14 years 2 months ago
Parameter-Free Spatial Data Mining Using MDL
Consider spatial data consisting of a set of binary features taking values over a collection of spatial extents (grid cells). We propose a method that simultaneously finds spatia...
Spiros Papadimitriou, Aristides Gionis, Panayiotis...
EACL
2006
ACL Anthology
13 years 10 months ago
Unsupervised Discovery of Persian Morphemes
This paper reports the present results of a research on unsupervised Persian morpheme discovery. In this paper we present a method for discovering the morphemes of Persian languag...
Mohsen Arabsorkhi, Mehrnoush Shamsfard
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
14 years 1 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
ICIP
2003
IEEE
14 years 2 months ago
A general framework for designing image processing algorithms for coherent polarimetric images
We describe a general framework to design optimal image processing algorithms for polarimetric images formed with coherent radiations, which can be optical or microwave. Starting ...
François Goudail, Frédéric Ga...