Demo Data from EDBT 2026 / reviewers in the wild / expert
Mark Inlow
dblp:96/10169
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2016
0000-0002-0388-1048ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3Graphics, computer vision, multimedia, augmented reality and games · 2
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
canonical correlation analysis |
0.2 | 1 | 2016 | Structured sparse canonical correlation analysis for brain imaging genetics: an improved GraphNet method · Bioinform. 2016 |
Bioinformatics and computational biology
imaging genetics |
0.2 | 1 | 2016 | Structured sparse canonical correlation analysis for brain imaging genetics: an improved GraphNet method · Bioinform. 2016 |
Methods — techniques the papers use, named apart from their topics
group lasso · 0.5graph-guided fused lasso · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Structured sparse canonical correlation analysis for brain imaging genetics: an improved GraphNet methodabstractMOTIVATION: Structured sparse canonical correlation analysis (SCCA) models have been used to identify imaging genetic associations. These models either use group lasso or graph-guided fused lasso to conduct feature selection and feature grouping simultaneously. The group lasso based methods require prior knowledge to define the groups, which limits the capability when prior knowledge is incomplete or unavailable. The graph-guided methods overcome this drawback by using the sample correlation to define the constraint. However, they are sensitive to the sign of the sample correlation, which could introduce undesirable bias if the sign is wrongly estimated. RESULTS: We introduce a novel SCCA model with a new penalty, and develop an efficient optimization algorithm. Our method has a strong upper bound for the grouping effect for both positively and negatively correlated features. We show that our method performs better than or equally to three competing SCCA models on both synthetic and real data. In particular, our method identifies stronger canonical correlations and better canonical loading patterns, showing its promise for revealing interesting imaging genetic associations. AVAILABILITY AND IMPLEMENTATION: The Matlab code and sample data are freely available at http://www.iu.edu/∼shenlab/tools/angscca/ CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Lei Du 0001, Heng Huang 0001, Sungeun Kim, Shannon L. Risacher, Mark Inlow, Jason H. Moore, Andrew J. Saykin, Li Shen 0001 |
Bioinform. | 6 |
| 2014 | A Novel Structure-Aware Sparse Learning Algorithm for Brain Imaging Genetics
Lei Du 0001, Sungeun Kim, Shannon L. Risacher, Heng Huang 0001, Mark Inlow, Jason H. Moore, Andrew J. Saykin, Li Shen 0001 |
MICCAI (3) | 6 |
| 2011 | Hippocampal Surface Mapping of Genetic Risk Factors in AD via Sparse Learning Models
Sungeun Kim, Mark Inlow, Kwangsik Nho, Shanker Swaminathan, Shannon L. Risacher, Shiaofen Fang, Michael Weiner 0001, Mirza Faisal Beg, Lei Wang 0032, Andrew J. Saykin, Li Shen 0001 |
MICCAI (2) | 3 |