Learning graphical model structure using L1-regularization paths

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1278-1283

  Schmidt, Mark ^a   Niculescu Mizil, Alexandru ^b   Murphy, Kevin ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATASETS; DECOMPOSABILITY; GRAPHICAL MODELS; REGULARIZATION;

ALGORITHMS; GRAPHIC METHODS; LEARNING SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS;

DATA STRUCTURES;

EID: 36348990694     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. D. Bertsekas. Nonlinear Programming: 2nd Edition. Athena Scientific, 2000.
2. O. Banerjee, L. El Ghaoui, A. d'Aspremont, and G. Natsoulis. Convex optimization techniques for fitting sparse gaussian graphical models. In Intl. Conf. on Machine Learning, 2006.
3. D. Chickering. Learning Bayesian networks is NP-Complete. In AI/Stats V, 1996.
4. B. Efron, I. Johnstone, T. Hastie, and R. Tibshirani. Least angle regression. Annals of Statistics, 32(2):407-499, 2004.
5. N. Friedman and D. Koller. Being Bayesian about Network Structure: A Bayesian Approach to Structure Discovery in Bayesian Networks. Machine Learning, 50:95-126, 2003.
6. N. Friedman, I. Nachman, and D. Peer. Learning Bayesian network structure from massive datasets: The "sparse candidate" algorithm. In UAI, 1999.
7. D. Heckerman, D. Chickering, C. Meek, R. Rounthwaite, and C. Kadie. Dependency networks for density estimation, collaborative filtering, and data visualization. J. of Machine Learning Research, 1:49-75, 2000.
8. D. Heckerman, D. Geiger, and M. Chickering. Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning, 1995.
9. S.-I. Lee, V. Ganapathi, and D. Koller. Efficient structure learning of Markov networks using L1-regularization. In NIPS, 2007.
10. S. Lee, H. Lee, P. Abbeel, and A. Ng. Efficient L1 Regularized Logistic Regression. In AAAI, 2006.
11. P. Larran̄aga and M. Poza. Structure Learning of Bayesian Networks by Genetic Algorithms: A Performance Analysis of Control Parameters. IEEE Trans. on Pattern Analysis and Machine Intelligence, 18(9):912-926, 1996.
12. Fan Li and Yiming Yang. Using modified lasso regression to learn large undirected graphs in a probabilistic framework. In AAAI, 2005.
13. N. Meinshausen and P. Buhlmann. High dimensional graphs and variable selection with the lasso. The Annals of Statistics, 34:1436-1462, 2006.
14. J. Pearl. Causality: Models, Reasoning and Inference. Cambridge Univ. Press, 2000.
15. M. Park and T. Hastie. L1 regularization path algorithm for generalized linear models. Technical report, Dept. Statistics, Stanford, 2006.
16. R. W. Robinson. Counting labeled acyclic digraphs. In F. Harary, editor, New Directions in the Theory of Graphs, pages 239-273. Academic Press, 1973.
17. I. Tsamardinos, L. Brown, and C. Aliferis. The maxmin hill-climbing bayesian network structure learning algorithm. Machine learning, 2006. To appear.
18. R. Tibshirani. Regression shrinkage and selection via the lasso. J. Royal. Statist. Soc B, 58(1):267-288, 1996.
19. M. Teyssier and D. Koller. Ordering-based search: A simple and effective algorithm for learning bayesian networks. In UAI, pages 584-590, 2005.
20. 1 -regularized pseudolikelihood. In NIPS, 2006.
21. M. Yuan and Y. Lin. Model Selection and Estimation in Regression with Grouped Variables. J. Royal. Statist. Soc B, 68(19):49-67, 2006.