Yalamanchili Venkata Nandini

Mrs. Yalamanchili Venkata Nandini


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 May 2024 in Entropy
Verified
Journal Article
Open access
PDF file
YNYalamanchili Venkata Nandini
Yalamanchili Venkata Nandini
JTJaya Lakshmi Lakshmi Tangirala
Jaya Lakshmi Lakshmi Tangirala
MEMurali Krishna Enduri
Murali Krishna Enduri
HSHemlata Sharma
Hemlata Sharma
Link prediction plays a crucial role in identifying future connections within complex networks, facilitating the analysis of network evolution across various domains such as biological networks, social networks, recommender systems, and more. Researchers have proposed various centrality measures, such as degree, clustering coefficient, betweenness, and closeness centralities, to compute similarity scores for predicting links in these networks. These centrality measures leverage both the local and global information of nodes within the network. In this study, we present a novel approach to link prediction using similarity score by utilizing average centrality measures based on local and global centralities, namely Similarity based on Average Degree (SACD), Similarity based on Average Betweenness (SACB), Similarity based on Average Closeness (SACC), and Similarity based on Average Clustering Coefficient (SACCC). Our approach involved determining centrality scores for each node, calculating the average centrality for the entire graph, and deriving similarity scores through common neighbors. We then applied centrality scores to these common neighbors and identified nodes with above average centrality. To evaluate our approach, we compared proposed measures with existing local similarity-based link prediction measures, including common neighbors, the Jaccard coefficient, Adamic–Adar, resource allocation, preferential attachment, as well as recent measures like common neighbor and the Centrality-based Parameterized Algorithm (CCPA), and keyword network link prediction (KNLP). We conducted experiments on four real-world datasets. The proposed similarity scores based on average centralities demonstrate significant improvements. We observed an average enhancement of 24% in terms of Area Under the Receiver Operating Characteristic (AUROC) compared to existing local similarity measures, and a 31% improvement over recent measures. Furthermore, we witnessed an average improvement of 49% and 51% in the Area Under Precision-Recall (AUPR) compared to existing and recent measures. Our comprehensive experiments highlight the superior performance of the proposed method.

26 November 2023
Verified
Book Chapter
Closed access
PDF file
YNYalamanchili Venkata Nandini
Yalamanchili Venkata Nandini
JTJaya Lakshmi Tangirala
Jaya Lakshmi Tangirala
MEMurali Krishna Enduri
Murali Krishna Enduri

26 November 2023
Verified
Book Chapter
Closed access
PDF file
SSSatya Uday Sanku
Satya Uday Sanku
TSThanuja Pavani Satti
Thanuja Pavani Satti
JTJaya Lakshmi Tangirala
Jaya Lakshmi Tangirala
YNYalamanchili Venkata Nandini
Yalamanchili Venkata Nandini

29 March 2025
Verified
Book Chapter
Closed access
PDF file
YNYalamanchili Venkata Nandini
Yalamanchili Venkata Nandini
TLT. Jaya Lakshmi
T. Jaya Lakshmi
MEMurali Krishna Enduri
Murali Krishna Enduri

26 November 2023
Verified
Book Chapter
Closed access
PDF file
CSChennapragada V. S. S. Mani Saketh
Chennapragada V. S. S. Mani Saketh
KPKakarla Pranay
Kakarla Pranay
ASAkhila Susarla
Akhila Susarla
DKDukka Ravi Ram Karthik
Dukka Ravi Ram Karthik
JTJaya Lakshmi Tangirala
Jaya Lakshmi Tangirala
YNYalamanchili Venkata Nandini
Yalamanchili Venkata Nandini