A partial order for the M-of-N rule-extraction algorithm

IEEE Transactions on Neural Networks

Volumn 8, Issue 6, 1997, Pages 1542-1544

  Maire, Frédéric ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Complexity; Neural network; Partial order; Rule extraction

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; NEURAL NETWORKS; VECTORS;

PARTIAL ORDER; RULE EXTRACTION ALGORITHM;

ALGORITHMS;

EID: 0031270628     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/72.641475     Document Type: Article

References (7)

1. R. Andrews, J. Diederich, and A. Tickle, "A survey and critique of techniques for extracting rules from trained artificial neural networks," Knowledge-Based Syst., vol. 8, no. 6, pp. 373-389, 1995.
2. G. Bradley, P. Hammer, and L. Wolsey, "Coefficient reduction for inequalities in 0-1 variables," Math. Programming, vol. 7, pp. 263-282, 1974.
3. M. Garey and D. Johnson, "Computer and intractability: A guide to the theory of NP-completeness," 1979.
4. P. Hammer, U. Peled, and M. Pollatscheck, "An algorithm to dualize a regular switching function," IEEE Trans. Comput., vol. C-28, pp. 238-243, Mar. 1979.
5. M. Golea, "On the complexity of rule-extraction from neural networks and network-querying," in Proc. Rule Extraction Trained Artificial Neural Networks Wkshp., AISB '96.
6. U. Peled and B. Simeone, "Polynomial-time algorithms for regular set-covering and threshold synthesis," Discrete Appl. Math., vol. 12, 1985, pp. 57-69.
7. G. Towel and J. Shavlik, "Extracting refined rules from knowledge-based neural networks," Machine Learning, vol. 13, no. 1, pp. 71-101, 1993.