Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Norwegian Open Resea...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
UiS Brage
Master thesis . 2020
Data sources: UiS Brage
versions View all 2 versions
addClaim

Scaling Network Embeddings

Authors: Maksyk, Vladyslav;

Scaling Network Embeddings

Abstract

A Recommendation System is an intelligent machine learning system that seeks to predict a customer ranked set of personalized products from a dynamic pool of diverse choices. We can define the main objective of such systems as ranking edges in an undirected unweighted graph consisting of user and item nodes. Deep Graph embeddings have recently attracted the interests of both academia and industry, mainly because of its simplicity and effectiveness in a variety of applications. This thesis's primary purpose is to perform research on the existing graph embeddings methods for recommendation algorithms. We aim to transform undirected unweighted graphs into vectors, also known as graph embeddings, to make a representation that would be suitable for different machine learning algorithms. At first, we introduce the reader to some existing and conventional approaches that allow us to create such embeddings. We then present several modifications and improvements to the existing methods. Finally, we use several evaluation metrics to showcase the performance evaluations of such modifications.

Master's thesis in Computer Science

Country
Norway
Related Organizations
Keywords

graph embedding, graph reconstruction, informasjonsteknologi, datateknikk, deep learning, VDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550, link prediction

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green
Related to Research communities