Sciweavers

25041 search results - page 57 / 5009
» Algorithms for Clustering Data
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
Noise Robust Spectral Clustering
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
Zhenguo Li, Jianzhuang Liu, Shifeng Chen, Xiaoou T...
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 9 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
CIKM
2006
Springer
13 years 11 months ago
Incremental hierarchical clustering of text documents
Incremental hierarchical text document clustering algorithms are important in organizing documents generated from streaming on-line sources, such as, Newswire and Blogs. However, ...
Nachiketa Sahoo, Jamie Callan, Ramayya Krishnan, G...
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 5 months ago
GAD: General Activity Detection for Fast Clustering on Large Data.
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
Jiawei Han, Liangliang Cao, Sangkyum Kim, Xin Jin,...
DATAMINE
2006
157views more  DATAMINE 2006»
13 years 8 months ago
Data Clustering with Partial Supervision
Clustering with partial supervision finds its application in situations where data is neither entirely nor accurately labeled. This paper discusses a semisupervised clustering algo...
Abdelhamid Bouchachia, Witold Pedrycz