Sciweavers

581 search results - page 39 / 117
» Fast Hierarchical Clustering Based on Compressed Data
Sort
View
KDD
2007
ACM
124views Data Mining» more  KDD 2007»
15 years 11 months ago
Hierarchical mixture models: a probabilistic analysis
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...
Mark Sandler
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
16 years 6 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
ICIP
2001
IEEE
16 years 7 months ago
Minimum discrimination information clustering: modeling and quantization with Gauss mixtures
Gauss mixtures have gained popularity in statistics and statistical signal processing applications for a variety of reasons, including their ability to well approximatea large cla...
Robert M. Gray, John C. Young, Anuradha K. Aiyer
159
Voted
DOLAP
2003
ACM
15 years 10 months ago
Hierarchical dwarfs for the rollup cube
The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compress...
Yannis Sismanis, Antonios Deligiannakis, Yannis Ko...
COLING
2010
15 years 16 days ago
Multi-Sentence Compression: Finding Shortest Paths in Word Graphs
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
Katja Filippova