TU Darmstadt / ULB / TUbiblio

Margin Driven Separate and Conquer by Working Set Expansion

Weizsäcker, Lorenz and Fürnkranz, Johannes (2009):
Margin Driven Separate and Conquer by Working Set Expansion.
[Online-Edition: http://www.ke.informatik.tu-darmstadt.de/publications/report...],
[Report]

Abstract

Covering algorithms for binary classification build a list of one-sided partial models in a greedy manner. The original motivation therefor stems from the context of rule learning where the expressiveness of a single rule is too limited to serve as standalone model. If the model space is richer, the decomposition into subproblems is not strictly necessary but separately solved subproblems might still lead to better models specially when the subproblems are less demanding in terms of the input model. We investigate in this direction with an AQR style covering algorithm that uses an SVM base learner for discovering the subproblems along with a corresponding output model. The experimental study covers different criteria for the selection of the subproblems and as well as several vector kernels of varying model capacity.

Item Type: Report
Erschienen: 2009
Creators: Weizsäcker, Lorenz and Fürnkranz, Johannes
Title: Margin Driven Separate and Conquer by Working Set Expansion
Language: English
Abstract:

Covering algorithms for binary classification build a list of one-sided partial models in a greedy manner. The original motivation therefor stems from the context of rule learning where the expressiveness of a single rule is too limited to serve as standalone model. If the model space is richer, the decomposition into subproblems is not strictly necessary but separately solved subproblems might still lead to better models specially when the subproblems are less demanding in terms of the input model. We investigate in this direction with an AQR style covering algorithm that uses an SVM base learner for discovering the subproblems along with a corresponding output model. The experimental study covers different criteria for the selection of the subproblems and as well as several vector kernels of varying model capacity.

Divisions: 20 Department of Computer Science > Knowl­edge En­gi­neer­ing
20 Department of Computer Science
Date Deposited: 24 Jun 2011 14:42
Official URL: http://www.ke.informatik.tu-darmstadt.de/publications/report...
Identification Number: TUD-KE-2009-06
Export:

Optionen (nur für Redakteure)

View Item View Item