196 research outputs found

    Mejora de los sistemas de recomendación de música de filtrado colaborativo: Un enfoque en la caracterización del usuario a partir de factores de comportamiento y contextuales

    Get PDF
    [ES] La popularización de la distribución digital de contenido multimedia, conocido como streaming, permite a cada vez más usuarios el acceso a prácticamente toda la música existente desde cualquier lugar sin la limitación de la capacidad de almacenamiento de los dispositivos. Esa enorme disponibilidad, así como la gran variedad de proveedores de estos servicios hace muy difícil al usuario encontrar música que pueda encajar en sus gustos. De ahí deriva el gran interés actual por el desarrollo de algoritmos de recomendación que ayuden al usuario a filtrar y descubrir la música que se ajusta a sus preferencias a partir de la enorme cantidad de contenido musical disponible en el espacio digital. La mayoría de las plataformas disponen de servicios de búsqueda y algunas de ellas disponen de mecanismos de recomendación y ofrecen listas personalizadas de reproducción (playlists), aunque todavía se requieren muchas mejoras. Los métodos utilizados en los sistemas de recomendación son muy variados, aunque los basados en filtrado colaborativo (FC) se encuentran entre los más extendidos. Las recomendaciones que proporcionan se basan en las valoraciones (ratings) que los usuarios hacen de los ítems a recomendar, que en el caso de los sistemas de recomendación de música son canciones o artistas. Las recomendaciones para un usuario dado se basan en las valoraciones realizadas por otros usuarios con gustos similares a él. Los resultados de este tipo de técnicas son bastante buenos, sin embargo, la dificultad de obtener la evaluación explicita de los ítems por parte de los usuarios hace que el número de valoraciones sea insuficiente, causando problemas de dispersión (sparsity), que impiden o dificultan la aplicación de tales métodos. Por este motivo, en algunas ocasiones se recurre a formas implícitas de obtener dicha información, las cuales son usualmente complejas y no siempre son efectivas. Otros problemas causados por la incorporación de nuevos usuarios o nuevos productos en el sistema son los de arranque en frío (cold start) y primera valoración (first rater) respectivamente. A esto hay que sumar la dificultad para ofrecer recomendaciones fiables a usuarios con gustos inusuales (gray sheep users). Para hacer frente a los problemas anteriores se han propuesto algoritmos basados en el contenido como alternativa a los métodos de CF. Estos métodos pueden utilizarse para recomendar cualquier ítem haciendo uso de sus características, de manera que el usuario recibe recomendaciones de ítems similares a otros por los que ha mostrado interés en el pasado. La mayoría de los sistemas de recomendación actuales utilizan técnicas híbridas destinadas a aprovechar las ventajas de ambos enfoques y evitar sus inconvenientes. Estos métodos hacen uso de atributos de ítems y usuarios, además de información de valoraciones. Este trabajo se centra en la caracterización del usuario con el fin de aumentar el grado de personalización y así mejorar las recomendaciones proporcionadas por los métodos de filtrado colaborativo. Las propuestas que se presentan, aunque pudieran hacerse extensivas a otros dominios de aplicación, se centran en el ámbito de la música debido a que la forma de consumo de la música difiere significativamente de la forma de consumir otros productos y, en consecuencia, algunos aspectos relativos a las recomendaciones también son diferentes. Los diferentes enfoques propuestos para caracterizar al usuario tienen en común el hecho de requerir únicamente la información disponible en las plataformas de música en streaming, sin necesidad de ningún dato adicional como puede ser información demográfica de los usuarios o atributos de los ítems. Además del hecho de no disponer de valoraciones explícitas de los ítems de música y tener que obtenerlos implícitamente a partir de las reproducciones de artistas o canciones por parte de cada usuario. La primera propuesta aborda el problema de la oveja negra mediante la caracterización del usuario en función de la popularidad de la música que escucha, lo que está estrechamente relacionado con la distribución de ley de potencia de la frecuencia de reproducción de los ítems. Este enfoque es aplicable tanto para la recomendación de artistas como de canciones, y en este último caso, las recomendaciones se pueden mejorar teniendo en cuenta la posición de las canciones en las sesiones del usuario. El tiempo es otro factor importante relacionado con el comportamiento y los hábitos del usuario. La propuesta de mejora de los métodos de recomendación en relación con este factor se aborda desde tres perspectivas centradas en el usuario: modelado tanto de la evolución de sus preferencias, como de sus hábitos de escucha en función del tiempo, y uso del tiempo como variable contextual para generar recomendaciones sensibles al contexto. El modelo de evolución de preferencias está incluido en el proceso de obtención de calificaciones implícitas. Otra forma de caracterizar al usuario es a través de su contexto social. Las plataformas de música en streaming no disponen de mucha información de este tipo. Sin embargo, los datos disponibles sobre relaciones de amistad y etiquetado social se pueden utilizar para este propósito. En concreto, esta información se ha utilizado en este trabajo para modelar su grado de influencia, a partir de las propiedades de confianza y homofilia, y su nivel de conocimiento (expertise) respectivamente. Aunque los métodos presentados no están diseñados específicamente para abordar el inconveniente del arranque en frío, algunos de ellos se han probado en este escenario, mostrando que también contribuyen a minimizar ese problema

    Towards Evaluating User Profiling Methods Based on Explicit Ratings on Item Features

    Get PDF
    In order to improve the accuracy of recommendations, many recommender systems nowadays use side information beyond the user rating matrix, such as item content. These systems build user profiles as estimates of users' interest on content (e.g., movie genre, director or cast) and then evaluate the performance of the recommender system as a whole e.g., by their ability to recommend relevant and novel items to the target user. The user profile modelling stage, which is a key stage in content-driven RS is barely properly evaluated due to the lack of publicly available datasets that contain user preferences on content features of items. To raise awareness of this fact, we investigate differences between explicit user preferences and implicit user profiles. We create a dataset of explicit preferences towards content features of movies, which we release publicly. We then compare the collected explicit user feature preferences and implicit user profiles built via state-of-the-art user profiling models. Our results show a maximum average pairwise cosine similarity of 58.07\% between the explicit feature preferences and the implicit user profiles modelled by the best investigated profiling method and considering movies' genres only. For actors and directors, this maximum similarity is only 9.13\% and 17.24\%, respectively. This low similarity between explicit and implicit preference models encourages a more in-depth study to investigate and improve this important user profile modelling step, which will eventually translate into better recommendations

    Social software for music

    Get PDF
    Tese de mestrado integrado. Engenharia Informática e Computação. Faculdade de Engenharia. Universidade do Porto. 200

    Social search in collaborative tagging networks : the role of ties

    Get PDF
    [no abstract

    A content-based music recommender system

    Get PDF
    Music recommenders have become increasingly relevant due to increased accessibility provided by various music streaming services. Some of these streaming services, such as Spotify, include a recommender system of their own. Despite many advances in recommendation techniques, recommender systems still often do not provide accurate recommendations. This thesis provides an overview of the history and developments of music information retrieval from a more content-based perspective. Furthermore, this thesis describes recommendation as a problem and the methods used for music recommendation with special focus on content-based recommendation by providing detailed descriptions on the audio content features and content-based similarity measures used in content-based music recommender systems. Some of the presented features are used in our own content-based music recommender. Both objective and subjective evaluation of the implemented recommender system further confirm the findings of many researchers that music recommendation based solely on audio content does not provide very accurate recommendations

    Contextual Social Networking

    Get PDF
    The thesis centers around the multi-faceted research question of how contexts may be detected and derived that can be used for new context aware Social Networking services and for improving the usefulness of existing Social Networking services, giving rise to the notion of Contextual Social Networking. In a first foundational part, we characterize the closely related fields of Contextual-, Mobile-, and Decentralized Social Networking using different methods and focusing on different detailed aspects. A second part focuses on the question of how short-term and long-term social contexts as especially interesting forms of context for Social Networking may be derived. We focus on NLP based methods for the characterization of social relations as a typical form of long-term social contexts and on Mobile Social Signal Processing methods for deriving short-term social contexts on the basis of geometry of interaction and audio. We furthermore investigate, how personal social agents may combine such social context elements on various levels of abstraction. The third part discusses new and improved context aware Social Networking service concepts. We investigate special forms of awareness services, new forms of social information retrieval, social recommender systems, context aware privacy concepts and services and platforms supporting Open Innovation and creative processes. This version of the thesis does not contain the included publications because of copyrights of the journals etc. Contact in terms of the version with all included publications: Georg Groh, [email protected] zentrale Gegenstand der vorliegenden Arbeit ist die vielschichtige Frage, wie Kontexte detektiert und abgeleitet werden können, die dazu dienen können, neuartige kontextbewusste Social Networking Dienste zu schaffen und bestehende Dienste in ihrem Nutzwert zu verbessern. Die (noch nicht abgeschlossene) erfolgreiche Umsetzung dieses Programmes führt auf ein Konzept, das man als Contextual Social Networking bezeichnen kann. In einem grundlegenden ersten Teil werden die eng zusammenhängenden Gebiete Contextual Social Networking, Mobile Social Networking und Decentralized Social Networking mit verschiedenen Methoden und unter Fokussierung auf verschiedene Detail-Aspekte näher beleuchtet und in Zusammenhang gesetzt. Ein zweiter Teil behandelt die Frage, wie soziale Kurzzeit- und Langzeit-Kontexte als für das Social Networking besonders interessante Formen von Kontext gemessen und abgeleitet werden können. Ein Fokus liegt hierbei auf NLP Methoden zur Charakterisierung sozialer Beziehungen als einer typischen Form von sozialem Langzeit-Kontext. Ein weiterer Schwerpunkt liegt auf Methoden aus dem Mobile Social Signal Processing zur Ableitung sinnvoller sozialer Kurzzeit-Kontexte auf der Basis von Interaktionsgeometrien und Audio-Daten. Es wird ferner untersucht, wie persönliche soziale Agenten Kontext-Elemente verschiedener Abstraktionsgrade miteinander kombinieren können. Der dritte Teil behandelt neuartige und verbesserte Konzepte für kontextbewusste Social Networking Dienste. Es werden spezielle Formen von Awareness Diensten, neue Formen von sozialem Information Retrieval, Konzepte für kontextbewusstes Privacy Management und Dienste und Plattformen zur Unterstützung von Open Innovation und Kreativität untersucht und vorgestellt. Diese Version der Habilitationsschrift enthält die inkludierten Publikationen zurVermeidung von Copyright-Verletzungen auf Seiten der Journals u.a. nicht. Kontakt in Bezug auf die Version mit allen inkludierten Publikationen: Georg Groh, [email protected]

    Tensor Learning for Recovering Missing Information: Algorithms and Applications on Social Media

    Get PDF
    Real-time social systems like Facebook, Twitter, and Snapchat have been growing rapidly, producing exabytes of data in different views or aspects. Coupled with more and more GPS-enabled sharing of videos, images, blogs, and tweets that provide valuable information regarding “who”, “where”, “when” and “what”, these real-time human sensor data promise new research opportunities to uncover models of user behavior, mobility, and information sharing. These real-time dynamics in social systems usually come in multiple aspects, which are able to help better understand the social interactions of the underlying network. However, these multi-aspect datasets are often raw and incomplete owing to various unpredictable or unavoidable reasons; for instance, API limitations and data sampling policies can lead to an incomplete (and often biased) perspective on these multi-aspect datasets. This missing data could raise serious concerns such as biased estimations on structural properties of the network and properties of information cascades in social networks. In order to recover missing values or information in social systems, we identify “4S” challenges: extreme sparsity of the observed multi-aspect datasets, adoption of rich side information that is able to describe the similarities of entities, generation of robust models rather than limiting them on specific applications, and scalability of models to handle real large-scale datasets (billions of observed entries). With these challenges in mind, this dissertation aims to develop scalable and interpretable tensor-based frameworks, algorithms and methods for recovering missing information on social media. In particular, this dissertation research makes four unique contributions: _ The first research contribution of this dissertation research is to propose a scalable framework based on low-rank tensor learning in the presence of incomplete information. Concretely, we formally define the problem of recovering the spatio-temporal dynamics of online memes and tackle this problem by proposing a novel tensor-based factorization approach based on the alternative direction method of multipliers (ADMM) with the integration of the latent relationships derived from contextual information among locations, memes, and times. _ The second research contribution of this dissertation research is to evaluate the generalization of the proposed tensor learning framework and extend it to the recommendation problem. In particular, we develop a novel tensor-based approach to solve the personalized expert recommendation by integrating both the latent relationships between homogeneous entities (e.g., users and users, experts and experts) and the relationships between heterogeneous entities (e.g., users and experts, topics and experts) from the geo-spatial, topical, and social contexts. _ The third research contribution of this dissertation research is to extend the proposed tensor learning framework to the user topical profiling problem. Specifically, we propose a tensor-based contextual regularization model embedded into a matrix factorization framework, which leverages the social, textual, and behavioral contexts across users, in order to overcome identified challenges. _ The fourth research contribution of this dissertation research is to scale up the proposed tensor learning framework to be capable of handling real large-scale datasets that are too big to fit in the main memory of a single machine. Particularly, we propose a novel distributed tensor completion algorithm with the trace-based regularization of the auxiliary information based on ADMM under the proposed tensor learning framework, which is designed to scale up to real large-scale tensors (e.g., billions of entries) by efficiently computing auxiliary variables, minimizing intermediate data, and reducing the workload of updating new tensors

    Cross domain recommender systems using matrix and tensor factorization

    Get PDF
    Today, the amount and importance of available data on the internet are growing exponentially. These digital data has become a primary source of information and the people’s life bonded to them tightly. The data comes in diverse shapes and from various resources and users utilize them in almost all their personal or social activities. However, selecting a desirable option from the huge list of available options can be really frustrating and time-consuming. Recommender systems aim to ease this process by finding the proper items which are more likely to be interested by users. Undoubtedly, there is not even one social media or online service which can continue its’ work properly without using recommender systems. On the other hand, almost all available recommendation techniques suffer from some common issues: the data sparsity, the cold-start, and the new-user problems. This thesis tackles the mentioned problems using different methods. While, most of the recommender methods rely on using single domain information, in this thesis, the main focus is on using multi-domain information to create cross-domain recommender systems. A cross-domain recommender system is not only able to handle the cold-start and new-user situations much better, but it also helps to incorporate different features exposed in diverse domains together and capture a better understanding of the users’ preferences which means producing more accurate recommendations. In this thesis, a pre-clustering stage is proposed to reduce the data sparsity as well. Various cross-domain knowledge-based recommender systems are suggested to recommend items in two popular social media, the Twitter and LinkedIn, by using different information available in both domains. The state of art techniques in this field, namely matrix factorization and tensor decomposition, are implemented to develop cross-domain recommender systems. The presented recommender systems based on the coupled nonnegative matrix factorization and PARAFAC-style tensor decomposition are evaluated using real-world datasets and it is shown that they superior to the baseline matrix factorization collaborative filtering. In addition, network analysis is performed on the extracted data from Twitter and LinkedIn

    Mining microblogs for culture-awareness in web adaptation

    Get PDF
    Prior studies in sociology and human-computer interaction indicate that persons from different countries and cultural origins tend to have their preferences in real-life communication and the usage of web and social media applications. With Twitter data, statistical and machine learning tools, this study advances our understand ing of microblogging in respect of cultural differences and demonstrates possible solutions of inferring and exploiting cultural origins for building adaptive web ap plications. Our findings reveal statistically significant differences in Twitter feature usage in respect of geographic locations of users. These differences in microblogger behaviour and user language defined in user profiles enabled us to infer user country origins with an accuracy of more than 90%. Other user origin predictive solutions we proposed do not require other data sources and human involvement for training the models, enabling the high accuracy of user country inference when exploiting information extracted from a user followers’ network, or with data derived from Twitter profiles. With origin predictive models, we analysed communication and privacy preferences and built a culture-aware recommender system. Our analysis of friend responses shows that Twitter users tend to communicate mostly within their cultural regions. Usage of privacy settings showed that privacy perceptions differ across cultures. Finally, we created and evaluated movie recommendation strategies considering user cultural groups, and addressed a cold-start scenario with a new user. We believe that the findings discussed give insights into the sociological and web research, in particular on cultural differences in online communication
    corecore