Link Analysis: Closeness centrality of anodes in a directed and undirected graph

The lecture explains closeness centrality as a type of link analysis. Centrality can be used as a measure to identify the importance of a node. Closeness centrality is a type of calculating centrality based on how close a node is to the other nodes. #closenesscentrality #centrality #linkanalysis #graphtheory #networkanalysis

[plogghuy]

For those wondering the type is actually the normalised closeness centrality measure ie the closeness centrality divided by the total number of nodes -1. Since the pre normalised centrality is the sum raised to the -1 we get the type on screen

[francescos]

Thanks, for this educational contribution.

[muhammadhamza]

There is a path between 4 to 1 (4>3>2>1) and 6 to 1 (6>4>3>2>1). Kindly correct

[souravde]

While directed graph what is the logic of being taken 100? I did not understand. If there is no connection, it should be zero but not 100.

[ragilchelvin]

I'm sorry sir, can you tell me about your reference to count it, please ? I will use that for citation of my bachelor thesis Thank you..

[anchitagarwal]

how is distance from node1 to node4 = 2??

[LCW]

Excuse me.
May I ask a question?
Do you know where is the source of this equation.
I want to know who is the author of the centrality degree equation, and the name of the paper.

Thank you very much.