Abstract
Lately the authors have proposed a new law discovery method called RF5 using neural networks; i.e., law-candidates (neural networks) are trained by using a second-order learning algorithm, and an information criterion selects the most suitable from law-candidates. Our previous experiments showed that RF5 worked well for relatively small problems. This paper evaluates how the method can be scaled up, and analyses how it is invariant for the normalization of input and output variables. Since the sizes of many real data are middle or large, the scalability of any law discovery method is highly important. Moreover since in most real data different variables have typical values which may differ significantly, the invariant nature for the normalization of variables is also important
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
C.M. Bishop. Neural networks for pattern recognition. Clarendon Press, Oxford, 1995.
R. Durbin and D. Rumelhart. Product units: a computationally powerful and biologically plausible extension. Neural Computation, 1(1):133–142, 1989.
P.E. Gill, W. Murray, and M.H. Wright. Practical optimization. Academic Press, 1981.
P. Langley. Bacon.1: a general discovery system. In Proc. 2nd National Conference of the Canadian Society for Computational Studies of Intelligence, pages 173–180, 1978.
P. Langley, H.A. Simon, G. Bradshaw, and J. Zytkow. Scientific discovery: computational explorations of the creative process. MIT Press, 1987.
L.R. Leerink, C.L. Giles, B.G. Horne, and M.A. Jabri. Learning with product units. In Advances in Neural Information Processing Systems7, pages 537–544, 1995.
B. Nordhausen and P. Langley. A robust approach to numeric discovery. In Proc. 7th Int. Conf. on Machine Learning, pages 411–418, 1990.
J. Rissanen. Stochatic complexity in statistical inquiry. World Scientific, 1989.
D.E. Rumelhart, G.E. Hinton, and R.J. Williams. Learning internal representations by error propagation. In Parallel Distributed Processing, Vol.1, pages 318–362. MIT Press, 1986.
K. Saito and R. Nakano. Law discovery using neural networks. In Proc. 15th International Joint Conference on Artificial Intelligence, pages 1078–1083, 1997.
K. Saito and R. Nakano. Partial BFGS update and efficient step-length calculation for three-layer neural networks. Neural Computation, 9(1):239–257, 1997.
C. Schaffer. Bivariate scientific function finding in a sampled, real-data testbed. Machine Learning, 12(1/2/3):167–183, 1993.
R.S. Sutton and C.J. Matheus. Learning polynomial functions by feature construction. In Proc. 8th Int. Conf. on Machine Learning, pages 208–212, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakano, R., Saito, K. (1998). Computational Characteristics of Law Discovery Using Neural Networks. In: Arikawa, S., Motoda, H. (eds) Discovey Science. DS 1998. Lecture Notes in Computer Science(), vol 1532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49292-5_30
Download citation
DOI: https://doi.org/10.1007/3-540-49292-5_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65390-5
Online ISBN: 978-3-540-49292-4
eBook Packages: Springer Book Archive