All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Combining Social Relations and Interaction Data in Recommender System With Graph Convolution Collaborative Filtering

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F23%3A10253968" target="_blank" >RIV/61989100:27240/23:10253968 - isvavai.cz</a>

  • Result on the web

    <a href="https://ieeexplore.ieee.org/document/10347223" target="_blank" >https://ieeexplore.ieee.org/document/10347223</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ACCESS.2023.3340209" target="_blank" >10.1109/ACCESS.2023.3340209</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Combining Social Relations and Interaction Data in Recommender System With Graph Convolution Collaborative Filtering

  • Original language description

    A recommender system is an important subject in the field of data mining, where the item rating information from users is exploited and processed to make suitable recommendations with all other users. The recommender system creates convenience for e-commerce users and stimulates the consumption of items that are suitable for users. In addition to e-commerce, a recommender system is also used to provide recommendations on books to read, movies to watch, courses to take or websites to visit. Similarity between users is an important impact for recommendation, which could be calculated from the data of past user ratings of the item by methods of collaborative filtering, matrix factorization or singular vector decomposition. In the development of graph data mining techniques, the relationships between users and items can be represented by matrices from which collaborative filtering could be done with the larger database, more accurate and faster in calculation. All these data can be represented graphically and mined by today&apos;s highly developed graph neural network models. On the other hand, users&apos; social friendship data also influence consumption habits because recommendations from friends will be considered more carefully than information sources. However, combining a user&apos;s friend influence and the similarity between users whose similar shopping habits is challenging. Because the information is noisy and it affects each particular data set in different ways. In this study, we present the input data processing method to remove outliers which are single reviews or users with little interaction with the items; the next proposed model will combine the social relationship data and the similarity in the rating history of users to improve the accuracy and recall of the recommender system. We perform a comparative assessment of the influence of each data set and calculation method on the final recommendation. We also propose and implement a model and compared it with base line models which include NGCF, LightGCN, WiGCN, SocialLGN and SEPT.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2023

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    IEEE Access

  • ISSN

    2169-3536

  • e-ISSN

    2169-3536

  • Volume of the periodical

    11

  • Issue of the periodical within the volume

    prosinec 2023

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    12

  • Pages from-to

    139759-139770

  • UT code for WoS article

    001130259100001

  • EID of the result in the Scopus database