scholarly journals Graph Embedding for Scholar Recommendation in Academic Social Networks

2021 ◽  
Vol 9 ◽  
Author(s):  
Chengzhe Yuan ◽  
Yi He ◽  
Ronghua Lin ◽  
Yong Tang
Keyword(s):  
Social Networks ◽  
Recommendation System ◽  
Auxiliary Information ◽  
Graph Embedding ◽  
Scientific Publications ◽  
Team Members ◽  
Feature Representations ◽  
Academic Social Networks ◽  
Academic Information ◽  
Real World Datasets

The academic social networks (ASNs) play an important role in promoting scientific collaboration and innovation in academic society. Accompanying the tremendous growth of scholarly big data, finding suitable scholars on ASNs for collaboration has become more difficult. Different from friend recommendation in conventional social networks, scholar recommendation in ASNs usually involves different academic entities (e.g., scholars, scientific publications, and status updates) and various relationships (e.g., collaboration relationship between team members, citations, and co-authorships), which forms a complex heterogeneous academic network. Our goal is to recommend potential similar scholars for users in ASNs. In this article, we propose to design a graph embedding-based scholar recommendation system by leveraging academic auxiliary information. First, we construct enhanced ASNs by integrating two types of academic features extracted from scholars’ academic information with original network topology. Then, the refined feature representations of the scholars are obtained by a graph embedding framework, which helps the system measure the similarity between scholars based on their representation vectors. Finally, the system generates potential similar scholars for users in ASNs for the final recommendation. We evaluate the effectiveness of our model on five real-world datasets: SCHOLAT, Zhihu, APS, Yelp and Gowalla. The experimental results demonstrate that our model is effective and achieves promising improvements than the other competitive baselines.

scholarly journals Fairwalk: Towards Fair Graph Embedding

2019 ◽  
Author(s):  
Tahleen Rahman ◽  
Bartlomiej Surma ◽  
Michael Backes ◽  
Yang Zhang
Keyword(s):  
Social Networks ◽  
Real World ◽  
Graph Embedding ◽  
Experimental Results ◽  
Graph Embeddings ◽  
Potential Bias ◽  
Embedding Method ◽  
Real World Datasets

Graph embeddings have gained huge popularity in the recent years as a powerful tool to analyze social networks. However, no prior works have studied potential bias issues inherent within graph embedding. In this paper, we make a first attempt in this direction. In particular, we concentrate on the fairness of node2vec, a popular graph embedding method. Our analyses on two real-world datasets demonstrate the existence of bias in node2vec when used for friendship recommendation. We, therefore, propose a fairness-aware embedding method, namely Fairwalk, which extends node2vec. Experimental results demonstrate that Fairwalk reduces bias under multiple fairness metrics while still preserving the utility.

scholarly journals A Hierarchical Attention Recommender System Based on Cross-Domain Social Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Rongmei Zhao ◽  
Xi Xiong ◽  
Xia Zu ◽  
Shenggen Ju ◽  
Zhongzhi Li ◽  
...  
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Recommendation System ◽  
Information Overload ◽  
User Behavior ◽  
Recommendation Systems ◽  
Social Domain ◽  
Network Information ◽  
Cross Domain ◽  
Real World Datasets

Search engines and recommendation systems are an essential means of solving information overload, and recommendation algorithms are the core of recommendation systems. Recently, the recommendation algorithm of graph neural network based on social network has greatly improved the quality of the recommendation system. However, these methods paid far too little attention to the heterogeneity of social networks. Indeed, ignoring the heterogeneity of connections between users and interactions between users and items may seriously affect user representation. In this paper, we propose a hierarchical attention recommendation system (HA-RS) based on mask social network, combining social network information and user behavior information, which improves not only the accuracy of recommendation but also the flexibility of the network. First, learning the node representation in the item domain through the proposed Context-NE model and then the feature information of neighbor nodes in social domain is aggregated through the hierarchical attention network. It can fuse the information in the heterogeneous network (social domain and item domain) through the above two steps. We propose the mask mechanism to solve the cold-start issues for users and items by randomly masking some nodes in the item domain and in the social domain during the training process. Comprehensive experiments on four real-world datasets show the effectiveness of the proposed method.

