Network Clustering Algorithm Based on Fast Detection of Central Node

Abstract

Based on scale-free and density-based complex networks and numerical clustering algorithm, a graph clustering algorithm based on fast detection of central nodes is proposed. Through the calculation of local density and comprehensive clustering of nodes in the network, the clustering center in the network can be found quickly and noncentral nodes can be divided into the clustering center according to the nearest neighbor principle, thus avoiding parameter limitations such as the number of clustering to be set in advance using conventional classic social network detection algorithm. The experimental comparison and analysis in the real network indicate that the graph clustering algorithm based on fast detection of the central node is highly effective and efficient.

Optimal Allocation of Fast Charging Station for Integrated Electric-Transportation System Using Multi-Objective Approach

“…In order to determine the optimal allocation of FCE, the proposed approach uses an arbitrary area, as depicted in Figure 1. Zones [45,46] are created inside the research area, such as zn 1 , zn 2 , zn 3 , and zn 4 , where the number of EVs is available in each zone [29].…”