Sciweavers

2600 search results - page 9 / 520
» Clustering with or without the Approximation
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 4 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
BTW
2005
Springer
80views Database» more  BTW 2005»
14 years 1 months ago
Measuring the Quality of Approximated Clusterings
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
Hans-Peter Kriegel, Martin Pfeifle
ICDM
2010
IEEE
197views Data Mining» more  ICDM 2010»
13 years 5 months ago
D-LDA: A Topic Modeling Approach without Constraint Generation for Semi-defined Classification
: D-LDA: A Topic Modeling Approach without Constraint Generation for Semi-Defined Classification Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yuhong Xiong, Zhongzhi Shi HP Labo...
Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yu...
SODA
2000
ACM
125views Algorithms» more  SODA 2000»
13 years 9 months ago
Approximation algorithms for projective clustering
We consider the following two instances of the projective clustering problem: Given a set
Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
13 years 12 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....