2008•Unpublished venueRequires access

A hypergraph model of granular computing

Guang Chen, Ning Zhong, Yiyu Y. Yao

Abstract

A hypergraph model of granular computing is proposed. In this model, a vertex refers to an object, a hyperedge corresponds to a granule, a hypergraph relates to a set of granules and their relations in a specific granularity, and a series of hypergraphs correspond to a hierarchical structure. The mapping between hypergraphs presents the relations of the granules in different levels. One can solve a problem by focusing on different levels of details, and move easily among different levels at various stages. Based on our discussion, the hypergraph model is an effective representation method of granular structures and a useful way for problem solving.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 30 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Hypergraph, Granular computing, Granularity, Computer science, Theoretical computer science, Vertex (graph theory), Representation (politics), Set (abstract data type)