Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Université du Québec

$15,000.00

Data mining and OLAP over sequential data

FY 2008-09

Summary
Researchers work over increasingly large distributed data sets. Literary researchers have access to most classical works in digital format. There are terabytes of biological data freely available on the Web. Sequential data such as text or time series is common and has been identified as an area of critical importance by the database research community. Mining patterns in terabytes of time series or text with user-driven techniques, is an important open problem. We want to provide tools to users so that they can interactively aggregate sequential data into views, as in On-Line Analytical Processing (OLAP). To do so, we need well adapted hierarchies over the data so that drill-down and roll-up queries can be supported. We need robust time series indexing. Finally, we need a good model for sequential databases: should we complement existing information retrieval tools or extend current databases? In either case, the amount of data is so large that we need good strategies to preaggregate the data. In OLAP, attribute values are aggregated by star schema hierarchies (store/city/province, client ID/age group). Words can be aggregated in phrases, sentences and paragraphs or by hyponymy (car/vehicle) though there are issues with word sense disambiguation. An equivalent for time series is segmentation. Segmentation divides the data into intervals where it behaves approximately according to a simple model (e.g. constant, linear, quadratic, unimodal, monotonic, convex). Segmentation is a hierarchical process since intervals can be further subdivided. Recently, some progress has been made in time warping indexing. When comparing two time series, time warping locally accelerates or slows time in one time series to compute robust similarity measures.
Program
Discovery Grants Program - Individual
Location
Quebec, Canada
Type
Grant
Source
NSERC's Awards Data

As published

Application id
261437-2007
Name nom
Lemire, Daniel
Department département
Télé-université (Montréal)
Organization id
48
Institution établissement
Université du Québec
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2007
Award amount
15000
Program id
RGPIN
Program nane 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
2
Nb partie
5
Application title
Data mining and OLAP over sequential data
Keyword
NA
Application summary
Researchers work over increasingly large distributed data sets. Literary researchers have access to most classical works in digital format. There are terabytes of biological data freely available on the Web. Sequential data such as text or time series is common and has been identified as an area of critical importance by the database research community. Mining patterns in terabytes of time series or text with user-driven techniques, is an important open problem. We want to provide tools to users so that they can interactively aggregate sequential data into views, as in On-Line Analytical Processing (OLAP). To do so, we need well adapted hierarchies over the data so that drill-down and roll-up queries can be supported. We need robust time series indexing. Finally, we need a good model for sequential databases: should we complement existing information retrieval tools or extend current databases? In either case, the amount of data is so large that we need good strategies to preaggregate the data. In OLAP, attribute values are aggregated by star schema hierarchies (store/city/province, client ID/age group). Words can be aggregated in phrases, sentences and paragraphs or by hyponymy (car/vehicle) though there are issues with word sense disambiguation. An equivalent for time series is segmentation. Segmentation divides the data into intervals where it behaves approximately according to a simple model (e.g. constant, linear, quadratic, unimodal, monotonic, convex). Segmentation is a hierarchical process since intervals can be further subdivided. Recently, some progress has been made in time warping indexing. When comparing two time series, time warping locally accelerates or slows time in one time series to compute robust similarity measures.