Exploiting sparse dependence structure in model based classification

Advances in Intelligent and Soft Computing

Volumn 77, Issue , 2010, Pages 509-517

  Pavlenko, Tatjana ^a   Björkström, Anders ^a  

^a STOCKHOLM UNIVERSITY   (Sweden)

Author keywords

Classification; High dimensionality; Lasso; Sparsity; Variable selection

Indexed keywords

SOFT COMPUTING;

DEPENDENCE STRUCTURES; HIGH DIMENSIONALITY; IMPROVE PERFORMANCE; LASSO; MODEL-BASED CLASSIFICATIONS; MODEL-BASED CLASSIFIERS; SPARSITY; VARIABLE SELECTION;

CLASSIFICATION (OF INFORMATION);

EID: 80053036709     PISSN: 18675662     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-14746-3_63     Document Type: Conference Paper

References (6)

1. Bai, Y., Wart, R. C.: Parallel block tridiagonalization of real symmetric matrices. J. Parallel Distrib. Comput. 68(5), 703-715 (2008)
2. Baumgartner, R., Somorjai, R. L.: Data complexity assessment in undersampled classification of high-dimensional biomedical data. Pattern Recogn. Lett. 27(12), 1383-1389 (2006)
3. Friedman, J., Hastie, T., Tibshirani, R.: Regularization Paths for Generalized Linear Models via Coordinate Descent. J. Stat. Software 33, 1-22 (2010)
4. Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd edn. Springer, New York (2009)
5. Marshall, A. W., Olkin, I.: Matrix versions of the Cauchy and Kantorovich inequalities. Aequationes Math. 40(1), 89-93 (1990)
6. Pavlenko, T., von Rosen, D.: On the optimal weighting of high-dimensional Bayesian networks. Adv. Appl. Stat. 4(3), 357-377 (2004)