THA-A Hybrid Approach for Rule Induction System using Rough Set Theory, Genetic Algorithm and Boolean algebra
Keywords:
rough set theory, genetic algorithm, mutation, crossover, boolean algebra
Abstract
The major process of discovering knowledge in database is the extraction of rules from classes of data. One of the major obstacles in performing rule induction from training data set is the inconsistency of information about a problem domain. In order to deal with this problem, many theories and technology have been developed in recent years. Among them the most successful ones are decision tree, fuzzy set, Dempster-Shafer theory of evidence. Unfortunately, all are referring to either prior or posterior probabilities. The rough set concept proposed by Pawlak is a new mathematical approach to inconsistent, vagueness, imprecision and uncertain data. In this paper we have proposed a hybridized model THA (Training dataset on hybrid approach) which combines rough set theory, genetic algorithm and Boolean algebra for discovering certain rules and also induce probable rules from inconsistent information. The experimental result shows that the projected method induced maximal generalized rules efficiently. The hybridized model was validated using the data obtained from observational study.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2014-01-15
Issue
Section
License
Copyright (c) 2014 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.