scispace - formally typeset
G

Günther Gediga

Researcher at University of Münster

Publications -  61
Citations -  1796

Günther Gediga is an academic researcher from University of Münster. The author has contributed to research in topics: Rough set & Dominance-based rough set approach. The author has an hindex of 21, co-authored 60 publications receiving 1617 citations. Previous affiliations of Günther Gediga include University of Osnabrück.

Papers
More filters
Journal ArticleDOI

Uncertainly measures of rough set prediction

TL;DR: This work presents three model selection criteria, using information theoretic entropy in the spirit of the minimum description length principle, based on the principle of indifference combined with the maximum entropy principle, thus keeping external model assumptions to a minimum.
Journal ArticleDOI

The IsoMetrics usability inventory: An operationalization of ISO 9241-10 supporting summative and formative evaluation of software systems

TL;DR: A questionnaire (IsoMetrics) which collects usability data for summative and formative evaluation, and a procedure to categorize and prioritize weak points, which subsequently can be used as basic input to usability reviews.
Journal ArticleDOI

How Can Physical Activity Be Promoted Among Children and Adolescents? A Systematic Review of Reviews Across Settings.

TL;DR: A systematic review of reviews identified a number of promising strategies for PA promotion among children and adolescents and recommended that future research should also target community and policy level interventions and interventions other than the school setting.
Journal ArticleDOI

Statistical evaluation of rough set dependency analysis

TL;DR: This paper proposes to enhance RSDA by two simple statistical procedures, both based on randomization techniques, to evaluate the validity of prediction based on the approximation quality of attributes of rough set dependency analysis.
Journal ArticleDOI

Skills and knowledge structures

TL;DR: In this article, it was shown that for every family K of subsets of Q which includes the empty set and Q, there are a set S of (abstract) skills and a problem function whose range is just K.