• Corpus ID: 39991010

# From Predictions to Data-Driven Decisions Using Machine Learning

@article{Kallus2014FromPT,
title={From Predictions to Data-Driven Decisions Using Machine Learning},
author={Nathan Kallus},
journal={ArXiv},
year={2014},
volume={abs/1402.5481}
}
Predictive analyses taking advantage of the recent explosion in the availability and accessibility of data have been made possible through flexible machine learning methodologies that are often well-suited to the variety and velocity of today’s data collection. This can be witnessed in recent works studying the predictive power of social media data and in the transformation of business practices around data. It is not clear, however, how to go from expected-value predictions based on predictive…
2 Citations

## Figures from this paper

17th International IEEE Conference on Intelligent Transportation Systems (ITSC)
• 2014
The experimental results show that the proposed approach can achieve a comparatively high accuracy when the sampling size of travel time is large enough, and under some reasonable assumptions, the accuracy could be 100%.
IEEE Transactions on Intelligent Transportation Systems
• 2016
This paper reformulates the original shortest path problem as a cardinality minimization problem directly based on samples of travel time on each road link, which can be obtained from the GPS trajectory of vehicles, and applies an ℓ1-norm minimization technique and its variants to solve the cardinality problem.

## References

SHOWING 1-10 OF 42 REFERENCES

• Computer Science
• 2013
Finite-sample performance bounds on the out-of-sample costs of the feature-based decisions shows the "Big Data" regime, when over-fitting dominates finite-sample bias, is defined by p > O(n-1/(2 8/p)}\sqrt{\log{(n)}}), and both regularized ML and KO are effective methods to handle over- fitting.
• W. Loh
• Computer Science
WIREs Data Mining Knowl. Discov.
• 2011
This article gives an introduction to the subject of classification and regression trees by reviewing some widely available algorithms and comparing their capabilities, strengths, and weakness in two examples.
• Computer Science
EuroCOLT
• 1995
The model studied can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting, and it is shown that the multiplicative weight-update Littlestone?Warmuth rule can be adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable to a considerably more general class of learning problems.
• Computer Science
Proceedings of the National Academy of Sciences
• 2010
This work uses search query volume to forecast the opening weekend box-office revenue for feature films, first-month sales of video games, and the rank of songs on the Billboard Hot 100 chart, finding in all cases that search counts are highly predictive of future outcomes.
• Economics
• 2000
In an intensifying international competition banks are forced to place increased emphasis on enter-prise wide risk-/return management. Financial risks have to be limited and managed from a bank wide
• Computer Science