199 search results - page 25 / 40 » Accuracy of distance metric learning algorithms |
75
Voted
IJCAI
1993
15 years 1 months ago
1993
Heuristics used by search algorithms are usually composed of more primitive functions which we call "features". A method for combining features is presented which is bas...
114
Voted
SIGCOMM
2006
ACM
15 years 6 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
113
click to vote
IJCAI
2007
15 years 1 months ago
2007
A key challenge in applying kernel-based methods for discriminative learning is to identify a suitable kernel given a problem domain. Many methods instead transform the input data...
101
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
112
click to vote
BMCBI
2004
15 years 10 days ago
2004
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...