Skip to main content
SpringerLink
Log in
Book cover

Incomplete Information: Rough Set Analysis

  • Book
  • © 1998

Overview

Editors:
  1. Ewa Orłowska

    1. Institute of Telecommunications, Warsaw, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • An up-to-date and highly authoritative account of the current status of the basic theory, extensions and applications of rough sets
  • A must reading for anyone who has a serious interest in information processing and knowledge-based systems

Part of the book series: Studies in Fuzziness and Soft Computing (STUDFUZZ, volume 13)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 chapters)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Introduction: What You Always Wanted to Know about Rough Sets

    1. Introduction: What You Always Wanted to Know about Rough Sets

      • Ewa Orłowska
      Pages 1-20

  3. Rough Sets and Decision Rules

    1. Front Matter

      Pages 21-21
      Download chapter PDF

    2. Synthesis of Decision Rules for Object Classification

      • Jan G. Bazan, Hung Son Nguyen, Tuan Trung Nguyen, Andrzej Skowron, Jaroslaw Stepaniuk
      Pages 23-57

    3. On the Lower Boundaries in Learning Rules from Examples

      • Chien-Chung Chan, Jerzy W. Grzymala-Busse
      Pages 58-74

    4. On the Best Search Method in the LEM1 and LEM2 Algorithms

      • Jerzy W. Grzymala-Busse, Paolo Werbrouck
      Pages 75-91

  4. Algebraic Structure of Rough Set Systems

    1. Front Matter

      Pages 93-93
      Download chapter PDF

    2. Rough Sets and Algebras of Relations

      • Ivo Düntsch
      Pages 95-108

    3. Rough Set Theory and Logic-Algebraic Structures

      • Piero Pagliani
      Pages 109-190

  5. Dependence Spaces

    1. Front Matter

      Pages 191-191
      Download chapter PDF

    2. Dependence Spaces of Information Systems

      • Miroslav Novotný
      Pages 193-246

    3. Applications of Dependence Spaces

      • Miroslav Novotný
      Pages 247-289

  6. Reasoning about Constraints

    1. Front Matter

      Pages 291-291
      Download chapter PDF

    2. Indiscernibility-Based Formalization of Dependencies in Information Systems

      • Wojciech Buszkowski, Ewa Orlowska
      Pages 293-315

    3. Dependencies between Many-Valued Attributes

      • Michael Luxenburger
      Pages 316-343

  7. Indiscernibility-Based Reasoning

    1. Front Matter

      Pages 345-345
      Download chapter PDF

    2. Logical Analysis of Indiscernibility

      • Stéphane Demri, Ewa Orlowska
      Pages 347-380

    3. Some Philosophical Aspects of Indiscernibility

      • Anna Lissowska-Wójtowicz
      Pages 381-398

    4. Rough Mereology and Analytical Morphology

      • Andrzej Skowron, Lech Polkowski
      Pages 399-437

  8. Similarity-Based Reasoning

    1. Front Matter

      Pages 439-439
      Download chapter PDF
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Institute of Telecommunications, Warsaw, Poland

    Ewa Orłowska

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation