Binary linear classification and feature selection via generalized approximate message passing

2014 48th Annual Conference on Information Sciences and Systems, CISS 2014

Volumn , Issue , 2014, Pages

  Ziniel, Justin ^a   Schniter, Philip ^a   Sederberg, Per ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE;

ALGORITHMIC APPROACH; BINARY CLASSIFICATION; CLASSIFICATION ERROR RATE; CLASSIFIER DESIGN; COMPRESSIVE SENSING; EXPECTATION MAXIMIZATION; LINEAR CLASSIFICATION; MISCLASSIFICATION RATES;

ALGORITHMS;

EID: 84901445963     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2014.6814160     Document Type: Conference Paper

References (31)

1. C. M. Bishop, Pattern Recognition and Machine Learning. New York: Springer-Verlag, 2006.
2. G. Forman, "An extensive empirical study of feature selection metrics for text classification," J. Mach. Learn. Res., vol. 3, pp. 1289-1305, 2003.
3. J. V. Haxby, M. I. Gobbini, M. L. Furey, A. Ishai, J. L. Schouten, and P. Pietrini, "Distributed and overlapping representations of faces and objects in ventral temporal cortex," Science, vol. 293, pp. 2425-2430, Sept. 2001. (Pubitemid 32917318)
4. A. M. Chan, E. Halgren, K Marinkovic, and S. S. Cash, "Decoding word and category-specific spatiotamporaJ representations from MEG and EEG," Neurolmage, vol. 54, pp. 3028-3039, 2011.
5. S. Ryali, K Supekar, D. A. Abrams, and V. Menon, "Spase logistic regression for whole-brain classification of fMRI data," Neurolmage, vol. 51, pp. 752-764, 2010.
6. A. Gustafsson, A. Hermann, and F. Huber, Conjoint Measurement: Methods and Applications. Berlin: Springer-Verlag, 2007.
7. E. P. Xing, M. I. Jordan, and R. M. Karp, "Feature selection for highdimensional genomic microarray data," in Int'l Wkshp. Mach. Learn., pp. 601-608, 2001.
8. P. T. Boufounos and R. G. Baraniuk, "I-bit compressive sensing," in Proc. Conf. Inform. Science & Sys., (Princeton, NJ), Mar. 2008.
9. Y. P Lan and R. Vershynin, "Robust I-bit compressed sensing and sparse logistic regression: A convex programming approach," in arXiv: 1202.1212, Feb. 2012.
10. S. Rangan, "Generalized approximate message passing for estimation with random linear mixing," in Proc. IEEE Int'l Symp. Inform. Theory, (St. P etersburg, Russia), pp. 2168-2172, Aug. 2011. (Full version at arXiv:JOJO.5i4i).
11. F. R. Kschischang,B. J. Frey,a nd H. A. Loeliger," Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, pp. 498-519, Feb. 2001.
12. B. J. Frey and D. J. C. MacKay, "A revolution: Belief propagation in graphs with cycles," Adv. Neural Info. Process. Sys., pp. 479-485,1 998.
13. A. Javanmard and A. Montanari, "State evolution for general approximate message passing aJgorithms, with applications to spatiaJ coupling," arXiv:1211.5J64, Nov. 2012.
14. S. Rangan,P . Schniter,E . Riegler,A. K Fletcher,a nd V. Cevher," Fixed points of generaJized approximate message passing with arbitrary matrices," in Proc. IEEE Int'l Symp. Inform. Theory, (Istanbul), July 2013. (Full version at arXiv:130i.6295).
15. H.-A. Loeliger, "An introduction to factor graphs," IEEE Signal Process. Mag., vol. 21, pp. 28-41, Jan. 2004.
16. J. Ziniel, Message Passing Approaches to Compressive inference Under Structured Signal Priors. PhD thesis, The Ohio State University, 2014.
17. C. E. Rasmussen and C. K I. Williams, Gaussian Processes for Machine Learning. The MIT Press, 2006.
18. P. Schniter, "Turbo reconstruction of structured sparse signals," in Conf. on Information Sciences and Systems (CiSS), (Princeton, NJ), pp. 1-6, Mar. 2010.
19. J. P. Vila and P. Schniter, "Expectation-Maximization Gaussian-mixture approximate message passing," IEEE Trans. Signal Process., vol. 61, pp. 4658-4672, Oct. 2013.
20. D. L. Donoho, A. Maleki, and A. Montanari, "Message passing algorithms for compressed sensing," in Proceedings of the National Academy of Sciences, vol. 106, pp. 18914-18919, Nov. 2009.
21. H. Zou and T. Hastie, "Regularization and variable selection via the elastic net;' J. Roy. Statist. Soc., B, vol. 67, no. 2, pp. 301-320, 2005.
22. A. K Nigam, Kand McCallum, S. Thrun, and T. Mitchell, "Text classification from labeled and unlabeled documents using EM," Machine Learning, vol. 39, pp. 103-134, 2000. (Pubitemid 30594822)
23. J. Vila and P. Schniter, "An empiricaJ-Bayes approach to recovering linearly constrained non-negative sparse signaJs," in Proc. IEEE Workshop Compo Adv. Multi-Sensor Adaptive Process., (Saint Martin), Dec. 2013. (Full version at arXiv:13JO.2806).
24. A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. Roy. Statist. Soc., B, vol. 39, pp. 1-38, 1977.
25. U. S. Kamilov, S. Rangan, A. K. Fletcher, and M. Unser, "Approximate message passing with consistent parameter estimation and applications to sparse learning," in Proc. Neural Inform. Process. Syst. Conf., (Lake Tahoe, NV), Dec. 2012. (Full version at arXiv:1207.3859).
26. D. D. Lewis, Y. Yang, T. G. Rose, and F. Li, "RCVl: A new benchmark collection for text categorization research," J. Mach. Learn. Res., vol. 5, pp. 361-397, 2004.
27. G.-X. Yuan,K .-W. Chang,C .-J. Hsieh,a nd c.-J. Lin," A comparison of optimization methods and software for large-scaJe Ll-regularized linear classification," J. Mach. Learn. Res., vol. 11, pp. 3183-3234, 2010.
28. C. Lin, R. C. Weng, and S. S. Keerthi, "Trust region Newton methods for large-scaJe logistic regression," in Proc. 24th Int'l Conf. Mach. Learn., (Corvallis, OR), pp. 561-568, 2007.
29. C. J. Lin and J. I. More, "Newton's method for large-scaJe bound constrained problems," SIAM J. Optim., vol. 9, pp. 1100-1127, 1999.
30. S. R. Becker, E. J. Candes, and M. C. Grant, "Templates for convex cone problems with applications to sparse signaJ recovery," Math. Prog. Comp., vol. 3, no. 3, pp. 165-218,2011.
31. P. Schniter and S. Rangan, "Compressive phase retrievaJ via generalized approximate message passing," in Allerton Conf. Commun., Control, Comput., (Monticello, IL), Oct. 2012.