Design and Implementation of Rough Set Algorithms on FPGA: A Survey

Abstract: Rough set theory, developed by Z. Pawlak, is a powerful soft computing tool for extracting meaningful patterns from vague, imprecise, inconsistent and large chunk of data. It classifies the given knowledge base approximately into suitable decision classes by removing irrelevant and redundant data using attribute reduction algorithm. Conventional Rough set information processing like discovering data dependencies, data reduction, and approximate set classification involves the use of software running on general purpose processor. Since last decade, researchers have started exploring the feasibility of these algorithms on FPGA. The algorithms implemented on a conventional processor using any standard software routine offers high flexibility but the performance deteriorates while handling larger real time databases. With the tremendous growth in FPGA, a new area of research has boomed up. FPGA offers a promising solution in terms of speed, power and cost and researchers have proved the benefits of mapping rough set algorithms on FGPA. In this paper, a survey on hardware implementation of rough set algorithms by various researchers is elaborated.

Kanchan Shailendra Tiwari and Ashwin. G. Kothari. “Design and Implementation of Rough Set Algorithms on FPGA: A Survey”. International Journal of Advanced Research in Artificial Intelligence (IJARAI) 3.9 (2014). http://dx.doi.org/10.14569/IJARAI.2014.030903

@article{Tiwari2014,
title = {Design and Implementation of Rough Set Algorithms on FPGA: A Survey},
journal = {International Journal of Advanced Research in Artificial Intelligence},
doi = {10.14569/IJARAI.2014.030903},
url = {http://dx.doi.org/10.14569/IJARAI.2014.030903},
year = {2014},
publisher = {The Science and Information Organization},
volume = {3},
number = {9},
author = {Kanchan Shailendra Tiwari and Ashwin. G. Kothari}
}