Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$28,000.00

Kernels and ensembles for horizontal and vertical information selection

EF 2015-16

Résumé
Exemplified by the support vector machine and the AdaBoost algorithm, kernel methods and ensemble methods constituted much of the new research in statistical machine learning during the last decade. My proposed research will focus on the development of these two classes of methods for two very general data-analytic problems, which I call horizontal and vertical information selection. Suppose we are given a data matrix, where the rows are observations and the columns are variables. By ""vertical"" selection, I mean the selection of important rows. In applications, these rows can be ""bad guys"" (e.g., fraudulent financial transactions) or ""good guys"" (e.g., chemical molecules with potential to inhibit a certain virus). By ""horizontal"" selection, I mean the selection of important columns. In applications, these columns are the most important factors that affect the outcome of interest (e.g., biomarkers for detecting a certain disease, or genes associated with a certain cancer). Due to the very general nature of these selection problems, my proposed research is expected to have broad practical implications. For example, a general paradigm for constructing very efficient kernel machines for vertical selection can benefit a wide spectrum of applied research, ranging from fraud detection to drug discovery. I will be studying new ideas that I have proposed, such as ""deep kernel machines"" (DKMs) and ""variable-selection ensembles"" (VSEs), as well as establishing an Analytics and Informatics Laboratory (AI Lab; http://www.math.uwaterloo.ca/~ailab). Deeper understandings of DKMs and VSEs will further advance the field of statistical machine learning. The AI Lab will provide a platform for students to receive training and conduct research in machine learning and data mining by creating data-driven applications on the internet, such as recommendation systems. These systems are closely related to the theme of my proposal. They analyze data matrices whose columns are items and whose rows are users, and the objective is to recommend a few items to each user, or to collectively solve a horizontal selection problem for each fixed vertical dimension.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
250419-2011
Name nom
Zhu, Mu
Department département
Statistics and Actuarial Science
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2011
Award amount
28000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à 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
3004
Research subject group en
Statistics and probability
Research subject group fr
Statistique et probabilité
Research subject en
Applied statistics
Research subject fr
Statistique appliquée
Partie
5
Nb partie
5
Application title
Kernels and ensembles for horizontal and vertical information selection
Keyword
NSERC
Application summary
Exemplified by the support vector machine and the AdaBoost algorithm, kernel methods and ensemble methods constituted much of the new research in statistical machine learning during the last decade. My proposed research will focus on the development of these two classes of methods for two very general data-analytic problems, which I call horizontal and vertical information selection. Suppose we are given a data matrix, where the rows are observations and the columns are variables. By ""vertical"" selection, I mean the selection of important rows. In applications, these rows can be ""bad guys"" (e.g., fraudulent financial transactions) or ""good guys"" (e.g., chemical molecules with potential to inhibit a certain virus). By ""horizontal"" selection, I mean the selection of important columns. In applications, these columns are the most important factors that affect the outcome of interest (e.g., biomarkers for detecting a certain disease, or genes associated with a certain cancer). Due to the very general nature of these selection problems, my proposed research is expected to have broad practical implications. For example, a general paradigm for constructing very efficient kernel machines for vertical selection can benefit a wide spectrum of applied research, ranging from fraud detection to drug discovery. I will be studying new ideas that I have proposed, such as ""deep kernel machines"" (DKMs) and ""variable-selection ensembles"" (VSEs), as well as establishing an Analytics and Informatics Laboratory (AI Lab; http://www.math.uwaterloo.ca/~ailab). Deeper understandings of DKMs and VSEs will further advance the field of statistical machine learning. The AI Lab will provide a platform for students to receive training and conduct research in machine learning and data mining by creating data-driven applications on the internet, such as recommendation systems. These systems are closely related to the theme of my proposal. They analyze data matrices whose columns are items and whose rows are users, and the objective is to recommend a few items to each user, or to collectively solve a horizontal selection problem for each fixed vertical dimension.