: There is new material regarding Neo4j algorithm questions posed in this report as well as where we did our due diligence research to resolve them. These results often provide details, including inquiries recorded after each monitoring period. Initially, a literature review supported the development of an initial data modeling, which was further provided as experimental analysis. By using Neo4j Graph Database, graph analytics can provide useful analysis.

Scientific Data Analysis using Neo4j

Hierarchical clustering algorithms based on node similarity have been widely used in community detection, but it is not suitable for signed networks. The typical signed network community detection algorithm has the problem of low community division rate from different nodes. Based on the similarity of nodes, this paper proposes the CDNS algorithm (Community Detection Algorithm based on Node Similarity in Signed Networks). Firstly, the algorithm proposes a node influence measure suitable for signed networks as the basis for selecting the initial node of the community. Secondly, it proposes the calculation of the node similarity based on the eigenvector centrality, and selects the node with the highest similarity from the initial node from the neighbour nodes to form the initial community. Finally, according to the community contribution of neighbour nodes, algorithm determines whether the neighbour nodes are joined in the community and in which order the neighbour nodes are joined in the community. The experiments of real signed network and simulated signed network prove that the CDNS algorithm has good accuracy and efficiency.

Jie Ren

Papers

Community Detection Algorithm based on Node Similarity in Signed Networks