Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Artificial Intelligence and Robotics (4)
- Business (2)
- Databases and Information Systems (2)
- Theory and Algorithms (2)
- E-Commerce (1)
-
- Engineering (1)
- Numerical Analysis and Scientific Computing (1)
- Operations Research, Systems Engineering and Industrial Engineering (1)
- Public Affairs, Public Policy and Public Administration (1)
- Sales and Merchandising (1)
- Social and Behavioral Sciences (1)
- Technology and Innovation (1)
- Transportation (1)
- Institution
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
Aspect-Based Helpfulness Prediction For Online Product Reviews, Yinfei Yang, Cen Chen, Forrest Sheng Bao
Aspect-Based Helpfulness Prediction For Online Product Reviews, Yinfei Yang, Cen Chen, Forrest Sheng Bao
Research Collection School Of Computing and Information Systems
Product reviews greatly influence purchase decisions in online shopping. A common burden of online shopping is that consumers have to search for the right answers through massive reviews, especially on popular products. Hence, estimating and predicting the helpfulness of reviews become important tasks to directly improve shopping experience. In this paper, we propose a new approach to helpfulness prediction by leveraging aspect analysis of reviews. Our hypothesis is that a helpful review will cover many aspects of a product at different emphasis levels. The first step to tackle this problem is to extract proper aspects. Because related products share common …
Monte Carlo Approaches To Parameterized Poker Squares, Todd W. Neller, Zuozhi Yang, Colin M. Messinger, Calin Anton, Karo Castro-Wunsch, William Maga, Steven Bogaerts, Robert Arrington, Clay Langely
Monte Carlo Approaches To Parameterized Poker Squares, Todd W. Neller, Zuozhi Yang, Colin M. Messinger, Calin Anton, Karo Castro-Wunsch, William Maga, Steven Bogaerts, Robert Arrington, Clay Langely
Computer Science Faculty Publications
The paper summarized a variety of Monte Carlo approaches employed in the top three performing entries to the Parameterized Poker Squares NSG Challenge competition. In all cases AI players benefited from real-time machine learning and various Monte Carlo game-tree search techniques.
Shortest Path Based Decision Making Using Probabilistic Inference, Akshat Kumar
Shortest Path Based Decision Making Using Probabilistic Inference, Akshat Kumar
Research Collection School Of Computing and Information Systems
We present a new perspective on the classical shortest path routing (SPR) problem in graphs. We show that the SPR problem can be recast to that of probabilistic inference in a mixture of simple Bayesian networks. Maximizing the likelihood in this mixture becomes equivalent to solving the SPR problem. We develop the well known Expectation-Maximization (EM) algorithm for the SPR problem that maximizes the likelihood, and show that it does not get stuck in a locally optimal solution. Using the same probabilistic framework, we then address an NP-Hard network design problem where the goal is to repair a network of …
Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Spatio-temporal matching of services to customers online is a problem that arises on a large scale in many domains associated with shared transportation (ex: taxis, ride sharing, super shuttles, etc.) and delivery services (ex: food, equipment, clothing, home fuel, etc.). A key characteristic of these problems is that matching of services to customers in one round has a direct impact on the matching of services to customers in the next round. For instance, in the case of taxis, in the second round taxis can only pick up customers closer to the drop off point of the customer from the first …
Using Topic Modelling Algorithms For Hierarchical Activity Discovery, Eoin Rogers, John D. Kelleher, Robert J. Ross
Using Topic Modelling Algorithms For Hierarchical Activity Discovery, Eoin Rogers, John D. Kelleher, Robert J. Ross
Conference papers
Activity discovery is the unsupervised process of discovering patterns in data produced from sensor networks that are monitoring the behaviour of human subjects. Improvements in activity discovery may simplify the training of activity recognition models by enabling the automated annotation of datasets and also the construction of systems that can detect and highlight deviations from normal behaviour. With this in mind, we propose an approach to activity discovery based on topic modelling techniques, and evaluate it on a dataset that mimics complex, interleaved sensor data in the real world. We also propose a means for discovering hierarchies of aggregated activities …
Online Arima Algorithms For Time Series Prediction, Chenghao Liu, Hoi, Steven C. H., Peilin Zhao, Jianling Sun
Online Arima Algorithms For Time Series Prediction, Chenghao Liu, Hoi, Steven C. H., Peilin Zhao, Jianling Sun
Research Collection School Of Computing and Information Systems
Autoregressive integrated moving average (ARIMA) is one of the most popular linear models for time series forecasting due to its nice statistical properties and great flexibility. However, its parameters are estimated in a batch manner and its noise terms are often assumed to be strictly bounded, which restricts its applications and makes it inefficient for handling large-scale real data. In this paper, we propose online learning algorithms for estimating ARIMA models under relaxed assumptions on the noise terms, which is suitable to a wider range of applications and enjoys high computational efficiency. The idea of our ARIMA method is to …