ACM DL

Information Systems (TOIS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Information Systems (TOIS), Volume 31 Issue 3, July 2013

About learning models with multiple query-dependent features
Craig Macdonald, Rodrygo L.T. Santos, Iadh Ounis, Ben He
Article No.: 11
DOI: 10.1145/2493175.2493176

Several questions remain unanswered by the existing literature concerning the deployment of query-dependent features within learning to rank. In this work, we investigate three research questions in order to empirically ascertain best practices...

Mining pure high-order word associations via information geometry for information retrieval
Yuexian Hou, Xiaozhao Zhao, Dawei Song, Wenjie Li
Article No.: 12
DOI: 10.1145/2493175.2493177

The classical bag-of-word models for information retrieval (IR) fail to capture contextual associations between words. In this article, we propose to investigate pure high-order dependence among a number of words forming an unseparable...

Fast candidate generation for real-time tweet search with bloom filter chains
Nima Asadi, Jimmy Lin
Article No.: 13
DOI: 10.1145/2493175.2493178

The rise of social media and other forms of user-generated content have created the demand for real-time search: against a high-velocity stream of incoming documents, users desire a list of relevant results at the time the query is issued. In the...

Discovering tasks from search engine query logs
Claudio Lucchese, Salvatore Orlando, Raffaele Perego, Fabrizio Silvestri, Gabriele Tolomei
Article No.: 14
DOI: 10.1145/2493175.2493179

Although Web search engines still answer user queries with lists of ten blue links to webpages, people are increasingly issuing queries to accomplish their daily tasks (e.g., finding a recipe, booking a flight, reading...

Practical linear-time O(1)-workspace suffix sorting for constant alphabets
Ge Nong
Article No.: 15
DOI: 10.1145/2493175.2493180

This article presents an O(n)-time algorithm called SACA-K for sorting the suffixes of an input string T[0, n-1] over an alphabet A[0, K-1]. The problem of sorting the suffixes of T is also known as...

Behavioral dynamics on the web: Learning, modeling, and prediction
Kira Radinsky, Krysta M. Svore, Susan T. Dumais, Milad Shokouhi, Jaime Teevan, Alex Bocharov, Eric Horvitz
Article No.: 16
DOI: 10.1145/2493175.2493181

The queries people issue to a search engine and the results clicked following a query change over time. For example, after the earthquake in Japan in March 2011, the query japan spiked in popularity and people issuing the query were more...