114 search results - page 1 / 23 » A New Framework for Dissimilarity and Similarity Learning |
PAKDD
2010
ACM
13 years 9 months ago
2010
ACM
MIR
2006
ACM
13 years 10 months ago
2006
ACM
In this paper, we introduce a new approach to learn dissimilarity for interactive search in content based image retrieval. In literature, dissimilarity is often learned via the fe...
AAAI
2007
13 years 7 months ago
2007
Recent studies have shown that graph-based approaches are effective for semi-supervised learning. The key idea behind many graph-based approaches is to enforce the consistency bet...
CPM
2001
Springer
13 years 9 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
WEBI
2005
Springer
13 years 10 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...