Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Université du Québec à Montréal

$25,000.00

Knowledge discovery from online social network

EF 2017-18

Résumé
The increasing amount of communication between individuals in e-formats (e.g. email, instant messaging, blogs, etc.) has motivated computational research in social network analysis. Social network analysis techniques aim to search communities of shared interests or leaders within communities. Social networks are often represented as graphs, where nodes represent individuals and edges represent the relationship between them. Such graphs are massive, in which node may contain a large amount of text data. Many existing social network analysis techniques focus either on the social network topology measured by communication frequencies or the content generated by the users. However, neither information alone is sufficient for finding accurately communities of shared interests and leaders within communities. The information in the text and the linkage structure re-enforce each other, and this leads to higher quality result. In addition to this, existing social network analysis techniques are only effective in analyzing graphs which are from a single source and relatively complete. Furthermore, most existing approaches assume that the structure of the network is static. However, online social networks change continually and links within the network come from different online sources. For example, consider links from Usenet to the blogosphere, links between tweets and news articles, etc. There are also some applications in which the whole network is not available at one time, but available in the form of continuous stream. Such applications create unique challenges, because the entire graph cannot be held in main memory. What is needed to make social network analysis more effective is to develop techniques that take into account textual content, uncertainty, incompleteness, heterogeneity of data sources and the need of developing specialized algorithms for Web applications that involve continuous stream of edges. Our goal is to address these issues by developing appropriate models and algorithms for mining effectively online social networks.
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
402495-2011
Name nom
Bouguessa, Mohamed
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
2011
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
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
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
6
Nb partie
6
Application title
Knowledge discovery from online social network
Keyword
NSERC
Application summary
The increasing amount of communication between individuals in e-formats (e.g. email, instant messaging, blogs, etc.) has motivated computational research in social network analysis. Social network analysis techniques aim to search communities of shared interests or leaders within communities. Social networks are often represented as graphs, where nodes represent individuals and edges represent the relationship between them. Such graphs are massive, in which node may contain a large amount of text data. Many existing social network analysis techniques focus either on the social network topology measured by communication frequencies or the content generated by the users. However, neither information alone is sufficient for finding accurately communities of shared interests and leaders within communities. The information in the text and the linkage structure re-enforce each other, and this leads to higher quality result. In addition to this, existing social network analysis techniques are only effective in analyzing graphs which are from a single source and relatively complete. Furthermore, most existing approaches assume that the structure of the network is static. However, online social networks change continually and links within the network come from different online sources. For example, consider links from Usenet to the blogosphere, links between tweets and news articles, etc. There are also some applications in which the whole network is not available at one time, but available in the form of continuous stream. Such applications create unique challenges, because the entire graph cannot be held in main memory. What is needed to make social network analysis more effective is to develop techniques that take into account textual content, uncertainty, incompleteness, heterogeneity of data sources and the need of developing specialized algorithms for Web applications that involve continuous stream of edges. Our goal is to address these issues by developing appropriate models and algorithms for mining effectively online social networks.