All Research Areas
Research Areas
Year Published

56 Results

June 24, 2014

Collaborative Hashing

Conference on Computer Vision and Pattern Recognition (CVPR)

Hashing technique has become a promising approach for fast similarity search. Most of existing hashing research pursue the binary codes for the same type of entities by preserving their similarities….

By: Xianglong Liu, Junfeng He, Cheng Deng, Bo Lang
April 11, 2014

Designing and Deploying Online Field Experiments

International World Wide Web Conference (WWW)

Online experiments are widely used to compare specific design alternatives, but they can also be used to produce generalizable knowledge and inform strategic decision making. Doing so often requires sophisticated experimental designs, iterative refinement, and careful logging and analysis.

By: Eytan Bakshy, Dean Eckles, Michael Bernstein
April 7, 2014

Personalized Collaborative Clustering

International World Wide Web Conference (WWW)

We study the problem of learning personalized user models from rich user interactions. In particular, we focus on learning from clustering feedback (i.e., grouping recommended items into clusters), wh…

By: Yisong Yue, Chong Wang, Khalid El-Arini, Carlos Guestrin
February 18, 2014

Romantic Partnerships and the Dispersion of Social Ties: A Network Analysis of Relationship Status on Facebook

ACM Conference on Computer Supported Cooperative Work and Social Computing (CSCW)

A crucial task in the analysis of on-line social-networking systems is to identify important people — those linked by strong social ties — within an individual’s network neighborhood. Here we investig…

By: Lars Backstrom, Jon Kleinberg
December 16, 2013

Counterfactual Reasoning and Learning Systems: The Example of Computational Advertising

Journal of Machine Learning Research (JMLR)

This work shows how to leverage causal inference to understand the behavior of complex learning systems interacting with their environment and predict the consequences of changes to the system. Such p…

By: Denis Charles, Dipankar Ray, Ed Snelson, Elon Portugaly, Joaquin Quinonero Candela, Leon Bottou, Max Chickering, Patrice Simard
December 8, 2013

Using Web Text to Improve Keyword Spotting in Speech

Automatic Speech Recognition and Understanding Workshop (ASRU)

For low resource languages, collecting sufficient training data to build acoustic and language models is time consuming and often expensive. In this paper, we investigate the use of online text resour…

By: Ankur Gandhe, Long Qin, Florian Metze, Alexander Rudnicky, Ian Lane, Matthias Eck
August 22, 2013

Weighted Hashing for Fast Large Scale Similarity Search

ACM International Conference on Information and Knowledge Management (CIKM)

Similarity search, or finding approximate nearest neighbors, is an important technique for many applications. Many recent research demonstrate that hashing methods can achieve promising results for large scale similarity search due to its computational and memory efficiency.

By: Qifan Wang, Dan Zhang, Luo Si
August 22, 2013

Reciprocal Hash Tables for Nearest Neighbor Search

AAAI Conference on Artificial Intelligence (AI)

Recent years have witnessed the success of hashing techniques in approximate nearest neighbor search. In practice, multiple hash tables are usually employed to retrieve more desired results from all hit buckets of each table. However, there are rare works studying the unified approach to constructing multiple informative hash tables except the widely used random way.

By: Xianglong Liu, Junfeng He, Bo Lang
August 11, 2013

Uncertainty in Online Experiments with Dependent Data: An Evaluation of Bootstrap Methods

ACM Conference on Knowledge Discovery and Data Mining (KDD)

Many online experiments exhibit dependence between users and items. For example, in online advertising, observations that have a user or an ad in common are likely to be associated. Because of this, even in experiments involving millions of subjects, the difference in mean outcomes between control and treatment conditions can have substantial variance. Previous theoretical and simulation results demonstrate that not accounting for this kind of dependence structure can result in confidence intervals that are too narrow, leading to inaccurate hypothesis tests.

By: Eytan Bakshy, Dean Eckles
August 11, 2013

Representing Documents Through Their Readers

ACM Conference on Knowledge Discovery and Data Mining (KDD)

From Twitter to Facebook to Reddit, users have become accustomed to sharing the articles they read with friends or followers on their social networks. While previous work has modeled what these shared stories say about the user who shares them, the converse question remains unexplored: what can we learn about an article from the identities of its likely readers?

By: Khalid El-Arini, Min Xu, Emily Fox, Carlos Guestrin