Pareto-PageRank algorithm
| dc.contributor.author | Tuhkanen, Olli | |
| dc.contributor.department | fi=Matematiikan ja tilastotieteen laitos|en=Department of Mathematics and Statistics| | |
| dc.contributor.faculty | fi=Matemaattis-luonnontieteellinen tiedekunta|en=Faculty of Science| | |
| dc.contributor.studysubject | fi=Sovellettu matematiikka|en=Applied Mathematics| | |
| dc.date.accessioned | 2022-08-25T21:01:57Z | |
| dc.date.available | 2022-08-25T21:01:57Z | |
| dc.date.issued | 2022-08-19 | |
| dc.description.abstract | PageRank algorithm is a powerfull graph analysis tools. This algorithm has been used in large variety of different applications. This thesis combines weighted PageRank with multiobjective optimization techniques producing a tool called Pareto-PageRank algorithm. This extension of the original PageRank allows it to be used in more demanding graph vulnerability analyses. This thesis covers the theory behind PageRank and multiobjective optimization. After the theory, the Pareto-PageRank algorithm itself is introduced and it's Python implementation is tested on real world road network data. | |
| dc.format.extent | 72 | |
| dc.identifier.olddbid | 171530 | |
| dc.identifier.oldhandle | 10024/154631 | |
| dc.identifier.uri | https://www.utupub.fi/handle/11111/16579 | |
| dc.identifier.urn | URN:NBN:fi-fe2022082556303 | |
| dc.language.iso | eng | |
| dc.rights | fi=Julkaisu on tekijänoikeussäännösten alainen. Teosta voi lukea ja tulostaa henkilökohtaista käyttöä varten. Käyttö kaupallisiin tarkoituksiin on kielletty.|en=This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.| | |
| dc.rights.accessrights | avoin | |
| dc.source.identifier | https://www.utupub.fi/handle/10024/154631 | |
| dc.subject | PageRank, Graph theory, Pareto-efficiency, Vulnerability analysis | |
| dc.title | Pareto-PageRank algorithm | |
| dc.type.ontasot | fi=Pro gradu -tutkielma|en=Master's thesis| |
Tiedostot
1 - 1 / 1