http://dl.gi.de/handle/20.500.12116/5009 2026-07-23T15:04:25Z 2026-07-23T15:04:25Z Fischer, Thomas Bakalov, Fedor Nauerz, Andreas http://dl.gi.de/handle/20.500.12116/5082 2017-11-15T15:00:46Z 2008-01-01T00:00:00Z

Towards an Automatic Service Composition for Generation of User-Sensitive Mashups Fischer, Thomas; Bakalov, Fedor; Nauerz, Andreas Hartmann, Melanie; Krause, Daniel; Nauerz, Andreas In today’s Web 2.0, mashups allow users to bring together data and services from various Web applications in order to create a new integrated tool that serves their needs. Nowadays, there is an increasing number of frameworks that provide users with a GUI environment to manually assemble different data sources and services into a mashup. However, in order to create such tools, the user must possess a certain level of technical knowledge. In this paper, we introduce a framework that automatically selects and combines Web services to create mashups. We also describe the user model that stores knowledge about user interests and expertise, which are used by the framework in order to generate mashups tailored to the needs of individual users.

2008-01-01T00:00:00Z Nauerz, Andreas Schindler, Sirko Bakalov, Fedor http://dl.gi.de/handle/20.500.12116/5085 2017-11-15T15:00:46Z 2008-01-01T00:00:00Z

Adaptive Treemap Based Navigation Through Web Portals Nauerz, Andreas; Schindler, Sirko; Bakalov, Fedor Hartmann, Melanie; Krause, Daniel; Nauerz, Andreas Today, Portals most often present the navigation in form of tree-like structures to users. These trees follow a representation of data with a natural hierarchy. Single nodes are either parents or children. This representation style has several drawbacks: for reaching the leaves users have to traverse rather long paths. During the traversion of the tree users get often lost and, finally, the content relations remain unclear. It is not obvious where the ”most” content is located, too. We regard treemapping (a method for displaying tree-structured data using nested polygons) as a promising technology to overcome these draw- backs. We especially focus on adaptive treemaps displaying different treemaps to different users - always trying to satisfy each single users’ individual needs. Our main concepts have been prototypically embedded within IBM’s WebSphere Portal.

2008-01-01T00:00:00Z Hauger, David http://dl.gi.de/handle/20.500.12116/5081 2017-11-15T15:00:46Z 2008-01-01T00:00:00Z

Fine-grained user models by means of asynchronous web technologies Hauger, David Hartmann, Melanie; Krause, Daniel; Nauerz, Andreas Although asynchronous HTTP technologies have grown in importance with the emergence of Web 2.0, most web-based Adaptive Hypermedia Systems (AHS) still exclusively use server- side monitoring of user behaviour to set up the user model. This paper discusses how asynchronous technologies and client-side observation may lead to more accurate and detailed user models, and how that might benefit next- generation AHS.

2008-01-01T00:00:00Z Bezold, Matthias http://dl.gi.de/handle/20.500.12116/5083 2017-11-15T15:00:46Z 2008-01-01T00:00:00Z

Describing User Actions in Adaptive Interfaces with Probabilistic Acceptors Bezold, Matthias Hartmann, Melanie; Krause, Daniel; Nauerz, Andreas An important aspect of adaptive systems is the description of the user-system interaction, which can be used to derive new information about the user and to trigger adaptations, for instance by means of adaptation rules. In this paper, we present an approach that describes user actions by means of probabilistic deterministic finite- state automatons (PDFA), which are generated from an annotated corpus of user interactions. Based on a training set, different acceptors are created from recording data and can be employed by an adaptation framework to trigger adaptation rules. An evaluation of this approach with a prototype of an interactive TV system is presented.

2008-01-01T00:00:00Z