Ranking tweets by labeled and collaboratively selected pairs with transitive closure

2Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Tweets ranking is important for information acquisition in Microblog. Due to the content sparsity and lack of labeled data, it is better to employ semi-supervised learning methods to utilize the unlabeled data. However, most of previous semi-supervised learning methods do not consider the pair conflict problem, which means that the new selected unlabeled data may have order conflict with the labeled and previously selected data. It will hurt the learning performance, if the training data con-tains many conflict pairs. In this paper, we propose a new collaborative semi-supervised SVM ranking model (CSR-TC), selecting unlabeled data based on a dynamically maintained transitive closure graph to avoid pair conflict. We also investigate the two views of features, intrinsic and content-relevant features, for the proposed model. Extensive experiments are conducted on TREC Microblogging corpus. The results demonstrate that our proposed method achieves significant improvement, compared to several state-of-the-art models.

Cite

CITATION STYLE

APA

Liu, S., Cheng, X., & Li, F. (2014). Ranking tweets by labeled and collaboratively selected pairs with transitive closure. In Proceedings of the National Conference on Artificial Intelligence (Vol. 2, pp. 1235–1241). AI Access Foundation. https://doi.org/10.1609/aaai.v28i1.8896

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free