Posts Tagged ‘Hybrid recommender system’

SOA 2.0: Human-provided Services (HpS) as Complement of Traditional Services in SOA

September 7th, 2009

Proposed Framework of Human-provided Services by David Schall

Proposed Framework of Human-provided Services by David Schall

One of the biggest challenges in information-centric enterprises such as bancs are the integration of applications. Traditionally, enterprises use still Enterprise Application Integration (EAI) to integrate their systems. In fact, in most cases that means that databases are available enterprise-wide and different application just use databases of other systems. I think, you see the problem, right? Originally, EAI consists consists of a middleware handling the information flow among connected systems.
A more sophisticated way of integration is the Service-Oriented Architecture (SOA) consisting of services only. Despite of service compositions, services are independent and loosely coupled. They provide an interface and description about what the expected result is and how to use it.

Current implementations of SOA only focus on services implemented as software. But software services may lack some ability that humans do not. Recently, the Web 2.0 revolution demonstrats the power of people’s collaboration and collaborative creativity.
Vitalab, the distributed system group of the TU Wien, invented the so-called Human-provided Services (HpS). HpS perfectly fit into the SOA such that they may even combined with other services for service composition, orchestration and choreography. User need to formally describe their user profile and services they intend to provide. You think that this approach is nonsense? Some applications exist already. In some cases, people are still more effective than the most sophisticated systems. For instance, Amazon provides a crowd sourcing service. People are asked to categorize images as images with or without pornographic content. Current algorithm are far from the accuracy and efficency o human analysis of visual images. By the way, that’s the method how professional spamer cracked the CAPTCHA security mechanism. They told users to enter the CAPTCHA code in order to get some more pornographic content.

I appreciate the invention of HpS. Imagine SOA-based systems combining computational power with man power. The use of HpS in recommender systems is straight forward. Some systems like FilmTrust by Jennifer Golbeck may benefit since recommendations rely on trust inferencing in Social Networks. But some people, especially outliers of the Social Network are mostly people participating in other Web-based Social Networks. Using them as HpS would lead to a more complete base for providing recommendations. But that’s just potential use in recommender systems.
But one may think about combining content filtering with HpS as hybrid recommender system where people may integrate the semantic meaning content information and contextual awareness. Even collaborative filtering approaches may benefit from better recommendations, since people predict the interests of other people very easy and associate interesting products with the person.

Paper on “Probabilistic Partial User Model Similarity for Collaborative Filtering” at the IRMLeS workshop

June 9th, 2009

Participants of the IRMLeS workshop

Participants of the IRMLeS workshop

Our current work on a probabilistic approach to compute partial user preference similarities was accepted and published at the 1st International Workshop on Inductive Reasoning and Machine Learning for the Semantic Web (IRMLeS) at the 6th European Semantic Web Conference (ESWC) 2009. The paper is available online at CEUR-WS.org as volume 474. The presentation is available at the IRMLeS Web page.

The general idea is that people may share similar preferences only partially. For instance, a person may like Italian food like another person but not Chinese food. But the other person does like Chinese food. Traditional collaborative filtering computes global preference similarity and fail detect this relation. Our approach computes is able to compute partial preference similarities on the basis of hypothesized user preferences. The hypothesized user preferences are learned applying traditional machine learning algorithms. We could show, that our approach performs significantly better then traditional user-based collaborative filtering. Especially in cases where people have only few common rated items. The strength of our approach are the use of partial preference similarities and using hypothesized user preferences instead of item ratings that are always biased.

It was my first real presentation at a conference and it was a great success. I got very positive feedback on it. But I also noticed that a too fancy presentation may irritate some people. Well, I just had the new version of Keynote installed on my Mac and thus, I had to try out the new fancy features. This workshop was one of the most successful at the this year’s ESWC measured by number of participants. I also enjoyed the workshop dinner where I participated interesting discussion on artificial intelligence, data mining in practice, football and Shakespeare.

At the conference, I got in touch with some very interesting people. Especially at the very well organised poster session and after the conference dinner. Unfortunately, it was the last European Semantic Web Conference because the organizers decided to have the industry as main target. Thus, the abbreviation of ESWC stands now for the Extended Semantic Web Conference.

Abstract

Recommender systems play an important role in supporting people getting items they like. One type of recommender systems is user-based collaborative filtering. The fundamental assumption of user-based collaborative filtering is that people who share similar preferences for common items behave similar in the future. The similarity of user preferences is computed globally on common rated items such that partial preference similarities might be missed. Consequently, valuable ratings of partially similar users are ignored. Furthermore, two users may even have similar preferences but the set of common rated items is too small to infer preference similarity. We propose first, an approach that computes user preference similarities based on learned user preference models and second, we propose a method to compute partial user preference similarities based on partial user model similarities. For users with few common rated items, we show that user similarity based on preferences significantly outperforms user similarity based on common rated items.

Presentation

In the following, you can watch my paper presentation I gave at the IRMLeS workshop:


Presentation at the IRMLeS workshop

Downloads

We include the papers on this page to ensure timely dissemination on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by the copyrights. These works may not be reposted without the explicit permission of the copyright holder.