Set-based granular computing: A lattice model

doi:10.1016/j.ijar.2013.11.001

2014-03-01

DOI：10.1016/j.ijar.2013.11.001

原文链接

查看原文

摘要

En 中文

Set-based granular computing plays an important role in human reasoning and problem solving. Its three key issues constitute information granulation, information granularity and granular operation. To address these issues, several methods have been developed in the literature, but no unified framework has been formulated for them, which could be inefficient to some extent. To facilitate further research on the topic, through consistently representing granular structures induced by information granulation, we introduce a concept of knowledge distance to differentiate any two granular structures. Based on the knowledge distance, we propose a unified framework for set-based granular computing, which is named a lattice model. Its application leads to desired answers to two key questions: (1) what is the essence of information granularity, and (2) how to perform granular operation. Through using the knowledge distance, a new axiomatic definition to information granularity, called generalized information granularity is developed and its corresponding lattice model is established, which reveal the essence of information granularity in set-based granular computing. Moreover, four operators are defined on granular structures, under which the algebraic structure of granular structures forms a complementary lattice. These operators can effectively accomplish composition, decomposition and transformation of granular structures. These results show that the knowledge distance and the lattice model are powerful mechanisms for studying set-based granular computing. (C) 2013 Elsevier Inc. All rights reserved.

Keyword:

Granular computing

Rough set theory

Knowledge distance

Information granularity

Operator