A Novel Combined Term Suggestion Service for Domain-Specific Digital Libraries

Interactive query expansion can assist users during their query formulation process. We conducted a user study with over 4,000 unique visitors and four different design approaches for a search term suggestion service. As a basis for our evaluation we have implemented services which use three different vocabularies: (1) user search terms, (2) terms from a terminology service and (3) thesaurus terms. Additionally, we have created a new combined service which utilizes thesaurus term and terms from a domain-specific search term re-commender. Our results show that the thesaurus-based method clearly is used more often compared to the other single-method implementations. We interpret this as a strong indicator that term suggestion mechanisms should be domain-specific to be close to the user terminology. Our novel combined approach which interconnects a thesaurus service with additional statistical relations out-performed all other implementations. All our observations show that domain-specific vocabulary can support the user in finding alternative concepts and formulating queries.Comment: To be published in Proceedings of Theories and Practice in Digital Libraries (TPDL), 201

On how to model content engineering in a semantic web environment

The technologies of the Semantic Web demand complex publications which themselves are the result of complex production processes. The complexity of these publications is cause and effect of more sophisticated communication processes possible through the Semantic Web. We introduce a model which briefly describes these processes on a solution-independent level by using a market perspective. The model is based on the assumption of a market interaction between content offer and demand, but is independent of the existence of real content markets with financial transactions. We emphasise the need of structured guidelines for Semantic Web Content Engineering Processes. Furthermore, the model represents a foundation for their development

Cooperative Indexing, Classification, and Evaluation in BoW

. BoW is an on-line bibliographic Dynamic Ranked Informationspace (DyRI). It provides the infrastructure for users to add bibliographical information, classify it, index it, and evaluate it. Thus users cooperate by contributing and sharing their experience in order to advance the most problematic aspects of information retrieval: nding the most relevant and high quality information for their needs.

Towards building active knowledge systems with conceptual graphs

Abstract. This paper outlines a vision for using conceptual graphs to build active knowledge systems that have the capability to solve practical and complex problems. A key ingredient in an active knowledge system is its ability to interact (not just interface) with the real world. Basic features of such systems go beyond logic to include support for data mining, intelligent agents, temporal actors, active sensors, a system for knowledge interchange and finally, support for knowledge-in-the-large.

Separating the concerns of distributed deployment and dynamic composition in internet application systems

The Internet is currently evolving from a global information network into a distributed application system. For example, some Internet applications are based on executing remote services which have been previously installed on possibly multiple Internet nodes, whereas parts of other Internet applications are dynamically moved from several remote nodes to be executed on a single node. In this paper, we focus on the related problem of how the parts of an Internet application that have been independently deployed on multiple Internet nodes can be transparently located, seamlessly retrieved and dynamically composed on a particular node by request. Vie propose a novel deployment and composition approach using so called modules and module federations and show how to separate the logical application composition from the physical module deployment. The realization of our proposal in Java and C++ is presented and the use of the approach in ongoing research projects is demonstrated