search query: @keyword parallel computing / total: 13
reference: 5 / 13
« previous | next »
Author:Timonen, Toni
Title:Methods and approaches to decomposing large scale social networks
Menetelmiä ja lähestymistapoja valtavien sosiaalisten verkostojen rypästämämiseen
Publication type:Master's thesis
Publication year:2010
Pages:vii + 46 s.      Language:   eng
Department/School:Informaatio- ja luonnontieteiden tiedekunta
Degree programme:Tietotekniikan tutkinto-ohjelma
Main subject:Tietojenkäsittelyteoria   (T-119)
Supervisor:Niemelä, Ilkka
Instructor:Alakuijala, Jyrki
OEVS:
Electronic archive copy is available via Aalto Thesis Database.
Instructions

Reading digital theses in the closed network of the Aalto University Harald Herlin Learning Centre

In the closed network of Learning Centre you can read digital and digitized theses not available in the open network.

The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/

You can read theses on the Learning Centre customer computers, which are available on all floors.

Logging on to the customer computers

  • Aalto University staff members log on to the customer computer using the Aalto username and password.
  • Other customers log on using a shared username and password.

Opening a thesis

  • On the desktop of the customer computers, you will find an icon titled:

    Aalto Thesis Database

  • Click on the icon to search for and open the thesis you are looking for from Aaltodoc database. You can find the thesis file by clicking the link on the OEV or OEVS field.

Reading the thesis

  • You can either print the thesis or read it on the customer computer screen.
  • You cannot save the thesis file on a flash drive or email it.
  • You cannot copy text or images from the file.
  • You cannot edit the file.

Printing the thesis

  • You can print the thesis for your personal study or research use.
  • Aalto University students and staff members may print black-and-white prints on the PrintingPoint devices when using the computer with personal Aalto username and password. Color printing is possible using the printer u90203-psc3, which is located near the customer service. Color printing is subject to a charge to Aalto University students and staff members.
  • Other customers can use the printer u90203-psc3. All printing is subject to a charge to non-University members.
Location:P1 Ark Aalto     | Archive
Keywords:Fiedler vector
social network
graph partitioning
community finding
parallel computing
Fiedler-vektori
sosiaalinen verkko
graafinjako
yhteisönhakuongelma
rinnakkaislaskenta
Abstract (eng): Decomposing large scale social networks is a hard problem.
In this thesis we discuss and analyze the real-world problem of dividing large social graphs into smaller geographically separated pieces in a way that keeps the communication cost as small as possible from the point of view of storage, access, and replication expenses.

An abstract model is formed to capture the essential properties of the communication cost problem.
This model is then analyzed against other well-known problems, especially the graph partitioning problem and certain community finding problems.

The problem is also solved in a way that combines graph partitioning with ideas from other areas.
The end product is a practical, parallelizable algorithm suitable for decomposing large-scale social networks.

Algorithm performance and behaviour is being analyzed by simulations done against different kinds of input in a test-bed.
Properties of test data are also analyzed and a more in-depth analysis is done for corner-case situations where the algorithm fails to produce an optimal outcome.
Abstract (fin): Valtavien sosiaalisten verkkojen paloittelu on vaikea ongelma.
Tässä diplomityössä käydään läpi ja analysoidaan teollisuudesta kumpuavaa ongelmaa, jossa jaetaan sosiaalinen verkko pienempiin, maantieteellisesti irrallisiin osiin tavalla, joka huomioi tiedon varastoinnin, tiedon saatavuuden ja tiedon monistamisen mukaiset tarpeet ja kustannukset.

Viestinnänkuluongelman ydinkohdat ja oleelliset ominaisuudet muotoillaan abstraktiin malliin, jota tutkitaan ja verrataan muihin tunnettuihin ongelmatyyppeihin.
Erityisesti graafinjako-ongelmaan ja eräisiin yhteisönhakuongelmien muotoihin kiinnitetään huomiota.

Mallista muotoillaan myös ratkaisualgoritmi yhdistellen menetelmiä graafinjakoalgoritmeista ja muista tutkimusalueista.
Lopputuotteena syntyy käytännöllinen rinnakkaistuva algoritmi, joka soveltuu valtavien sosiaalisten verkostojen paloitteluun.

Algoritmin käyttäytymistä analysoidaan simulaatioin käyttäen erilaisia syötteitä.
Syötteiden edustavuutta tutkitaan, kuten myös rajatapauksia, joissa algoritmi ei tuota parasta mahdollista tulosta.
ED:2010-04-12
INSSI record number: 39438
+ add basket
« previous | next »
INSSI