Grant: Discovery Grants Program - Individual
University of Manitoba
$24,000.00
Efficient mining of constrained patterns
EF 2007-08
Résumé
With the advance in technology, a flood of data can be produced in many applications such as wireless sensor networks. Consequently, we are drowning in data but starving for knowledge. To be able to ''drink from a fire hose'' (i.e., to make sense of the flood of data), methods for extracting useful information from the flood of data are in demand. This calls for data mining, which refers to the search for implicit, previously unknown, and potentially useful knowledge (such as frequent patterns and exceptional patterns) that might be embedded in the data. Over the past few years, I have developed interactive algorithms for finding frequent patterns satisfying a certain class of constraints. The algorithms are enhanced with some optimizations such as a light-weight structure that provides sharper bounds on the frequency of frequent patterns. Furthermore, I have also developed a novel tree structure for effectively capturing and updating the contents of the database in an incremental environment. Along this direction, I propose to build a more efficient, user-friendly, and powerful mining system such that it (i) incorporates users' preferences, (ii) allows users to visualize the data, (iii) permits users to change the mining parameter and/or constraints during the mining process, (iv) provides users with comprehensible feedback in a ''real-time'' fashion, (v) discovers and exploits any unknown properties of constraints to avoid unnecessary computation and to further speed up performance, and (vi) keeps a good fusion of theory and practice via the exploration of real-life applications (e.g., mining from market basket data, Web click stream, agricultural/meteorological data, and medical/biomedical data). The discovered frequent patterns reveal the common trends; the discovered exceptional patterns trigger alarm bells for prevention of outbreaks or disasters. In the long term, this proposal can also be extended to handle various types of data, ranging from traditional alphanumeric data to non-traditional multimedia data, from structured data to semi-structured XML data, and from traditional ''static'' transactional data to ''dynamic'' streams of continuous data.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Manitoba, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
298317-2007
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
2007
Competition year année de concours
2007
Award amount
24000
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
330
Committee name en
Computing and Information Sciences - A
Committee name fr
Informatique - A
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
1
Nb partie
5
Application title
Efficient mining of constrained patterns
Keyword
NA
Application summary
With the advance in technology, a flood of data can be produced in many applications such as wireless sensor networks. Consequently, we are drowning in data but starving for knowledge. To be able to ''drink from a fire hose'' (i.e., to make sense of the flood of data), methods for extracting useful information from the flood of data are in demand. This calls for data mining, which refers to the search for implicit, previously unknown, and potentially useful knowledge (such as frequent patterns and exceptional patterns) that might be embedded in the data. Over the past few years, I have developed interactive algorithms for finding frequent patterns satisfying a certain class of constraints. The algorithms are enhanced with some optimizations such as a light-weight structure that provides sharper bounds on the frequency of frequent patterns. Furthermore, I have also developed a novel tree structure for effectively capturing and updating the contents of the database in an incremental environment. Along this direction, I propose to build a more efficient, user-friendly, and powerful mining system such that it (i) incorporates users' preferences, (ii) allows users to visualize the data, (iii) permits users to change the mining parameter and/or constraints during the mining process, (iv) provides users with comprehensible feedback in a ''real-time'' fashion, (v) discovers and exploits any unknown properties of constraints to avoid unnecessary computation and to further speed up performance, and (vi) keeps a good fusion of theory and practice via the exploration of real-life applications (e.g., mining from market basket data, Web click stream, agricultural/meteorological data, and medical/biomedical data). The discovered frequent patterns reveal the common trends; the discovered exceptional patterns trigger alarm bells for prevention of outbreaks or disasters. In the long term, this proposal can also be extended to handle various types of data, ranging from traditional alphanumeric data to non-traditional multimedia data, from structured data to semi-structured XML data, and from traditional ''static'' transactional data to ''dynamic'' streams of continuous data.