Abstract
It is desirable that data analysis tools become more autonomous in managing their computational resources, minimizing risk and cost, assessing their errors, developing new representations, and integrating with other data analysis tools. To aid in this development we introduce a design for using Meta-Reasoning in a Data Analysis Tool Allocation system that employs analogical and structural reasoning to learn from and across domains and its experience. We give a formal definition of a “Data Analysis Game” that allows the implementation of a hierarchical learning framework suitable for describing and exploring real-world analysis problems. The framework may also be used to analyze the performance of the Tool Allocation system itself, allowing it to self-optimize. If the integration of tools is performed correctly, it should allow a cost-efficient level of performance not obtainable with a single tool alone or with unsystematic use of a group of tools.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Allen, E. Hamilton, and R. Levinson, “New advances in adaptive pattern-oriented chess,” in Proceedings of 8th Annual Conference on Advances in Computer Chess, (Maastricht, Neatherlands), June 1996.
L. Brieman, Classification and regression trees. The Wadsworth statistics/probability series, Wadsworth International Group, 1984.
S. Cost and S. Salzberg, “A weighted nearest neighbor algorithm for learning with symbolic features,” Machine Learning, vol. 10, pp. 57–67, 1993.
C. Forgy, “Rete: A fast algorithm for the many pattern/many object patern match problem,” Artificial Intelligence, vol. 19, no. 1, pp. 17–37, 1982.
J. Gould and R. Levinson, “Experience-based adaptive search,” in Machine Learning:A Multi-Strategy Approach (R. Michalski and G. Tecuci, eds.), vol. 4, pp. 579–604, Morgan Kauffman, 1994.
P. Langley, Elements of Machine Learning. Morgan Kaufmann Publishers, Inc., 1996.
R. Levinson, “General game-playing and reinforcement learning,” Computational Intelligence, vol. 12, pp. 155–176, February 1996.
R. Levinson and R. Snyder, “Adaptive pattern oriented chess,” in Proceedings of AAAI-91, pp. 601–605, Morgan-Kaufman, 1991.
R. A. Levinson, “Uds: A universal data structure,” in Proc. 2ND International Conference on Conceptual Structures, (College Park, Maryland USA), pp. 230–250, 1991.
S. Markovitch and Y. Sella, “Learning of resource allocation strategies for game playing,” Computational Intelligence, vol. 12, pp. 88–105, February 1996.
D. P. Miranker, “Treat: A better match algorithm for ai production systems,” in Proceedings of AAAI-87, pp. 42–47, 1987.
E. Morales, “Learning patterns for playing strategies,” International Computer Chess Association Journal, vol. 17, pp. 15–26, March 1994.
S. Omohundro, “Efficient algorithms with neural network behavior,” Tech. Rep. UIUCDCS-R-87-1331, University of Illinois, April 1987.
E. D. Rumelhart and J. L. McClelland, Parallel Distributed Processing, vol. 1–2. MIT Press, 1986.
S. Russell and E. Wefald, Do The Right Thing: studies in limited rationality. Cambridge, Massachusetts: MIT Press, 1991.
R. Sutton, “Special issue on reinforcement learning,” Machine Learning, 1991.
R. S. Sutton, “Learning to predict by the methods of temporal differences,” Machine Learning, vol. 3, pp. 9–44, August 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Levinson, R., Wilkinson, J. (1997). Meta-Reasoning for Data Analysis Tool Allocation. In: Liu, X., Cohen, P., Berthold, M. (eds) Advances in Intelligent Data Analysis Reasoning about Data. IDA 1997. Lecture Notes in Computer Science, vol 1280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052832
Download citation
DOI: https://doi.org/10.1007/BFb0052832
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63346-4
Online ISBN: 978-3-540-69520-2
eBook Packages: Springer Book Archive