scholarly journals TransET: Knowledge Graph Embedding with Entity Types

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1407
Author(s):  
Peng Wang ◽  
Jing Zhou ◽  
Yuzhang Liu ◽  
Xingchen Zhou
Keyword(s):  
Link Prediction ◽  
State Of The Art ◽  
Score Function ◽  
Graph Embedding ◽  
Vector Spaces ◽  
Knowledge Graph ◽  
Semantic Features ◽  
Knowledge Graphs ◽  
Real World Datasets ◽  
Low Dimensional

Knowledge graph embedding aims to embed entities and relations into low-dimensional vector spaces. Most existing methods only focus on triple facts in knowledge graphs. In addition, models based on translation or distance measurement cannot fully represent complex relations. As well-constructed prior knowledge, entity types can be employed to learn the representations of entities and relations. In this paper, we propose a novel knowledge graph embedding model named TransET, which takes advantage of entity types to learn more semantic features. More specifically, circle convolution based on the embeddings of entity and entity types is utilized to map head entity and tail entity to type-specific representations, then translation-based score function is used to learn the presentation triples. We evaluated our model on real-world datasets with two benchmark tasks of link prediction and triple classification. Experimental results demonstrate that it outperforms state-of-the-art models in most cases.

User opinions driven social recommendation system

2021 ◽  
Vol 25 (1) ◽  
pp. 21-31
Author(s):  
Lakshmikanth Paleti ◽  
P. Radha Krishna ◽  
J.V.R. Murthy
Keyword(s):  
Social Networks ◽  
Collaborative Filtering ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Social Recommendation ◽  
Novel Approach ◽  
Tripartite Graphs ◽  
Content Based Filtering

Recommendation systems provide reliable and relevant recommendations to users and also enable users’ trust on the website. This is achieved by the opinions derived from reviews, feedbacks and preferences provided by the users when the product is purchased or viewed through social networks. This integrates interactions of social networks with recommendation systems which results in the behavior of users and user’s friends. The techniques used so far for recommendation systems are traditional, based on collaborative filtering and content based filtering. This paper provides a novel approach called User-Opinion-Rating (UOR) for building recommendation systems by taking user generated opinions over social networks as a dimension. Two tripartite graphs namely User-Item-Rating and User-Item-Opinion are constructed based on users’ opinion on items along with their ratings. Proposed approach quantifies the opinions of users and results obtained reveal the feasibility.

Research output availability on academic social networks: implications for stakeholders in academic publishing

2017 ◽  
Vol 27 (2) ◽  
pp. 125-133 ◽  
Author(s):  
Mikael Laakso ◽  
Juho Lindman ◽  
Cenyu Shen ◽  
Linus Nyman ◽  
Bo-Christer Björk
Keyword(s):  
Social Networks ◽  
Research Output ◽  
Academic Publishing ◽  
Academic Social Networks

scholarly journals AANMF: Attribute-Aware Attentional Neural Matrix Factorization

2019 ◽  
Vol 48 (4) ◽  
pp. 682-693
Author(s):  
Bo Zheng ◽  
Jinsong Hu
Keyword(s):  
Matrix Factorization ◽  
Recommendation System ◽  
Auxiliary Information ◽  
Inner Product ◽  
Data Sets ◽  
It Projects ◽  
Real World Data ◽  
Latent Space ◽  
Almost All ◽  
Novel Model

Matrix Factorization (MF) is one of the most intuitive and effective methods in the Recommendation System domain. It projects sparse (user, item) interactions into dense feature products which endues strong generality to the MF model. To leverage this interaction, recent works use auxiliary information of users and items. Despite effectiveness, irrationality still exists among these methods, since almost all of them simply add the feature of auxiliary information in dense latent space to the feature of the user or item. In this work, we propose a novel model named AANMF, short for Attribute-aware Attentional Neural Matrix Factorization. AANMF combines two main parts, namely, neural-network-based factorization architecture for modeling inner product and attention-mechanism-based attribute processing cell for attribute handling. Extensive experiments on two real-world data sets demonstrate the robust and stronger performance of our model. Notably, we show that our model can deal with the attributes of user or item more reasonably. Our implementation of AANMF is publicly available at https://github.com/Holy-Shine/AANMF.

