Identification of top-K nodes in large networks using Katz centrality
Abstract Network theory concepts form the core of algorithms that are designed to uncover valuable insights from various datasets. Especially, network centrality measures such as Eigenvector centrality, Katz centrality, PageRank centrality etc., are used in retrieving top-K viral information propaga...
Main Authors: | Justin Zhan, Sweta Gurung, Sai Phani Krishna Parsa |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2017-05-01
|
Series: | Journal of Big Data |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s40537-017-0076-5 |
Similar Items
-
Identifying Top-k Influential Nodes Based on Discrete Particle Swarm Optimization With Local Neighborhood Degree Centrality
by: Lihong Han, et al.
Published: (2021-01-01) -
Friedrich Katz, 1927-2010
by: Javier Garciadiego
Published: (2011-07-01) -
Dina Katz. Gilgamesh and Akkaa. Groningen, The Netherlands : Styx, 1993.
by: Jorge Silva Castillo
Published: (1997-05-01) -
Heuristic energy-saving virtual network embedding algorithm based on Katz centrality
by: Qiang Zhu, et al.
Published: (2020-09-01) -
Predicting metabolite-disease associations based on KATZ model
by: Xiujuan Lei, et al.
Published: (2019-10-01)