Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Alberta

$29,000.00

Projected and semi-supervised clustering for high-dimensional data

FY 2015-16

Summary
Clustering is one of the major unsupervised data mining methods facing severe challenges when applied to today's high-dimensional data sets, which are collected on a large scale by automatic equipment (e.g. microarray chips, sensors, logging devices). The sparsity of the data, the small variance of distances in the full-dimensional space, and the inclusion of a large number of ""irrelevant"" or ""random"" dimensions make it typically impossible to detect a meaningful clustering structure using standard clustering algorithms with common full-dimensional (dis-)similarity measures. Meaningful structure can rather be detected by either considering lower-dimensional subspaces, or, by taking into account background knowledge if it is available (often as ""must-link"" or ""cannot-link"" constraints for a small subset of data points) to guide an algorithm to a certain clustering structure that is consistent with this information - overriding to some extent the information derived in the full-dimensional space. Main objectives of the proposed research program: 1) Advancement of the theoretical understanding of clustering methods applied to today's very high-dimensional data sets, particularly for the following relatively recent approaches ""projected (or subspace-) clustering"" and ""semi-supervised clustering"". 2) Development of novel and improved algorithms for projected and semi-supervised clustering, overcoming some of their current limitations, extending their applicability, and also combining the concepts of both for a wider range of application areas where such clustering methods can be useful. 3) Demonstration of the usefulness of the proposed methods on some real world data sets including gene expression data, text data, and medical image plus clinical data.
Program
Discovery Grants Program - Individual
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
250344-2011
Name nom
Sander, JËrg
Department département
Computing Science
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2011
Award amount
29000
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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
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
Computer software
Area of application fr
Logiciel
Research subject code
2709
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Other computing methods
Research subject fr
Autres méthodes informatiques
Partie
5
Nb partie
5
Application title
Projected and semi-supervised clustering for high-dimensional data
Keyword
NSERC
Application summary
Clustering is one of the major unsupervised data mining methods facing severe challenges when applied to today's high-dimensional data sets, which are collected on a large scale by automatic equipment (e.g. microarray chips, sensors, logging devices). The sparsity of the data, the small variance of distances in the full-dimensional space, and the inclusion of a large number of ""irrelevant"" or ""random"" dimensions make it typically impossible to detect a meaningful clustering structure using standard clustering algorithms with common full-dimensional (dis-)similarity measures. Meaningful structure can rather be detected by either considering lower-dimensional subspaces, or, by taking into account background knowledge if it is available (often as ""must-link"" or ""cannot-link"" constraints for a small subset of data points) to guide an algorithm to a certain clustering structure that is consistent with this information - overriding to some extent the information derived in the full-dimensional space. Main objectives of the proposed research program: 1) Advancement of the theoretical understanding of clustering methods applied to today's very high-dimensional data sets, particularly for the following relatively recent approaches ""projected (or subspace-) clustering"" and ""semi-supervised clustering"". 2) Development of novel and improved algorithms for projected and semi-supervised clustering, overcoming some of their current limitations, extending their applicability, and also combining the concepts of both for a wider range of application areas where such clustering methods can be useful. 3) Demonstration of the usefulness of the proposed methods on some real world data sets including gene expression data, text data, and medical image plus clinical data.