Show simple item record

dc.date.accessioned2009-04-08T13:25:24Z
dc.date.available2009-04-08T13:25:24Z
dc.date.issued2005
dc.identifier.uriurn:nbn:de:hebis:34-2009040826878
dc.identifier.urihttp://hdl.handle.net/123456789/2009040826878
dc.format.extent254926 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.subject.ddc004
dc.titleA finite state model for on-line analytical processing in triadic contextseng
dc.typePreprint
dcterms.abstractAbout 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.eng
dcterms.accessRightsopen access
dcterms.creatorStumme, Gerd
dc.description.everythingAuch 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)ger
dc.subject.swdFormale Begriffsanalyseger


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record