scholarly journals BSO-MV: An Optimized Multiview Clustering Approach for Items Recommendation in Social Networks

2021 ◽  
Vol 27 (7) ◽  
pp. 667-692
Author(s):  
Lamia Berkani ◽  
Lylia Betit ◽  
Louiza Belarif
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Data Sets ◽  
Large Scale Data ◽  
Recommendation Algorithms ◽  
Clustering Approach ◽  
Real World Datasets ◽  
Multiview Clustering ◽  
Improving Accuracy

Clustering-based approaches have been demonstrated to be efficient and scalable to large-scale data sets. However, clustering-based recommender systems suffer from relatively low accuracy and coverage. To address these issues, we propose in this article an optimized multiview clustering approach for the recommendation of items in social networks. First, the selection of the initial medoids is optimized using the Bees Swarm optimization algorithm (BSO) in order to generate better partitions (i.e. refining the quality of medoids according to the objective function). Then, the multiview clustering (MV) is applied, where users are iteratively clustered from the views of both rating patterns and social information (i.e. friendships and trust). Finally, a framework is proposed for testing the different alternatives, namely: (1) the standard recommendation algorithms; (2) the clustering-based and the optimized clustering-based recommendation algorithms using BSO; and (3) the MV and the optimized MV (BSO-MV) algorithms. Experimental results conducted on two real-world datasets demonstrate the effectiveness of the proposed BSO-MV algorithm in terms of improving accuracy, as it outperforms the existing related approaches and baselines.

scholarly journals Academic Social Networks: How the web is changing our way to make and communicate researches

2015 ◽  
Vol 7 (2) ◽  
pp. 3-14 ◽  
Author(s):  
Giovanni Bonaiuti
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Social Network Sites ◽  
Rapid Evolution ◽  
Scientific Field ◽  
Academic Social Network ◽  
Academic Social Networks ◽  
Insight Into ◽  
The Web ◽  
Natural Component

Abstract Networking is not only essential for success in academia, but it should also be seen as a natural component of the scholarly profession. Research is typically not a purely individualistic enterprise. Academic social network sites give researchers the ability to publicise their research outputs and connect with each other. This work aims to investigate the use done by Italian scholars of 11/D2 scientific field. The picture presented shows a realistic insight into the Italian situation, although since the phenomenon is in rapid evolution results are not stable and generalizable.

scholarly journals Recommendation System for Major University Determination Based on Student’s Profile and Interest

2017 ◽  
Vol 2 (1) ◽  
pp. 21-28 ◽  
Author(s):  
Desi Purwanti Kusumaningrum ◽  
Noor Ageng Setiyanto ◽  
Erwin Yudi Hidayat ◽  
Khafiizh Hastuti
Keyword(s):  
Recommendation System ◽  
Dropping Out ◽  
Prospective Students ◽  
National Education ◽  
Academic System ◽  
New Students ◽  
Education Statistics ◽  
Academic Information ◽  
The Relationship ◽  
Selection Of

Failure study on university students is one of the serious problems we face today. Data from the Centre for Education Statistics Research and Development of the Ministry of National Education Republic of Indonesia showed that the percentage of students graduate on time from 2001 to 2011 only reached 51.97%. In addition, cases of students dropping out at the beginning of the semester is also quite significant. One of the causes of failure of this study was the selection of major’s errors when applying to university. This study offers a selection subject recommendation system that builds on the profile data and student’s interest using the technique of Association Rule. Results of the rules of the relationship will then be matched with prospective students using questionnaires dynamic, so expect new students get recommendations more valid subject fit the profile and interest respectively. The system built on this research utilizes student data stored on the academic system of Dian Nuswantoro University. This model however can be adapted by all the universities that has a system of academic information. At the end of this system is expected to be used to minimize failures caused students study majors election mistakes

Sign in / Sign up

Export Citation Format

Share Document