Günther Gediga

dblp:47/3823 · DBLP profile ↗
← Back
14ranked-venue papers
2as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 10 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 2Software engineering, systems software and programming languages · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

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.

Theoretical computer science
4 papers
Logic in computer science · 95% Algorithms and data structures · 5%
Artificial intelligence
3 papers
Knowledge representation and reasoning · 100%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › knowledge representation and reasoning › uncertainty reasoning
rough set theory
0.122002
Modal-style operators in qualitative data analysis · ICDM 2002
Rough approximation quality revisited · Artif. Intell. 2001
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
rough sets
0.021998
Uncertainty Measures of Rough Set Prediction · Artif. Intell. 1998
Statistical evaluation of rough set dependency analysis · Int. J. Hum. Comput. Stud. 1997
Logic in computer science › knowledge representation and reasoning
formal concept analysis
0.012002
Modal-style operators in qualitative data analysis · ICDM 2002
Logic in computer science
formal systems
0.012001
Relational attribute systems · Int. J. Hum. Comput. Stud. 2001

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

statistical evaluation · 0.0necessity operator · 0.0modal possibility operator · 0.0rough set theory · 0.0
YearPublicationVenuePosition
2026 Towards a logic of affordances
abstract
We aim to construct a formal theory of affordances seen as ternary relations. Beginning with a characterization of affordances proposed by James J. Gibson, and utilizing the tools provided by Zdzisław Pawlak's information systems and rough sets, we construct a mathematically precise definition of both crisp and rough affordances. Then, we analyze modal and approximation operators that enable reasoning about affordances in both scenarios.
Rafal Gruszczynski, Paula Menchón, Ivo Düntsch, Günther Gediga
Int. J. Approx. Reason.4
2020 Indices for rough set approximation and the application to confusion matrices
abstract
Confusion matrices and their associated statistics are a well established tool in machine learning to evaluate the accuracy of a classifier. In the present study, we define a rough confusion matrix based on a very general classifier, and derive various statistics from it which are related to common rough set estimators. In other words, we perform a rough set–like analysis on a confusion matrix, which is the converse of the usual procedure; in particular, we consider upper approximations. A suitable index for measuring the tightness of the upper bound uses a ratio of odds. Odds ratios offer a symmetric interpretation of lower and upper precision, and remove the bias in the upper approximation. We investigate rough odds ratios of the parameters obtained from the confusion matrix; to guard against undue random influences, we also approximate their standard errors.
Ivo Düntsch, Günther Gediga
Int. J. Approx. Reason.2
2012 Weighted lambda precision models in rough set data analysis
Ivo Düntsch, Günther Gediga
FedCSIS2
2004 Hyperrelations in version space
Hui Wang 0001, Ivo Düntsch, Günther Gediga, Andrzej Skowron
Int. J. Approx. Reason.3
2002 Modal-style operators in qualitative data analysis
abstract
We explore the usage of the modal possibility operator (and its dual necessity operator) in qualitative data analysis, and show that it-quite literally-complements the derivation operator of formal concept analysis; we also propose a new generalization of the rough set approximation operators. As an example for the applicability of the concepts we investigate the Morse data set which has been frequently studied in multidimensional scaling procedures.
Ivo Düntsch, Günther Gediga
ICDM2
2001 Rough approximation quality revisited
Günther Gediga, Ivo Düntsch
Artif. Intell.1
2001 Roughian: Rough information analysis
abstract
Rough set data analysis (RSDA), introduced by Pawlak, has become a much researched method of knowledge discovery with over 1200 publications to date. One feature which distinguishes RSDA from other data analysis methods is that, in its original form, it gathers all its information from the given data, and does not make external model assumptions as all statistical and most machine learning methods (including decision tree procedures) do. The price which needs to be paid for the parsimony of this approach, however, is that some statistical backup is required, for example, to deal with random influences to which the observed data may be subjected. In supplementing RSDA by such meta-procedures care has to be taken that the same non-invasive principles are applied. In a sequence of papers and conference contributions, we have developed the components of a non-invasive method of data analysis, which is based on the RSDA principle, but is not restricted to “classical” RSDA applications. In this article, we present for the first time in a unified way the foundation and tools of such rough information analysis. © 2001 John Wiley & Sons, Inc.
Ivo Düntsch, Günther Gediga
Int. J. Intell. Syst.2
2001 Relational attribute systems
Ivo Düntsch, Günther Gediga, Ewa Orlowska
Int. J. Hum. Comput. Stud.2
2000 Classificatory filtering in decision systems
Hui Wang 0001, Ivo Düntsch, Günther Gediga
Int. J. Approx. Reason.3
1999 The IsoMetrics usability inventory: An operationalization of ISO 9241-10 supporting summative and formative evaluation of software systems
abstract
Aiming at a user-oriented approach in software evaluation on the basis of ISO 9241 Part 10, we present a questionnaire (IsoMetrics) which collects usability data for summative and formative evaluation, and document its construction. The summative version of IsoMetrics shows a high reliability of its subscales and gathers valid information about differences in the usability of different software systems. Moreover, we show that the formative version of IsoMetrics is a powerful tool for supporting the identification of software weaknesses. Finally, we propose a procedure to categorize and prioritize weak points, which subsequently can be used as basic input to usability reviews.
Günther Gediga, Kai-Christoph Hamborg, Ivo Düntsch
Behav. Inf. Technol.1
1998 Uncertainty Measures of Rough Set Prediction
Ivo Düntsch, Günther Gediga
Artif. Intell.2
1998 Simple data filtering in rough set systems
Ivo Düntsch, Günther Gediga
Int. J. Approx. Reason.2
1997 Algebraic Aspects of Attribute Dependencies in Information Systems
abstract
We exhibit some new connections between structure of an information system and its corresponding semilattice of equivalence relations. In particular, we investigate dependency properties and introduce a partial ordering of information systems over a fixed object set U which reflects the sub-semilattice relation on the set of all equivalence relations on U.
Ivo Düntsch, Günther Gediga
Fundam. Informaticae2
1997 Statistical evaluation of rough set dependency analysis
Ivo Düntsch, Günther Gediga
Int. J. Hum. Comput. Stud.2