Incomplete Information: Rough Set Analysis
In 1982, Professor Pawlak published his seminal paper on what he called "rough sets" - a work which opened a new direction in the development of theories of incomplete information. Today, a decade and a half later, the theory of rough sets has evolved into a far-reaching methodology for dealing with a wide variety of issues centering on incompleteness and imprecision of information - issues which playa key role in the conception and design of intelligent information systems. "Incomplete Information: Rough Set Analysis" - or RSA for short - presents an up-to-date and highly authoritative account of the current status of the basic theory, its many extensions and wide-ranging applications. Edited by Professor Ewa Orlowska, one of the leading contributors to the theory of rough sets, RSA is a collection of nineteen well-integrated chapters authored by experts in rough set theory and related fields. A common thread that runs through these chapters ties the concept of incompleteness of information to those of indiscernibility and similarity.
1101498146
Incomplete Information: Rough Set Analysis
In 1982, Professor Pawlak published his seminal paper on what he called "rough sets" - a work which opened a new direction in the development of theories of incomplete information. Today, a decade and a half later, the theory of rough sets has evolved into a far-reaching methodology for dealing with a wide variety of issues centering on incompleteness and imprecision of information - issues which playa key role in the conception and design of intelligent information systems. "Incomplete Information: Rough Set Analysis" - or RSA for short - presents an up-to-date and highly authoritative account of the current status of the basic theory, its many extensions and wide-ranging applications. Edited by Professor Ewa Orlowska, one of the leading contributors to the theory of rough sets, RSA is a collection of nineteen well-integrated chapters authored by experts in rough set theory and related fields. A common thread that runs through these chapters ties the concept of incompleteness of information to those of indiscernibility and similarity.
169.99 In Stock
Incomplete Information: Rough Set Analysis

Incomplete Information: Rough Set Analysis

Incomplete Information: Rough Set Analysis

Incomplete Information: Rough Set Analysis

Hardcover(1998)

$169.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
    Not Eligible for Free Shipping
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

In 1982, Professor Pawlak published his seminal paper on what he called "rough sets" - a work which opened a new direction in the development of theories of incomplete information. Today, a decade and a half later, the theory of rough sets has evolved into a far-reaching methodology for dealing with a wide variety of issues centering on incompleteness and imprecision of information - issues which playa key role in the conception and design of intelligent information systems. "Incomplete Information: Rough Set Analysis" - or RSA for short - presents an up-to-date and highly authoritative account of the current status of the basic theory, its many extensions and wide-ranging applications. Edited by Professor Ewa Orlowska, one of the leading contributors to the theory of rough sets, RSA is a collection of nineteen well-integrated chapters authored by experts in rough set theory and related fields. A common thread that runs through these chapters ties the concept of incompleteness of information to those of indiscernibility and similarity.

Product Details

ISBN-13: 9783790810493
Publisher: Physica-Verlag HD
Publication date: 10/02/2000
Series: Studies in Fuzziness and Soft Computing , #13
Edition description: 1998
Pages: 613
Product dimensions: 6.10(w) x 9.25(h) x 0.05(d)

Table of Contents

1 Introduction: What You Always Wanted to Know about Rough Sets.- I Rough Sets and Decision Rules.- 2 Synthesis of Decision Rules for Object Classification.- 3 On the Lower Boundaries in Learning Rules from Examples.- 4 On the Best Search Method in the LEM1 and LEM2 Algorithms.- II Algebraic Structure of Rough Set Systems.- 5 Rough Sets and Algebras of Relations.- 6 Rough Set Theory and Logic Algebraic Structures.- III Dependence Spaces.- 7 Dependence Spaces of Information Systems.- 8 Applications of Dependence Spaces.- IV Reasoning about Constraints.- 9 Indiscernibility-Based Formalization of Dependencies in Information Systems.- 10 Dependencies between Many-Valued Attributes.- V Indiscernibility-Based Reasoning.- 11 Logical Analysis of Indiscernibility.- 12 Some Philosophical Aspects of Indiscernibility.- 13 Rough Mereology and Analytical Morphology.- VI Similarity-Based Reasoning.- 14 Similarity versus Preference in Fuzzy Set-Based Logics.- 15 A Logic for Reasoning about Similarity.- 16 Information Systems, Similarity Relations and Modal Logics.- VII Extended Rough Set-Based Deduction Methods.- 17 Axiomatization of Logics Based on Kripke Models with Relative Accessibility Relations.- 18 Rough Logics: A Survey with Further Directions.- 19 On the Logic with Rough Quantifier.
From the B&N Reads Blog

Customer Reviews