Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zdzislaw Pawlak

dblp:19/2833 · DBLP profile ↗
← Back
32ranked-venue papers
25as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 9 · 9 first-authorTheory of computation · 9 · 5 first-authorHuman-computer interaction and ubiquitous computing · 6 · 5 first-authorArtificial intelligence and machine learning · 5 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 4 · 3 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
6 papers
Knowledge representation and reasoning · 100%
Theoretical computer science
6 papers
Algorithms and data structures · 62% Automated reasoning and model checking · 12% Automata and formal languages · 12%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
rough sets
0.041999
Rough classification · Int. J. Hum. Comput. Stud. 1999
Rough Sets: Probabilistic versus Deterministic Approach · Int. J. Man Mach. Stud. 1988
Rough Classification · Int. J. Man Mach. Stud. 1984
Algorithms and data structures › learning algorithms
classification algorithms
0.021999
Rough classification · Int. J. Hum. Comput. Stud. 1999
Rough Classification · Int. J. Man Mach. Stud. 1984
Medical and health informatics
clinical decision support
0.011986
Rough Classification of Patients After Highly Selective Vagotomy for Duodenal Ulcer · Int. J. Man Mach. Stud. 1986
Knowledge, reasoning and agents › Knowledge representation and reasoning
belief revision
0.011984
On Conflicts · Int. J. Man Mach. Stud. 1984
Knowledge, reasoning and agents › Knowledge representation and reasoning › inconsistency handling
conflict resolution
0.011984
On Conflicts · Int. J. Man Mach. Stud. 1984
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge representation systems
0.011984
Expressive Power of Knowledge Representation Systems · Int. J. Man Mach. Stud. 1984
Automated reasoning and model checking
probabilistic inference
0.011988
Rough Sets: Probabilistic versus Deterministic Approach · Int. J. Man Mach. Stud. 1988
Computational complexity › descriptive complexity
expressive power
0.011984
Expressive Power of Knowledge Representation Systems · Int. J. Man Mach. Stud. 1984
Logic in computer science
nonmonotonic reasoning
0.011984
On Conflicts · Int. J. Man Mach. Stud. 1984
Compilers and program optimization › code generation
instruction selection
0.011979
Programs for Instruction Machines · Inf. Control. 1979

Methods — techniques the papers use, named apart from their topics

