190,693 research outputs found
Modelling Requirements for Content Recommendation Systems
This paper addresses the modelling of requirements for a content
Recommendation System (RS) for Online Social Networks (OSNs). On OSNs, a user
switches roles constantly between content generator and content receiver. The
goals and softgoals are different when the user is generating a post, as
opposed as replying to a post. In other words, the user is generating instances
of different entities, depending on the role she has: a generator generates
instances of a "post", while the receiver generates instances of a "reply".
Therefore, we believe that when addressing Requirements Engineering (RE) for
RS, it is necessary to distinguish these roles clearly.
We aim to model an essential dynamic on OSN, namely that when a user creates
(posts) content, other users can ignore that content, or themselves start
generating new content in reply, or react to the initial posting. This dynamic
is key to designing OSNs, because it influences how active users are, and how
attractive the OSN is for existing, and to new users. We apply a well-known
Goal Oriented RE (GORE) technique, namely i-star, and show that this language
fails to capture this dynamic, and thus cannot be used alone to model the
problem domain. Hence, in order to represent this dynamic, its relationships to
other OSNs' requirements, and to capture all relevant information, we suggest
using another modelling language, namely Petri Nets, on top of i-star for the
modelling of the problem domain. We use Petri Nets because it is a tool that is
used to simulate the dynamic and concurrent activities of a system and can be
used by both practitioners and theoreticians.Comment: 28 pages, 7 figure
Mining for Social Serendipity
A common social problem at an event in which people do not personally know all of the other participants is the natural tendency for cliques to form and for discussions to mainly happen between people who already know each other. This limits the possibility for people to make interesting new acquaintances and acts as a retarding force in the creation of new links in the social web. Encouraging users to socialize with people they don't know by revealing to them hidden surprising links could help to improve the diversity of interactions at an event. The goal of this paper is to propose a method for detecting "surprising" relationships between people attending an event. By "surprising" relationship we mean those relationships that are not known a priori, and that imply shared information not directly related with the local context of the event (location, interests, contacts) at which the meeting takes place. To demonstrate and test our concept we used the Flickr community. We focused on a community of users associated with a social event (a computer science conference) and represented in Flickr by means of a photo pool devoted to the event. We use Flickr metadata (tags) to mine for user similarity not related to the context of the event, as represented in the corresponding Flickr group. For example, we look for two group members who have been in the same highly specific place (identified by means of geo-tagged photos), but are not friends of each other and share no other common interests or, social neighborhood
- …