Issue No.07 - July (2011 vol.23)
Cam-Tu Nguyen , Tohoku University, Sendai
Dieu-Thu Le , University of Trento, Italy
Le-Minh Nguyen , Japan Advanced Institute of Science and Technology, Nomi
Susumu Horiguchi , Tohoku University, Sendai
Quang-Thuy Ha , Vietnam National University, Hanoi
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.27
This paper introduces a hidden topic-based framework for processing short and sparse documents (e.g., search result snippets, product descriptions, book/movie summaries, and advertising messages) on the Web. The framework focuses on solving two main challenges posed by these kinds of documents: 1) data sparseness and 2) synonyms/homonyms. The former leads to the lack of shared words and contexts among documents while the latter are big linguistic obstacles in natural language processing (NLP) and information retrieval (IR). The underlying idea of the framework is that common hidden topics discovered from large external data sets (universal data sets), when included, can make short documents less sparse and more topic-oriented. Furthermore, hidden topics from universal data sets help handle unseen data better. The proposed framework can also be applied for different natural languages and data domains. We carefully evaluated the framework by carrying out two experiments for two important online applications (Web search result classification and matching/ranking for contextual advertising) with large-scale universal data sets and we achieved significant results.
Web mining, hidden topic analysis, sparse data, classification, matching, ranking, contextual advertising.
Cam-Tu Nguyen, Dieu-Thu Le, Le-Minh Nguyen, Susumu Horiguchi, Quang-Thuy Ha, "A Hidden Topic-Based Framework toward Building Applications with Short Web Documents", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 7, pp. 961-976, July 2011, doi:10.1109/TKDE.2010.27