Back
pdf
Journal article

Similarity-based classification in partially labeled networks

  • Zhang, Qian-Ming Web Sciences Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
  • Shang, Ming-Sheng Web Sciences Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
  • Lü, Linyuan Department of Physics, University of Fribourg, Switzerland
    2010
Published in:
  • International Journal of Modern Physics C. - 2010, vol. 21, no. 6, p. 813-824
Complex networks
similarity index
classification
labeled networks
English Two main difficulties in the problem of classification in partially labeled networks are the sparsity of the known labeled nodes and inconsistency of label information. To address these two difficulties, we propose a similarity-based method, where the basic assumption is that two nodes are more likely to be categorized into the same class if they are more similar. In this paper, we introduce ten similarity indices defined based on the network structure. Empirical results on the co-purchase network of political books show that the similarity-based method can, to some extent, overcome these two difficulties and give higher accurate classification than the relational neighbors method, especially when the labeled nodes are sparse. Furthermore, we find that when the information of known labeled nodes is sufficient, the indices considering only local information can perform as good as those global indices while having much lower computational complexity.
Faculty
Faculté des sciences et de médecine
Department
Département de Physique
Language
  • English
Classification
Physics
License
License undefined
Identifiers
Persistent URL
https://folia.unifr.ch/unifr/documents/301750
Statistics
Document views: 20 File downloads:
  • lu_sbc.pdf: 36