Profile Closeness in Complex Networks

03/14/2019
by   Divya Sindhu Lekha, et al.
0

We introduce a new centrality measure, known as profile closeness, for complex networks. This network attribute originates from the graph-theoretic analysis of consensus problems. We also demonstrate its relevance in inferring the evolution of network communities.

READ FULL TEXT
research
09/21/2020

Profile Consistency Identification for Open-domain Dialogue Agents

Maintaining a consistent attribute profile is crucial for dialogue agent...
research
09/22/2019

Is change the only constant? Profile change perspective on #LokSabhaElections2019

Users on Twitter are identified with the help of their profile attribute...
research
04/13/2023

PGTask: Introducing the Task of Profile Generation from Dialogues

Recent approaches have attempted to personalize dialogue systems by leve...
research
08/11/2020

Planimation

Planimation is a modular and extensible open source framework to visuali...
research
11/28/2014

Efficient inference of overlapping communities in complex networks

We discuss two views on extending existing methods for complex network m...
research
06/04/2020

Unsupervised clustering of Roman pottery profiles from their SSAE representation

In this paper we introduce the ROman COmmonware POTtery (ROCOPOT) databa...
research
02/26/2020

Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Discrete Distributions

The profile of a sample is the multiset of its symbol frequencies. We sh...

Please sign up or login with your details

Forgot password? Click here to reset