The Community for Technology Leaders
2013 IEEE 13th International Conference on Data Mining (2013)
Dallas, TX, USA USA
Dec. 7, 2013 to Dec. 10, 2013
ISSN: 1550-4786
pp: 438-447
ABSTRACT
In the past two decades, there has been a huge amount of document data with rich tag information during the evolution of the Internet, which can be called semi-structured data. These semi-structured data contain both unstructured features (e.g., plain text) and metadata, such as tags in html files or author and venue information in research articles. It's of great interest to model such kind of data. Most previous works focused on modeling the unstructured data. Some other methods have been proposed to model the unstructured data with specific tags. To build a general model for semi-structured documents remains an important problem in terms of both model fitness and efficiency. In this paper, we propose a novel method to model the tagged documents by a so-called Tag-Weighted Dirichlet Allocation (TWDA). TWDA is a framework that leverages both the tags and words in each document to infer the topic components for the documents. This allows not only to learn the document-topic and topic-word distributions, but also to infer the tag-topic distributions for text mining (e.g., classification, clustering, and recommendations). Moreover, TWDA can automatically infer the probabilistic weights of tags for each document, that can be used to predict the tags in one document. We present an efficient variational inference method with an EM algorithm for estimating the model parameters. The experimental results show the effectiveness, efficiency and robustness of our TWDA approach by comparing it with the state-of-the-art methods on four corpora in document modeling, tags prediction and text classification.
INDEX TERMS
Data models, Vectors, Resource management, Mathematical model, Predictive models, Probabilistic logic, Analytical models
CITATION

S. Li, G. Huang, R. Tan and R. Pan, "Tag-Weighted Dirichlet Allocation," 2013 IEEE 13th International Conference on Data Mining(ICDM), Dallas, TX, USA USA, 2013, pp. 438-447.
doi:10.1109/ICDM.2013.11
233 ms
(Ver 3.3 (11022016))