278,732 research outputs found
A General Form of Attribute Exploration
We present a general form of attribute exploration, a knowledge completion algorithm from formal concept analysis. The aim of this generalization is to extend the applicability of attribute exploration by a general description. Additionally, this may also allow for viewing different existing variants of attribute exploration as instances of a general form, as for example exploration on partial contexts
Towards Collaborative Conceptual Exploration
In domains with high knowledge distribution a natural objective is to create
principle foundations for collaborative interactive learning environments. We
present a first mathematical characterization of a collaborative learning
group, a consortium, based on closure systems of attribute sets and the
well-known attribute exploration algorithm from formal concept analysis. To
this end, we introduce (weak) local experts for subdomains of a given knowledge
domain. These entities are able to refute and potentially accept a given
(implicational) query for some closure system that is a restriction of the
whole domain. On this we build up a consortial expert and show first insights
about the ability of such an expert to answer queries. Furthermore, we depict
techniques on how to cope with falsely accepted implications and on combining
counterexamples. Using notions from combinatorial design theory we further
expand those insights as far as providing first results on the decidability
problem if a given consortium is able to explore some target domain.
Applications in conceptual knowledge acquisition as well as in collaborative
interactive ontology learning are at hand.Comment: 15 pages, 2 figure
Usability testing for improving interactive geovisualization techniques
Usability describes a product’s fitness for use according to a set of predefined criteria.
Whatever the aim of the product, it should facilitate users’ tasks or enhance their performance
by providing appropriate analysis tools. In both cases, the main interest is to satisfy users in
terms of providing relevant functionality which they find fit for purpose. “Testing usability
means making sure that people can find and work with [a product’s] functions to meet their
needs” (Dumas and Redish, 1999: 4). It is therefore concerned with establishing whether
people can use a product to complete their tasks with ease and at the same time help them
complete their jobs more effectively.
This document describes the findings of a usability study carried out on DecisionSite Map
Interaction Services (Map IS). DecisionSite, a product of Spotfire, Inc.,1 is an interactive
system for the visual and dynamic exploration of data designed for supporting decisionmaking.
The system was coupled to ArcExplorer (forming DecisionSite Map IS) to provide
limited GIS functionality (simple user interface, basic tools, and data management) and
support users of spatial data. Hence, this study set out to test the suitability of the coupling
between the two software components (DecisionSite and ArcExplorer) for the purpose of
exploring spatial data. The first section briefly discusses DecisionSite’s visualization
functionality. The second section describes the test goals, its design, the participants and data
used. The following section concentrates on the analysis of results, while the final section
discusses future areas of research and possible development
Attribute Exploration of Discrete Temporal Transitions
Discrete temporal transitions occur in a variety of domains, but this work is
mainly motivated by applications in molecular biology: explaining and analyzing
observed transcriptome and proteome time series by literature and database
knowledge. The starting point of a formal concept analysis model is presented.
The objects of a formal context are states of the interesting entities, and the
attributes are the variable properties defining the current state (e.g.
observed presence or absence of proteins). Temporal transitions assign a
relation to the objects, defined by deterministic or non-deterministic
transition rules between sets of pre- and postconditions. This relation can be
generalized to its transitive closure, i.e. states are related if one results
from the other by a transition sequence of arbitrary length. The focus of the
work is the adaptation of the attribute exploration algorithm to such a
relational context, so that questions concerning temporal dependencies can be
asked during the exploration process and be answered from the computed stem
base. Results are given for the abstract example of a game and a small gene
regulatory network relevant to a biomedical question.Comment: Only the email address and reference have been replace
- …