Multi-task feature selection on multiple networks via maximum flows

SIAM International Conference on Data Mining 2014, SDM 2014

Volumn 1, Issue , 2014, Pages 199-207

  Sugiyama, Mahito ^a   Azencott, Chloé Agathe ^a   Grimm, Dominik ^a,b   Kawahara, Yoshinobu ^c   Borgwardt, Karsten M ^a,b  

^a Machine Learning and Computational Biology Research Group   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

^c OSAKA UNIVERSITY   (Japan)

Author keywords

Feature selection; Multi locus association mapping; Multi task learning; Network regularizer

Indexed keywords

FEATURE EXTRACTION; GENES; MAPPING; MULTIVARIANT ANALYSIS; PLANTS (BOTANY); SPACE DIVISION MULTIPLE ACCESS;

ARABIDOPSIS THALIANA; ASSOCIATION MAPPING; MAXIMUM-FLOW ALGORITHM; MULTITASK LEARNING; MULTIVARIATE DATA ANALYSIS; REGULARIZER; STATE-OF-THE-ART METHODS; STRUCTURAL INFORMATION;

DATA MINING;

EID: 84945543585     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973440.23     Document Type: Conference Paper

References (34)

1. Atwell, S., et al: Genome-wide association study of 107 phenotypes in Arabidopsis thaliana inbred lines. Nature 465(7298), 627-631 (2010)
2. Azencott, C. A., Grimm, D., Sugiyama, M., Kawahara, Y., Borgwardt, K. M.: Efficient network-guided multilocus association mapping with graph cuts. Bioinformatics 29(13), il71-il79 (2013)
3. Bach, F.: Structured sparsity-inducing norms through submodular functions. In: NIPS. pp. 118-126 (2010)
4. Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. TPAMI 26(9), 1124-1137 (2004)
5. Brachi, B., et al.: Linkage and association mapping of Arabidopsis thaliana flowering time in nature. PLoS Genetics 6(5), el000940 (2010)
6. Chen, X., et al.: A two-graph guided multi-task lasso approach for eQTL mapping. In: AISTATS. pp. 208-217 (2012)
7. Fei, H., Huan, J.: Structured feature selection and task relationship inference for multi-task learning. KAIS 35(2), 345-364 (2013)
8. Gallo, G., Grigoriadis, M. D., Tarjan, R. E.: A fast parametric maximum flow algorithm and applications. SICOMP 18(1), 30-55 (1989)
9. Gao, S., Tsang, I., Chia, L.: Laplacian sparse coding, hypergraph Laplacian sparse coding, and applications. TPAMI 35(1), 92-104 (2013)
10. Goldberg, A. V., Tarjan, R. E.: A new approach to the maximum-flow problem. JACM 35(4), 921-940 (1988)
11. Gretton, A., Bousquet, O., Smola, A., Scholkopf, B.: Measuring statistical dependence with Hilbert-Schmidt norms. In: ALT. pp. 63-77. Springer (2005)
12. Gu, Q., Han, J.: Towards feature selection in network. In: CIKM. pp. 1175-1184 (2011)
13. Hastie, T., Rosset, S., Tibshirani, R., Zhu, J.: The entire regularization path for the support vector machine. JMLR 5, 1391-1415 (2005)
14. Huang, J., Zhang, T., Metaxas, D.: Learning with structured sparsity. JMLR 12, 3371-3412 (2011)
15. Jacob, L., Obozinski, G., Vert, J. P.: Group lasso with overlap and graph lasso. In: ICML. pp. 433-440 (2009)
16. Kim, S., Sohn, K. A., Xing, E.: A multivariate regression approach to association analysis of a quantitative trait network. Bioinformatics 25(12), i204-i212 (2009)
17. Lee, S., Xing, E. P.: Leveraging input and output structures for joint mapping of epistatic and marginal eQTLs. Bioinformatics 28(12), il37-il46 (2012)
18. Li, C., Li, H.: Network-constrained regularization and variable selection for analysis of genomic data. Bioinformatics 24(9), 1175-1182 (2008)
19. Li, C., Li, H.: Variable selection and regression analysis for graph-structured covariates with an application to genomics. Ann Appl Stat 4(3), 1498-1516 (2010)
20. Mairal, J., Jenatton, R., Obozinski, G., Bach, F.: Convex and network flow optimization for structured sparsity. JMLR 12, 2681-2720 (2011)
21. Marchini, J., Donnelly, P., Cardon, L. R.: Genomewide strategies for detecting multiple loci that influence complex diseases. Nat Genet 37(4), 413-417 (2005)
22. Matthews, B. W.: Comparison of the predicted and observed secondary structure of T4 phage lysozyme. Biochimica et Biophysica Acta 405(2), 442-451 (1975)
23. Obozinski, G., Wainwright, M. J., Jordan, M. I.: Highdimensional union support recovery in multivariate regression. In: NIPS. pp. 1217-1224 (2008)
24. Price, A. L., Patterson, N. J., Plenge, R. M., Weinblatt, M. E., Shadick, N. A., Reich, D.: Principal components analysis corrects for stratification in genome-wide association studies. Nat Genet 38(8), 904-909 (2006)
25. Reshef, D. N., et al.: Detecting novel associations in large data sets. Science 334(6062), 1518-1524 (2011)
26. Saha, B., Pham, D. S., Phung, D., Venkatesh, S.: Sparse subspace clustering via group sparse coding. In: SDM. pp. 130-138 (2013)
27. Simon, N., Friedman, J., Hastie, T., Tibshirani, R.: A sparse-group lasso. J Comput Graph Stat 22(2), 231-245 (2013)
28. Tibshirani, R.: Regression shrinkage and selection via the lasso. J Roy Stat Soc B 58(1), 267-288 (1996)
29. Wu, M. C., Lee, S., Cai, T., Li, Y., Boehnke, M., Lin, X.: Rare-variant association testing for sequencing data with the sequence kernel association test. Am J Hum Genet 89(1), 82-93 (2011)
30. Yang, S., Yuan, L., Lai, Y. C., Shen, X., Wonka, P., Ye, J.: Feature grouping and selection over an undirected graph. In: KDD. pp. 922-930 (2012)
31. Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J Roy Stat Soc B 68, 49-67 (2006)
32. Zhang, Y., Yeung, D. Y., Xu, Q.: Probabilistic multitask feature selection. In: NIPS. pp. 2559-2567 (2010)
33. Zhou, Y., Jin, R., Hoi, S. C. H.: Exclusive lasso for multi-task feature selection. In: AISTATS. vol. 9, pp. 988-995 (2010)
34. Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J Roy Stat Soc B 67(2), 301-320 (2005)