138 search results - page 27 / 28 » Approximated Clustering of Distributed High-Dimensional Data |
NIPS
2004
13 years 6 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
DICTA
2003
13 years 6 months ago
2003
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
IROS
2006
IEEE
13 years 11 months ago
2006
IEEE
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...