TY - JOUR
T1 - Grouping granular structures in human granulation intelligence
AU - Qian, Yuhua
AU - Cheng, Honghong
AU - Wang, Jieting
AU - Liang, Jiye
AU - Pedrycz, Witold
AU - Dang, Chuangyin
PY - 2017/3
Y1 - 2017/3
N2 - Human granulation intelligence means that people can observe and analyze the same problem from various granulation points of view, which generally acknowledge an essential feature of human intelligence. Each granulation view can generate a granular structure through dividing a cognitive target into some meaningful information granules. This means that a large number of granular structures can be generated from the cognitive target. However, people can group these granular structures and select some representative ones for problem solving. This leads to an interesting research topic: how to efficiently and effectively group a family of granular structures. To address this issue, we first introduce a granular structure distance to measure the difference between two granular structures within a unified knowledge representation. Then, we propose a framework for grouping granular structures, called GGS algorithm, which is used to efficiently partition them. Moreover, two indices denoted as DIS and APD are also designed for evaluating the performance of a grouping result of granular structures. Finally, experiments carried out for nine data sets show that the GGS algorithm comes as a sound solution from perspectives of its convergence, effectiveness and scalability. In this way we have proposed and experimented with the general framework for discovering the structure inherent in granular structures, which can be afterwards used to simulate intelligent behavior of human's abilities of granular structure selection.
AB - Human granulation intelligence means that people can observe and analyze the same problem from various granulation points of view, which generally acknowledge an essential feature of human intelligence. Each granulation view can generate a granular structure through dividing a cognitive target into some meaningful information granules. This means that a large number of granular structures can be generated from the cognitive target. However, people can group these granular structures and select some representative ones for problem solving. This leads to an interesting research topic: how to efficiently and effectively group a family of granular structures. To address this issue, we first introduce a granular structure distance to measure the difference between two granular structures within a unified knowledge representation. Then, we propose a framework for grouping granular structures, called GGS algorithm, which is used to efficiently partition them. Moreover, two indices denoted as DIS and APD are also designed for evaluating the performance of a grouping result of granular structures. Finally, experiments carried out for nine data sets show that the GGS algorithm comes as a sound solution from perspectives of its convergence, effectiveness and scalability. In this way we have proposed and experimented with the general framework for discovering the structure inherent in granular structures, which can be afterwards used to simulate intelligent behavior of human's abilities of granular structure selection.
KW - Granular computing
KW - Granular structure
KW - Granular structure distance
KW - Granulation intelligence
KW - Knowledge representation
UR - http://www.scopus.com/inward/record.url?scp=85004009059&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85004009059&origin=recordpage
U2 - 10.1016/j.ins.2016.11.024
DO - 10.1016/j.ins.2016.11.024
M3 - RGC 21 - Publication in refereed journal
SN - 0020-0255
VL - 382-383
SP - 150
EP - 169
JO - Information Sciences
JF - Information Sciences
ER -