• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

A generalized definition of rough approximations based on similarity

Thumbnail
Date
2000
Dewey
Intelligence artificielle
Sujet
Rough sets; similarity relation.; lower and upper approximations; ambiguity
Journal issue
IEEE Transactions on Knowledge and Data Engineering
Volume
12
Number
2
Publication date
2000
Article pages
331-336
Publisher
Institute of Electrical and Electronics Engineers
DOI
http://dx.doi.org/http://doi.ieeecomputersociety.org/10.1109/69.842271
URI
https://basepub.dauphine.fr/handle/123456789/2806
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Slowinski, Roman
Vanderpooten, Daniel
Type
Article accepté pour publication ou publié
Abstract (EN)
This paper proposes new definitions of lower and upper approximations, which are basic concepts of the rough set theory. These definitions follow naturally from the concept of ambiguity introduced in this paper. The new definitions are compared to the classical definitions and are shown to be more general, in the sense that they are the only ones which can be used for any type of indiscernibility or similarity relation.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.