NDLI: Finding all the absolute reductions based on discernibility matrix

Content Provider	IEEE Xplore Digital Library
Author	Hua Li Jie Zhu
Copyright Year	2005
Description	Author affiliation: Dept. of Math., Shijiazhuang Railway Inst., Hebei, China (Hua Li)
Abstract	Rough-set-based-method to simplify a decision table is of great importance. We can calculate the absolute reductions and relative reductions and core through the discernibility matrix, but the numeration is very complex and the archival memory is very large. In this paper, we present a new notion for finding all the absolute reductions in a given information system. Firstly we present the conception of an indiscernibility matrix based on discernibility matrix, secondly, through the analysis of the discernibility matrix and indiscernibility matrix and the indiscernible equivalent relation induced by attributes sets in the context of rough sets, we present two new algorithm for finding all the absolute reductions in a given information system. The new algorithms are valid to finding all the relative reductions also. In the new algorithm 1, through the Boer function analysis to the discernibility function, we can remove the elements that are independent of the calculation in the discernibility matrix. Furthermore, we can obtain the indiscernibility matrix based on discernibility matrix and place items in that in accordance with the order of the exponent, this can simplify the calculation. Consequently the numeration can be decreased. In the new algorithm 2, its complexity is the n power once of 2; it is valid to the information that consists of few attributes. Both the theoretical analysis and experimental results are made to validate to the presented new algorithm.
Sponsorship	IEEE Syst., Man and Cybernetics Tech. Comm. on Cybernetics, Hong Kong Polytechnic Univ. Hebei Univ. South China Univ. Chongqing Univ. Sun Yat-sen Univ. Harbin Inst. of Technol. and Int. Univ. in Germany
Starting Page	5682
Ending Page	5685
File Size	243058
Page Count	4
File Format	PDF
ISBN	0780390911
DOI	10.1109/ICMLC.2005.1527949
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-08-18
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Information systems Rough sets Mathematics Information analysis Rail transportation Educational institutions Computer science Reductions Decision tables Discernibility matrix Indiscernibility matrix
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Applying Indiscernibility Attribute to Attribute Reduction Based on Discernibility Matrix

The reduction generated algorithm of minimal disjunctive normal form based on discernibility matrix

Attribute reduction based on improved discernibility matrix

Notice of RetractionAttribute reduction based on improved discernibility matrix

Characterization and algorithm of decision system's core based discernibility matrix

Algorithm for decision rules reduction in incomplete information system based on binary discernibility matrix

New Algorithm for Computing the Core Based on Skowron's Discernibility Matrix

A new method of ascertaining Attribute Weight based on discernibility matrix

An Improved Discernibility Matrix for Computing All Reducts of an Inconsistent Decision Table

Finding all the absolute reductions based on discernibility matrix

Similar Documents

Applying Indiscernibility Attribute to Attribute Reduction Based on Discernibility Matrix

The reduction generated algorithm of minimal disjunctive normal form based on discernibility matrix

Attribute reduction based on improved discernibility matrix

Notice of RetractionAttribute reduction based on improved discernibility matrix

Characterization and algorithm of decision system's core based discernibility matrix

Algorithm for decision rules reduction in incomplete information system based on binary discernibility matrix

New Algorithm for Computing the Core Based on Skowron's Discernibility Matrix

A new method of ascertaining Attribute Weight based on discernibility matrix

An Improved Discernibility Matrix for Computing All Reducts of an Inconsistent Decision Table

Finding all the absolute reductions based on discernibility matrix