Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computing and Information Science
  4. Computing and Information Science Technical Reports
  5. High-Speed Function Approximation

High-Speed Function Approximation

File(s)
TR2007-2092.pdf (142.47 KB)
Permanent Link(s)
https://hdl.handle.net/1813/8225
Collections
Computing and Information Science Technical Reports
Author
Panda, Biswanath
Riedewald, Mirek
Gehrke, Johannes
Pope, Stephen
Abstract

Learning methods for predictive models have traditionally focused on prediction quality and model building time, while prediction time(the time taken to make a prediction) is often ignored. However, there is an increasing need for models that are not only accurate, but also make fast predictions. Some of the most accurate models like ensemble models are often too slow to be used in practice. We believe that exploring the tradeoff between prediction time and model accuracy is an exciting new direction for data mining research. In this paper, we make a first step toward exploring this tradeoff. We introduce a new learning problem where we minimize model prediction time subject to a constraint on model accuracy. Our solution is a generic framework that leverages existing data mining algorithms while taking prediction time into account. We show a first application of our framework to a combustion simulation, and our results show significant improvements over existing methods.

Date Issued
2007-08-14
Publisher
Cornell University
Keywords
computer science
•
Learning
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2007-2092
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance