Back to search

University of Victoria (Canada)

Efficient algorithms for discovering importance-based communities in large web-scale networks

Abstract

dc:description.abstract

k-core is a notion capturing the cohesiveness of a subgraph in a social network graph. Most of the current research work only consider pure network graphs and neglect an important property of the nodes: influence. Li, Qin, Yu, and Mao introduced a novel community model called k-influential community which is based on the concept of k-core enhanced with node influence values. In this model, we are interested not only in subgraphs that are well-connected but also have a high lower-bound on their influence. More precisely, we are interested in finding top r (with respect to influence), k-core communities. We present novel approaches that provide an impressive scalability in solving the problem for graphs of billions of edges using only a consumer-grade machine.

Degree

thesis:*
Level thesis:degree_level
Master of Science M.Sc.
Department thesis:degree_department
Department of Computer Science
Year dc:date.issued
2017

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wei, Ran
Advisor dc:contributor.supervisor
  • Thomo, Alex

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • Available to the World Wide Web
Language dc:language.iso
en, English

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1828/8432

Chain of custody

source
Harvested from
University of Victoria (Canada)
Base URL
dspace.library.uvic.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Wei, Ran. Efficient algorithms for discovering importance-based communities in large web-scale networks. Master of Science M.Sc. thesis, 2017. http://hdl.handle.net/1828/8432