Similarity-Based Classification in Partially Labeled Networks

Details Similarity-Based Classification in Partially Labeled Networks Similarity-Based Classification in Partially Labeled Networks

2010-03-03

arxiv.org/abs/1003.0837v1

Int. J. Mod. Phys. C 21, 813 (2010)

Physics

Data Analysis, Statistics and Probability

13 pages,3 figures,1 table

Scientific paper

10.1142/S012918311001549X

We propose a similarity-based method, using the similarity between nodes, to address the problem of classification in partially labeled networks. 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, including five local ones and five global ones. Empirical results on the co-purchase network of political books show that the similarity-based method can give high accurate classification even when the labeled nodes are sparse which is one of the difficulties in classification. Furthermore, we find that when the target network has many labeled nodes, the local indices can perform as good as those global indices do, while when the data is sparce the global indices perform better. Besides, the similarity-based method can to some extent overcome the unconsistency problem which is another difficulty in classification.

Affiliated with

Also associated with

No associations

Rating

Similarity-Based Classification in Partially Labeled Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Similarity-Based Classification in Partially Labeled Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Similarity-Based Classification in Partially Labeled Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-684939