Influential community discovery in massive social networks using a consumer-grade machine
| dc.contributor.author | Chen, Shu | |
| dc.contributor.supervisor | Thomo, Alex | |
| dc.date.accessioned | 2017-07-24T14:48:09Z | |
| dc.date.available | 2017-07-24T14:48:09Z | |
| dc.date.copyright | 2017 | en_US |
| dc.date.issued | 2017-07-24 | |
| dc.degree.department | Department of Computer Science | en_US |
| dc.degree.level | Master of Science M.Sc. | en_US |
| dc.description.abstract | Graphs have become very crucial as they can represent a wide variety of systems in different areas. One interesting structure called community in graphs has attracted considerable attention from both academia and industry. Community detection is meaningful, but typically hard in arbitrary networks. A lot of research has been done based on structural information, but we would like to find communities which are not only cohesive but also influential or important. A k-influential community model based on k-core provided by Li, Qin, Yu, and Mao is helpful to discover these cohesive and important communities. They organize the problem as finding top-r most important communities in a given graph. In this thesis, our goal is to detect top-r most important communities using efficient and memory-saving algorithms running on a consumer-grade machine. We analyze two existing algorithms, then propose multiple new efficient algorithms for this problem. To test their performance, we conduct extensive experiments on some real-world graph datasets. Experimental results show that our algorithms are able to compute top-r most important communities within a very reasonable amount of time and space in a consumer-grade machine. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/8367 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | algorithms | en_US |
| dc.subject | graphs | en_US |
| dc.title | Influential community discovery in massive social networks using a consumer-grade machine | en_US |
| dc.type | Thesis | en_US |