2020
DOI: 10.1016/j.physa.2019.123790
|View full text |Cite
|
Sign up to set email alerts
|

Link prediction in complex networks based on Significance of Higher-Order Path Index (SHOPI)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 32 publications
(7 citation statements)
references
References 39 publications
0
7
0
Order By: Relevance
“…In order to evaluate the performance of the proposed DICN method, this method and another 8 representative methods from the literature were implemented in Java and executed on a PC with an i5 2.3 GHz processor and 8 MB memory. The eight methods used for comparison are: Common Neighbours (CN) 8 , Preferential Attachment Index (PA) 10 , Jaccard Index (JC) 11 , Hub Promoted Index (HPI) 28 , Common Neighbours Degree Penalization (CNDP) 15 , Node-coupling Clustering (NCC) 17 , Parameterized Algorithm (CCPA) 16 and Significance of Higher-Order Path Index (SHOPI) 29 .…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to evaluate the performance of the proposed DICN method, this method and another 8 representative methods from the literature were implemented in Java and executed on a PC with an i5 2.3 GHz processor and 8 MB memory. The eight methods used for comparison are: Common Neighbours (CN) 8 , Preferential Attachment Index (PA) 10 , Jaccard Index (JC) 11 , Hub Promoted Index (HPI) 28 , Common Neighbours Degree Penalization (CNDP) 15 , Node-coupling Clustering (NCC) 17 , Parameterized Algorithm (CCPA) 16 and Significance of Higher-Order Path Index (SHOPI) 29 .…”
Section: Resultsmentioning
confidence: 99%
“…( 7 ), where is a tunable parameter and is the shortest distance between nodes and . Higher-Order Path Index 29 : Based on the common neighbours, the significance of paths between two nodes is taken into account to propose an iterative method. Summing up the significance of the paths between two nodes determines the likelihood of link formation between them.…”
Section: Related Workmentioning
confidence: 99%
“…Kumar et al [26] have introduced a new method to predict links based on level-2 node clustering coefficients. Their method presents level-2 common nodes and clustering coefficients to gather information about clusters from the seed node pair's level-2 familiar neighbors.…”
Section: Related Workmentioning
confidence: 99%
“…The model that is formed in the path equation will bring up the path coefficients whose significance needs to be tested next. The significance of the existing path coefficients will affect the path significance of the path diagram of the resulting model (Kumar et al, 2020). The significance test using the t-student test with the null hypothesis is that there is no significant effect of exogenous variables on endogenous variables.…”
Section: Path Coefficient Significancementioning
confidence: 99%