Minimal approximate hitting sets and rule templates

International Journal of Approximate Reasoning

Volumn 25, Issue 2, 2000, Pages 123-143

  Vinterbo, Staal ^a   Øhrn, Aleksander ^a  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

Classification; Genetic algorithm; Hitting set; Reducts; Rough sets

Indexed keywords

EID: 0001206731     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0888-613X(00)00051-7     Document Type: Article

References (29)

1. W.R. Pearson, G. Robins, D.E. Wrege, T. Zhang, On the primer selection problem in polymerase chain reaction experiments, Discrete Applied Mathematics 71 (1-3) (1996) 231-246.
2. A.E. Andreev, A.E.F. Clementi, J.D.P. Rolim, Hitting sets derandomize BPP, In: Automata, languages and programming, number 1099, Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 357-368.
3. D.S. Hochbaum, An optimal test compression procedure for combinatorial circuits, IEEE Transactions of Computer-Aided Design of Integrated Circuits and Systems 15 (10) (1996) 1294-1299.
4. J.A. Reggia, D.S. Nau, P.Y. Wang, Diagnostic expert systems based on a set covering model, International Journal of Man-Machine Studies 19 (1983) 437-460.
5. G. Ausiello, A. D'Atri, M. Protasi, Structure preserving reductions among convex optimization problems, Journal of Computer and System Sciences 21 (1) (1980) 136-153.
6. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
7. D.S. Johnson, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences 9 (1974) 256-278.
8. Z. Pawlak, Rough sets, International Journal of Information and Computer Science 11 (1982).
9. J.H. Holland, Adaption in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.
10. R. Dybowski, P. Weller, R. Chang, V. Gant, Prediction of outcome in critically ill patients using artificial neural network synthesized by genetic algorithm, Lancet 347 (9009) (1996) 1146-1150.
11. S. Vinterbo, L. Ohno-Machado, A genetic algorithm approach to multidisorder diagnosis, Artificial Intelligence in Medicine, 18 (2) (2000) 117-132.
12. A. Skowron, C. Rauszer, The discernibility matrices and functions in information systems, In: R. Słowiński (Ed.), Intelligent Decision Support: Handbook of Applications and Advances in Rough Sets Theory, Vol. 11 of Series D: System Theory, Knowledge Engineering and Problem Solving, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1992, pp. 331-362 (Chapter III-2).
13. Z. Pawlak, Rough Sets, Theoretical Aspects of Reasoning about Data, Series D: System Theory, Knowledge Engineering and Problem Solving, Vol. 9, Kluwer Academic Publishers, Dordrecht, 1991.
14. A. Skowron, Synthesis of adaptive decision systems from experimental data, in: A. Aamodt, J. Komorowski (Eds.), SCAI - 95 Fifth Scandinavian Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, Vol. 28, IOS Press, 1995.
15. J.G. Bazan, A comparison of dynamic and non-dynamic rough set methods for extracting laws from decision tables, in: L. Polkowski, A. Skowron (Eds.), Rough Sets in Knowledge Discovery 1: Methodology and Applications, Studies in Fuzziness and Soft Computing, Vol. 18, Physica, Heidelberg, Germany, 1998, pp. 321-365 (Chapter 17).
16. J.G. Bazan, A. Skowron, P. Synak, Dynamic reducts as a tool for extracting laws from decision tables, In: Proceedings of the International Symposium on Methodologies for Intelligent Systems, number 869, Lecture Notes in Artificial Intelligence, Springer, New York, 1994, pp. 346-355.
17. A. Øhrn, J. Komorowski, A. Skowron, P. Synak, The design and implementation of a knowledge discovery toolkit based on rough sets: The ROSETTA system, in: L. Polkowski, A. Skowron (Eds.), Rough Sets in Knowledge Discovery 1: Methodology and Applications, Vol. 18, Studies in Fuzziness and Soft Computing, Physica, Heidelberg, Germany, 1998, pp. 376-399 (Chapter 19).
18. J.A. Swets, R.M. Pickett, Evaluation of Diagnostic Systems. Methods from Signal Detection Theory, Academic Press, New York, 1982.
19. F.E. Harrell Jr., R.M. Califf, D.B. Pryor, K.L. Lee, R.A. Rosati, Evaluating the yield of medical tests, Journal of the American Medical Association 247 (18) (1982) 2543-2546.
20. J.A. Hanley, B.J. McNeil, A method of comparing the areas under receiver operating characteristic curves derived from the same cases, Radiology 148 (1983) 839-843.
21. Uci repository of machine learning databases and domain theories, ftp://ftp.ics.uci.edu/pub/ machine-learning-databases/.
22. E. Alpaydin, Combined 5 x 2 CV F test for comparing supervised classification learning algorithms, Neural Computing 11 (8) (1999) 1885-1982.
23. T.G. Dietterich, Approximate statistical tests for comparing supervised classification learning algorithms, Neural Computation 10 (7) (1998) 1895-1923.
24. F.M. Brown, Boolean Reasoning, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1990.
25. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, New York, 1992.
26. J. Wröblewski, Finding minimal reducts using genetic algorithms, in: Proceedings of the Second Annual Join Conference on Information Sciences, October 1995, pp. 186-189.
27. P. Pritchard, A simple sub-quadratic algorithm for computing the subset partial order, Information Processing Letters 56 (1995) 337-341.
28. W.W. Koczkodaj, M. Orlowski, V.W. Marek, Myths about rough set theory, Communications of the ACM 41 (11) (1998) 102-103.
29. M. Mitchell, An Introduction to Genetic Algorithms, MIT press, Cambridge, 1996.