Sciweavers

640 search results - page 51 / 128
» Extracting Propositions from Trained Neural Networks
Sort
View
IJCAI
1997
14 years 11 months ago
Law Discovery using Neural Networks
This paper proposes a new connectionist approach to numeric law discovery; i.e., neural networks (law-candidates) are trained by using a newly invented second-order learning algor...
Kazumi Saito, Ryohei Nakano
IJCNN
2006
IEEE
15 years 3 months ago
Classify Unexpected News Impacts to Stock Price by Incorporating Time Series Analysis into Support Vector Machine
— the paper discusses an approach of using traditional time series analysis, as domain knowledge, to help the data-preparation of support vector machine for classifying documents...
Ting Yu, Tony Jan, John K. Debenham, Simeon J. Sim...
NPL
2006
172views more  NPL 2006»
14 years 9 months ago
Adapting RBF Neural Networks to Multi-Instance Learning
In multi-instance learning, the training examples are bags composed of instances without labels, and the task is to predict the labels of unseen bags through analyzing the training...
Min-Ling Zhang, Zhi-Hua Zhou
ACSC
2008
IEEE
14 years 11 months ago
An investigation of the state formation and transition limitations for prediction problems in recurrent neural networks
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
Angel Kennedy, Cara MacNish
IJCAI
2007
14 years 11 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...