Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Alberta

$25,000.00

Reinforcing pattern mining with uncertainty and connectivity

EF 2013-14

Résumé
Generally, data stored in databases are considered facts and observations that took place. These records are also typically considered mutually independent. This is true for many application domains. For instance, a hospital database contains information about patients that are independent from each other. A record could state a visit at a given date for a particular diagnostic for which a given treatment is given. The observed facts are recorded as unrelated. Data mining and analysis tasks assume this independence between records and consider the recorded facts to be certain. However, in many real applications some relationships exist between observations and thus could be recorded. For example, the fact that a person is a friend, colleague or family member of another person can be recorded as a connection. In telecommunication, the fact that a phone number calls another telephone number creates a relationship between records. These are information networks. Ignoring these relationships in data analysis is a missed opportunity to get better insights about the data. Moreover, uncertainties in data exist and can come from the measurement instruments such as sensors or any confidence level attached to the source of information. For instance, the temperature measured by a sensor may not be certain but assumed within a range of values; many values recorded in different application domains may only be ascertained with some level of confidence. These are probabilistic data because the value of an attribute could be affixed with a probability level. Uncertainty can also be ascribed to relationships in data to form probabilistic information networks. Unfortunately, most existing data mining approaches assume independence and certainty of data. Very little work has been done on effectively analyzing probabilistic databases or probabilistic information networks to discover useful new knowledge or patterns in such data collections. The purpose of this proposal is to work on devising effective and efficient techniques to mine and learn from probabilistic databases and probabilistic information networks, and show the use and relevance of these techniques in real domains applications where uncertainty is germane to the data collection.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
217618-2013
Name nom
Zaïane, Osmar
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
2013
Competition year année de concours
2013
Award amount
25000
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
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2700
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Information technology
Research subject fr
Technologie de l'information
Partie
1
Nb partie
5
Application title
Reinforcing pattern mining with uncertainty and connectivity
Keyword
NSERC
Application summary
Generally, data stored in databases are considered facts and observations that took place. These records are also typically considered mutually independent. This is true for many application domains. For instance, a hospital database contains information about patients that are independent from each other. A record could state a visit at a given date for a particular diagnostic for which a given treatment is given. The observed facts are recorded as unrelated. Data mining and analysis tasks assume this independence between records and consider the recorded facts to be certain. However, in many real applications some relationships exist between observations and thus could be recorded. For example, the fact that a person is a friend, colleague or family member of another person can be recorded as a connection. In telecommunication, the fact that a phone number calls another telephone number creates a relationship between records. These are information networks. Ignoring these relationships in data analysis is a missed opportunity to get better insights about the data. Moreover, uncertainties in data exist and can come from the measurement instruments such as sensors or any confidence level attached to the source of information. For instance, the temperature measured by a sensor may not be certain but assumed within a range of values; many values recorded in different application domains may only be ascertained with some level of confidence. These are probabilistic data because the value of an attribute could be affixed with a probability level. Uncertainty can also be ascribed to relationships in data to form probabilistic information networks. Unfortunately, most existing data mining approaches assume independence and certainty of data. Very little work has been done on effectively analyzing probabilistic databases or probabilistic information networks to discover useful new knowledge or patterns in such data collections. The purpose of this proposal is to work on devising effective and efficient techniques to mine and learn from probabilistic databases and probabilistic information networks, and show the use and relevance of these techniques in real domains applications where uncertainty is germane to the data collection.