847 search results - page 44 / 170 » Approximation algorithms for projective clustering |
109
click to vote
AUSAI
2010
Springer
14 years 10 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
104
Voted
TNN
1998
15 years 7 days ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
ICANN
2009
Springer
15 years 5 months ago
2009
Springer
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
234
Voted
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
99
Voted
CGF
1999
15 years 8 days ago
1999
The calculation of radiant energy balance in complex scenes has been made possible by hierarchical radiosity methods based on clustering mechanisms. Although clustering offers an ...