Utilize este identificador para referenciar este registo: http://hdl.handle.net/10071/12288
Autoria: Marques, A.
Ferreira, A. S.
Cardoso, M. G. M. S.
Data: 2016
Título próprio: Combining models in discrete discriminant analysis
Volume: 8
Número: 2
Paginação: 143 - 160
ISSN: 1755-8050
DOI (Digital Object Identifier): 10.1504/IJDATS.2016.077483
Palavras-chave: Combining models
DDA
Dependence trees model
Discrete discriminant analysis
DTM
First-order independence model
FOIM
Hierarchical coupling model
HIERM
Random forest
RF
Resumo: When conducting discrete discriminant analysis, alternative models provide different levels of predictive accuracy which has encouraged the research in combined models. This research seems to be specially promising when small or moderate sized samples are considered, which often occurs in practice. In this work we evaluate the performance of a linear combination of two discrete discriminant analysis models: the first-order independence model and the dependence trees model. The proposed methodology also uses a hierarchical coupling model when addressing multi-class classification problems, decomposing the multi-class problems into several bi-class problems, using a binary tree structure. The analysis is based both on simulated and real datasets. Results of the proposed approach are compared with those obtained by random forests, being generally more accurate. Measures of precision regarding a training set, a test set and cross-validation are presented. The R software is used for the algorithms' implementation.
Arbitragem científica: yes
Acesso: Acesso Aberto
Aparece nas coleções:BRU-RI - Artigos em revistas científicas internacionais com arbitragem científica

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
Publicação_IJDAT_2016_VersãoInicial.pdfPré-print271,87 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.