DocumentCode
453876
Title
Extending the Margin Algorithm
Author
Vance, D.
Author_Institution
ECECS Dept., Cincinnati Univ., OH
Volume
1
fYear
2005
fDate
28-30 Nov. 2005
Firstpage
389
Lastpage
395
Abstract
The design of a classifier usually has the important step of attribute selection. A computationally tractable scheme almost always relies on a subset of attributes that optimize a certain criterion is chosen. The result is usually a good sub-optimal solution. Previously we showed how an all attributes approach can be used efficiently by the classifier to classify a given data point in a binary dataset. The resulting classifier is transparent, and the approach compares favorably with previous approaches in both accuracy and efficiency. This paper extends that work to multi-class data sets and the order of attribute use in the classification process
Keywords
computational complexity; learning (artificial intelligence); optimisation; pattern classification; attribute selection; binary dataset; classification process; computationally tractable scheme; margin algorithm; multiclass data sets; Automation; Business; Computational intelligence; Computational modeling; Decision trees; Intelligent agent; Internet; Training data;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence for Modelling, Control and Automation, 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, International Conference on
Conference_Location
Vienna
Print_ISBN
0-7695-2504-0
Type
conf
DOI
10.1109/CIMCA.2005.1631297
Filename
1631297
Link To Document