Detalhes bibliográficos
| Resumo: | The idea of combining models in Discrete Discriminant Analysis (DDA) is present in a growing number of papers which aim to obtain more robust and more stable models than any of the competing ones. This seems to be a promising approach since it is known that different DDA models perform differently on different subjects (Brito et al.(2006)). In particular, this will be a more relevant issue if the groups are not well separated, which often occurs in practice. In the present work a new methodological approach is suggested which is based on DDA models' combination. The multiclass problem is decomposed into several dichotomous problems that are nested in a hierarchical binary tree (Sousa Ferreira (2000), Brito et al. (2006)) and at each level of the binary tree a new combining model is proposed to derive the decision rule. This combining model is based on two well known models in the literature - the First-order Independence Model (FOIM) and the Dependence Trees Model (DTM) (Celeux and Nakache (1994)). The MATLAB software is used for the algorithms' implementation and the proposed approach is illustrated in a DDA application. |
| Autores principais: | Marques, Anabela |
| Outros Autores: | Ferreira, Ana Sousa; Cardoso, Margarida |
| Assunto: | Combining model Discrete discriminant analysis First-order independence model Dependence trees model |
| Ano: | 2008 |
| País: | Portugal |
| Tipo de documento: | documento de conferência |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Instituto Politécnico de Setúbal |
| Idioma: | inglês |
| Origem: | Instituto Politécnico de Setúbal |