Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$18,000.00

Data analysis by learning manifolds from high-dimensional data

EF 2006-07

Résumé
Dimensionality reduction (manifold learning) addresses the problem of dealing with complex data by mapping high-dimensional data into fewer dimensions. Many problems of scientific interest that require the analysis of very large and high-dimensional data sets can benefit from dimensionality reduction techniques. Most existing dimensionality reduction techniques ignore information about the sequence of observations and actions between data points.  I recently co-developed a new dimensionality reduction technique called Action Respecting Embedding (ARE) which exploits this additional information, successfully translating actions into meaningful and interpretable low-dimensional representations. In my proposed research, I intend to refine this new technique to make it faster and more efficient. This could lead to novel solutions to real-world sequential decision problems such as planning and localization for robots. Unlike existing techniques, an ARE approach would require no expert knowledge about the domain to find effective solutions. On the more theoretical side, I propose to explore and formalize non-linear dimensionality reduction techniques as probabilistic models. I will address the problem of how such models should be constructed, and how they should respond when data is missing. This has many potential uses in fields such as physics, economics, and medicine, where meaningful information must be extracted from large data sets.
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
327487-2006
Name nom
GhodsiBoushehri, Ali
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
2006
Competition year année de concours
2006
Award amount
18000
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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2805
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Learning and inference theories
Research subject fr
Théories de l'apprentissage et l'inférence
Partie
1
Nb partie
3
Application title
Data analysis by learning manifolds from high-dimensional data
Keyword
NA
Application summary
Dimensionality reduction (manifold learning) addresses the problem of dealing with complex data by mapping high-dimensional data into fewer dimensions. Many problems of scientific interest that require the analysis of very large and high-dimensional data sets can benefit from dimensionality reduction techniques. Most existing dimensionality reduction techniques ignore information about the sequence of observations and actions between data points.  I recently co-developed a new dimensionality reduction technique called Action Respecting Embedding (ARE) which exploits this additional information, successfully translating actions into meaningful and interpretable low-dimensional representations. In my proposed research, I intend to refine this new technique to make it faster and more efficient. This could lead to novel solutions to real-world sequential decision problems such as planning and localization for robots. Unlike existing techniques, an ARE approach would require no expert knowledge about the domain to find effective solutions. On the more theoretical side, I propose to explore and formalize non-linear dimensionality reduction techniques as probabilistic models. I will address the problem of how such models should be constructed, and how they should respond when data is missing. This has many potential uses in fields such as physics, economics, and medicine, where meaningful information must be extracted from large data sets.