2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE) 2015
DOI: 10.1109/ablaze.2015.7154915
|View full text |Cite
|
Sign up to set email alerts
|

Eigenvector centrality and its application in research professionals' relationship network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 34 publications
(13 citation statements)
references
References 14 publications
0
11
0
Order By: Relevance
“…We used Freeman's degree to measure the total number of a publication's co-citations in the database (Freeman 1978). The eigenvector centrality represents an extension of the degree centrality by considering the importance of articles to which a publication is related (Bihari and Pandia 2015). The eigenvector score, which also underlies Google's page ranking (Langville and Meyer 2006), reflects various publications' centrality in the entire research field better than unweighted measures do.…”
Section: Discussionmentioning
confidence: 99%
“…We used Freeman's degree to measure the total number of a publication's co-citations in the database (Freeman 1978). The eigenvector centrality represents an extension of the degree centrality by considering the importance of articles to which a publication is related (Bihari and Pandia 2015). The eigenvector score, which also underlies Google's page ranking (Langville and Meyer 2006), reflects various publications' centrality in the entire research field better than unweighted measures do.…”
Section: Discussionmentioning
confidence: 99%
“…A cluster analysis was conducted to classify subgroups that were closely connected to each other in the networks using the Clauset-Newman-Moore cluster algorithm (Clauset et al, 2004). Eigenvector centrality index was also computed that gauges the influence of a node in a network by assessing relative ranking of a node based on its connection to central nodes in a network (Bihari & Pandia, 2015). In addition, the topography of the networks was visualized using the Harel-Koren Fast Multiscale layout algorithm from NodeXL.…”
Section: Social and Semantic Network Analysismentioning
confidence: 99%
“…Power method is used for evaluation of EVC from of the network. For this method, we initiate from the ones vector that is [ ] corresponding to the count of nodes in the network and passes through a number of iterations [2,9,10]. The preliminary eigenvector evaluated during the( ) iteration is given as follows:…”
Section: Eigenvector Centrality (Evc)mentioning
confidence: 99%