Class Label Enhancement via Related Instances

Class-instance label propagation algorithms have been successfully used to fuse information from multiple sources in order to enrich a set of unlabeled instances with class labels. Yet, nobody has explored the relationships between the instances themselves to enhance an initial set of class-instance pairs. We propose two graph-theoretic methods (centrality and regularization), which start with a small set of labeled class-instance pairs and use the instance-instance network to extend the class labels to all instances in the network. We carry out a comparative study with state-of-the-art knowledge harvesting algorithm and show that our approach can learn additional class labels while maintaining high accuracy. We conduct a comparative study between class-instance and instance-instance graphs used to propagate the class labels and show that the latter one achieves higher accuracy.

• Type: Journal
• Year: 2011
• Where: EMNLP
• Authors: Zornitsa Kozareva, Konstantin Voevodski, Shang-Hua Teng
• Keywords: Class Labels, EMNLP 2011, Label Propagation, Natural Language Processing, Propagation Algorithms