JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2018, Vol. 53 ›› Issue (8): 17-24.doi: 10.6040/j.issn.1671-9352.4.2018.052

Previous Articles     Next Articles

Composition and structure on attribute reduction of interval-set concept lattices

ZHANG En-sheng   

  1. College of Mathematics and Information Science, Anshan Normal University, Anshan 114007, Liaoning, China
  • Received:2018-04-15 Online:2018-08-20 Published:2018-07-11

Abstract: Interval-set provides a research tool for processing partially known concepts and for approximating undefinable or complex concepts. Concept lattices is a powerful tool for data analysis in machine learning, data mining, knowledge discovery, information retrieval, and so on. Interval-set concept lattices is the product of the combination concept lattices and the interval-set theory,which is a powerful tool for data analysis in machine learning, data mining, knowledge discovery and information retrieval on the information systems of partially known concepts or undefinable concepts. The attribute reduction of interval-set concept lattices is a kind of the method which reveals the elementary character of interval-set concept lattices attribute. This paper reveals the composition and structure of the attribute reduction of interval-set concept lattices. The equivalence relative necessary attributes are not in the same attribute reduction; and the intersection of attribute reduction and any relative necessary attribute equivalence class is nonempty. The set of the core attributes and the relative necessary attributes chosen by taking an attribute from each relative necessary attribute equivalence class must be an attribute reduction.

Key words: interval-set, interval-set concept lattices, attribute reduction

CLC Number: 

  • TP18
[1] WILLE R. Restructuring lattice theory: an approach based on hierarchies of concepts[M]. Dordrecht: Reidel Publishing Company, 1982: 445-470.
[2] 张文修,魏玲,祁建军. 概念格的属性约简理论与方法[J]. 中国科学(信息科学),2005,35(6):628-639. ZHANG Wenxiu, WEI Ling, QI Janjun. Attribute reduction theory and approach to concept lattice[J]. Science in China(Information Sciences), 2005, 35(6):628-639.
[3] YAO Y Y. Interval-set algebra for qualitative knowledge representation[C] // Proceedings of the 5th International Conference on Computing and Information. Washington: IEEE, 1993: 370-374.
[4] YAO Y Y. Comparison of rough-set an interval-set models for uncertain Reasoning[J]. Fundamenta Informaticae, 1996, 27:289-298.
[5] YAO Y Y, WANG J. Interval sets and interval-set algebras[C] // Proceedings of the 8th IEEE International Conference on Cognitive Informatics. Washington: IEEE, 2009: 307-314.
[6] 姚一豫. 区间集: 云模型与粒计算[M]. 北京:科学出版社, 2012: 74-81. YAO Yiyu. Interval sets: cloud model and granular computing[M]. Beijing: Science Press, 2012: 74-81.
[7] 李金海. 形式背景与概念格: 形式概念分析理论与应用[M]. 北京:科学出版社,2016: 2-3. LI Jinhai. Formal context and concept lattice: formal concept analysis theory and application[M]. Beijing: Science Press, 2016: 2-3.
[8] 马建敏. 区间集概念格: 形式概念分析理论与应用[M]. 北京:科学出版社,2016: 69-79. MA Jianmin. Interval-set concept lattice: formal concept analysis theory and application[M]. Beijing: Science Press, 2016: 69-79.
[9] 张恩胜,顾红生,刘德仁. 形式概念格属性约简集的组成与结构[J]. 广西师范大学学报(自然科学版),2008,26(1):166-169. ZHANG Ensheng, GU Hongsheng, LIU Deren. Structure of attribute reduction set of concept lattices[J]. Journal of Guangxi Normal University(Natural Science Edition), 2008, 26(1):166-169.
[1] LI Tong-jun, HUANG Jia-wen, WU Wei-zhi. Attribute reduction of incomplete contexts based on similarity relations [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(8): 9-16.
[2] ZUO Zhi-cui, ZHANG Xian-yong, MO Zhi-wen, FENG Lin. Block discernibility matrix based on decision classification and its algorithm finding the core [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(8): 25-33.
[3] HU Qian, MI Ju-sheng, LI Lei-jun. The fuzzy belief structure and attribute reduction based on multi-granulation fuzzy rough operators [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(7): 30-36.
[4] CHEN Xue, WEI Ling, QIAN Ting. Attribute reduction in formal decision contexts based on AE-concept lattices [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(12): 95-103.
[5] HUANG Wei-ting, ZHAO Hong, ZHU William. Adaptive divide and conquer algorithm for cost-sensitive attribute reduction [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(8): 98-104.
[6] FENG Lin1,2, LUO Feng3, FANG Dan3, YUAN Yong-le1. Approaches for attribute core and attribute reduction based on an  improved extended positive region [J]. J4, 2012, 47(1): 72-76.
[7] ZHANG Ling-jun, XU Jiu-cheng, LI Shuang-qun, LI Xiao-yan. Numerical attribute reduction of mutex neighborhood covering rough set theory [J]. J4, 2012, 47(1): 77-82.
[8] DING Wei-ping1,2,3, WANG Jian-dong2, DUAN Wei-hua2, SHI Quan1. Research of cooperative PSO for attribute reduction optimization [J]. J4, 2011, 46(5): 97-102.
[9] YU Cheng-yi, LI Jin-jin*. β lower approximation attribute reduction in variable precision rough sets [J]. J4, 2011, 46(11): 17-21.
[10] YE Ming-quan1,2, HU Xue-gang1, WU Chang-rong3. Privacy preserving attribute reduction based on conditional information entropy over vertically partitioned multi-decision tables [J]. J4, 2010, 45(9): 14-19.
[11] WANG Bin-di, WEI Ling. The reduction theory of concept lattice based on its associated lattice [J]. J4, 2010, 45(9): 20-26.
[12] LI Jin-jin1, ZHANG Yan-lan2, XU Qing-yuan2. Reduction in general consistent approximate representation space [J]. J4, 2010, 45(10): 109-115.
[13] BAI Ru-jiang,WANG Xiao-yue . AA hybrid classifier based on the rough sets and BPneural networks [J]. J4, 2006, 41(3): 70-75 .
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!