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

《山东大学学报(理学版)》 ›› 2021, Vol. 56 ›› Issue (1): 75-82.doi: 10.6040/j.issn.1671-9352.4.2020.149

• • 上一篇    

基于可能属性分析的粒描述

唐洁1,2,魏玲1,2*,任睿思1,2,赵思雨1,2,3   

  1. 1.西北大学数学学院, 陕西 西安 710127;2.西北大学概念、认知与智能研究中心, 陕西 西安 710127;3.咸阳师范学院数学与信息科学学院, 陕西 咸阳 712000
  • 发布日期:2021-01-05
  • 作者简介:唐洁(1995— ),女,硕士研究生,研究方向为形式概念分析、粗糙集理论和粒计算. E-mail:15385559385@163.com*通信作者简介:魏玲(1972— ),女,博士,教授,研究方向为形式概念分析、粗糙集理论和粒计算. E-mail:wl@nwu.edu.cn
  • 基金资助:
    国家自然科学基金资助项目(61772021,62006190);陕西省教育厅科研计划资助项目(19JK0929)

Granule description using possible attribute analysis

TANG Jie1,2, WEI Ling1,2*, REN Rui-si1,2, ZHAO Si-yu1,2,3   

  1. 1. School of Mathematics, Northwest University, Xian 710127, Shaanxi, China;
    2. Institute of Concepts, Cognition and Intelligence, Northwest University, Xian 710127, Shaanxi, China;
    3. College of Mathematics and Information Science, Xianyang Normal University, Xianyang 712000, Shaanxi, China
  • Published:2021-01-05

摘要: 粒计算是一种利用粒化信息的思想解决复杂问题的方法和有效工具。在粒化的过程中常常需要对粒进行描述,因此粒描述成为了粒计算的一个基本问题。本文在考虑基于必然属性分析的粒描述基础上,提出了基于可能属性分析的粒描述。首先,将面向属性概念的外延看作形式背景上的可定义粒,给出了可定义粒的描述方式;然后,利用概念的稳定性,给出概念的极小生成子对可定义粒进行精简化描述;最后,通过任务分配的例子说明基于可能属性分析的粒描述的优势。

关键词: 粒计算, 粒描述, 形式概念分析, 稳定性, 可能属性

Abstract: Granular computing is a method and effective tool of solving complicated problems by using information granularity. During the process of granularity, it is often accompanied with granule description, and granule description becomes a fundamental problem in granular computing. Inspired by necessary attribute analysis, this paper proposes granule description using possible attribute analysis. First, taking the extents of property oriented concepts as definable granules in the formal context, and defining the description of definable granule. Then, using the stability of concepts to define minimal generator of concept so that definable granules description becomes concise. Finally, the advantage of granule description using possible attribute analysis is discussed by an example of task assignment.

Key words: granular computing, granule description, formal concept analysis, stability, possible attribute

中图分类号: 

  • O29
