skip to main content
10.1145/956750.956767acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
Article

To buy or not to buy: mining airfare data to minimize ticket purchase price

Published:24 August 2003Publication History

ABSTRACT

As product prices become increasingly available on the World Wide Web, consumers attempt to understand how corporations vary these prices over time. However, corporations change prices based on proprietary algorithms and hidden variables (e.g., the number of unsold seats on a flight). Is it possible to develop data mining techniques that will enable consumers to predict price changes under these conditions?This paper reports on a pilot study in the domain of airline ticket prices where we recorded over 12,000 price observations over a 41 day period. When trained on this data, Hamlet --- our multi-strategy data mining algorithm --- generated a predictive model that saved 341 simulated passengers $198,074 by advising them when to buy and when to postpone ticket purchases. Remarkably, a clairvoyant algorithm with complete knowledge of future prices could save at most $320,572 in our simulation, thus HAMLET's savings were 61.8% of optimal. The algorithm's savings of $198,074 represents an average savings of 23.8% for the 341 passengers for whom savings are possible. Overall, HAMLET saved 4.4% of the ticket price averaged over the entire set of 4,488 simulated passengers. Our pilot study suggests that mining of price data available over the web has the potential to save consumers substantial sums of money per annum.

References

  1. R. Agrawal and R. Srikant. Mining sequential patterns. In P. S. Yu and A. S. P. Chen, editors, Eleventh International Conference on Data Engineering, pages 3--14, Taipei, Taiwan, 1995. IEEE Computer Society Press.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. L. Ambite, G. Barish, C. A. Knoblock, M. Muslea, J. Oh, and S. Minton. Getting from here to there: Interactive planning and agent execution for optimizing travel. In Proceedings of the Fourteenth Conference on Innovative Applications of Artificial Intelligence (IAAI-2002), pages 862--869, AAAI Press, Menlo Park, CA, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. G. Barish and C. A. Knoblock. An efficient and expressive language for information gathering on the web. In Proceedings of the AIPS-2002 Workshop on Is there life after operator sequencing? - Exploring real world planning, pages 5--12, Tolouse, France, 2002.]]Google ScholarGoogle Scholar
  4. D. Berndt and J. Clifford. Finding patterns in time series: a dynamic programming approach. In U. Fayyad, G. Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining. AAAI Press, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. Breiman. Bagging predictors. Machine Learning, 24:123--140, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. H. Chalupsky, Y. Gil, C. A. Knoblock, K. Lerman, J. Oh, D. V. Pynadath, T. A. Russ, and M. Tambe. Electric elves: Applying agent technology to support human organizations. In Proceedings of the Conference on Innovative Applications of Artificial Intelligence, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Chatfield. The Analysis of Time Series: An Introduction. Chapman and Hall, London, UK, 1989.]]Google ScholarGoogle Scholar
  8. W. W. Cohen. Fast effective rule induction. In A. Prieditis and S. Russell, editors, Proc. of the 12th International Conference on Machine Learning, pages 115--123, Tahoe City, CA, July 9--12, 1995. Morgan Kaufmann.]]Google ScholarGoogle Scholar
  9. F. Diebold. Elements of Forecasting. South-Western College Publishing, 2nd edition, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. P. Domingos. MetaCost: A general method for making classifiers cost-sensitive. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 155--164, San Diego, CA, 1999. ACM Press.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R. Doorenbos, O. Etzioni, and D. Weld. A scalable comparison-shopping agent for the World-Wide Web. In Proc. First Intl. Conf. Autonomous Agents, pages 39--48, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Y. Freund and R. E. Schapire. Experiments with a new boosting algorithm. In Proceedings of the Thirteenth International Conference on Machine Learning, pages 148--156, Bari, Italy, 1996. Morgan Kaufmann.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. C. W. J. Granger. Forecasting in Business and Economics. Harcourt Brace, second edition, 1989.]]Google ScholarGoogle Scholar
  14. J. C. Hull. Options, Futures, and Other Derivatives. Prentice Hall College Div, 5th edition, 2002.]]Google ScholarGoogle Scholar
  15. C. A. Knoblock, K. Lerman, S. Minton, and I. Muslea. Accurately and reliably extracting data from the web: A machine learning approach. In P. S. Szczepaniak, J. Segovia, J. Kacprzyk, and L. A. Zadeh, editors, Intelligent Exploration of the Web, pages 275--287. Springer-Verlag, Berkeley, CA, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212--261, February 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. D. Lucking-Reiley, D. Bryan, N. Prasad, and D. Reeves. Pennies from ebay: The determinants of price in online auctions. Technical report, University of Arizona, 2000.]]Google ScholarGoogle Scholar
  18. S. Mahadevan. Average reward reinforcement learning: Foundations, algorithms, and empirical results. Machine Learning, 22(1--3):159--195, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. S. McCartney. Airlines Rely on Technology To Manipuate Fare Structure. Wall Street Journal, November 3 1997.]]Google ScholarGoogle Scholar
  20. J. Moody and M. Saffell. Reinforcement learning for trading systems and portfolios. In KDD, pages 279--283, 1998.]]Google ScholarGoogle Scholar
  21. J. Moody and M. Saffell. Minimizing downside risk via stochastic dynamic programming. In Y. S. Abu-Mostafa, B. LeBaron, A. W. Lo, and A. S. Weigend, editors, Computational Finance 1999, Cambridge, MA, 2000. MIT Press.]]Google ScholarGoogle Scholar
  22. J. Moody and M. Saffell. Learning to trade via direct reinforcement. In IEEE Transactions on Neural Networks, Vol. 12, No. 4, 2001.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. J. F. Roddick and M. Spiliopoulou. A bibliography of temporal, spatial and spatio-temporal data mining research. SIGKDD Explorations, 1(1):34--38, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. H. S. Shah, N. R. Joshi, A. Sureka, and P. R. Wurman. Mining for bidding strategies on ebay. In Lecture Notes in Artificial Intelligence. Springer-Verlag, 2003.]]Google ScholarGoogle Scholar
  25. R. S. Sutton and A. Barto. Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. K. M. Ting and I. H. Witten. Issues in stacked generalization. Journal of Artificial Intelligence Research, 10:271--289, 1999.]]Google ScholarGoogle ScholarCross RefCross Ref
  27. M. P. Wellman, D. M. Reeves, K. M. Lochner, and Y. Vorobeychik. Price prediction in a trading agent competition. Technical report, University of Michigan, 2002.]]Google ScholarGoogle Scholar
  28. D. Wolpert. Stacked generalization. Neural Networks, 5:241--259, 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. To buy or not to buy: mining airfare data to minimize ticket purchase price

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
      August 2003
      736 pages
      ISBN:1581137370
      DOI:10.1145/956750

      Copyright © 2003 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 24 August 2003

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      KDD '03 Paper Acceptance Rate46of298submissions,15%Overall Acceptance Rate1,133of8,635submissions,13%

      Upcoming Conference

      KDD '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader