Sciweavers

1651 search results - page 27 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ACCV
2010
Springer
13 years 2 months ago
One-Class Classification with Gaussian Processes
Detecting instances of unknown categories is an important task for a multitude of problems such as object recognition, event detection, and defect localization. This paper investig...
Michael Kemmler, Erik Rodner, Joachim Denzler
COLT
2007
Springer
13 years 11 months ago
Robust Reductions from Ranking to Classification
Abstract. We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classif...
Maria-Florina Balcan, Nikhil Bansal, Alina Beygelz...
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
13 years 11 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
TCS
2008
13 years 7 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
AAAI
2006
13 years 9 months ago
Corpus-based and Knowledge-based Measures of Text Semantic Similarity
This paper presents a method for measuring the semantic similarity of texts, using corpus-based and knowledge-based measures of similarity. Previous work on this problem has focus...
Rada Mihalcea, Courtney Corley, Carlo Strapparava