Granular Partition and Concept Lattice Division Based on Quotient Space

Authors

  • Qiang Wu Department of Computer Science and Engineering, Shaoxing University, Shaoxing
  • Haiyan Shi Department of Computer Science and Engineering, Shaoxing University, Shaoxing
  • Liping Xie Mechanical and Electrical Engineering College, Shaoxing University, Shaoxing

Keywords:

Classification set, granule, quotient space, concept lattice, entropy

Abstract

In this paper, we investigate the relationship between the concept lattice and quotient space by granularity. A new framework of knowledge representation - granular quotient space - is constructed and it demonstrates that concept lattice classing is linked to quotient space. The covering of the formal context is firstly given based on this granule, then the granular concept lattice model and its construction are discussed on the sub-context which is formed by the granular classification set. We analyze knowledge reduction and give the description of granular entropy techniques, including some novel formulas. Lastly, a concept lattice constructing algorithm is proposed based on multi-granular feature selection in quotient space. Examples and experiments show that the algorithm can obtain a minimal reduct and is much more efficient than classical incremental concept formation methods.

Downloads

Download data is not yet available.

Downloads

Published

2018-11-21

How to Cite

Wu, Q., Shi, H., & Xie, L. (2018). Granular Partition and Concept Lattice Division Based on Quotient Space. COMPUTING AND INFORMATICS, 37(5), 1103–1125. Retrieved from http://www.cai.sk/ojs/index.php/cai/article/view/2018_5_1103