Journal
INFORMATION SCIENCES
Volume 213, Issue -, Pages 1-13Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2012.05.021
Keywords
Expected granularity; Granular computing; Granularity; Hartley entropy; Information theory; Partition lattice
Categories
Funding
- NSERC Canada
- Basic Research Program of Education Office of Jiangsu Province, China [07KJA52004]
- Natural Science Foundation of Jiangsu Province, China [BK2009349]
Ask authors/readers for more resources
Measurement of granularity is one of the foundational issues in granular computing. This paper investigates a class of measures of granularity of partitions. The granularity of a set is defined by a strictly monotonic increasing transformation of the cardinality of the set. The granularity of a partition is defined as the expected granularity of all blocks of the partition with respect to the probability distribution defined by the partition. Many existing measures of granularity are instances of the proposed class. New measures of granularity of partitions are also introduced. (C) 2012 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
