Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Manitoba

$22,000.00

Mining Interesting Useful Patterns

EF 2014-15

Résumé
Frequent pattern mining is an important data mining task that finds sets of frequently co-occurring items. Many existing algorithms find frequent patterns from precise data (e.g., supermarket transactions), in which the contents of datasets are precisely known. However, there are real-life situations in which data are imprecise or uncertain (e.g., sensor data, medical test results) due to factors like inherited measurement inaccuracies or sampling frequency. Despite their uncertainty, these data contain a rich set of useful knowledge. Over the past few years, I have developed algorithms that use probabilistic approaches to find frequent patterns from uncertain data, in which items in each transaction are assumed to be independent. However, this assumption may not hold in many real-life situations. Hence, I propose a research program with an objective to build an exploratory, efficient, user-friendly, and powerful mining framework--which consists of systems that mine useful patterns that are interesting to users from data streams and/or uncertain data. Specifically, I plan to (i) explore non-probabilistic approaches in finding frequent patterns, (ii) relax the above assumption so as to handle more realistic situations where items in each uncertain transaction may be related, (iii) incorporate user preferences in the mining process so as to allow users to find other useful (frequent or infrequent) patterns that are interesting to users, (iv) further improve performance so as to provide users with real-time responses, (v) develop visual analytics tools so as to enable users to visualize and analyze static (or dynamic) datasets of precise (or uncertain) data. Consequently, for this proposed research program, I and my HQP would develop new data mining technology for mining interesting useful patterns. This, in turn, advances knowledge of researchers in the field. Moreover, I also plan to apply the proposed system to various real-life applications (e.g., mining Web data, telecommunication data, agro-meteorological data, and tweets from social networks) so as to demonstrate the effectiveness of the proposed systems in addressing scientific/business needs of the application users when mining interesting useful patterns.
Programme
Discovery Grants Program - Individual
Emplacement
Manitoba, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
298317-2012
Name nom
Leung, CarsonKaiSang
Department département
Computer Science
Organization id
19
Institution établissement
University of Manitoba
Province en
Manitoba
Province fr
Manitoba
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2012
Award amount
22000
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
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
2711
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Database management
Research subject fr
Gestion de bases de données
Partie
3
Nb partie
5
Application title
Mining Interesting Useful Patterns
Keyword
NSERC
Application summary
Frequent pattern mining is an important data mining task that finds sets of frequently co-occurring items. Many existing algorithms find frequent patterns from precise data (e.g., supermarket transactions), in which the contents of datasets are precisely known. However, there are real-life situations in which data are imprecise or uncertain (e.g., sensor data, medical test results) due to factors like inherited measurement inaccuracies or sampling frequency. Despite their uncertainty, these data contain a rich set of useful knowledge. Over the past few years, I have developed algorithms that use probabilistic approaches to find frequent patterns from uncertain data, in which items in each transaction are assumed to be independent. However, this assumption may not hold in many real-life situations. Hence, I propose a research program with an objective to build an exploratory, efficient, user-friendly, and powerful mining framework--which consists of systems that mine useful patterns that are interesting to users from data streams and/or uncertain data. Specifically, I plan to (i) explore non-probabilistic approaches in finding frequent patterns, (ii) relax the above assumption so as to handle more realistic situations where items in each uncertain transaction may be related, (iii) incorporate user preferences in the mining process so as to allow users to find other useful (frequent or infrequent) patterns that are interesting to users, (iv) further improve performance so as to provide users with real-time responses, (v) develop visual analytics tools so as to enable users to visualize and analyze static (or dynamic) datasets of precise (or uncertain) data. Consequently, for this proposed research program, I and my HQP would develop new data mining technology for mining interesting useful patterns. This, in turn, advances knowledge of researchers in the field. Moreover, I also plan to apply the proposed system to various real-life applications (e.g., mining Web data, telecommunication data, agro-meteorological data, and tweets from social networks) so as to demonstrate the effectiveness of the proposed systems in addressing scientific/business needs of the application users when mining interesting useful patterns.