Sciweavers

16 search results - page 3 / 4
» Finding Clusters in subspaces of very large, multi-dimension...
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Power Iteration Clustering
We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power ite...
Frank Lin, William W. Cohen
KDD
1999
ACM
166views Data Mining» more  KDD 1999»
13 years 11 months ago
CACTUS - Clustering Categorical Data Using Summaries
Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Rece...
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
14 years 7 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
KDD
2002
ACM
118views Data Mining» more  KDD 2002»
14 years 7 months ago
SECRET: a scalable linear regression tree algorithm
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
Alin Dobra, Johannes Gehrke
ISICA
2007
Springer
14 years 1 months ago
Instant Message Clustering Based on Extended Vector Space Model
Instant intercommunion techniques such as Instant Messaging (IM) are widely popularized. Aiming at such kind of large scale masscommunication media, clustering on its text conte...
Le Wang, Yan Jia, Weihong Han