Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

HEC Montréal

$44,000.00

Latent factor decomposition for complex data structures

EF 2024-25

Résumé
In this proposal, we address the general problem of extracting meaningful information from very large matrix datasets that exhibit complex correlation structures, using latent factor decomposition - a modern matrix completion techniques originally rooted in recommender systems. By "meaningful information", we refer to interpretable latent features that can be used for inference, missing data imputation or prediction purposes. Our long term goal is to propose an ensemble of statistical and computational strategies for both prediction and inference. These strategies are designed for situations where i) external information is available on the rows/columns of the data matrix, and ii) the correlation within the rows and/or columns of the data matrix exhibits some spatial, temporal, network or other graphical structure. The motivation of this research program arises from several collaborations in the fields of genetics (methylation data), medical imaging (Raman microspectroscopy data) and transportation (GPS and censor traffic data). In transportation, the (n,t)th element of the data matrix corresponds to the observed traffic flow (e.g. number of cars) passing through a sensor n located on the road network during time period t. Correlation between the rows and columns of this matrix is induced by the spatial and temporal pattern of traffic flow. In genetic methylation data, the (n,t)th element of the data matrix represents the DNA methylation level of a sample n at CpG site (DNA location) t. Such data may exhibit correlation between samples (rows of the matrix) and /or some spatial correlation between nearby CpG sites (columns of the matrix). In all these cases, existing models need to be extended to model adequately the specific characteristics of the data, the correlation structure present in the rows/columns of the data, and to integrate external covariate information when available to estimate the latent factors. Modern matrix completion techniques, originally rooted in recommender systems, have evolved to become indispensable in diverse domains, establishing themselves as a cornerstone of contemporary data science. The research program we propose addresses multiple challenges associated with the modeling of the correlation structure that underpins observed data. It provides an ideal opportunity to harness the synergy of advanced statistical modeling techniques and machine learning algorithms, thereby significantly amplifying the predictive capabilities of these models. The research conducted within this program will make valuable contributions to both statistical and machine learning literature. Moreover, each of the proposed projects is driven by practical questions stemming from ongoing collaborations in the fields of transportation and genomics. It is anticipated that the outcomes of this research will yield significant benefits for both domains.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2024-04090
Name nom
Labbe, Aurelie
Department département
Sciences de la décision - Sciences de la décision
Organization id
65
Institution établissement
HEC Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2024
Award amount
44000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
3000
Research subject group en
Statistics and probability
Research subject group fr
Statistique et probabilité
Research subject en
Statistics and probability
Research subject fr
Statistique et probabilité
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Latent factor decomposition for complex data structures
Keywords
matrix factorization; bayesian statistics; spatial statistics; factor analysis; statistical genetics; random forests; statistical learning
Application summary
In this proposal, we address the general problem of extracting meaningful information from very large matrix datasets that exhibit complex correlation structures, using latent factor decomposition - a modern matrix completion techniques originally rooted in recommender systems. By "meaningful information", we refer to interpretable latent features that can be used for inference, missing data imputation or prediction purposes. Our long term goal is to propose an ensemble of statistical and computational strategies for both prediction and inference. These strategies are designed for situations where i) external information is available on the rows/columns of the data matrix, and ii) the correlation within the rows and/or columns of the data matrix exhibits some spatial, temporal, network or other graphical structure. The motivation of this research program arises from several collaborations in the fields of genetics (methylation data), medical imaging (Raman microspectroscopy data) and transportation (GPS and censor traffic data). In transportation, the (n,t)th element of the data matrix corresponds to the observed traffic flow (e.g. number of cars) passing through a sensor n located on the road network during time period t. Correlation between the rows and columns of this matrix is induced by the spatial and temporal pattern of traffic flow. In genetic methylation data, the (n,t)th element of the data matrix represents the DNA methylation level of a sample n at CpG site (DNA location) t. Such data may exhibit correlation between samples (rows of the matrix) and /or some spatial correlation between nearby CpG sites (columns of the matrix). In all these cases, existing models need to be extended to model adequately the specific characteristics of the data, the correlation structure present in the rows/columns of the data, and to integrate external covariate information when available to estimate the latent factors. Modern matrix completion techniques, originally rooted in recommender systems, have evolved to become indispensable in diverse domains, establishing themselves as a cornerstone of contemporary data science. The research program we propose addresses multiple challenges associated with the modeling of the correlation structure that underpins observed data. It provides an ideal opportunity to harness the synergy of advanced statistical modeling techniques and machine learning algorithms, thereby significantly amplifying the predictive capabilities of these models. The research conducted within this program will make valuable contributions to both statistical and machine learning literature. Moreover, each of the proposed projects is driven by practical questions stemming from ongoing collaborations in the fields of transportation and genomics. It is anticipated that the outcomes of this research will yield significant benefits for both domains.