Boolean feature discovery in empirical learning-Reference-Cited by-同舟云学术

Boolean feature discovery in empirical learning

Published:1990-03 Issue:1 Volume:5 Page:71-99
ISSN:0885-6125
Container-title:Machine Learning
language:en
Short-container-title:Mach Learn

Author:

Bagallo Giulia,Haussler David

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00115895.pdf

Reference23 articles.

1. Beach, L.R. (1964). Cue probabilism and inference behavior.Psychological Monographs, Whole, 582.

2. BlumerA., EhrenfeuchtA., HausslerD. & WarmuthM. (1987). Occam's razor.Information Processing Letters.24:377?380.

3. Breiman, L., Friedman, J.H., Olsen, R.A., & Stone, C.J. (1984).Classification and Regression Trees. Wadsworth Statistic/Probability Series.

4. Carbonell, J., Michalski, R., & Mitchell, T. (1983). An overview of machine learning. InMachine Learning: An Artificial Intelligence Approach, 3?24 Morgan Kaufmann.

5. ClarkP. & NiblettT. (1989). The CN2 induction algorithm.Machine Learning,3:251?283.

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Feature construction using explanations of individual predictions;Engineering Applications of Artificial Intelligence;2023-04

2. Disjunctive Rule Lists;INFORMS Journal on Computing;2022-11

3. Decision List Compression by Mild Random Restrictions;Journal of the ACM;2021-12-31

4. A Frequent Pattern Conjunction Heuristic for Rule Generation in Data Streams;Information;2021-01-09

5. Decision list compression by mild random restrictions;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-22