Sciweavers

1227 search results - page 31 / 246
» Approximate Kernel Clustering
Sort
View
ICML
2004
IEEE
15 years 10 months ago
K-means clustering via principal component analysis
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
Chris H. Q. Ding, Xiaofeng He
ISAAC
2005
Springer
122views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Fast k-Means Algorithms with Constant Approximation
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
CATS
2006
14 years 11 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
QEST
2005
IEEE
15 years 3 months ago
An approximation algorithm for labelled Markov processes: towards realistic approximation
Abstract— Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not be...
Alexandre Bouchard-Côté, Norm Ferns, ...
ICDM
2006
IEEE
139views Data Mining» more  ICDM 2006»
15 years 3 months ago
Unsupervised Clustering In Streaming Data
Tools for automatically clustering streaming data are becoming increasingly important as data acquisition technology continues to advance. In this paper we present an extension of...
Dimitris K. Tasoulis, Niall M. Adams, David J. Han...