In reality we are always faced with a large number of complex massive databases. In this
work we introduce the notion of a homomorphism as a kind of tool to study data compression …

Rough set theory is an important technique to deal with vagueness and granularity in
information systems. In rough set theory, relation-based rough sets and covering-based …

Communication between information systems is a basic problem in granular computing. The
concept of homomorphism is a useful mathematical tool to study the communication …

Information granulation is an effective vehicle to explore data structure and has become a
timely research topic. In this article, a top-down granulation model (T-GrM) adhering to the …

Rough sets are efficient for data pre-processing in data mining. However, some important
problems such as attribute reduction in rough sets are NP-hard, and the algorithms to solve …

The attribute reduction algorithm based on fuzzy rough set theory is a commonly used
method for dealing with uncertain information. However, many existing attribute reduction …

Granular computing is an umbrella term to cover a series of theories, methodologies,
techniques, and tools that make use of information granules in complex problem solving …

In real applications, the feature set in a relation decision system often varies with time
resulting in a dynamic relation decision system where the existing attribute reduction …

When multiple granulated knowledge in multigranulation spaces are involved in decision
making, protocol principles are adopted to arrive at the final consensus. Multigranulation …

Covering rough sets generalize classical rough sets by relaxing partitions of the universe to
coverings. The existing research of covering rough sets mainly concentrates on comparing …