• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

A generalized definition of rough approximations based on similarity

Slowinski, Roman; Vanderpooten, Daniel (2000), A generalized definition of rough approximations based on similarity, IEEE Transactions on Knowledge and Data Engineering, 12, 2, p. 331-336. http://doi.ieeecomputersociety.org/10.1109/69.842271

Type
Article accepté pour publication ou publié
Date
2000
Journal name
IEEE Transactions on Knowledge and Data Engineering
Volume
12
Number
2
Publisher
Institute of Electrical and Electronics Engineers
Pages
331-336
Publication identifier
http://doi.ieeecomputersociety.org/10.1109/69.842271
Metadata
Show full item record
Author(s)
Slowinski, Roman
Vanderpooten, Daniel
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.
Subjects / Keywords
Rough sets; similarity relation.; lower and upper approximations; ambiguity

Related items

Showing items related by title and author.

  • Thumbnail
    Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2005) Communication / Conférence
  • Thumbnail
    Approximation of min-max and min-max regret versions of some combinatorial optimization problems 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2007) Article accepté pour publication ou publié
  • Thumbnail
    Approximation of satisfactory bisection problems 
    Bazgan, Cristina; Tuza, Zsolt; Vanderpooten, Daniel (2008) Article accepté pour publication ou publié
  • Thumbnail
    Complexity and approximation of satisfactory partition problems 
    Bazgan, Cristina; Tuza, Zsolt; Vanderpooten, Daniel (2005) Communication / Conférence
  • Thumbnail
    General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2010) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo