Sciweavers

1105 search results - page 89 / 221
» Approximate Spectral Clustering.
Sort
View
127
Voted
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
15 years 2 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
AAAI
2000
15 years 2 months ago
Multivariate Clustering by Dynamics
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen
FGCN
2008
IEEE
240views Communications» more  FGCN 2008»
15 years 7 months ago
Data Compression Algorithm Based on Hierarchical Cluster Model for Sensor Networks
A new distributed algorithm of data ccompression based on hierarchical cluster model for sensor networks is proposed, the basic ideas of which are as follows, firstly the whole se...
Tongsen Wang, Lei Wang, Zhijun Xie, Ronghua Yang
ICDM
2009
IEEE
175views Data Mining» more  ICDM 2009»
14 years 10 months ago
Maximum Margin Clustering with Multivariate Loss Function
This paper presents a simple but powerful extension of the maximum margin clustering (MMC) algorithm that optimizes multivariate performance measure specifically defined for clust...
Bin Zhao, James Tin-Yau Kwok, Changshui Zhang
86
Voted
UAI
2008
15 years 2 months ago
Learning and Solving Many-Player Games through a Cluster-Based Representation
In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. ...
Sevan G. Ficici, David C. Parkes, Avi Pfeffer