449 search results - page 36 / 90 » Measuring the Similarity of Geometric Graphs |
162
click to vote
AAAI
2008
15 years 7 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
173
click to vote
TALG
2010
15 years 6 days ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
141
click to vote
PAKDD
2009
ACM
16 years 7 days ago
2009
ACM
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
154
click to vote
ESWS
2006
Springer
15 years 9 months ago
2006
Springer
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...
204
click to vote
EMNLP
2006
15 years 6 months ago
2006
Word clustering is important for automatic thesaurus construction, text classification, and word sense disambiguation. Recently, several studies have reported using the web as a c...