504 search results - page 47 / 101 » PCS: An Efficient Clustering Method for High-Dimensional Dat... |
114
click to vote
PAISI
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
FLAIRS
2004
15 years 1 months ago
2004
Effective personalization is greatly demanded in highly heterogeneous and diverse e-commerce domain. In our approach we rely on the idea that an effective personalization techniqu...
112
click to vote
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
102
click to vote
CCGRID
2006
IEEE
15 years 5 months ago
2006
IEEE
There is a growing need for systems that can monitor and analyze application performance data automatically in order to deliver reliable and sustained performance to applications....
102
click to vote
CORR
1998
Springer
14 years 11 months ago
1998
Springer
We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word classes to improve the accuracy of syntactic disa...