Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Université du Québec à Montréal

$20,000.00

Pattern mining from linked data, methods, tools and applications

EF 2017-18

Résumé
This program is about extracting useful knowledge from the structured data that is published on the Web. It researches the adaptation of previously contributed methods and techniques for pattern mining to the emerging Web of Data, a cloud of Linked Open Data (LOD) datasets freely available on the Web for access/retrieval. The underlying format is the Resource Description Framework (RDF), a graph-based language. LOD datasets of the cloud, often with an explicit machine readable schema, are inter-linked into a virtually unique global graph which is constantly expanding (32 billion edges in 2011). Data mining within such a huge heterogeneous yet relatively well structured source is both beneficial and challenging: (1) the relational structure of a LOD dataset is hard to process for standard data miners and (2) the available schema knowledge need to be properly exploited to guide the mining process. Our program focuses on pattern mining, i.e., discovery of recurring regularities in data descriptions. The extracted patterns have a wide range of applications from schema refinement to recommendation to decision making in the domain. However, existing pattern miners fail in at least one of the three ways: flatten the graph into a feature vector and hence lose precious information for mining, ignore the schema knowledge or sacrify efficiency for expressiveness. We propose to research on a better trade-off between scalability, expressiveness and coverage of variable pattern languages for RDF datasets. The research will build upon mining methods designed to work with rich schemas (ontologies) albeit with a somewhat different input data and of smaller size. The key challenge is therefore to increase their scope and efficiency. To that end, we shall research on properly recasting them in terms of general data mining problems to enable the application of state-of-the-art data structures, techniques and structural results. The intended applications are analysis of drug adverse reactions (pharmacovigilance), decision making in critical care, design of complex workflows in phylogenetic analysis of genomic data.
Programme
Discovery Grants Program - Individual
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
249900-2013
Name nom
Valtchev, Petko
Department département
Informatique
Organization id
57
Institution établissement
Université du Québec à Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2013
Award amount
20000
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
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2800
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Artificial intelligence (computer vision, use2603)
Research subject fr
Intelligence artificielle (vision artificielle, utiliser 2603)
Partie
5
Nb partie
5
Application title
Pattern mining from linked data, methods, tools and applications
Keyword
NSERC
Application summary
This program is about extracting useful knowledge from the structured data that is published on the Web. It researches the adaptation of previously contributed methods and techniques for pattern mining to the emerging Web of Data, a cloud of Linked Open Data (LOD) datasets freely available on the Web for access/retrieval. The underlying format is the Resource Description Framework (RDF), a graph-based language. LOD datasets of the cloud, often with an explicit machine readable schema, are inter-linked into a virtually unique global graph which is constantly expanding (32 billion edges in 2011). Data mining within such a huge heterogeneous yet relatively well structured source is both beneficial and challenging: (1) the relational structure of a LOD dataset is hard to process for standard data miners and (2) the available schema knowledge need to be properly exploited to guide the mining process. Our program focuses on pattern mining, i.e., discovery of recurring regularities in data descriptions. The extracted patterns have a wide range of applications from schema refinement to recommendation to decision making in the domain. However, existing pattern miners fail in at least one of the three ways: flatten the graph into a feature vector and hence lose precious information for mining, ignore the schema knowledge or sacrify efficiency for expressiveness. We propose to research on a better trade-off between scalability, expressiveness and coverage of variable pattern languages for RDF datasets. The research will build upon mining methods designed to work with rich schemas (ontologies) albeit with a somewhat different input data and of smaller size. The key challenge is therefore to increase their scope and efficiency. To that end, we shall research on properly recasting them in terms of general data mining problems to enable the application of state-of-the-art data structures, techniques and structural results. The intended applications are analysis of drug adverse reactions (pharmacovigilance), decision making in critical care, design of complex workflows in phylogenetic analysis of genomic data.