Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Our research
Content type
+
Downloads (446)
+
Events (415)
 
Groups (143)
+
News (2637)
 
People (732)
 
Projects (1065)
+
Publications (12152)
+
Videos (5344)
Labs
Research areas
Algorithms and theory47205 (294)
Communication and collaboration47188 (190)
Computational linguistics47189 (193)
Computational sciences47190 (199)
Computer systems and networking47191 (702)
Computer vision208594 (881)
Data mining and data management208595 (78)
Economics and computation47192 (96)
Education47193 (81)
Gaming47194 (71)
Graphics and multimedia47195 (208)
Hardware and devices47196 (200)
Health and well-being47197 (81)
Human-computer interaction47198 (803)
Machine learning and intelligence47200 (781)
Mobile computing208596 (37)
Quantum computing208597 (20)
Search, information retrieval, and knowledge management47199 (626)
Security and privacy47202 (275)
Social media208598 (27)
Social sciences47203 (247)
Software development, programming principles, tools, and languages47204 (569)
Speech recognition, synthesis, and dialog systems208599 (86)
Technology for emerging markets208600 (27)
1–25 of 781
Sort
Show 25 | 50 | 100
1234567Next 
Yanjie Fu, Yong Ge, Yu Zheng, Yao, Yanchi Liu, Hui Xiong, and Nicholas Jing Yuan

Ranking residential real estates based on investment values can provide decision making support for home buyers and thus plays an important role in estate marketplace. In this paper, we aim to develop methods for ranking estates based on investment values by mining users opinions about estates from online user reviews and offline moving behaviors (e.g., taxi traces, smart card transactions, check-ins). While a variety of features could be extracted from these data, these features are intercorrelated and...

Publication details
Date: 1 December 2015
Type: Inproceeding
Publisher: IEEE – Institute of Electrical and Electronics Engineers
Publication details
Date: 1 December 2015
Type: Article
Fuzheng Zhang, Nicholas Jing Yuan, David Wilkie, Yu Zheng, and Xing Xie

Urban transportation is an important factor in energy consumption and pollution, and is of increasing concern due to its complexity and economic significance. Its importance will only increase as urbanization continues around the world. In this paper, we explore drivers’ refueling behavior in urban areas. Compared to questionnaire-based methods of the past, we propose a complete data-driven system that pushes towards real-time sensing of individual refueling behavior and citywide petrol consumption. Our...

Publication details
Date: 1 June 2015
Type: Article
Publisher: ACM – Association for Computing Machinery
Ali Mamdouh Elkahky, Yang Song, and Xiaodong He

Recent online services rely heavily on automatic personalization to recommend relevant content to a large number of users. This requires systems to scale promptly to accommodate the stream of new users visiting the online services for the first time. In this work, we propose a content-based recommendation system to address both the recommendation quality and the system scalability. We propose to use a rich feature set to represent users, according to their web browsing history and search queries. We use...

Publication details
Date: 1 May 2015
Type: Inproceeding
Publisher: WWW – World Wide Web Consortium (W3C)
Varun Jampani, SM Ali Eslami, Daniel Tarlow, Pushmeet Kohli, and John Winn

Generative models provide a powerful framework for probabilistic reasoning. However, in many domains their use has been hampered by the practical difficulties of inference. This is particularly the case in computer vision, where models of the imaging process tend to be large, loopy and layered. For this reason bottom-up conditional models have traditionally dominated in such domains. We find that widely-used, general-purpose message passing inference algorithms such as Expectation Propagation (EP) and...

Publication details
Date: 1 May 2015
Type: Inproceeding
Sudip Roy, Arnd Christian König, Igor Dvorkin, and Manish Kumar

Cloud platforms involve multiple independently developed components, often executing on diverse hardware configurations and across multiple data centers. This complexity makes tracking various key performance indicators (KPIs) and manual diagnosing of anomalies in system behavior both difficult and expensive. In this paper, we describe Argus, an automated system for mining service logs to identify anomalies and help formulate data-driven hypotheses.

Argus includes a suite of efficient mining...

Publication details
Date: 15 April 2015
Type: Inproceeding
Publisher: IEEE
Toby Sharp, Cem Keskin, Duncan Robertson, Jonathan Taylor, Jamie Shotton, David Kim, Christoph Rhemann, Ido Leichter, Alon Vinnikov, Yichen Wei, Daniel Freedman, Eyal Krupka, Andrew Fitzgibbon, and Shahram Izadi

