Know Center Research

Publikationen

Traub Matthias, Kowald Dominik, Lacic Emanuel, Lex Elisabeth, Schoen Pepjin, Supp Gernot
2015
In this paper, we present a scalable hotel recommender system for TripRebel, a new online booking portal. On the basis of the open-source enterprise search platform Apache Solr, we developed a system architecture with Web-based services to interact with indexed data at large scale as well as to provide hotel recommendations using various state-of-the-art recommender algorithms. We demonstrate the efficiency of our system directly using the live TripRebel portal where, in its current state, hotel alternatives for a given hotel are calculated based on data gathered from the Expedia AffiliateNetwork (EAN).
Dennerlein Sebastian, Kowald Dominik, Lex Elisabeth, Lacic Emanuel, Theiler Dieter, Ley Tobias
2015
Informal learning at the workplace includes a multitude of processes. Respective activities can be categorized into multiple perspectives on informal learning, such as reflection, sensemaking, help seeking and maturing of collective knowledge. Each perspective raises requirements with respect to the technical support, this is why an integrated solution relying on social, adaptive and semantic technologies is needed. In this paper, we present the Social Semantic Server, an extensible, open-source application server that equips clientside tools with services to support and scale informal learning at the workplace. More specifically, the Social Semantic Server semantically enriches social data that is created at the workplace in the context of user-to-user or user-artifact interactions. This enriched data can then in turn be exploited in informal learning scenarios to, e.g., foster help seeking by recommending collaborators, resources, or experts. Following the design-based research paradigm, the Social Semantic Server has been implemented based on design principles, which were derived from theories such as Distributed Cognition and Meaning Making. We illustrate the applicability and efficacy of the Social Semantic Server in the light of three real-world applications that have been developed using its social semantic services. Furthermore, we report preliminary results of two user studies that have been carried out recently.
Lacic Emanuel, Traub Matthias, Kowald Dominik, Lex Elisabeth
2015
In this paper, we present our approach towards an effective scalable recommender framework termed ScaR. Our framework is based on the microservices architecture and exploits search technology to provide real-time recommendations. Since it is our aim to create a system that can be used in a broad range of scenarios, we designed it to be capable of handling various data streams and sources. We show its efficacy and scalability with an initial experiment on how the framework can be used in a large-scale setting.
Lacic Emanuel, Luzhnica Granit, Simon Jörg Peter, Traub Matthias, Lex Elisabeth, Kowald Dominik
2015
In this paper, we present work-in-progress on a recommender system based on Collaborative Filtering that exploits location information gathered by indoor positioning systems. This approach allows us to provide recommendations for "extreme" cold-start users with absolutely no item interaction data available, where methods based on Matrix Factorization would not work. We simulate and evaluate our proposed system using data from the location-based FourSquare system and show that we can provide substantially better recommender accuracy results than a simple MostPopular baseline that is typically used when no interaction data is available.
Kowald Dominik, Lex Elisabeth
2015
To date, the evaluation of tag recommender algorithms has mostly been conducted in limited ways, including p-core pruned datasets, a small set of compared algorithms and solely based on recommender accuracy. In this study, we use an open-source evaluation framework to compare a rich set of state-of-the-art algorithms in six unfiltered, open datasets via various metrics, measuring not only accuracy but also the diversity, novelty and computational costs of the approaches. We therefore provide a transparent and reproducible tag recommender evaluation in real-world folksonomies. Our results suggest that the efficacy of an algorithm highly depends on the given needs and thus, they should be of interest to both researchers and developers in the field of tag-based recommender systems.
Kowald Dominik
2015
With the emergence of Web 2.0, tag recommenders have becomeimportant tools, which aim to support users in ndingdescriptive tags for their bookmarked resources. Althoughcurrent algorithms provide good results in terms of tag predictionaccuracy, they are often designed in a data-drivenway and thus, lack a thorough understanding of the cognitiveprocesses that play a role when people assign tags toresources. This thesis aims at modeling these cognitive dynamicsin social tagging in order to improve tag recommendationsand to better understand the underlying processes.As a rst attempt in this direction, we have implementedan interplay between individual micro-level (e.g., categorizingresources or temporal dynamics) and collective macrolevel(e.g., imitating other users' tags) processes in the formof a novel tag recommender algorithm. The preliminaryresults for datasets gathered from BibSonomy, CiteULikeand Delicious show that our proposed approach can outperformcurrent state-of-the-art algorithms, such as CollaborativeFiltering, FolkRank or Pairwise Interaction TensorFactorization. We conclude that recommender systems canbe improved by incorporating related principles of humancognition.
Seitlinger Paul, Kowald Dominik, Kopeinik Simone, Hasani-Mavriqi Ilire, Ley Tobias, Lex Elisabeth
2015
Classic resource recommenders like Collaborative Filtering(CF) treat users as being just another entity, neglecting non-linear user-resource dynamics shaping attention and inter-pretation. In this paper, we propose a novel hybrid rec-ommendation strategy that re nes CF by capturing thesedynamics. The evaluation results reveal that our approachsubstantially improves CF and, depending on the dataset,successfully competes with a computationally much moreexpensive Matrix Factorization variant.