Closeness Centrality

Overview

Closeness centrality of a node is a measure of centrality in a network, calculated as the reciprocal of the sum of the length of the shortest paths between the node and all other reachable nodes in a graph. It can be used to measure the time for transmitting information from this node to other nodes. The bigger the node's Closeness Centrality is, the more central the location of the node will be.

Application Scenarios

This algorithm is used in key node mining in social networking.

Parameter Description

**Table 1** Closeness Centrality algorithm parameters
Parameter	Mandatory	Description	Type	Value Range	Default Value
source	Yes	Enter the ID of the node to be calculated.	String	-	-

Example

Set parameter source to Lee to calculate the closeness centrality of the Lee node. The JSON result is displayed in the query result area.

Parent topic: Algorithms

Previous topic: n-Paths

Next topic: Label Propagation

Feedback

Was this page helpful?

Helpful Not helpful

Provide feedback

Thank you very much for your feedback. We will continue working to improve the documentation.

The system is busy. Please try again later.

Which of the following issues have you encountered?

Content is inconsistent with the product UI

Unclear descriptions

Lack of examples or code

Incorrect steps

Can't find what I need

Lack of best practices

Feedback (optional)

0/500

Select at least one type of issue, and enter your comments or suggestions.

Enter a maximum of 500 characters.

Submit Cancel