JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2014, Vol. 49 ›› Issue (08): 15-21.doi: 10.6040/j.issn.1671-9352.1.2014.207

Previous Articles     Next Articles

Dynamic reduction theory for interval concept lattice based on covering and its realization

ZHANG Chun-ying, WANG Li-ya, LIU Bao-xiang   

  1. College of Science, Hebei United University, Tangshan 063009, Hebei, China
  • Received:2014-06-02 Revised:2014-07-08 Online:2014-08-20 Published:2014-09-24

PDF (PC)

918

Abstract: The structure of interval concept lattice is complex and the lattice built by the existing construction algorithm has the problem of concept redundancy. To reduce the redundancy of interval concepts, a dynamic reduction method for interval concept lattice is put forward which starts from a formal context directly. Firstly, the similarity degree of the binary relations and covering-neighborhood-space are defined which could ensure that the compressed lattice still can reflect the relationship between concepts. Secondly, according to the reduction operators, the compressed concept is acquired. Thirdly, it is proved that the reduced interval concept set is a subset of the original. Then, it built the dynamic reduction model for interval concept lattice based on the covering-neighborhood-space and reduction operators. The number of concepts in lattice is controlled by the threshold value of similarity class which can realize the dynamic of reduction. Finally, the correctness of model and the high efficiency of reduction are shown by a case study.

Key words: interval concept lattice, similarity degree of relationship, covering-neighborhood-space

CLC Number: 

  • TP301.6
[1] WILLE R. Restructuring lattice theory: an approach based on hierarchies of concepts[M]//Formal Concept Analysis Lecture Notes in Computer Science. Reidel I. Boston: D. Reidel Publishing Company, 1982: 445-470.
[2] 杨海峰,张继福.粗糙概念格及构造算法[J].计算机工程与应用,2007,43(24):172-175. YANG Haifeng,ZHANG Jifu. Rough concept lattice and construction arithmetic[J]. Computer Engineering and Applications, 2007, 43(24):172-175.
[3] 刘宗田,强宇,周文,等. 一种模糊概念格模型及其渐进式构造算法[J].计算机学报,2007,30:184-188. LIU Zongtian, QIANG Yu, ZHOU Wen, et al. A fuzzy concept lattice model and its incremental construction algorithm[J]. Chinese Journal of Computers, 2007, 30:184-188.
[4] 张继福,张素兰.加权概念格及其渐进式构造[J].模式识别与人工智能,2005,18(2):171-176. ZHANG Jifu, ZHANG Sulan, ZHENG Lian. Weighted concept lattice and incremental construction[J]. Pattern Recognition and Artificial Intelligence, 2005, 18(2):171-176.
[5] 刘保相,张春英.一种新的概念格结构--区间概念格[J].计算机科学,2012,39(8):273-277. LIU Baoxiang, ZHANG Chunying. New concept lattice structure--interval concept lattice[J]. Computer Science, 2012, 39(8):273-277.
[6] CHUNG K S K, VOGEL D. Complexity reduction in lattice based information retrieval[J]. Information Retrieval, 2005, 8:285-299.
[7] ZHANG Wenxiu, Wei Ling, Qi Jianjun. Attribute reduction in concept lattice based on discernibility matrix[C]//SLEZAK D. Lecture Notes in Artificial Intelligence Proceedings of RSFDGrC. Canada: Springer, 2005: 157-165.
[8] 王霞,张文修.概念格的属性约简与属性特征[J].计算机工程与应用,2008,44(12):1-4. WANG Xia, ZHANG Wenxiu. Attribute reduction in concept lattices and attribute characteristics[J]. Computer Engineering and Applications,2 008, 44(12):1-4.
[9] KUMAR A C, SPRINIVAS S. Concept lattice reduction using K-means clustering[J]. Expert Systems with Applications, 2010, 37(3):2696-2704.
[10] 魏玲,李强.面向属性概念格基于覆盖的压缩[J].电子科技大学学报,2012,41(2):299-304. WEI Ling, LI Qiang. Covering-based reduction of property-oriented concept lattices[J]. Journal of University of Electronic Science and Technology of China, 2012, 41(2):299-304.
[11] 陈永平,杨思春.面向对象概念格的压缩[J].计算机工程与应用,2013,49(19):119-122. CHEN Yongping, YANG Sichun. Reduction of object-oriented concept lattices[J]. Computer Engineering and Applications, 2013, 49(19):119-122.
[12] 张春英, 王立亚. 基于属性集合幂集的区间概念格Lβα的渐进式生成算法[J].计算机应用研究,2014,31(3):731-734. ZHANG Chunying, WANG Liya. Incremental construction algorithm based on attribute power set for interval concept lattice Lβα[J]. Application Research of Computers, 2014, 31(3):731-734.
[13] ZHU William. Relationship between generalized rough sets based on binary and covering[J]. Information Science, 2009, 179:210-225.
[1] . Graph model based trustworthy resource scheduling algorithm in cloud environment [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(1): 63-74.
[2] XIE Jian-min, YAO Bing, ZHAO Ting-gang. An algorithm and its implementation for odd-elegant labeling of general sun graph Sm,n [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(4): 79-85.
[3] ZHENG Xiang-Wei,LIU Hong . A diversity-guided two stages multi-objective particle swarm optimizer [J]. J4, 2008, 43(11): 5-10 .
[4] SONG Le-hui,CHENG Yue-gui,PAN Meng . A hybrid evolutionary modeling algorithm for dynamic systems [J]. J4, 2008, 43(11): 27-30 .
[5] YUAN Xiao-hang,DU Xiao-yong . iRIPPER: an improved rule-based text categorization algorithm [J]. J4, 2007, 42(11): 66-68 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd