A heuristic concept construction approach to collaborative recommendation

被引:13
作者
Liu, Zhong-Hui [1 ]
Zhao, Qi [1 ]
Zou, Lu [1 ]
Xu, Wei-Hua [2 ]
Min, Fan [1 ,3 ]
机构
[1] Southwest Petr Univ, Sch Comp Sci, Chengdu 610500, Peoples R China
[2] Southwest Univ, Coll Artificial Intelligence, Chongqing 400715, Peoples R China
[3] Southwest Petr Univ, Inst Artificial Intelligence, Chengdu 610500, Peoples R China
基金
中国国家自然科学基金;
关键词
Formal concept analysis; Heuristic algorithm; Local popularity; Recommender system; CONCEPT LATTICE REDUCTION; FORMAL CONCEPT ANALYSIS;
D O I
10.1016/j.ijar.2022.04.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Formal concept analysis was first used in collaborative filtering for over one decade. Popular approaches are based on superconcept-subconcept relationship or boolean matrix factorization. In this paper, we design a heuristic approach to construct a set of approximately strong concepts for recommendation. Here strong refers to not only big intent to ensure the similarity among users, but also big extent to ensure the stability of user groups. First, we use the intent threshold as the constraint and the area as the optimization objective to obtain approximately strong concepts. Second, we generate pre recommendations based on the local popularity of the items implied by each concept. Finally, we determine the actual recommendation according to the number of times the item is pre-recommended to the user. Experiments have been undertaken on five popular datasets with different versions. Results show that our algorithm has lower runtime and/or higher recommendation quality compared with approaches based on concept lattice, matrix factorization, k-nearest neighbors, item-based collaborative filtering and boolean matrix factorization. (C)& nbsp;2022 Elsevier Inc. All rights reserved.
引用
收藏
页码:119 / 132
页数:14
相关论文
共 53 条
  • [1] [Anonymous], 2009, COMPUT SCI
  • [2] Belohlávek R, 2005, IEEE INT CONF FUZZY, P663
  • [3] Similarity relations in concept lattices
    Belohlávek, R
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2000, 10 (06) : 823 - 845
  • [4] Discovery of optimal factors in binary data via a novel method of matrix decomposition
    Belohlavek, Radim
    Vychodil, Vilem
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (01) : 3 - 20
  • [5] Constraint-based concept mining and its application to microarray data analysis
    Besson, Jeremy
    Robardet, Celine
    Boulicaut, Jean-Francois
    Rome, Sophie
    [J]. INTELLIGENT DATA ANALYSIS, 2005, 9 (01) : 59 - 82
  • [6] [陈昊文 Chen Haowen], 2017, [小型微型计算机系统, Journal of Chinese Computer Systems], V38, P2553
  • [7] Collaborative recommending using formal concept analysis
    du Boucher-Ryan, Patrick
    Bridge, Derek
    [J]. KNOWLEDGE-BASED SYSTEMS, 2006, 19 (05) : 309 - 315
  • [8] INCREMENTAL CONCEPT-FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES
    GODIN, R
    MISSAOUI, R
    ALAOUI, H
    [J]. COMPUTATIONAL INTELLIGENCE, 1995, 11 (02) : 246 - 267
  • [9] Grigoriev PA, 2004, LECT NOTES ARTIF INT, V2961, P386
  • [10] Hu L.-H., 2006, COMPUT INTELL-US, V4114