izpis_h1_title_alt

Izboljšave dinamičnega algoritma za iskanje maksimalne klike v proteinskem grafu z uporabo strojnega učenja
Reba, Kristjan (Author), Guid, Matej (Mentor) More about this mentor... This link opens in a new window, Konc, Janez (Co-mentor)

.pdfPDF - Presentation file, Download (3,62 MB)
MD5: 17895B87903A912F6DF1D6B01DCD6F49

Abstract
Iskanje maksimalne klike spada med dobro raziskane NP-polne probleme. Za praktično uporabnost algoritmov za iskanje maksimalne klike morajo biti ti dovolj hitri na ciljni domeni grafov. V zadnjih letih je bilo narejenega veliko napredka na področju strojnega učenja na grafih. V magistrskem delu uporabimo moderne pristope strojnega učenja na grafih za pohitritev dinamičnega algoritma za iskanje maksimalne klike. Pohitritve testiramo na različnih vrstah grafov s poudarkom na različnih vrstah proteinskih grafov. Ugotovimo, da so pohitritve možne in jih lahko dosežemo z dobro izbiro modela za strojno učenje. Ugotovimo tudi, da pohitritve niso velike, vendar pa so konsistentne na skoraj vseh predstavljenih grafih.

Language:Slovenian
Keywords:proteinski graf, maksimalna klika, strojno učenje
Work type:Master's thesis/paper (mb22)
Tipology:2.09 - Master's Thesis
Organization:FRI - Faculty of computer and information science
Year:2021
COBISS.SI-ID:82279427 This link opens in a new window
Views:51
Downloads:21
Metadata:XML RDF-CHPDL DC-XML DC-RDF
 
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
:
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Secondary language

Language:English
Title:Improvements to the dynamic algorithm for finding maximum clique in a protein graph using machine learning
Abstract:
Finding maximum clique is a well-researched NP-complete problem. For the practical applicability of algorithms for finding the maximum clique, they must be fast enough on the target domain of graphs. There has been a lot of progress made in recent years in the field of machine learning on graphs. In the master's thesis we use modern approaches to machine learning on graphs to speed up the dynamic algorithm for finding the maximum clique. Speedups are tested with different types of graphs with an emphasis on different types of protein graphs. We find that speeding up the maximum clique search is possible and can be achieved with a good choice of machine learning model. We also find that the speedups are not large but are consistent on almost all the graphs presented.

Keywords:protein graph, maximum clique, machine learning

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Comments

Leave comment

You have to log in to leave a comment.

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

Back