A design of semantics filter using the inductive learning algorithm for GIS

2004 ◽  
Author(s):  
M. Nerome ◽  
T. Yabiku ◽  
Y. Matsuda ◽  
Dongslaik Kang ◽  
H. Miyagi ◽  
...  
Keyword(s):  
Learning Algorithm ◽  
Inductive Learning

Application of a Rough Set-Based Inductive Learning System

1993 ◽  
Vol 18 (2-4) ◽  
pp. 209-220
Author(s):  
Michael Hadjimichael ◽  
Anita Wasilewska
Keyword(s):  
Machine Learning ◽  
Rough Set ◽  
Presidential Election ◽  
Predictive Accuracy ◽  
Learning Algorithm ◽  
Inductive Learning ◽  
Real Data ◽  
Semantic Content ◽  
Learning System ◽  
Voter Preferences

We present here an application of Rough Set formalism to Machine Learning. The resulting Inductive Learning algorithm is described, and its application to a set of real data is examined. The data consists of a survey of voter preferences taken during the 1988 presidential election in the U.S.A. Results include an analysis of the predictive accuracy of the generated rules, and an analysis of the semantic content of the rules.

scholarly journals How to Shift Bias: Lessons from the Baldwin Effect

1996 ◽  
Vol 4 (3) ◽  
pp. 271-295 ◽  
Author(s):  
Peter Turney
Keyword(s):  
Learning Algorithm ◽  
Inductive Learning ◽  
Learning Algorithms ◽  
Darwinian Evolution ◽  
Baldwin Effect ◽  
Lamarckian Evolution ◽  
Inheritance Of Acquired Characteristics ◽  
The Baldwin Effect ◽  
Fixed Bias ◽  
Shift Of Bias

An inductive learning algorithm takes a set of data as input and generates a hypothesis as output. A set of data is typically consistent with an infinite number of hypotheses; therefore, there must be factors other than the data that determine the output of the learning algorithm. In machine learning, these other factors are called the bias of the learner. Classical learning algorithms have a fixed bias, implicit in their design. Recently developed learning algorithms dynamically adjust their bias as they search for a hypothesis. Algorithms that shift bias in this manner are not as well understood as classical algorithms. In this paper, we show that the Baldwin effect has implications for the design and analysis of bias shifting algorithms. The Baldwin effect was proposed in 1896 to explain how phenomena that might appear to require Lamarckian evolution (inheritance of acquired characteristics) can arise from purely Darwinian evolution. Hinton and Nowlan presented a computational model of the Baldwin effect in 1987. We explore a variation on their model, which we constructed explicitly to illustrate the lessons that the Baldwin effect has for research in bias shifting algorithms. The main lesson is that it appears that a good strategy for shift of bias in a learning algorithm is to begin with a weak bias and gradually shift to a strong bias.

A SIMPLE FORECASTING GAME

2006 ◽  
Vol 17 (02) ◽  
pp. 279-286 ◽  
Author(s):  
M. ANDRECUT
Keyword(s):  
Learning Algorithm ◽  
Inductive Learning ◽  
Numerical Results ◽  
Future State ◽  
Unexpected Consequence ◽  
The Future ◽  
Correct Forecast

We consider a population of Boolean agents playing a simple forecasting game, in which the goal of each agent is to give a correct forecast of the future state of its neighbors. The numerical results show that by using a simple inductive learning algorithm the agents are able to accurately achive the goal of the game. However, this remarkable performance has an unexpected consequence: by learning to forecast the future, the agents dynamics freezes up at the end of the game; the only way to regain their dynamics is to forget what they have learned.

scholarly journals Graphical evolving transformation system machine

2015 ◽  
Author(s):  
◽  
Thanh Thieu
Keyword(s):  
Learning Algorithm ◽  
Minimum Description Length ◽  
Inductive Learning ◽  
Human Perception ◽  
Machine Intelligence ◽  
Transformation System ◽  
Noisy Input ◽  
Wide Range ◽  
Real World Datasets ◽  
Class Representation

For years, scientists have challenged the machine intelligence problem. Learning classes of objects followed by the classification of objects into their classes is a common task in machine intelligence. For this task, two objects representation schemes are often used: a vector-based representation, and a graph-based representation. While the vector representation has sound mathematical background and optimization tools, it lacks the ability to encode relations between the patterns and their parts, thus lacking the complexity of human perception. On the other hand, the graph-based representation naturally captures the intrinsic structural properties, but available algorithms usually have exponential complexity. In this work, we build an inductive learning algorithm that relies on graph-based representation of objects and their classes, and test the framework on a competitive dataset of human actions in static images. The method incorporates three primary measures of class representation: likelihood probability, family resemblance typicality, and minimum description length. Empirical benchmarking shows that the method is robust to the noisy input, scales well to real-world datasets, and achieves comparable performance to current learning techniques. Moreover, our method has the advantage of intuitive representation regarding both patterns and class representation. While applied to a specific problem of human pose recognition, our framework, named graphical Evolving Transformation System (gETS), can have a wide range of applications and can be used in other machine learning tasks.

ILA: an inductive learning algorithm for rule extraction

1998 ◽  
Vol 14 (3) ◽  
pp. 361-370 ◽  
Author(s):  
Mehmet R. Tolun ◽  
Saleh M. Abu-Soud
Keyword(s):  
Learning Algorithm ◽  
Inductive Learning ◽  
Rule Extraction
Sign in / Sign up

Export Citation Format

Share Document