CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Granularity measures and complexity measures of partition-based granular structures
Authors
Matthew X. Yao
Publication date
1 January 2019
Publisher
'Elsevier BV'
Doi
Cite
Abstract
The final publication is available at Elsevier via https://dx.doi.org/10.1016/j.knosys.2018.10.015 © 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/Granular computing is an emerging field of study in which the complexity of problem solving is reduced through granulation. Researchers have proposed various granularity measures of partitions to quantify the effects of granulation with respect to simplification. However, two important issues still remain and require careful investigation. The first issue is that a partition is only a simple two-level granular structure, which may not be sufficient for the full scope of granular computing. The second issue is a clarification of the differences between granularity and complexity. Although they are related to each other, they represent different things. To address the two issues, this paper makes three contributions. First, we extend the partition granulation scheme into multilevel granular structures based on progressive partitioning. Second, we propose a complexity measure of a partition that incorporates both the block-level interactions (interactions within a block) and the partition-level interactions (interactions between blocks of the partition). Third, we generalize the complexity measure to multilevel granular structures generated from a progressive partitioning process
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
University of Waterloo's Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:uwspace.uwaterloo.ca:10012...
Last time updated on 08/01/2019