Design and Implementation of Rough Set Algorithms on FPGA: A Survey
Journal Title: International Journal of Advanced Research in Artificial Intelligence(IJARAI) - Year 2014, Vol 3, Issue 9
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.
Authors and Affiliations
Kanchan Tiwari, Ashwin. Kothari
Keywords
Related Articles
- EP ID EP94483
- DOI 10.14569/IJARAI.2014.030903
- Views 131
- Downloads 0
Applying Inhomogeneous Probabilistic Cellular Au-tomata Rules on Epidemic Model
This paper presents some of the results of our probabilis¬tic cellular automaton (PCA) based epidemic model. It is shown that PCA performs better than deterministic ones. We consider two possible ways of interactio...
A Comparative Study on different AI Techniques towards Performance Evaluation in RRM(Radar Resource Management)
The multifunction radar (MFR) has to make a decision as to which functions are to be performed first or which must be degraded or even not done at all when there are not enough resources to be allocated. The process of m...
Category Decomposition Method for Un-Mixing of Mixels Acquired with Spaceborne Based Visible and Near Infrared Radiometers by Means of Maximum Entropy Method with Parameter Estimation Based on Simulated Annealing
Category decomposition method for un-mixing of mixels (Mixed Pixels) which is acquired with spaceborne based visible to near infrared radiometers by means of Maximum Entropy Method (MEM) with parameter estimation b...
A genetic algorithm approach for scheduling of resources in well-services companies
In this paper, two examples of resources scheduling in well-services companies are solved by means of genetic algorithms: resources for call solving, people scheduling. The results demonstrate that the genetic algorithm...
Dynamic Programming Method Applied in Vietnamese Word Segmentation Based on Mutual Information among Syllables
Vietnamese word segmentation is an important step in Vietnamese natural language processing such as text categorization, text summary, and automated machine translation. The problem with Vietnamese word segmentatio...