您的位置:山东大学 -> 科技期刊社 -> 《山东大学学报(理学版)》

《山东大学学报(理学版)》 ›› 2025, Vol. 60 ›› Issue (7): 56-68.doi: 10.6040/j.issn.1671-9352.4.2024.210

• • 上一篇    

一种融合对象邻接关系的网络概念及其推荐应用

李晓兰1,3,刘忠慧1,3,闵帆1,2,3*   

  1. 1.西南石油大学计算机与软件学院, 四川 成都 610500;2.西南石油大学人工智能研究院, 四川 成都 610500;3.西南石油大学机器学习研究中心, 四川 成都 610500
  • 发布日期:2025-07-01
  • 通讯作者: 闵帆(1973— ),男,教授,博士生导师,博士,研究方向为粒计算、主动学习与多标签学习等. E-mail:minfan@swpu.edu.cn
  • 作者简介:李晓兰(2000— ),女,硕士研究生,研究方向为形式概念分析和网络形式背景. E-mail:lixiaolan513@163.com*通信作者:闵帆(1973— ),男,教授,博士生导师,博士,研究方向为粒计算、主动学习与多标签学习等. E-mail:minfan@swpu.edu.cn
  • 基金资助:
    国家自然科学基金资助项目(61976245);中央引导地方科技发展专项资助项目(2021ZYD0003);南充市校科技战略合作项目(23XNSYSX0062、23XNSYJG0054)

A network concept incorporated adjacency relationships between objects and its recommendation application

LI Xiaolan1,3, LIU Zhonghui1,3, MIN Fan1,2,3*   

  1. 1. School of Computer Science and Software Engineering, Southwest Petroleum University, Chengdu 610500, Sichuan, China;
    2. Institute for Artificial Intelligence, Southwest Petroleum University, Chengdu 610500, Sichuan, China;
    3. Lab of Machine Learning, Southwest Petroleum University, Chengdu 610500, Sichuan, China
  • Published:2025-07-01

摘要: 传统的概念仅包含对象和属性之间的关系,忽略了对象与对象之间的邻接关系,导致推荐效果不佳。为了解决这一问题,本文基于网络形式背景提出邻接网络(adjacency network, AN)概念,并设计了AN概念集构造方法和基于该概念集的推荐算法。设计AN概念由外延对象、邻接内涵和内涵属性组成,其中邻接内涵为外延对象的邻接节点。提出启发式构造算法,利用概念的容积作为启发式信息,生成AN概念集。采用不同的推荐策略,为外延对象和邻接内涵对象进行预推荐,通过推荐次数阈值判断实现最终推荐。本文在11个真实数据集上进行了实验,并将结果与经典的协同过滤算法和基于形式概念的推荐算法进行了比较。结果表明,本文提出的算法具有较好的推荐效果。

关键词: 网络形式背景, AN概念, 邻接内涵, 推荐置信度, 推荐系统

Abstract: The traditional concepts only include the relationship between objects and attributes, while the adjacency relationships between objects are ingored, resulting in poor recommendation performance. To solve this problem, the adjacency network concept based on the network formal context is proposed, and a method for constructing an AN concept set is designed, along with a recommendation algorithm based on this set. The AN concept is consisted of extent objects, adjacency intent and intent attributes. The adjacency intent is formed by adjacent nodes of extent objects. A heuristic construction algorithm is proposed, which utilizes the concept volume as heuristic information to construct the AN concept set. Different strategies are adopted to make the pre-recommendation for extent objects and adjacency intent objects. The final recommendation result is determined by the recommendation frequency threshold. The algorithm is verified on eleven real datasets. It is compared with the classical collaborative filtering algorithms and recommendation algorithms based on the formal concepts. The results show that our algorithm has better recommendation effect.

Key words: network formal context, adjacency network concept, adjacency intent, recommendation confidence, recommendation system

中图分类号: 

  • TP181
