NDLI: A Quick Algorithm for Computing Core Based on the Positive Region

Content Provider	IEEE Xplore Digital Library
Author	Wei-Dong Cai Zhang-Yan Xu Wei Song Bing-Ru Yang
Copyright Year	2007
Description	Author affiliation: Univ. of Ji'nan, Jinan (Wei-Dong Cai)
Abstract	Some scholars provided the discernibility matrix based on the positive region. The time complexity of the algorithm for computing core with this discernibility matrix is $O(\|CparU\|^{2}$ ). For cutting down the time complexity of the algorithm, the definition of simplified discernibility matrix based on the positive region and the corresponding definition of the core are provided. At the same time, it is proved that this core is equivalent to the core based on the positive region. Since the partition of U/C is the key process for computing simplified discernibility matrix, a quick algorithm for computing U/C is designed with the idea of radix sorting. Its time complexity is O(\|CparU\|). On this condition, a new algorithm for computing core based on the positive region is designed with the simplified discernibility. Its time complexity is cut down to $max\{O(\|CparU'_{pos}parU/C\|),$ O(\|CparU\|)}.
Starting Page	676
Ending Page	681
File Size	379720
Page Count	6
File Format	PDF
ISBN	9780769529097
DOI	10.1109/SNPD.2007.87
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-07-30
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Decision making Simplified discernibility matrix Partitioning algorithms Distributed computing Sorting Complexity Rough set Concurrent computing Partial response channels Set theory Computer networks Artificial intelligence Positive region Core
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

Different core attributes's comparison and analysis

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

Algorithm with database technology for computing the core based on Skowron's discernibility matrix

Decision table decomposition using core attributes partition for attribute reduction

New Algorithm for Computing the Core Based on Information Entropy

Comparison study on different core attributes

Improved algorithm for attribute core computing based on binary discernibility matrix

Distributed Mining Core of Attributes on Horizontally Partitioned Data

An Improved Incremental Updating Algorithm for the Core Computation of Decision Table

A Quick Algorithm for Computing Core Based on the Positive Region

Similar Documents

Different core attributes's comparison and analysis

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

Algorithm with database technology for computing the core based on Skowron's discernibility matrix

Decision table decomposition using core attributes partition for attribute reduction

New Algorithm for Computing the Core Based on Information Entropy

Comparison study on different core attributes

Improved algorithm for attribute core computing based on binary discernibility matrix

Distributed Mining Core of Attributes on Horizontally Partitioned Data

An Improved Incremental Updating Algorithm for the Core Computation of Decision Table

A Quick Algorithm for Computing Core Based on the Positive Region