scholarly journals Some computational aspects of linear classification models

1970 ◽  
Author(s):  
Abel Geber Mexas
2004 ◽  
Vol 1 (1) ◽  
pp. 143-161
Author(s):  
Maja Pohar ◽  
Mateja Blas ◽  
Sandra Turk

Two of the most widely used statistical methods for analyzing categorical outcome variables are linear discriminant analysis and logistic regression. While both are appropriate for the development of linear classification models, linear discriminant analysis makes more assumptions about the underlying data. Hence, it is assumed that logistic regression is the more flexible and more robust method in case of violations of these assumptions. In this paper we consider the problem of choosing between the two methods, and set some guidelines for proper choice. The comparison between the methods is based on several measures of predictive accuracy. The performance of the methods is studied by simulations. We start with an example where all the assumptions of the linear discriminant analysis are satisfied and observe the impact of changes regarding the sample size, covariance matrix, Mahalanobis distance and direction of distance between group means. Next, we compare the robustness of the methods towards categorisation and non-normality of explanatory variables in a closely controlled way. We show that the results of LDA and LR are close whenever the normality assumptions are not too badly violated, and set some guidelines for recognizing these situations. We discuss the inappropriateness of LDA in all other cases.


2019 ◽  
Author(s):  
Nico Curti ◽  
Enrico Giampieri ◽  
Giuseppe Levi ◽  
Gastone Castellani ◽  
Daniel Remondini

The objective of many high-throughput “omics” studies is to obtain a relatively low-dimensional set of observables - signature - for sample classification purposes (diagnosis, prognosis, stratification). We propose DNetPRO, Discriminant Analysis with Network PROcessing, a supervised signature identification method based on a bottom-up combinatorial approach that exploits the discriminant power of all variable pairs. The algorithm is easily scalable allowing efficient computing even for high number of observables (104 − 105). We show applications on real high-throughput genomic datasets in which our method outperforms existing results, or compares to them but with a smaller number of selected variables. Moreover the linearity of DNetPRO allows a clearer interpretation of the obtained signatures in comparison to non linear classification models


10.29007/hjt1 ◽  
2019 ◽  
Author(s):  
Pietro Galliani ◽  
Oliver Kutz ◽  
Daniele Porello ◽  
Guendalina Righetti ◽  
Nicolas Troquard

We study a family of operators (called ‘Tooth’ operators) that combine Description Logic concepts via weighted sums. These operators are intended to capture the notion of instances satisfy- ing “enough” of the concept descriptions given. We examine two variants of these operators: the “knowledge-independent” one, that evaluates the concepts with respect to the current interpretation, and the “knowledge-dependent” one that instead evaluates them with respect to a specified knowledge base, comparing and contrasting their properties. We furthermore discuss the connections between these operators and linear classification models.


2015 ◽  
Vol 10 (8) ◽  
pp. 829
Author(s):  
Aswin Wibisurya ◽  
Ford Lumban Gaol ◽  
Kuncoro Wastuwibowo

Sign in / Sign up

Export Citation Format

Share Document