1. Bay, S.D.: Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets. In: Proc. of 15 ICML, Morgan Kaufmann, Madison, 1998
2. Bazan J., A Comparison of Dynamic and non-Dynamic Rough Set Methods for Extracting Laws from Decision Tables, In Polkowski L.(ed.), Rough Sets in Knowledge Discovery, Physica Verlag, Heidelberg, 1998 [10], vol. 1, pp. 321–365
3. Bazan, J.G., Nguyen, H.S., Nguyen, S.H, Synak, P., Wróblewski, J.: Rough Set Algorithms in Classification Problem. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds), Rough Set Methods and Applications, Physica-Verlag, 2000 pp. 49–88.
4. LNAI;J. Bazan,2001
5. Garey M., Johnson D., Computers and Intarctability: A Guide to the Theory of NP-completness, W.H. Freeman&Co., San Francisco, 1998, (twentieth print)