VIDEO: https://www.youtube.com/watch?v=A-xXrMpOHyc

Paper and Abstract coming soon.

Publication details
Date: 1 April 2015
Type: Inproceeding
Publisher: CHI
Nathan Wiebe, Ashish Kapoor, and Krysta M. Svore

We present several quantum algorithms for performing nearest-neighbor learning. At the core of our algorithms are fast and coherent quantum methods for computing distance metrics such as the inner product and Euclidean distance. We prove upper bounds on the number of queries to the input data required to compute these metrics. In the worst case, our quantum algorithms lead to polynomial reductions in query complexity relative to the corresponding classical algorithm. In certain cases, we show...

Publication details
Date: 1 March 2015
Type: Article
Publisher: Rinton Press
Number: 3&4
Publication details
Date: 1 February 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Asli Celikyilmaz, Dilek Hakkani-Tur, Panupong Pasupat, and Ruhi Sarikaya

Unsupervised word embeddings provide rich linguistic and conceptual information about words. However, they may provide weak information about domain specific semantic relations for certain tasks such as semantic parsing of natural language queries, where such information about words can be valuable. To encode the prior knowledge about the semantic word relations, we present new method as follows: we extend the neural network based lexical word embedding objective function (Mikolov et al. 2013) by...

Publication details
Date: 19 January 2015
Type: Inproceeding
Publisher: AAAI - Association for the Advancement of Artificial Intelligence
Jason D. Williams, Nobal B. Niraula, Pradeep Dasigi, Aparna Lakshmiratan, Carlos Garcia Jurado Suarez, Mouni Reddy, and Geoff Zweig

In personal assistant dialog systems, intent models are classifiers that identify the intent of a user utterance, such as to add a meeting to a calendar, or get the director of a stated movie. Rapidly adding intents is one of the main bottlenecks to scaling — adding functionality to — personal assistants. In this paper we show how interactive learning can be applied to the creation of statistical intent models. Interactive learning [10] combines model definition, labeling, model...

Publication details
Date: 11 January 2015
Type: Inproceeding
Kevin Schelten, Sebastian Nowozin, Jeremy Jancsary, Carsten Rother, and Stefan Roth

Publication details
Date: 6 January 2015
Type: Inproceeding
Publisher: IEEE – Institute of Electrical and Electronics Engineers
Gao Huang, Jianwen Zhang, Shiji Song, and Zheng Chen

This paper proposes a new approach for discriminative clustering. The intuition is, for a good clustering, one should be able to learn a classifier from the clustering labels with high generalization accuracy. Thus we define a novel metric to evaluate the quality of a clustering labeling, named Minimum Separation Probability (MSP), which is a lower bound of the generalization accuracy of a classifier learnt from the clustering labeling. We take MSP as the objective to maximize and propose our...

Publication details
Date: 1 January 2015
Type: Inproceeding
Publisher: AAAI - Association for the Advancement of Artificial Intelligence
Nihar B. Shah and Dengyong Zhou

Human computation or crowdsourcing involves joint inference of the ground-truth-answers and the worker abilities by optimizing an objective function, for instance, by maximizing the data likelihood based on an assumed underlying model. A variety of methods have been proposed in the literature to address this inference problem. As far as we know, none of the objective functions in existing methods is convex. In machine learning and applied statistics, a convex function such as the objective function of...

Publication details
Date: 1 January 2015
Type: Inproceeding
Publisher: AAAI - Association for the Advancement of Artificial Intelligence
Yuchen Zhang and Lin Xiao

We consider distributed convex optimization problems originated from sample average approximation of stochastic optimization, or empirical risk minimization in machine learning. We assume that each machine in the distributed computing system has access to a local empirical loss function, constructed with i.i.d. data sampled from a common distribution. We propose a communication-efficient distributed algorithm to minimize the overall empirical loss, which is the average of the local empirical losses. The...

Publication details
Date: 1 January 2015
Type: Technical report
Number: MSR-TR-2015-1
Xian-Sheng Hua and Jin Li