[1] 王国胤,张清华,胡军.粒计算研究综述[J]. 智能系统学报, 2007, 2(6):8-26. WANG Guoyin, ZHANG Qinghua, HU Jun. Summary of research on granular computing[J]. Journal of Intelligent Systems, 2007, 2(6):8-26.
[2] ZHI Huilai, LI Jinhai. Granule description based on formal concept analysis[J]. Knowledge-Based Systems, 2016, 104:62-73.
[3] ZHI Huilai, LI Jinhai. Granule description based on positive and negative attributes[J]. Granular Computing, 2018(4):337-350.
[4] 智慧来,李金海.基于必然属性分析的粒描述[J]. 计算机学报,2018,41(12):68-85. ZHI Huilai, LI Jinhai. Granule description based on necessary attribute analysis[J]. Journal of Computer Science, 2018, 41(12):68-85.
[5] ZHI Huilai, LI Jinhai. Granule description based knowledge discovery from incomplete formal contexts via necessary attribute analysis[J]. Information Sciences, 2019, 485:347-361.
[6] WILLE R. Restructuring lattice theory: an approach based on hierarchies of concepts[C] //RIVAL I Ordered Sets. Reidel: Dordrecht-Boston, 1982: 445-470.
[7] GANTER B, WILLE R. Formal concept analysis: mathematical fundations[M]. New York: Springer-Verlag, 1999.
[8] 张文修,仇国芳. 基于粗糙集的不确定决策[M]. 北京: 清华大学出版社, 2005. ZHANG Wenxiu, QIU Guofang. Uncertain decision based on rough set[M]. Beijing: Tsinghua University Press, 2005.
[9] 张文修,姚一豫,梁怡. 粗糙集与概念格[M]. 西安: 西安交通大学出版社, 2006. ZHANG Wenxiu, YAO Yiyu, LEUNG Yee. Rough set and concept lattice[M]. Xian: Xian Jiaotong University Press, 2006.
[10] YAO Yiyu. A comparative study of formal concept analysis and rough set theory in data analysis[C] //Rough Sets and Current Trends in Computing, 4th International Conference, RSCTC 2004, Uppsala, Sweden, June 1-5, 2004. Berlin: Springer, 2004: 59-68.
[11] 张文修,梁怡,吴伟志.信息系统与知识发现[M]. 北京: 科学出版社, 2003. ZHANG Wenxiu, LEUNG Yee, WU Weizhi. Information system and knowledge discovery[M]. Beijing: Science Press, 2003.
[12] DÜNTSCH I, GEDIGA G. Modal-style operators in qualitative data analysis[M] //Proceedings of the 2002 IEEE International Conference on Data Mining. Maebashi: IEEE Transactions on Knowledge and Data Enginerring, 2002.
[13] KUZNETSOV S O. On stability of a formal concept[J]. Annals of Mathematics and Artificial Intelligence, 2007, 49(1/2/3/4):101-115.
[14] BABIN M A, KUZNETSOV S O. Approximating concept stability[C] //Proceedings of the 10th International Conference on Formal Concept Analysis. Berlin: Springer, 2012: 7-15.
[15] DAVEY B A, PRIESTLEY H A. Introduction to lattices and order[M]. New York: Cambridge University Press, 2002.
[1] 阳忠亮, 郭改慧. 一类带有B-D功能反应的捕食-食饵模型的分支分析[J]. 《山东大学学报(理学版)》, 2020, 55(7): 9-15.
[2] 李金海,贺建君,吴伟志. 多粒度形式概念分析的类属性块优化[J]. 《山东大学学报(理学版)》, 2020, 55(5): 1-12.
[3] 刘营营,米据生,梁美社,李磊军. 三支区间集概念格[J]. 《山东大学学报(理学版)》, 2020, 55(3): 70-80.
[4] 温晓,刘琪,高振,曾维新,吕咸青. 局部非侵入式约化基模型在瑞利-泰勒不稳定中的应用[J]. 《山东大学学报(理学版)》, 2020, 55(2): 109-117.
[5] 陈璐,张晓光. 一类自适应网络上的传染病模型研究[J]. 《山东大学学报(理学版)》, 2019, 54(9): 76-82.
[6] 王占平,袁恺英. 相对于余挠对的强Gorenstein内射模[J]. 《山东大学学报(理学版)》, 2019, 54(8): 102-107.
[7] 李粉宁,范敏,李金海. 形式概念分析中面向对象粒概念的动态更新[J]. 《山东大学学报(理学版)》, 2019, 54(4): 105-115.
[8] 李金海,吴伟志,邓硕. 形式概念分析的多粒度标记理论[J]. 《山东大学学报(理学版)》, 2019, 54(2): 30-40.
[9] 张瑜,赵仁育. Gorenstein FP-投射模及其稳定性[J]. 《山东大学学报(理学版)》, 2019, 54(12): 79-85.
[10] 钱婷,赵思雨,贺晓丽. 基于属性粒度研究决策形式背景的规则提取理论[J]. 《山东大学学报(理学版)》, 2019, 54(10): 113-120.
[11] 刘华,叶勇,魏玉梅,杨鹏,马明,冶建华,马娅磊. 一类离散宿主-寄生物模型动态研究[J]. 山东大学学报(理学版), 2018, 53(7): 30-38.
[12] 李翠平,高兴宝. 求解具有约束的l1-范数问题的神经网络模型[J]. 《山东大学学报(理学版)》, 2018, 53(12): 90-98.
[13] 冯孝周,徐敏,王国珲. 具有B-D反应项与毒素影响的捕食系统的共存解[J]. 《山东大学学报(理学版)》, 2018, 53(12): 53-61.
[14] 宋亮,冯金顺,程正兴. 多重Gabor框架的存在性与稳定性[J]. 山东大学学报(理学版), 2017, 52(8): 17-24.
[15] 李金海,吴伟志. 形式概念分析的粒计算方法及其研究展望[J]. 山东大学学报(理学版), 2017, 52(7): 1-12.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!