4009 search results - page 288 / 802 » Clustering on Complex Graphs |
210
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
176
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
We use clustering to derive new relations which augment database schema used in automatic generation of predictive features in statistical relational learning. Clustering improves...
185
click to vote
WEBDB
2004
Springer
16 years 1 days ago
2004
Springer
Web site structures are complex to analyze. Cross-referencing the web structure with navigational behaviour adds to the complexity of the analysis. However, this convoluted analys...
155
click to vote
DCC
2009
IEEE
16 years 7 months ago
2009
IEEE
The RKLT is a lossless approximation to the KLT, and has been recently employed for progressive lossy-to-lossless coding of hyperspectral images. Both yield very good coding perfo...
153
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...