rough set theory · 0.0probabilistic reasoning · 0.0rough classification · 0.0
YearPublicationVenuePosition
2007 Rudiments of rough sets
Zdzislaw Pawlak, Andrzej Skowron
Inf. Sci.1
2007 Rough sets: Some extensions
Zdzislaw Pawlak, Andrzej Skowron
Inf. Sci.1
2007 Rough sets and Boolean reasoning
Zdzislaw Pawlak, Andrzej Skowron
Inf. Sci.1
2005 Flow Graphs and Intelligent Data Analysis
Zdzislaw Pawlak
Fundam. Informaticae1
2004 Can Bayesian confirmation measures be useful for rough set decision rules?
Salvatore Greco, Zdzislaw Pawlak, Roman Slowinski
Eng. Appl. Artif. Intell.2
2004 Decision Rules and Dependencies
Zdzislaw Pawlak
Fundam. Informaticae1
2003 A rough set view on Bayes' theorem
abstract
Rough set theory offers new perspective on Bayes' theorem. The look on Bayes' theorem offered by rough set theory reveals that any data set (decision table) satisfies the total probability theorem and Bayes' theorem. These properties can be used directly to draw conclusions from objective data without referring to subjective prior knowledge and its revision if new evidence is available. Thus, the rough set view on Bayes' theorem is rather objective in contrast to subjective “classical” interpretation of the theorem. © 2003 Wiley Periodicals, Inc.
Zdzislaw Pawlak
Int. J. Intell. Syst.1
2002 Theorize with Data Using Rough Sets
abstract
In this paper we study the granular structure of data in the language of rough set theory. It is shown that the granularity of data can be represented in a form of a flow graph, and the relationship between granules obeys Bayes' theorem. This leads to a new method of data analysis. This paper is dedicated to the renowned Sherlock Holmes for his mastery in theorizing about data.
Zdzislaw Pawlak
COMPSAC1
2002 A Rough Set Approach to Measuring Information Granules
abstract
This article introduces an approach to measures of information granules based on rough set theory. Informally, an information granule is a representation of a multiset (or bag) of real-world objects that are somehow indistinguishable, or similar, or which cause the same functionality. Examples of measures of information granules based on the rough set theory are inclusion, closeness, size, and enclosure. All of these measures are based on rough inclusion. This paper is limited to a consideration of measures of inclusion based on a straightforward extension of classical rough membership functions and closeness based on measurement of separation of equivalence classes in a partition of the universe containing information granules. Measurement of sensor-based information granules has been motivated by recent studies of sensor signals. A sensor signal is a non-empty, finite set of sample sensor signal values temporally ordered. Classification of sensor signals requires measurements of sample signal values over subintervals of time. This article introduces a rough set approach to measuring information granule inclusion and closeness.
James F. Peters, Zdzislaw Pawlak, Andrzej Skowron
COMPSAC2
2002 Rough sets and intelligent data analysis
Zdzislaw Pawlak
Inf. Sci.1
2001 Combining Rough Sets and Bayes' Rules
abstract
In rough set theory with every decision rule two conditional probabilities, called certainty and coverage factors, are associated. These two factors are closely related with the lower and the upper approximation of a set, basic notions of rough set theory. It is shown that these two factors satisfy the Bayes' rule. The Bayes' rule in our case simply shows some relationship in the data, without referring to prior and posterior probabilities intrinsically associated with Bayesian inference. This relationship can be used to “invert” decision rules, i.e., to find reasons (explanation) for decisions thus providing inductive as well as deductive inference in our scheme.
Zdzislaw Pawlak
Comput. Intell.1
2001 Drawing conclusions from data - The rough set way
abstract
In the rough set theory with every decision rule two conditional probabilities, called certainty and coverage factors, are associated. These two factors are closely related with the lower and the upper approximation of a set, basic notions of rough set theory. It is shown that these two factors satisfy the Bayes' theorem. The Bayes' theorem in our case simply shows some relationship in the data, without referring to prior and posterior probabilities intrinsically associated with Bayesian inference in our case and can be used to “inverse” decision rules, i.e., to find reasons (explanation) for decisions. © 2001 John Wiley & Sons, Inc.
Zdzislaw Pawlak
Int. J. Intell. Syst.1
2000 Ai and Intelligent Industrial Applications: the Rough Set Perspective
abstract
Application of intelligent methods in industry become a very challenging issue nowadays and will be of extreme importance in the future. Intelligent methods include fuzzy sets, neural networks, genetics algorithms, and other techniques known as soft computing. No doubt, rough set theory can also contribute essentially to this domain. In this paper, basic ideas of rough set theory are presented and some possible intelligent industrial applications outlined.
Zdzislaw Pawlak
Cybern. Syst.1
1999 Data Mining - a Rough Set Perspective
Zdzislaw Pawlak
PAKDD1
1999 Rough classification
Zdzislaw Pawlak
Int. J. Hum. Comput. Stud.1
1998 Rough Set Theory and its Applications to Data Analysis
abstract
This paper gives basic ideas of rough set theory a new approach to data analysis. The lower and upper approximation of a set, the basic operations of the theory, are intuitively explained and formally defined. Some applications of rough set theory are briefly outlined and some future problems are outlined.
Zdzislaw Pawlak
Cybern. Syst.1
1998 An Inquiry into Anatomy of Conflicts
Zdzislaw Pawlak
Inf. Sci.1
1996 Rough Sets, Rough Relations and Rough Functions
abstract
The paper explores the concepts of approximate relations and functions in the framework of the theory of rough sets. The difficulties with the application of the idea of rough relation to general rough function definition are discussed. The definition of rough function for the domain of real numbers is introduced and its properties are investigated in detail including the generalization of the standard notion of function continuity known in the theory of real functions.
Zdzislaw Pawlak
Fundam. Informaticae1
1995 Vagueness and Uncertainty: A Rough Set Perspective
abstract
Vagueness and uncertainty have attracted the attention of philosophers and logicians for many years. Recently, AI researchers contributed essentially to this area of research. Fuzzy set theory and the theory of evidence are seemingly the most appealing topics. On this note we present a new approach, based on the rough set theory, for looking to these problems. The theory of rough sets seems a suitable mathematical tool for dealing with problems of vagueness and uncertainty. This paper is a modified version of the author's lecture titled “An inquiry into vagueness and uncertainty,” which was delivered at the AI Conference in Wigry (Poland), 1994.
Zdzislaw Pawlak
Comput. Intell.1
1992 On a problem concerning dependence spaces
Miroslav Novotný, Zdzislaw Pawlak
Fundam. Informaticae2
1991 Algebraic theory of independence in information systems
Miroslav Novotný, Zdzislaw Pawlak
Fundam. Informaticae2
1988 Rough Sets: Probabilistic versus Deterministic Approach
Zdzislaw Pawlak, S. K. Michael Wong, Wojciech Ziarko
Int. J. Man Mach. Stud.1
1986 Rough Classification of Patients After Highly Selective Vagotomy for Duodenal Ulcer
Zdzislaw Pawlak, Krzysztof Slowinski, Roman Slowinski
Int. J. Man Mach. Stud.1
1984 Expressive Power of Knowledge Representation Systems
Ewa Orlowska, Zdzislaw Pawlak
Int. J. Man Mach. Stud.2
1984 On Conflicts
Zdzislaw Pawlak
Int. J. Man Mach. Stud.1
1984 Rough Classification
Zdzislaw Pawlak
Int. J. Man Mach. Stud.1
1984 Representation of Nondeterministic Information
Ewa Orlowska, Zdzislaw Pawlak
Theor. Comput. Sci.2
1981 Information systems theoretical foundations
Zdzislaw Pawlak
Inf. Syst.1
1979 Programs for Instruction Machines
Zdzislaw Pawlak, Grzegorz Rozenberg, Walter J. Savitch
Inf. Control.1
1976 Information Storage and Retrieval Systems: Mathematical Foundations
Victor W. Marek, Zdzislaw Pawlak
Theor. Comput. Sci.2
1973 Mathematical Foundation of Information Retrieval
Zdzislaw Pawlak
MFCS1
1971 Another Comment on "Negative Radix Conversion"
Zdzislaw Pawlak
IEEE Trans. Computers1