search query: @supervisor Gionis, Aristides / total: 13
results-list
reference: 10 / 13
« previous | next »
Author:Rozenshtein, Polina
Title:Discovering dynamic communities in interaction networks
Publication type:Master's thesis
Publication year:2014
Pages:61 s.+ liitt. 3      Language:   eng
Department/School:Perustieteiden korkeakoulu
Main subject:Machine Learning and Data Mining   (SCI3015)
Supervisor:Gionis, Aristides
Instructor:Gionis, Aristides ; Tatti, Nikolaj
Electronic version URL: http://urn.fi/URN:NBN:fi:aalto-201408292554
OEVS:
Electronic archive copy is available via Aalto Thesis Database.
Instructions
close

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  1752   | Archive
Keywords:community detection
graph mining
social-network analysis
dynamic graphs
time-evolving networks
interaction networks
Abstract (eng):Very often online social networks are defined by aggregating information regarding the interaction between the nodes of the network.
For example, a call graph is defined by considering an edge for each pair of individuals who have called each other at least once - or at least k times.
Similarly, an implicit social network in a social-media site is defined by considering an edge for each pair of users who have interacted in some way, e.g., have made a conversation, commented to each other's content, etc.
Despite the fact that this type of definitions have been used to obtain a lot of insights regarding the structure of social networks, it is obvious that they suffer from a severe limitation: they neglect the precise time that the interaction between network nodes occurs.

In this thesis we propose to study interaction networks, where one considers not only the underlying topology of the social network, but also the exact time instances that nodes interact.
In an interaction network an edge is associated with a time stamp, and multiple edges may occur for the same pair of nodes.
Consequently, interaction networks offer a more fine-grained representation that can be used to reveal otherwise hidden dynamic phenomena in the network.

In the context of interaction networks, we study the problem of discovering communities, which are dense in terms of the underlying network structure, and whose edges occur in short time intervals.
Such communities represent groups of individuals who interact with each other in some specific time instances, for example, a group of employees who work on a project and whose interaction intensifies before certain project milestones.
We prove that the problem we define is NP-hard, and we provide effective algorithms by adapting techniques used to find dense subgraphs.
We perform extensive evaluation of the proposed methods on synthetic and real datasets, which demonstrates the validity of our concepts and the good performance of our algorithms.
ED:2014-08-31
INSSI record number: 49682
+ add basket
« previous | next »
INSSI