A model to address the cold-start in peer recommendation by using k-means clustering and sentence embedding

被引:0
|
作者
Shukla, Deepika [1 ]
Chowdary, C. Ravindranath [1 ]
机构
[1] Indian Inst Technol BHU, Dept Comp Sci & Engn, Varanasi 221005, India
关键词
Cold-start problem; Peer recommendation; k-means clustering; Recommender system;
D O I
10.1016/j.jocs.2024.102465
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In academia, research collaboration plays a vital role in enhancing the research quality and enriching academic profile of the authors. Recommending appropriate collaborators from a vast scholarly database, particularly for newcomers, poses a challenging cold-start problem. This study addresses a cold-start problem in peer recommendation, considering a dynamic coauthorship graph as a network structure of academic collaborators. As the coauthorship graph is quite large and complex, an efficient indexing method is essential for speeding up the initial search of similar coauthors. The study introduces an efficient Global Inverted List ( GIL ) for indexing research areas and active authors in the coauthorship network. An attribute-based search and filtering mechanism is proposed to identify relevant collaborators, followed by the application k-means clustering and doc2vec metrics to rank and select top recommendations. A cold user is associated with attributes that identify coauthors with similar research interests. For each attribute of the cold user, model searches the associated authors from the GIL. Further, two filtering approaches are applied to refine retrieved author list. The first ensures that the authors have a significant presence in the specified research areas, whereas the second one helps avoid recommending authors with only superficial connections to cold user. The model creates a feature matrix of filtered authors using the publication features of authors. k-means clustering applied to the feature matrix generates k clusters, among which the model chooses those with seed nodes i.e. the clusters which are having seed nodes are selected for further process. Selected clusters are ranked using doc2vec metrics, with the top-ranked cluster providing the final recommendation. model recommends the top L members of the selected cluster, where L is the length of the recommendations provided to the new user. Our extensive experiments show the efficacy of the proposed model.
引用
收藏
页数:12
相关论文
共 50 条
  • [21] Embedding Guarantor: Knowledge-Enhanced Graph Learning for New Item Cold-Start Recommendation
    Zhang, Zhipeng
    Zhu, Youfu
    Dong, Mianxiong
    Ota, Kaoru
    Zhang, Yao
    Ren, Yonggong
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2025,
  • [22] MetaEM: Meta Embedding Mapping for Federated Cross-domain Recommendation to Cold-Start Users
    Zheng, Dongyi
    Guo, Yeting
    Liu, Fang
    Xiao, Nong
    Gao, Lu
    COLLABORATIVE COMPUTING: NETWORKING, APPLICATIONS AND WORKSHARING, COLLABORATECOM 2022, PT I, 2022, 460 : 154 - 172
  • [23] ML2E: Meta-Learning Embedding Ensemble for Cold-Start Recommendation
    Wang, Huiwei
    Zhao, Yong
    IEEE ACCESS, 2020, 8 : 165757 - 165768
  • [24] A Multimodal Single-Branch Embedding Network for Recommendation in Cold-Start and Missing Modality Scenarios
    Ganhoer, Christian
    Moscati, Marta
    Hausberger, Anna
    Nawaz, Shah
    Schedl, Markus
    PROCEEDINGS OF THE EIGHTEENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS, RECSYS 2024, 2024, : 380 - 390
  • [25] Statistical Shape Model Generation Using K-means Clustering
    Wu, Jiaqi
    Li, Guangxu
    Lu, Huimin
    Kim, Hyoungseop
    PROCEEDINGS OF 2018 INTERNATIONAL CONFERENCE ON ELECTRONICS AND ELECTRICAL ENGINEERING TECHNOLOGY (EEET 2018), 2018, : 207 - 211
  • [26] Using semantic web to reduce the cold-start problems in recommendation systems
    Nouali, Omar
    Belloui, Amokrane
    2009 SECOND INTERNATIONAL CONFERENCE ON THE APPLICATIONS OF DIGITAL INFORMATION AND WEB TECHNOLOGIES (ICADIWT 2009), 2009, : 525 - 530
  • [27] Deep transfer learning with multimodal embedding to tackle cold-start and sparsity issues in recommendation system
    Jafri, Syed Irteza Hussain
    Ghazali, Rozaida
    Javid, Irfan
    Mahmood, Zahid
    Hassan, Abdullahi Abdi Abubakar
    PLOS ONE, 2022, 17 (08):
  • [28] Soil data clustering by using K-means and fuzzy K-means algorithm
    Hot, Elma
    Popovic-Bugarin, Vesna
    2015 23RD TELECOMMUNICATIONS FORUM TELFOR (TELFOR), 2015, : 890 - 893
  • [29] Cold-Start Recommendation Using Bi-Clustering and Fusion for Large-Scale Social Recommender Systems
    Zhang, Daqiang
    Hsu, Ching-Hsien
    Chen, Min
    Chen, Quan
    Xiong, Naixue
    Lloret, Jaime
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2014, 2 (02) : 239 - 250
  • [30] Approximate Distributed K-Means Clustering over a Peer-to-Peer Network
    Datta, Souptik
    Giannella, Chris R.
    Kargupta, Hillol
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2009, 21 (10) : 1372 - 1388