Sciweavers

13383 search results - page 328 / 2677
» Abstractions from proofs
Sort
View
COLT
2007
Springer
15 years 10 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...
CIE
2006
Springer
15 years 10 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
ECAI
2006
Springer
15 years 10 months ago
Learning by Automatic Option Discovery from Conditionally Terminating Sequences
Abstract. This paper proposes a novel approach to discover options in the form of conditionally terminating sequences, and shows how they can be integrated into reinforcement learn...
Sertan Girgin, Faruk Polat, Reda Alhajj
PKDD
2000
Springer
159views Data Mining» more  PKDD 2000»
15 years 10 months ago
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
ECAI
2008
Springer
15 years 8 months ago
Generating Diagnoses from Conflict Sets with Continuous Attributes
Abstract. Many techniques in model-based diagnosis and other research fields find the hitting sets of a group of sets. Existing techniques apply to sets of finite elements only. Th...
Emmanuel Benazera, Louise Travé-Massuy&egra...