TITLE

Dendogram-based SVM for Multi-Class Classification

AUTHOR(S)
Benabdeslem, Khalid; Bennani, Younès
PUB. DATE
December 2006
SOURCE
Journal of Computing & Information Technology;Dec2006, Vol. 14 Issue 4, p283
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper presents a new approach called dendogram-based support vector machines (DSVM), to treat multi-class problems. First, the method consists to build a taxonomy of classes in an ascendant manner done by ascendant hierarchical clustering method (AHC). Second, SVM is injected at each internal node of the taxonomy in order to separate the two subsets of the current node. Finally, for classifying a pattern query, we present it to the "root" SVM, and then, according to the output, the pattern is presented to one of the two SVMs of the subsets, and so on through the "leaf" nodes. Therefore, the classification procedure is done in a descendant way in the taxonomy from the root through the end level which represents the classes. The pattern is thus associated to one of the last SVMs associated class. AHC decomposition uses distance measures to investigate the class grouping in binary form at each level in the hierarchy. SVM method requires little tuning and yields both high accuracy levels and good generalization for binary classification. Therefore, DSVM method gives good results for multi-class problems by both, training an optimal number of SVMs and by rapidly classifying patterns in a descendant way by selecting an optimal set of SVMs which participate to the final decision. The proposed method is compared to other multi-class SVM methods over several complex problems.
ACCESSION #
23639692

 

Related Articles

  • Relationships between Borda voting and Zermelo ranking. Anderson, Lowell Bruce; Dandurova, Helena; Falk, James E.; Yeganova, Lana // Social Choice & Welfare;Mar2009, Vol. 32 Issue 3, p355 

    There are many situations wherein a group of individuals (e.g., voters, experts, sports writers) must produce an ordered list of �best� alternatives selected from a given group of alternatives (e.g., candidates, proposals, sports teams). Two long established mechanisms that have been...

  • RELAXATION OF FREE-DISCONTINUITY ENERGIES WITH OBSTACLES. Focardi, Matteo; Stella Gelli, Maria // ESAIM: Control, Optimisation & Calculus of Variations;Oct2008, Vol. 14 Issue 4, p879 

    Given a Borel function ? defined on a bounded open set O with Lipschitz boundary and f ? L�(?O,Hn-1), we prove an explicit representation formula for the L� lower semicontinuous envelope of Mumford-Shah type functionals with the obstacle constraint u+ = ? Hn-1 a.e. on ? and the...

  • Classifying countable Boolean terms. Selivanov, V. L. // Algebra & Logic;Mar2005, Vol. 44 Issue 2, p95 

    We deal with the Borel and difference hierarchies in the space P? of all subsets of ? endowed with the Scott topology. (The spaces P? and2? coincide set-theoretically but differ topologically.) We look at the Wadge reducibility in P?. The results obtained are applied to the problem of...

  • ABSOLUTE BOREL CLASSES AND BOREL MEASURABLE MAPS. Holicky, P. // Real Analysis Exchange;June2003 Conference Reports, Vol. 29, p11 

    Presents information on absolute Borel classes and Borel measurable maps. Classical results of the descriptive set theory; Steps consisted in theorem 2; Main tool used to prove the theorem on Borel bimeasurable maps.

  • BOREL CLASSES OF SETS OF EXTREME AND EXPOSED POINTS IN Rn. Keleti, Tamas // Real Analysis Exchange;June2003 Conference Reports, Vol. 29, p17 

    Discusses the Borel classes of sets of extreme and exposed point in Rn.

  • Pattern-based feature selection in genomics and proteomics. Alexe, Gabriela; Alexe, Sorin; Hammer, Peter L.; Vizvari, Bela // Annals of Operations Research;Nov2006, Vol. 148 Issue 1, p189 

    A major difficulty in bioinformatics is due to the size of the datasets, which contain frequently large numbers of variables. In this study, we present a two-step procedure for feature selection. In a first “filtering” stage, a relatively small subset of features is identified on the...

  • Baire and automata. Simonnet, Pierre; Cagnard, Benoit // Discrete Mathematics & Theoretical Computer Science (DMTCS);Dec2007, Vol. 9 Issue 2, p255 

    In his thesis Baire defined functions of Baire class 1. A function f is of Baire class 1 if it is the pointwise limit of a sequence of continuous functions. Baire proves the following theorem. A function f is not of class 1 if and only if there exists a closed nonempty set F such that the...

  • HALF OF AN INSEPARABLE PAIR. Miller, Arnold W. // Real Analysis Exchange;June2004 Conference Report, p51 

    Discusses the half of an inseparable pair in relation to real analysis. Notations on the Borel classes; Theorems.

  • The?-borel conjecture. Miller, Arnold W. // Archive for Mathematical Logic;May2005, Vol. 44 Issue 4, p425 

    In this paper we prove that it is consistent that every?-set is countable while not every strong measure zero set is countable. We also show that it is consistent that every strong?-set is countable while not every?-set is countable. On the other hand we show that every strong measure zero set...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics