Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • 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
Divisive Betweenness Centrality Clustering on Graphs Weighted by Timestamps
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2015 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Data visualization is important to obtain a better understanding of many networks. However, for larger networks it is hard to perceive the visualization of the network. In order to simplify such visualizations of networks, graph clustering algorithms may be used to identify subgraphs of close vertices and group them together. In this paper we study graph clustering algorithms applied to event structures from continuous integration infrastructures. These event structures are special in the sense that they can be viewed as a directed acyclic graph with edges weighted by the duration between connected events. We have chosen to cluster this graph with variations of divisive graph clustering algorithms utilizing betweenness centrality measures, a measurement which originates from sociology. While some of the algorithms we tested produced acceptable clusters, our conclusion is that more theory behind the event structures is needed in order to achieve greater graph clustering qualities.

Place, publisher, year, edition, pages
2015.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-168662OAI: oai:DiVA.org:kth-168662DiVA: diva2:817827
Supervisors
Examiners
Available from: 2015-06-06 Created: 2015-06-06 Last updated: 2015-06-06Bibliographically approved

Open Access in DiVA

fulltext(665 kB)193 downloads
File information
File name FULLTEXT01.pdfFile size 665 kBChecksum SHA-512
5c9eacf47f091c9ca23f9e81d616a121ac3a71707e17329b0ecae80f7ba15970d5f869a6ae6adb11072c162136bc81fd877d6ec1efb0e00124c28b9888e0fcdb
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 193 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: 214 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • 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