NDLI: Rule induction based on rough sets from possibilistic information under Lipski's approach

Content Provider	IEEE Xplore Digital Library
Author	Nakata, M. Sakai, H.
Copyright Year	2014
Abstract	How rules are induced on the basis of rough sets under Lipski's approach has been examined in a possibilistic information system where attribute values in information tables are expressed by normal possibility distributions. In Lipski's approach possible tables are created from the original information table and each possible table has a possibilistic degree with which it is the actual information table. In each possible table, rough approximations are obtained for a set of objects. The possible membership degree of an object is the maximum of possibilistic degrees of possible tables where the object is included in the rough approximations. The certain membership degree is one minus the maximum of possibilistic degrees of possible tables where the object is not included in the rough approximations. Therefore, the certain and possible membership degrees are the lower and upper bounds of the membership degree that the object actually has. This leads an object to have membership degrees expressed by not a single, but an interval value for rough approximations, which is essential in possibilistic information systems. For the rough approximations, the complementarity property holds, as is so in complete information systems. This gives justification for dealing with possibilistic information under Lipski's approach. It is required to use rough approximations whose element consists of a pair of an object and a rule that it supports in order to induce rules from an information table. Criterion are introduced for whether or not objects validly supports rules, because they support lots of rules with low degrees in possibilistic information systems. By using the criterions, only rules that are validly supported can be selected from lots of rules.
Starting Page	218
Ending Page	223
File Size	299454
Page Count	6
File Format	PDF
ISBN	9781479954643
DOI	10.1109/GRC.2014.6982838
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-10-22
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Upper bound Lower and upper approximations Conferences Rule induction Semantics Natural languages Rough sets Possible world semantics Approximation methods Possibilistic information Information systems
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

Rule induction based on rough sets from information tables containing possibilistic information

Dual rough approximations in possibilistic information systems

Rule induction based on rough sets from information tables having continuous domains

Rough Lattices

Definability of approximations in reflexive relations

Rule induction for tolerance relation-based rough sets

Two Rough Approximations for Information Tables Containing Missing Values

On variable precision of generalized rough sets

Semantic relationships and approximations of sets: An ontological graph based approach

Rule induction based on rough sets from possibilistic information under Lipski's approach

Similar Documents

Rule induction based on rough sets from information tables containing possibilistic information

Dual rough approximations in possibilistic information systems

Rule induction based on rough sets from information tables having continuous domains

Rough Lattices

Definability of approximations in reflexive relations

Rule induction for tolerance relation-based rough sets

Two Rough Approximations for Information Tables Containing Missing Values

On variable precision of generalized rough sets

Semantic relationships and approximations of sets: An ontological graph based approach

Rule induction based on rough sets from possibilistic information under Lipski's approach