𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An inductive learning algorithm based on regression analysis

✍ Scribed by Hiroshi Tsukimoto; Chie Morita; Nobuhiro Shimogori


Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
1020 KB
Volume
28
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Analysis of Two Gradient-Based Algorithm
✍ NicolΓ² Cesa-Bianchi πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 189 KB

In this paper we present a new analysis of two algorithms, Gradient Descent and Exponentiated Gradient, for solving regression problems in the on-line framework. Both these algorithms compute a prediction that depends linearly on the current instance, and then update the coefficients of this linear

Learning Foraging Thresholds for Lizards
✍ Leslie Ann Goldberg; William E. Hart; David Bruce Wilson πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 138 KB

This paper gives proof of convergence for a learning algorithm that describes how anoles (lizards found in the Caribbean) learn foraging threshold distance. An anole will pursue a prey if and only if it is within this threshold of the anole's perch. The learning algorithm was proposed by Roughgarden

A simplified fuel-NOx model based on reg
✍ Minghou Xu; Yaoguo Fan; Jianwei Yuan; Changdong Sheng; Hong Yao πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 137 KB

The mechanism of detailed chemical reactions in combustion is very complicated, especially when the formation of a pollutant such as NO V is considered. Based on regression analysis, a simplified fuel-NO V model is developed for premixed flame. The new model is available for a wider range of temeper

A genetic algorithm with deterministic m
✍ Minoru Fukumi; Norio Akamatsu πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 189 KB πŸ‘ 2 views

This paper presents a method for designing neural networks using a genetic algorithm (GA) with deterministic mutation (DM) based on learning. The GA presented in this paper has a large framework including DM, which is performed on the basis of the results from neural network learning. It can achieve

An iterated local search algorithm for l
✍ Luis M. De Campos; Juan M. FernΓ‘ndez-Luna; J. Miguel Puerta πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

A common approach for learning Bayesian networks (BNs) from data is based on the use of a scoring metric to evaluate the fitness of any given candidate network to the data and a method to explore the search space, which usually is the set of directed acyclic graphs (DAGs). The most efficient search