Identification of feature-salience

In this paper we present two techniques designed to identify the relative salience of features in a data-defined problem with respect to their ability to predict a category outcome-e.g., which features of a character contribute most to accurate prediction of outcome. The first technique we proposed is a neural-net based clamping technique and another is based on inductive learning algorithm-decision tree's heuristic. They are compared with a number of other techniques, i.e., automatic relevance determination (ARD), weight-product, random selection, in addition to a standard statistical technique-linear correlation analysis. The salience of the features that compose a proposed set is an important problem to solve efficiently and effectively not only for neural computing technology but also in order to provide a sound basis for any attempt to design an optimal computational system. The focus of this study is the efficiency as well as the effectiveness with which high-salience subsets of features can be identified in the context of ill-understood and potentially noisy real-world data.

[1]  J. Utans,et al.  Selecting neural network architectures via the prediction risk: application to corporate bond rating prediction , 1991, Proceedings First International Conference on Artificial Intelligence Applications on Wall Street.

[2]  Xinhua Zhuang,et al.  A general model for bidirectional associative memories , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[3]  D Partridge,et al.  Artificial neural networks: a potential role in osteoporosis , 1999, Journal of the Royal Society of Medicine.

[4]  Tamás D. Gedeon,et al.  Data Mining of Inputs: Analysing Magnitude and Functional Measures , 1997, Int. J. Neural Syst..

[5]  William B. Yates,et al.  Engineering Multiversion Neural-Net Systems , 1996, Neural Computation.

[6]  Korris Fu-Lai Chung,et al.  On fuzzy associative memory with multiple-rule storage capacity , 1996, IEEE Trans. Fuzzy Syst..

[7]  Yee Leung,et al.  Asymmetric bidirectional associative memories , 1994 .

[8]  David J. C. MacKay,et al.  A Practical Bayesian Framework for Backpropagation Networks , 1992, Neural Computation.

[9]  Derek Partridge,et al.  Ranking Pattern Recognition Features for Neural Networks , 1999 .

[10]  BART KOSKO,et al.  Bidirectional associative memories , 1988, IEEE Trans. Syst. Man Cybern..

[11]  Derek Partridge,et al.  Assessing the Impact of Input Features in a Feedforward Neural Network , 2000, Neural Computing & Applications.

[12]  Xinhua Zhuang,et al.  Better learning for bidirectional associative memory , 1993, Neural Networks.