Big Data Mining and Analytics  2018, Vol. 01 Issue (03): 245-256    DOI: 10.26599/BDMA.2018.9020023
A Multi-granularity Decomposition Mechanism of Complex Tasks Based on Density Peaks
Ziling Pang, Guoyin Wang*, Jie Yang
Ziling Pang, Guoyin Wang, and Jie Yang are with the Chongqing Key Laboratory of Computational Intelligence, Chongqing University of Post and Telecommunication, Chongqing 400060, China. E-mail: woshi@pangziling.com; 530966074@qq.com.

Abstract

There are many algorithms for solving complex problems in supervised manner. However, unsupervised tasks are more common in real scenarios. Inspired by the idea of granular computing and the characteristics of human cognitive process, this paper proposes a complex tasks decomposition mechanism based on Density Peaks Clustering (DPC) to address complex tasks with an unsupervised process, which simulates the multi-granular observation and analysis of human being. Firstly, the DPC algorithm is modified to nullify its essential defects such as the difficulty of locating correct clustering centers and classifying them accurately. Then, the improved DPC algorithm is used to construct the initial decomposition solving space with multi-granularity theory. We also define subtask centers set and the granulation rules to guide the multi-granularity decomposing procedure. These rules are further used to decompose the solving space from coarse granules to the optimal fine granules with a convergent and automated process. Furthermore, comprehensive experiments are presented to verify the applicability and veracity of our proposed method in community-detection tasks with several benchmark complex social networks. The results show that our method outperforms other four state-of-the-art approaches.

Received: 08 September 2017      Published: 13 January 2020
Corresponding Authors: Guoyin Wang