EWCBR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Good similarity functions are at the heart of effective case-based reasoning. However, the similarity functions that have been designed so far have been mostly linear, we...
ER
2007
Springer
13 years 10 months ago
2007
Springer
Approximate data matching applications typically use similarity functions to quantify the degree of likeness between two data instances. There are several similarity functions ava...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
Given a bipartite graph of collaborative ratings, the task of recommendation and rating prediction can be modeled with graph kernels. We interpret these graph kernels as the inver...
PKDD
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present a method for applying machine learning algorithms to the automatic classification of astronomy star surveys using time series of star brightness. Currently su...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
CVPR
2008
IEEE
14 years 6 months ago
2008
IEEE
The required amount of labeled training data for object detection and classification is a major drawback of current methods. Combining labeled and unlabeled data via semisupervise...