1,151 research outputs found

    Tagging and Tag Recommendation

    Get PDF
    Tagging has emerged as one of the best ways of associating metadata with objects (e.g., videos, texts) in Web 2.0 applications. Consisting of freely chosen keywords assigned to objects by users, tags represent a simpler, cheaper, and a more natural way of organizing content than a fixed taxonomy with a controlled vocabulary. Moreover, recent studies have demonstrated that among other textual features such as title, description, and user comments, tags are the most effective to support information retrieval (IR) services such as search, automatic classification, and content recommendation. In this context, tag recommendation services aim at assisting users in the tagging process, allowing users to select some of the recommended tags or to come up with new ones. Besides improving user experience, tag recommendation services potentially improve the quality of the generated tags, benefiting IR services that rely on tags as data sources. Besides the obvious benefit of improving the description of the objects, tag recommendation can be directly applied in IR services such as search and query expansion. In this chapter, we will provide the main concepts related to tagging systems, as well as an overview of tag recommendation techniques, dividing them into two stages of the tag recommendation process: (1) the candidate tag extraction and (2) the candidate tag ranking

    Relational social recommendation: Application to the academic domain

    Get PDF
    This paper outlines RSR, a relational social recommendation approach applied to a social graph comprised of relational entity profiles. RSR uses information extraction and learning methods to obtain relational facts about persons of interest from the Web, and generates an associative entity-relation social network from their extracted personal profiles. As a case study, we consider the task of peer recommendation at scientific conferences. Given a social graph of scholars, RSR employs graph similarity measures to rank conference participants by their relatedness to a user. Unlike other recommender systems that perform social rankings, RSR provides the user with detailed supporting explanations in the form of relational connecting paths. In a set of user studies, we collected feedbacks from participants onsite of scientific conferences, pertaining to RSR quality of recommendations and explanations. The feedbacks indicate that users appreciate and benefit from RSR explainability features. The feedbacks further indicate on recommendation serendipity using RSR, having it recommend persons of interest who are not apriori known to the user, oftentimes exposing surprising inter-personal associations. Finally, we outline and assess potential gains in recommendation relevance and serendipity using path-based relational learning within RSR

    Content blaster : the online show generator

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

    A PageRank-based collaborative filtering recommendation approach in digital libraries

    Get PDF
    U sadašnje vrijeme opromnog broja podataka, eksplozivni porast digitalnih izvora u Digitalnim Knjižnicama - Digital Libraries (DLs) doveo je do ozbiljnog problema preopterećenja informacijama. Taj trend zahtijeva pristupe personaliziranih preporuka koji bi korisnike DL upoznali s digitalnim izvorima specifičnim za njihove individualne potrebe. U ovom radu predstavljamo personalizirani pristup preporuci digitalnog izvora koji kombinira tehnike PageRank i Collaborative Filtering (CF) u sjedinjenom okviru u svrhu preporuke odgovarajućih digitalnih izvora aktivnom korisniku generirajući i analizirajući mrežu u postojećem vremenu kako odnosa među korisnicima tako i odnosa među izvorima. Kako bi se obradila postojeća pitanja o postavljanju digitalnih knjižnica, uključujući nesigurne profile korisnika, nesigurna obilježja digitalnog izvora, oskudnost podataka i problem hladnog starta, ovaj rad adaptira personalizirani PageRank algoritam kako bi rangirao važnost izvora koji vodi računa o vremenu učinkovitijim CF, tražeći asocijativne linkove koji povezuju i aktivnog korisnika i njegove/njezine početno preferirane izvore. Također ocijenjujemo performansu predložene metodologije kroz analizu slučaja vezanog za tradicionalnu CF tehniku koja koristi iste podatke iz Digitalne knjižnice.In the current era of big data, the explosive growth of digital resources in Digital Libraries (DLs) has led to the serious information overload problem. This trend demands personalized recommendation approaches to provide DL users with digital resources specific to their individual needs. In this paper we present a personalized digital resource recommendation approach, which combines PageRank and Collaborative Filtering (CF) techniques in a unified framework for recommending right digital resources to an active user by generating and analyzing a time-aware network of both user relationships and resource relationships from historical usage data. To address the existing issues in DL deployment, including unstable user profiles, unstable digital resource features, data sparsity and cold start problem, this work adapts the personalized PageRank algorithm to rank the time-aware resource importance for more effective CF, by searching for associative links connecting both active user and his/her initially preferred resources. We further evaluate the performance of the proposed methodology through a case study relative to the traditional CF technique operating on the same historical usage data from a DL

    An interactive human centered data science approach towards crime pattern analysis

    Get PDF
    The traditional machine learning systems lack a pathway for a human to integrate their domain knowledge into the underlying machine learning algorithms. The utilization of such systems, for domains where decisions can have serious consequences (e.g. medical decision-making and crime analysis), requires the incorporation of human experts' domain knowledge. The challenge, however, is how to effectively incorporate domain expert knowledge with machine learning algorithms to develop effective models for better decision making. In crime analysis, the key challenge is to identify plausible linkages in unstructured crime reports for the hypothesis formulation. Crime analysts painstakingly perform time-consuming searches of many different structured and unstructured databases to collate these associations without any proper visualization. To tackle these challenges and aiming towards facilitating the crime analysis, in this paper, we examine unstructured crime reports through text mining to extract plausible associations. Specifically, we present associative questioning based searching model to elicit multi-level associations among crime entities. We coupled this model with partition clustering to develop an interactive, human-assisted knowledge discovery and data mining scheme. The proposed human-centered knowledge discovery and data mining scheme for crime text mining is able to extract plausible associations between crimes, identifying crime pattern, grouping similar crimes, eliciting co-offender network and suspect list based on spatial-temporal and behavioral similarity. These similarities are quantified through calculating Cosine, Jacquard, and Euclidean distances. Additionally, each suspect is also ranked by a similarity score in the plausible suspect list. These associations are then visualized through creating a two-dimensional re-configurable crime cluster space along with a bipartite knowledge graph. This proposed scheme also inspects the grand challenge of integrating effective human interaction with the machine learning algorithms through a visualization feedback loop. It allows the analyst to feed his/her domain knowledge including choosing of similarity functions for identifying associations, dynamic feature selection for interactive clustering of crimes and assigning weights to each component of the crime pattern to rank suspects for an unsolved crime. We demonstrate the proposed scheme through a case study using the Anonymized burglary dataset. The scheme is found to facilitate human reasoning and analytic discourse for intelligence analysis
    corecore