With the advances in distributed computation, machine learning and deep neural networks, we enter into an era that it is possible to build a real world image recognition system. There are three essential components to build a real-world image recognition system: 1) creating representative features, 2) de-signing powerful learning approaches, and 3) identifying massive training data. While extensive researches have been done on the first two aspects, much less attention has been paid on the third. In...

Publication details
Date: 1 January 2015
Type: Inproceeding
Publisher: AAAI - Association for the Advancement of Artificial Intelligence
Shipra Agrawal and Nikhil R. Devanur

We introduce the online stochastic Convex Programming (CP) problem, a very general version of stochastic online problems which allows arbitrary concave objectives and convex feasibility constraints. Many well-studied problems like online stochastic packing and covering, online stochastic matching with concave returns, etc. form a special case of online stochastic CP. We present fast algorithms for these problems, which achieve near-optimal regret guarantees for both the i.i.d. and the...

Publication details
Date: 1 January 2015
Type: Inproceeding
Publisher: SIAM – Society for Industrial and Applied Mathematics
Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, and Li Deng

In this paper we present a unified framework for modeling multi-relational representations, scoring, and learning, and conduct an empirical study of several recent multi-relational embedding models under the framework. We investigate the different choices of relation operators based on linear and bilinear transformations, and also the effects of entity representations by incorporating unsupervised vectors pre-trained on extra textual resources. Our results show several interesting findings, enabling the...

Publication details
Date: 12 December 2014
Type: Inproceeding
Saleema Amershi, Maya Cakmak, W. Bradley Knox, and Todd Kulesza

Systems that can learn interactively from their end-users are quickly becoming widespread. Until recently, this progress has been fueled mostly by advances in machine learning; however, more and more researchers are realizing the importance of studying users of these systems. In this article we promote this approach and demonstrate how it can result in better user experiences and more effective learning systems. We present a number of case studies that demonstrate how interactivity results in a tight...

Publication details
Date: 1 December 2014
Type: Article
Publisher: AAAI - Association for the Advancement of Artificial Intelligence
Adrian Kim, Kyomin Jung, Daniel Tarlow, and Pushmeet Kohli

Presented at the 2015 NIPS Workshop on Perturbations, Optimization, and Statistics.

Publication details
Date: 1 December 2014
Type: Inproceeding
Xiaohu Liu and Ruhi Sarikaya

Spoken language understanding (SLU) systems use various features to detect the domain, intent and semantic slots of a query. In addition to n-grams, features generated from entity dictionaries are often used in model training. Clean or properly weighted dictionaries are critical to improve model’s coverage and accuracy for unseen entities during test time. However, clean dictionaries are hard to obtain for some applications since they are automatically generated and can potentially contain millions of...

Publication details
Date: 1 December 2014
Type: Proceedings
Publisher: IEEE – Institute of Electrical and Electronics Engineers
Prateek Jain, Ambuj Tewari, and Purushottam Kar

The use of M-estimators in generalized linear regression models in high dimensional settings requires risk minimization with hard L0 constraints. Of the known methods, the class of projected gradient descent (also known as iterative hard thresholding (IHT)) methods is known to offer the fastest and most scalable solutions. However, the current state-of-the-art is only able to analyze these methods in very restrictive settings which do not hold in high dimensional statistical models. In this...

Publication details
Date: 1 December 2014
Type: Inproceeding
Publisher: Neural Information Processing Systems
Publication details
Date: 1 December 2014
Type: Inproceeding
Publisher: IEEE – Institute of Electrical and Electronics Engineers
Kenton O'Hara, Gerardo Gonzalez, Abigail Sellen, Graeme Penney, Varnavas, Helena Mentis, Antonio Criminisi, Robert Corish, Mark Rouncefield, Neville Dastur, and Tom Carrell
Publication details
Date: 1 December 2014
Type: Article
Purushottam Kar, Harikrishna Narasimhan, and Prateek Jain

Modern applications in sensitive domains such as biometrics and medicine frequently require the use of non-decomposable loss functions such as precision@k, F-measure etc. Compared to point loss functions such as hinge-loss, these offer much more fine grained control over prediction, but at the same time present novel challenges in terms of algorithm design and analysis. In this work we initiate a study of online learning techniques for such non-decomposable loss functions with an aim to enable...

Publication details
Date: 1 December 2014
Type: Inproceeding
Publisher: Neural Information Processing Systems
1–25 of 781
Sort
Show 25 | 50 | 100
1234567Next 
> Our research