| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Implementacija metod iskanja najkrajše poti za optimizacijo povezovanja v socialnih omrežjih
Authors:ID Hertiš, Tadej (Author)
ID Šumak, Boštjan (Mentor) More about this mentor... New window
ID Pušnik, Maja (Comentor)
Files:.pdf MAG_Hertis_Tadej_2018.pdf (1,24 MB)
MD5: 753F4785939D5D94BAD7D4CFAA3321FC
PID: 20.500.12556/dkum/1f108d7d-84ba-4d60-bfd3-6f82d01347d0
 
.zip MAG_Hertis_Tadej_2018.zip (1,13 MB)
MD5: 059D2E62EC8BC70F4352F24F66045E26
PID: 20.500.12556/dkum/c9acfaf9-ed4b-4eb3-a6a6-01ccebd01d10
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V magistrskem delu predstavljamo problem iskanja najkrajše poti v socialnih omrežjih na podlagi pregleda, analize in implementacije metod iskanja najkrajše poti. Izdelan je bil sistematičen pregled literature kot podlaga za identificiranje najpogosteje uporabljenih metod iskanja najkrajše poti v analizi socialnih omrežij. Predstavljena je implementacija dveh poglavitnih metod iskanja najkrajše poti: Dijkstrov in Bellman-Fordov algoritem. Na podlagi implementacije sta bila izvedena eksperiment učinkovitosti delovanja algoritmov in primerjalna analiza. Na praktičnem primeru realnega socialnega omrežja je prikazana uporaba tradicionalnih metod iskanja najkrajše poti za izračun metrik v analizi socialnih omrežij. Ugotovljeno je bilo, da se Dijkstrov algoritem zaradi preprostejše implementacije izvaja hitreje kot Bellman-Fordov algoritem. Na velikih socialnih omrežjih se za hitrejše iskanje najkrajše poti uporabljajo hevristični pristopi in združevanje vozlišč v skupine. Prav tako Dijkstrov in Bellman-Fordov algoritem za iskanje najkrajše poti v socialnih omrežjih ne podpirata nekaterih vrst komunikacijskih povezav med uporabniki.
Keywords:problem iskanja najkrajše poti, Dijkstrov algoritem, Bellman-Fordov algoritem, socialno omrežje, analiza socialnih omrežij
Place of publishing:[Maribor
Publisher:T. Hertiš
Year of publishing:2018
PID:20.500.12556/DKUM-70968 New window
UDC:004.738.021(043.2)
COBISS.SI-ID:21587222 New window
NUK URN:URN:SI:UM:DK:WUE37ZEX
Publication date in DKUM:17.07.2018
Views:1629
Downloads:315
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY-ND 4.0, Creative Commons Attribution-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nd/4.0/
Description:Under the NoDerivatives Creative Commons license one can take a work released under this license and re-distribute it, but it cannot be shared with others in adapted form, and credit must be provided to the author.
Licensing start date:25.06.2018

Secondary language

Language:English
Title:Implementation of the shortest path problem methods for edge optimization in social networks
Abstract:In the master's thesis we present the shortest path problem in social networks based on the examination, analysis and implementation of the methods for finding the shortest path. A systematic literature overview has been elaborated as the basis for identifying the most commonly used methods for finding the shortest path in the social network analysis. The implementation of two main shortest path problem methods is presented: Dijkstra and Bellman-Ford algorithm. An experiment and a comparative analysis on the performance of algorithms was performed based on the algorithms implementation. Behaviour of the shortest path problem methods is shown with the practical example of the real social network for the calculation of the social network analysis metrics. It was found, that Dijkstra algorithm is faster, than Bellman-Ford algorithm, due to simpler implementation. On large social networks, heuristic approaches and grouping of nodes are used for faster search of shortest paths. Additionally, Dijkstra and Bellman-Ford algorithm, for finding the shortest path, do not support some types of communication edges between users in social networks.
Keywords:Shortest path problem, Dijkstra algorithm, Bellman-Ford algorithm, Social network, Social network analysis


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica