Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19127341

Reducing the number of sub-classifiers for pairwise multi-category support vector machines

Author
WANG YE1 ; SHANG-TENG, Huang1
[1] Department of Computer Science and Engineering, Shanghai JiaoTong University, China
Source

Pattern recognition letters. 2007, Vol 28, Num 15, pp 2088-2093, 6 p ; ref : 1/2 p

CODEN
PRLEDG
ISSN
0167-8655
Scientific domain
Computer science; Telecommunications
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Author keyword
Multi-category classification Pairwise SVM Uncertainty sampling
Keyword (fr)
Apprentissage Classification automatique Classification signal Echantillonnage Machine vecteur support Redondance
Keyword (en)
Learning Automatic classification Signal classification Sampling Support vector machine Redundancy
Keyword (es)
Aprendizaje Clasificación automática Muestreo Máquina vector soporte Redundancia
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04A Information, signal and communications theory / 001D04A04 Signal and communications theory / 001D04A04A Signal, noise / 001D04A04A1 Signal representation. Spectral analysis

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04A Information, signal and communications theory / 001D04A04 Signal and communications theory / 001D04A04C Sampling, quantization

Discipline
Telecommunications and information theory
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
19127341

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web