354 search results - page 19 / 71 » Recovery Rate of Clustering Algorithms |
141
click to vote
ICMCS
2010
IEEE
15 years 1 months ago
2010
IEEE
In a multiview-imaging setting, image-acquisition costs could be substantially diminished if some of the cameras operate at a reduced quality. Compressed sensing is proposed to ef...
131
Voted
SDM
2004
SIAM
15 years 4 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
159
click to vote
SIGMOD
2001
ACM
16 years 3 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...
106
click to vote
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
Data warehouses and recording systems typically have a large continuous stream of incoming data, that must be stored in a manner suitable for future access. Access to stored recor...
144
Voted
WWW
2009
ACM
16 years 4 months ago
2009
ACM
Several attempts have been made to analyze customer behavior on online E-commerce sites. Some studies particularly emphasize the social networks of customers. Users' reviews ...