52 search results - page 4 / 11 » Clustering through ranking on manifolds |
113
click to vote
MM
2006
ACM
15 years 5 months ago
2006
ACM
In many image retrieval applications, the mapping between highlevel semantic concept and low-level features is obtained through a learning process. Traditional approaches often as...
142
click to vote
TKDE
2012
13 years 2 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
102
click to vote
KDD
2009
ACM
16 years 6 days ago
2009
ACM
In recent years, the number of patents filed by the business enterprises in the technology industry are growing rapidly, thus providing unprecedented opportunities for knowledge d...
ISMIS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
122
click to vote
ECCV
2008
Springer
16 years 1 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...