NDLI: From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules

Content Provider	IEEE Xplore Digital Library
Author	Zhipeng Xie Zongtian Liu
Copyright Year	2005
Description	Author affiliation: Dept. of Comput. & Inf. Technol., Fudan Univ., Shanghai (Zhipeng Xie)
Abstract	Automatic extraction of data dependencies or regularities from historical data is of great importance in practice. Concept lattice could serve as a common framework for such tasks. To deal with two typical kinds of data dependencies, attribute implications and association rules, this paper presents the definitions of intent reducts and approximate intent reducts, as the theoretical foundation for extracting these two kinds of knowledge. Algorithms for calculating them are developed. We also given out the methods for extracting attribute implications and association rules. The results provide a better understanding of attribute implications, association rules, and concept lattices
Sponsorship	Univ. of Aizu, Japan Nat. Natural Sci. Found. China Fudan GrandHorizon Inf. Technol., Inc. China Hewlett-Packard Co., Ltd
Starting Page	162
Ending Page	169
File Size	309241
Page Count	8
File Format	PDF
ISBN	076952432X
DOI	10.1109/CIT.2005.121
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-09-21
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Bridges Databases Lattices Rough sets Machine learning Data engineering Association rules Data mining Decision trees Information technology
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

An Applied Method for Inferring Knowledge Rules

Mining associative decision rules in decision tables through attribute value reduction

Information Granularity Lattices

Incremental Granular Ranking Algorithm Based on Rough Sets

Research on rules reduction for real value attribute information system based on fuzzy similarity

Dual-Universe Rough Sets Model Based on Pansystems

Rough Set Based Attribute Reduction and Extension Data Mining

Approximate reducts and association rules -- correspondence and complexity results -- (1999).

Correlativity sets based theoretical frameworks of data mining

From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules

Similar Documents

An Applied Method for Inferring Knowledge Rules

Mining associative decision rules in decision tables through attribute value reduction

Information Granularity Lattices

Incremental Granular Ranking Algorithm Based on Rough Sets

Research on rules reduction for real value attribute information system based on fuzzy similarity

Dual-Universe Rough Sets Model Based on Pansystems

Rough Set Based Attribute Reduction and Extension Data Mining

Approximate reducts and association rules -- correspondence and complexity results -- (1999).

Correlativity sets based theoretical frameworks of data mining

From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules