Date
2005Metadata
Show full item record
Preprint
A finite state model for on-line analytical processing in triadic contexts
Abstract
About ten years ago, triadic contexts were presented by Lehmann and Wille as an extension of Formal Concept Analysis. However, they have rarely been used up to now, which may be due to the rather complex structure of the resulting diagrams. In this paper, we go one step back and discuss how traditional line diagrams of standard (dyadic) concept lattices can be used for exploring and navigating triadic data. Our approach is inspired by the slice & dice paradigm of On-Line-Analytical Processing (OLAP). We recall the basic ideas of OLAP, and show how they may be transferred to triadic contexts. For modeling the navigation patterns a user might follow, we use the formalisms of finite state machines. In order to present the benefits of our model, we show how it can be used for navigating the IT Baseline Protection Manual of the German Federal Office for Information Security.
Citation
@article{urn:nbn:de:hebis:34-2009040826878,
author={Stumme, Gerd},
title={A finite state model for on-line analytical processing in triadic contexts},
year={2005}
}
0500 Oax
0501 Text $btxt$2rdacontent
0502 Computermedien $bc$2rdacarrier
1100 2005$n2005
1500 1/eng
2050 ##0##urn:nbn:de:hebis:34-2009040826878
3000 Stumme, Gerd
4000 A finite state model for on-line analytical processing in triadic contexts / Stumme, Gerd
4030
4060 Online-Ressource
4085 ##0##=u http://nbn-resolving.de/urn:nbn:de:hebis:34-2009040826878=x R
4204 \$dPreprint
4170
5550 {{Formale Begriffsanalyse}}
7136 ##0##urn:nbn:de:hebis:34-2009040826878
<resource xsi:schemaLocation="http://datacite.org/schema/kernel-2.2 http://schema.datacite.org/meta/kernel-2.2/metadata.xsd"> 2009-04-08T13:25:24Z 2009-04-08T13:25:24Z 2005 urn:nbn:de:hebis:34-2009040826878 http://hdl.handle.net/123456789/2009040826878 254926 bytes application/pdf eng Urheberrechtlich geschützt https://rightsstatements.org/page/InC/1.0/ 004 A finite state model for on-line analytical processing in triadic contexts Preprint About ten years ago, triadic contexts were presented by Lehmann and Wille as an extension of Formal Concept Analysis. However, they have rarely been used up to now, which may be due to the rather complex structure of the resulting diagrams. In this paper, we go one step back and discuss how traditional line diagrams of standard (dyadic) concept lattices can be used for exploring and navigating triadic data. Our approach is inspired by the slice & dice paradigm of On-Line-Analytical Processing (OLAP). We recall the basic ideas of OLAP, and show how they may be transferred to triadic contexts. For modeling the navigation patterns a user might follow, we use the formalisms of finite state machines. In order to present the benefits of our model, we show how it can be used for navigating the IT Baseline Protection Manual of the German Federal Office for Information Security. open access Stumme, Gerd Auch erschienen in: Ganter, Bernhard u.a. (Hrsg.): Formal concept analysis. (Lecture notes in computer science ; 3403) Berlin u.a. : Springer, 2005. S. 315-328. ISBN 3-540-24525-1 (The original publication is available at www.springerlink.com) Formale Begriffsanalyse </resource>
The following license files are associated with this item:
:Urheberrechtlich geschützt