Modeling Term Associations for Searching and Analyzing Large-Scale Text Data
Traditionally, in many probabilistic retrieval models, query terms are assumed to be independent. Although such models can achieve reasonably good performance, associations can exist among terms from human being's point of view. There are some recent studies that investigate how to model term associations/dependencies by proximity measures. However, the modeling of term associations theoretically under the probabilistic retrieval framework is still largely unexplored. In this talk, I will introduce a new concept named Cross Term, to model term proximity, with the aim of boosting retrieval performance. With Cross Terms, the association of multiple query terms can be modeled in the same way as a simple unigram term. In particular, an occurrence of a query term is assumed to have an impact on its neighboring text. The degree of the query term impact gradually weakens with increasing distance from the place of occurrence. We use shape functions to characterize such impacts. Based on this assumption, we first propose a bigram CRoss TErm Retrieval (CRTER2) model as the basis model, and then recursively propose a generalized n-gram CRoss TErm Retrieval (CRTERn) model for n query terms where n > 2. Specifically, a bigram Cross Term occurs when the corresponding query terms appear close to each other, and its impact can be modeled by the intersection of the respective shape functions of the query terms. For n-gram Cross Term, we develop several distance metrics with different properties and employ them in the proposed models for ranking. We also show how to extend the language model using the newly proposed cross terms. Extensive experiments on a number of TREC collections demonstrate the effectiveness of our proposed models.
Jimmy Huang is a York Research Chair Professor at the School of Information Technology and the founding director of Information Retrieval & Knowledge Management Research Lab at the York University. He joined York University as an Assistant Professor in July 2003. Previously, he was a Post Doctoral Fellow at the School of Computer Science, University of Waterloo. He did his PhD in Information Science at City, University of London, U.K. He also worked in the financial industry in Canada, where he was awarded a CIO Achievement Award. Since 2003, he has published more than 230 refereed papers in top-tier journals (such as the ACM Transactions on Information Systems, the Journal of American Society for Information Science and Technology, the Information Processing & Management, the IEEE Transactions on Knowledge and Data Engineering, the Information Sciences, the Information Retrieval, the BMC Bioinformatics, the BMC Genomics, and the BMC Medical Genomics) and international conference proceedings (such as such as ACM SIGIR, ACM CIKM, KDD, ACL, COLING, IEEE ICDM, IJCAI and AAAI) and lead-edited 6 books & multiple book chapters. He was awarded tenure and promoted to Full Professor at York University in 2006 and 2011 respectively. He received the Dean's Award for Outstanding Research in 2006, an Early Researcher Award, formerly the Premiers Research Excellence Award in 2007, the Petro Canada Young Innovators Award in 2008, the SHARCNET Research Fellowship Award in 2009, the Best Paper Award at the 32nd European Conference on Information Retrieval in 2010 and LA&PS Award for Distinction in Research, Creativity and Scholarship (Established Researcher) in 2015. He was the General Conference Chair for the 19th International ACM CIKM Conference in 2010 and will be the General Conference Chair for the 43rd ACM SIGIR Conference in 2020). His research focuses on information retrieval, big data analytics with complex structures and their applications to the Web and medical healthcare.
Slonim Conference Room (#430), Goldberg Computer Science Building
David Langstroth email@example.comModeling Term Associations for Searching and Analyzing Large-Scale Text Data