FASTBEE: A Fast and Self-Adaptive Clustering Algorithm Towards to Edge Computing

With the rapid development of data explosion era, the cloud computing has been unable to process the massive data efficiently which forced on a urgent need for edge computing. Edge computing refers to a new type of computing model that performs computations on a large amount of data at the edge of a network. In order to improve the operating efficiency in the network, we put forward that applying a fast and self-adaptive clustering algorithm to the edge computing which helps the edge devices to distribute different types of data clustered to the cloud computing center. In our paper, we proposed the FASTBEE algorithm which is suitable for edge computing. The FASTBEE algorithm makes improvements on density collision and dynamic determination of density threshold by using gradient descent method to update the sum of squared errors formula. The proposed algorithm is extensively tested on several well-known datasets. The results proved the performance of our approach that its accuracy is 36 percent higher and it runs much faster compared with the CFSFDP algorithm and the DBSCAN algorithm.

[1]  Liangzhong Shen,et al.  Clustering Mixed Data by Fast Search and Find of Density Peaks , 2017 .

[2]  Mamdouh Refaat,et al.  Data Preparation for Data Mining Using SAS , 2006 .

[3]  Artem Cherkasov,et al.  Novel approaches for small biomolecule classification and structural similarity search , 2007, SKDD.

[4]  Pasi Fränti,et al.  Iterative shrinking method for clustering problems , 2006, Pattern Recognit..

[5]  J. Manyika.  Big data: The next frontier for innovation, competition, and productivity , 2011 .

[6]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[7]  Xindong Wu,et al.  Data mining with big data , 2014, IEEE Transactions on Knowledge and Data Engineering.

[8]  Zhang Mingxin,et al.  Research on Optimization of Clustering by Fast Search and Find of Density Peaks , 2016 .

[9]  Derya Birant,et al.  ST-DBSCAN: An algorithm for clustering spatial-temporal data , 2007, Data Knowl. Eng..

[10]  Ayman I. Kayssi,et al.  Edge computing enabling the Internet of Things , 2015, 2015 IEEE 2nd World Forum on Internet of Things (WF-IoT).

[11]  Dit-Yan Yeung,et al.  Robust path-based spectral clustering , 2008, Pattern Recognit..

[12]  Ejaz Ahmed,et al.  A survey on mobile edge computing , 2016, 2016 10th International Conference on Intelligent Systems and Control (ISCO).

[13]  Shi Hua-ji.  Text density clustering algorithm with optimized threshold values , 2011 .

[14]  Fei Wang,et al.  Supervised patient similarity measure of heterogeneous patient records , 2012, SKDD.

[15]  Sean Hughes,et al.  Clustering by Fast Search and Find of Density Peaks , 2016 .

[16]  Masao Fukushima,et al.  Regularized nonsmooth Newton method for multi-class support vector machines , 2007, Optim. Methods Softw..

[17]  Zhou Shui.  FDBSCAN: A Fast DBSCAN Algorithm , 2000 .

[18]  Khaled Ben Letaief,et al.  Joint Task Offloading Scheduling and Transmit Power Allocation for Mobile-Edge Computing Systems , 2017, 2017 IEEE Wireless Communications and Networking Conference (WCNC).

[19]  Yunchuan Sun,et al.  Adaptive fuzzy clustering by fast search and find of density peaks , 2015, 2015 International Conference on Identification, Information, and Knowledge in the Internet of Things (IIKI).

[20]  Aristides Gionis,et al.  Clustering Aggregation , 2005, ICDE.