2011Unpublished venueRequires access

Evaluating node importance in complex networks based on factor analysis

Zhang Minqing, WuXuguang

Open publisher page 7 citations

Abstract

Objective and accurate assessment of each node importance is a basic and vital issue to research complex networks. Many algorithms and software tools have been developed, but most of them make use of single metric measurement, which is incomplete and limited to evaluate node importance in the real networks with large-scale nodes and complex relationships. In this paper, we propose a node importance evaluation method with multiple metric measurements. Factor analysis is used to explore the relationships of multiple measures, and avoid random subjective values in node importance calculation. Then the method proposed is applied to a complex network—“Les Misèrables” figure relations network, and compared with other typical algorithms such as PageRank and HITS. Experiment results show that the method has a good and reasonable value.

About this research paper

What this paper is about

Objective and accurate assessment of each node importance is a basic and vital issue to research complex networks. Many algorithms and software tools have been developed, but most of them make use of single metric measurement, which is incomplete and limited to evaluate node importance in the real networks with large-scale nodes and complex relationships. In this paper, we propose a node importance evaluation method with multiple metric measurements. Factor analysis is used to explore the relationships of multiple measures, and avoid random subjective values in node importance calculation. Then the method proposed is applied to a complex network—“Les Misèrables” figure relations network, and compared with other typical algorithms such as PageRank and HITS. Experiment results show that the method has a good and reasonable value.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Objective and accurate assessment of each node importance is a basic and vital issue to research complex networks. Many algorithms and software tools have been developed, but most of them make use of single metric measurement, which is incomplete and limited to evaluate node importance in the real networks with large-scale nodes and complex relationships. In this paper, we propose a node importance evaluation method with multiple metric measurements. Factor analysis is used to explore the relationships of multiple measures, and avoid random subjective values in node importance calculation. Then the method proposed is applied to a complex network—“Les Misèrables” figure relations network, and compared with other typical algorithms such as PageRank and HITS. Experiment results show that the method has a good and reasonable value.

Key concepts: PageRank, Computer science, Complex network, Node (physics), Metric (unit), Data mining, Factor (programming language), Software

Related papers

Back to paper searchBrowse research topicsOriginal source
Evaluating node importance in complex networks based on factor analysis — Research Paper | ScholarLens