A connectionist approach to generating oblique decision trees
暂无分享,去创建一个
[1] Saul B. Gelfand,et al. Classification trees with neural network feature extraction , 1992, IEEE Trans. Neural Networks.
[2] Ehud D. Karnin,et al. A simple procedure for pruning back-propagation trained neural networks , 1990, IEEE Trans. Neural Networks.
[3] Simon Kasif,et al. Induction of Oblique Decision Trees , 1993, IJCAI.
[4] Leo Breiman,et al. Classification and Regression Trees , 1984 .
[5] Yann LeCun,et al. Optimal Brain Damage , 1989, NIPS.
[6] Timur Ash,et al. Dynamic node creation in backpropagation networks , 1989 .
[7] Christopher J. Merz,et al. UCI Repository of Machine Learning Databases , 1996 .
[8] J. Ross Quinlan,et al. Learning Efficient Classification Procedures and Their Application to Chess End Games , 1983 .
[9] Babak Hassibi,et al. Second Order Derivatives for Network Pruning: Optimal Brain Surgeon , 1992, NIPS.
[10] Ron Sun,et al. Hybrid Connectionist-Symbolic Modules: A Report from the IJCAI-95 Workshop on Connectionist-Symbolic Integration , 1996, AI Mag..
[11] Rudy Setiono,et al. A Penalty-Function Approach for Pruning Feedforward Neural Networks , 1997, Neural Computation.
[12] Rudy Setiono,et al. Use of a quasi-Newton method in a feedforward neural network construction algorithm , 1995, IEEE Trans. Neural Networks.
[13] O. Mangasarian,et al. Pattern Recognition Via Linear Programming: Theory and Application to Medical Diagnosis , 1989 .
[14] Simon Kasif,et al. OC1: A Randomized Induction of Oblique Decision Trees , 1993, AAAI.
[15] Rudy Setiono. A Neural Network Construction Algorithm which Maximizes the Likelihood Function , 1995, Connect. Sci..
[16] Krzysztof J. Cios,et al. A machine learning method for generation of a neural network architecture: a continuous ID3 algorithm , 1992, IEEE Trans. Neural Networks.