Label Propagation Using Amendable Clamping

نویسندگان

  • Tatsurou Miyazaki
  • Yasunobu Sumikawa
چکیده

Assigning several labels to digital data is becoming easier because we can perform it in a collaborative manner with Internet users. However, some suitable labels may be missed and may not be attached to the data leading to inaccuracies in classification. In this paper, we propose a novel graphbased multi-label classifier to support the multi-labeling task. The core process of our algorithm is to update label weights of labeled data from their top-k similar data in each label propagation step. We report that our algorithm is more stable for F-scores compared to the state-of-the-art ones even though the some correct labels are missed. ACM Classification

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Community Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks

Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...

متن کامل

Clamping Variables and Approximate Inference

It was recently proved using graph covers (Ruozzi, 2012) that the Bethe partition function is upper bounded by the true partition function for a binary pairwise model that is attractive. Here we provide a new, arguably simpler proof from first principles. We make use of the idea of clamping a variable to a particular value. For an attractive model, we show that summing over the Bethe partition ...

متن کامل

Community Detection Using Robust Label Propagation Algorithm

Because there is so much randomness, the robustness of label propagation algorithm (LPA) is severely hampered. To reduce the randomness, a label propagation algorithm based on degree (LPAD) is proposed. Only the node with extreme degree is labeled initially, and the label is updated according to the sum degree of its neighbors during iteration. The results show that the randomness of LPAD is re...

متن کامل

Efficient and Accurate Label Propagation on Dynamic Graphs and Label Sets

Many web-based application areas must infer label distributions starting from a small set of sparse, noisy labels. Previous work has shown that graph-based propagation can be very effective at finding the best label distribution across nodes, starting from partial information and a weightedconnection graph. In their work on video recommendations, Baluja et al. showed high-quality results using ...

متن کامل

Ranking and Semi-supervised Classification on Large Scale Graphs Using Map-Reduce

Label Propagation, a standard algorithm for semi-supervised classification, suffers from scalability issues involving memory and computation when used with largescale graphs from real-world datasets. In this paper we approach Label Propagation as solution to a system of linear equations which can be implemented as a scalable parallel algorithm using the map-reduce framework. In addition to semi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018