[1] WILLE R. Restructuring lattice theory: an approach based on hierarchies of concepts[C] //Ordered Sets. Berlin: Springer, 1982:445-470.
[2] LI Jinhai, HUANG Chenchen, QI Jianjun, et al. Three-way cognitive concept learning via multi-granularity[J]. Information Sciences, 2017, 378:244-263.
[3] DE MAIO C, FENZA G, GALLO M, et al. Toward reliable machine learning with congruity: a quality measure based on formal concept analysis[J]. Neural Computing and Applications, 2023, 35(2):1899-1913.
[4] PAK C H, KIM J H, JONG M G. Describing hierarchy of concept lattice by using matrix[J]. Information Sciences, 2021, 542:58-70.
[5] HASSAN B A, RASHID T A, MIRJALILI S. Formal context reduction in deriving concept hierarchies from corpora using adaptive evolutionary clustering algorithm star[J]. Complex & Intelligent Systems, 2021, 7(5):2383-2398.
[6] HU Qian, YUAN Zhong, Qin Keyun, et al. A novel outlier detection approach based on formal concept analysis[J]. Knowledge-Based Systems, 2023, 268:110486.
[7] PAN Lizheng, WANG Shunchao, YIN Zeming. Recognition of human inner emotion based on two-stage FCA-reliefF feature optimization[J]. Information Technology and Control, 2022, 51(1):32-47.
[8] MASICH I, REZOVA N, SHKABERINA G, et al. Subgroup discovery in machine learning problems with formal concepts analysis and test theory algorithms[J]. Algorithms, 2023, 16(5):246.
[9] WEI Ling, QI Jianjun, ZHANG Wenxiu, et al. Concept reduction and concept characteristics in formal concept analysis[J]. Scientia Sinica Informationis, 2020, 50(12):1817-1833.
[10] YANG Zheng, ZGANG Xi, DU Xianghua, et al. Dynamic knowledge discovery under the linguistic concept weighted network formal context based on three-way decision[C] //18th International Conference on Intelligent Systems and Knowledge Engineering, New Jersey: IEEE, 2023:465-470.
[11] LI Jinhai, MEI Changlin, LV Yuejin. Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction[J]. International Journal of Approximate Reasoning, 2013, 54(1):149-165.
[12] ZHI Huilai, LI Jinhai. Granule description based knowledge discovery from incomplete formal contexts via necessary attribute analysis[J]. Information Sciences, 2019, 485:347-361.
[13] ZHI Huilai, LI Jinhai, LI Yinan. Multilevel conflict analysis based on fuzzy formal contexts[J]. IEEE Transactions on Fuzzy Systems, 2022, 30(12):5128-5142.
[14] BENITEZ-CABALLERO M J, MEDINA J, RAMIREZ-POUSSA E, et al. Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis[J]. Fuzzy Sets and Systems, 2020, 391:117-138.
[15] 刘忠慧,姜帅,闵帆. 模糊概念集的启发式构造方法及其推荐应用[J]. 山东大学学报(理学版),2024,59(3):14-26. LIU Zhonghui, JIANG Shuai, MIN Fan. Heuristic construction method of fuzzy concept set and its recommended application[J]. Journal of Shandong University(Natural Science), 2024, 59(3):14-26.
[16] XU Weihua, LI Wentao. Granular computing approach to two-way learning based on formal concept analysis in fuzzy datasets[J]. IEEE Transactions on Cybernetics, 2014, 46(2):366-379.
[17] LI Jinhai, MEI Chenglin, XU Weihua, et al. Concept learning via granular computing: a cognitive viewpoint[J]. Information Sciences, 2015, 298:447-467.
[18] ZHI Huilai, LI Jinhai. Granule description of incomplete data: a cognitive viewpoint[J]. Cognitive Computation, 2022, 14(6):2108-2119.
[19] WEI Ling, QI Jianjun. Relation between concept lattice reduction and rough set reduction[J]. Knowledge-Based Systems, 2010, 23(8):934-938.
[20] 于洪,王国胤,姚一豫. 决策粗糙集理论研究现状与展望[J]. 计算机学报,2015,38(8):1628-1639. YU Hong, WANG Guoyin, YAO Yiyu. Current research and future perspectives on decision-theoretic rough sets[J]. Chinese Journal of Computers, 2015, 38(8):1628-1639.
[21] GRECO S, MATARAZZO B, SLOWINSKI R. Granular computing and data mining for ordered data: the dominance-based rough set approach[M] //Granular, Fuzzy, and Soft Computing. New York: Springer, 2023:117-145.
[22] YANG Sichun, LU Yuman, JIA Xiuyi, et al. Constructing three-way concept lattice based on the composite of classical lattices[J]. International Journal of Approximate Reasoning, 2020, 121:174-186.
[23] YAO Yiyu. Three-way granular computing, rough sets, and formal concept analysis[J]. International Journal of Approximate Reasoning, 2020, 116:106-125.
[24] GUO Doudou, XU Weihua, QIAN Yuhua, et al. Fuzzy-granular concept-cognitive learning via three-way decision: performance evaluation on dynamic knowledge discovery[J]. IEEE Transactions on Fuzzy Systems. 2024, 32(3):1409-1423.
[25] 马娜,范敏,李金海. 复杂网络下的概念认知学习[J]. 南京大学学报(自然科学),2019,55(4):609-623. MA Na, FAN Min, LI Jinhai. Concept-cognitive learning under complex network[J]. Journal of Nanjing University(Natural Sciences), 2019, 55(4):509-623.
[26] 范敏,罗杉,李金海. 基于变精度可能算子的网络概念认知[J]. 山东大学学报(理学版),2022,57(8):1-12. FAN Min, LUO Shan, LI Jinhai. Cognition of network concepts based on variable precision possibility operator[J]. Journal of Shandong University(Natural Science), 2022, 57(8):1-12.
[27] YAN Mengyu, LI Jinhai. Knowledge discovery and updating under the evolution of network formal contexts based on three-way decision[J]. Information Sciences, 2022, 601:18-38.
[28] FAN Min, LUO Shan, LI Jinhai. Network rule extraction under the network formal context based on three-way decision[J]. Applied Intelligence, 2023, 23:5126-5146.
[29] ZOU Caifeng, ZHANG Daqiang, WAN Jiafu, et al. Using concept lattice for personalized recommendation system design[J]. IEEE Systems Journal, 2015, 11(1):305-314.
[30] ZHAO Xuejian, LI Hao, TANG Haotian. Recommendation rating prediction algorithm based on user interest concept lattice reduction[J]. Journal of Computer Applications, 2023, 43(11):3340.
[31] HUANG Wenqing, HAO Fei, PANG Guangyao. Complementary context-enhanced concept lattice aware personalized recommendation[C] //IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications(TrustCom), New Jersey: IEEE, 2021:919-926.
[32] LIU Zhonghui, ZHAO Qi, ZHOU Lu, et al. A heuristic concept construction approach to collaborative recommendation[J]. International Journal of Approximate Reasoning, 2022, 149:116-132.
[33] 刘忠慧,陈建宇,宋国杰,等. 基于模拟退火法的概念集构造算法[J]. 模式识别与人工智能,2021,34(8):723-732. LIU Zhonghui, CHEN Jianyu, SONG Guojie, et al. Construction algorithm of concept set based on simulated annealing algorithm[J]. Pattern Recognition and Artificial Intelligence, 2021, 34(8):723-732.
[34] 刘忠慧,李鑫,闵帆. 内涵粗糙三支概念及个性化推荐[J]. 西北大学学报(自然科学版),2022,52(5):774-783. LIU Zhonghui, LI Xin, MIN Fan. Three-way concept with rough intent and its application in personalized recommendation[J]. Journal of Northwest University(Natural Science Edition), 2022, 52(5):774-783.
[35] 范敏,张洁,李金海. 基于弱概念相似度的组推荐方法[J]. 数据采集与处理,2023,38(2):439-450. FAN Min, ZHANG Jie, LI Jinhai. Group recommendation method based on weaken-concept similarity[J]. Journal of Data Acquisition and Processing, 2023, 38(2):439-450.
[36] 范敏,郭瑞欣,李金海. 网络决策形式背景下基于因果力的邻域推荐算法[J]. 模式识别与人工智能,2022,35(11):977-988. FAN Min, GUO Ruixin, LI Jinhai. Neighborhood recommendation algorithm based on causality force under network formal decision context[J]. Pattern recognition and Artificial Intelligence, 2022, 35(11):977-988.
[37] BELOHLAVEK R, VYCHODIL V. Discovery of optimal factors in binary data via a novel method of matrix decomposition[J]. Journal of Computer and System Sciences, 2010, 76(1):3-20.
[38] 刘文星,范敏,李金海. 网络形式背景下的社区划分方法研究[J]. 计算机科学与探索,2021,15(8):1441-1449. LIU Wenxing, FAN Min, LI Jinhai. Research on community division method under network formal context[J]. Journal of Frontiers of Computer Science and Technology, 2021, 15(8):1441-1449.
[1] 杨纪元,马沐阳,任鹏杰,陈竹敏,任昭春,辛鑫,蔡飞,马军. 基于自监督的预训练在推荐系统中的研究[J]. 《山东大学学报(理学版)》, 2024, 59(7): 1-26.
[2] 范敏,秦琴,李金海. 基于三支因果力的邻域推荐算法[J]. 《山东大学学报(理学版)》, 2024, 59(5): 12-22.
[3] 刘忠慧,姜帅,闵帆. 模糊概念集的启发式构造方法及其推荐应用[J]. 《山东大学学报(理学版)》, 2024, 59(3): 14-26.
[4] 戚丽丽,孙静宇*,陈俊杰. 基于均模型的IBCF算法研究[J]. J4, 2013, 48(11): 105-110.
[5] 孙静宇,陈俊杰*,余雪丽,何秀. 基于CBR的协同Web搜索模型及应用研究[J]. J4, 2012, 47(5): 19-24.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!