SIMILARITY-BASED CLASSIFICATION IN PARTIALLY LABELED NETWORKS
From MaRDI portal
Publication:4929688
DOI10.1142/S012918311001549XzbMath1195.05078arXiv1003.0837OpenAlexW2035485367MaRDI QIDQ4929688
Linyuan Lu, Ming-Sheng Shang, Qian-Ming Zhang
Publication date: 23 September 2010
Published in: International Journal of Modern Physics C (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.0837
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (2)
Node similarity measuring in complex networks with relative entropy ⋮ Biased random walk with restart for link prediction with graph embedding method
Cites Work
This page was built for publication: SIMILARITY-BASED CLASSIFICATION IN PARTIALLY LABELED NETWORKS