17390 search results - page 338 / 3478 » Distributed Data Clustering |
131
click to vote
ICRA
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper describes the new localisation algorithms under implementation for the mail distributing mobile robot, MOPS, of the Institute of Robotics, Swiss Federal Institute of Te...
131
click to vote
ESANN
2006
15 years 5 months ago
2006
In this study, a method for hierarchical examination and visualization of GSM data using the Self-Organizing Map (SOM) is described. The data is examined in few phases. At first te...
133
click to vote
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
168
click to vote
SIGMOD
2000
ACM
15 years 8 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
169
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...