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
2000Journal name
IEEE Transactions on Knowledge and Data EngineeringVolume
12Number
2Publisher
Institute of Electrical and Electronics Engineers
Pages
331-336
Publication identifier
Metadata
Show full item recordAbstract (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; ambiguityRelated items
Showing items related by title and author.
-
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2005) Communication / Conférence
-
Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2007) Article accepté pour publication ou publié
-
Bazgan, Cristina; Tuza, Zsolt; Vanderpooten, Daniel (2008) Article accepté pour publication ou publié
-
Bazgan, Cristina; Tuza, Zsolt; Vanderpooten, Daniel (2005) Communication / Conférence
-
Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2010) Article accepté pour publication ou publié