Loading...
Loading...
British Journal of Computer, Networking and Information Technology
Vol. 7Issue 12024pp. 84–92Published 1 May 2024
DOI 10.52589/BJCNIT-JAK93DUNShare Link
Cite this
Citation unavailable for this article.
Abstract:
One method for handling imprecise, ambiguous, and unclear data is rough set theory. Rough set theory offers a practical method for making decisions during data extraction. The practice of analyzing vast amounts of data to extract useful information from a larger collection of raw data is known as data mining. This paper discusses consistent data with rough set theory, covering blocks of attribute-value pairs, information table reductions, decision tables, and indiscernibility relations. It also explains the basics of rough set theory with a focus on applications to data mining. Additionally, rule induction algorithms are explained. The rough set theory to inconsistent data is then introduced, containing certain and potential rule sets along with lower and upper approximations (Skowron, et al, 2018). Finally, a presentation and explanation of rough set theory to incomplete data is given. This includes characteristic sets, characteristic relations, and blocks of attribute-value pairs.
Disclaimer/Publisher’s Note
The statements, opinions and data contained in this publication are solely those of the author(s) and contributor(s) and not of AB Journals or its editors. AB Journals remains neutral and accepts no responsibility for any injury or damage resulting from ideas, methods, instructions or products referred to in the content.
Copyrights