uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Scalable Solutions for Social Network Analysis
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2009 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

A telecom operator can get a lot of high quality intelligence by studying the social network of its subscribers. One way to generate such a social network is to study the calls between the subscribers. Social networks generated from telecom networks can consist of millions of subscribers and the majority of the current social network analysis algorithms are too slow to analyze large networks. This master's thesis' objective is to find a more scalable solution to analyze social networks.

The work was divided into three steps; a survey of the existing solutions and algorithms, a pre-study to verify limitations of existing solutions and test some ideas and from the result of the pre-study and the survey a prototype was planned and implemented.

From the pre-study it was clear that the current solutions both took too long and used too much memory to be possible to use on a large social network. A number of algorithms were tested and from those a few was chosen to be implemented in the prototype. To help with the memory and time consumption the solution was also parallelized by using a partitioning algorithm to divide the graph into separate pieces on which each algorithm could run locally.The partitioning algorithm failed to scale well due to an internal modification of the partitioning scheme to adapt the partitioning to social graphs and simplify the parallelization. All but one algorithm scaled well and they were considerably faster than the original algorithms.

Place, publisher, year, edition, pages
2009.
Series
UPTEC IT, ISSN 1401-5749 ; 09 017
Identifiers
URN: urn:nbn:se:uu:diva-110548OAI: oai:DiVA.org:uu-110548DiVA, id: diva2:277255
Presentation
(English)
Uppsok
Technology
Supervisors
Examiners
Available from: 2009-11-16 Created: 2009-11-16 Last updated: 2009-11-17Bibliographically approved

Open Access in DiVA

fulltext(4618 kB)768 downloads
File information
File name FULLTEXT01.pdfFile size 4618 kBChecksum SHA-512
20e2fdf13d4144f31a2189db28ca4ef29bbe876abe537f4fb9d30d7dda47ee0abd90e0da827fce6f913cb5b6812e043e2e1a4b78ffe3a6802db72ea5a837c196
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 768 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 1015 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf