NDLI: Data Reduction Through Combining Lattice with Rough Sets

Content Provider	IEEE Xplore Digital Library
Author	Bao-Cheng Su Jian-Chao Xu Shu-Yan Chen Zhi-Ping Li
Copyright Year	2006
Description	Author affiliation: Acad. of Comput. Sci. & Eng., Changchun Univ. of Technol. (Bao-Cheng Su)
Abstract	In this paper, we propose a new efficient data reduction algorithm through combining lattice with rough set. On the basis of lattice learning, the algorithm applies the concept of attribute reduction in the theory of rough sets and calculates the importance degree of attributes automatically by a density based approach. Under acceptable classification precision and complexity, it reduces row and column together and generates concise classification rules. The algorithm represents a solution to the problem of attribute generalization on the basis of lattice learning and automatic estimation of attribute weights independently of domain experts. Attributes in the classification rules are ordered by the importance degree of attribute. So in the classification and by the sequence of importance degree of attribute, from one attribute to another, we can exclude the objects which dissatisfy the constraint from the attribute. And then it can, to a large extent, reduce the size of data set of object classified by scanning attribute of the rules, and thereby the efficiency of classification is improved greatly
Sponsorship	IEEE Syst., Man and Cybernetics Hebei Univ.
Starting Page	990
Ending Page	995
File Size	299418
Page Count	6
File Format	PDF
ISBN	1424400619
DOI	10.1109/ICMLC.2006.258530
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-08-13
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Lattices Rough sets Data mining Machine learning Knowledge engineering Computer science Data engineering Educational technology Laboratories Computer science education automatic evaluation lattice lattice machine rough set hypertuple weight
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

Association Rule Mining Analysis on Concept Lattice and Rough Set

Lp - Association Rules mining based on rough concept lattice

Rough Set Based Related Affect Attribute Reduction Algorithm

Continuous-attributes reduction in incomplete information system based on rough sets technique

Discernable matrix and its application in decision rules

Attribute Reduction Based on Rough Neighborhood Approximation

The reduction for two kind of generalized concept lattices

Ordinal fuzzy sets and rough sets

Some Operations of L-Fuzzy Approximate Spaces On Residuated Lattices

Data Reduction Through Combining Lattice with Rough Sets

Similar Documents

Association Rule Mining Analysis on Concept Lattice and Rough Set

Lp - Association Rules mining based on rough concept lattice

Rough Set Based Related Affect Attribute Reduction Algorithm

Continuous-attributes reduction in incomplete information system based on rough sets technique

Discernable matrix and its application in decision rules

Attribute Reduction Based on Rough Neighborhood Approximation

The reduction for two kind of generalized concept lattices

Ordinal fuzzy sets and rough sets

Some Operations of L-Fuzzy Approximate Spaces On Residuated Lattices

Data Reduction Through Combining Lattice with Rough Sets