Sciweavers

1810 search results - page 4 / 362
» Similarity estimation techniques from rounding algorithms
Sort
View
DAM
2008
111views more  DAM 2008»
13 years 5 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule
JMLR
2002
144views more  JMLR 2002»
13 years 5 months ago
Round Robin Classification
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
Johannes Fürnkranz
ICDAR
2009
IEEE
13 years 3 months ago
Bayesian Similarity Model Estimation for Approximate Recognized Text Search
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
Atsuhiro Takasu
ICML
2001
IEEE
14 years 6 months ago
Round Robin Rule Learning
In this paper, we discuss a technique for handling multi-class problems with binary classifiers, namely to learn one classifier for each pair of classes. Although this idea is kno...
Johannes Fürnkranz
BMCBI
2006
119views more  BMCBI 2006»
13 years 5 months ago
LS-NMF: A modified non-negative matrix factorization algorithm utilizing uncertainty estimates
Background: Non-negative matrix factorisation (NMF), a machine learning algorithm, has been applied to the analysis of microarray data. A key feature of NMF is the ability to iden...
Guoli Wang, Andrew V. Kossenkov, Michael F. Ochs