111 research outputs found

    Vers des recommandations plus personnalisées dans les folksonomies

    Get PDF
    Session 3 : Web socialNational audiencePlusieurs approches ont Ă©tĂ© proposĂ©es dans la littĂ©rature pour personnaliser les recommandations dans les folksonomies. Dans ce papier, nous considĂ©rons une nouvelle dimension dans les folksonomies comme information supplĂ©mentaire pour offrir aux utilisateurs une recommandation plus ciblĂ©e et mieux conforme Ă  leurs besoins. Cela passe par un regroupement des utilisateurs ayant des intĂ©rĂȘts communs sous forme de structures appelĂ©es quadri-concepts. Notre approche, dans laquelle nous rĂ©pondons Ă©galement au challenge de cold start, est ensuite Ă©valuĂ©e sur deux jeux de donnĂ©es du monde rĂ©el, MOVIELENS et BOOKCROSSING. Cette Ă©valuation comprend une mesure de la prĂ©cision et du rappel, une Ă©valuation sociale ainsi que plusieurs mĂ©triques d'Ă©valuation comme la diversitĂ©, la couverture ou la scalabilitĂ©

    mldr.resampling: Efficient Reference Implementations of Multilabel Resampling Algorithms

    Full text link
    Resampling algorithms are a useful approach to deal with imbalanced learning in multilabel scenarios. These methods have to deal with singularities in the multilabel data, such as the occurrence of frequent and infrequent labels in the same instance. Implementations of these methods are sometimes limited to the pseudocode provided by their authors in a paper. This Original Software Publication presents mldr.resampling, a software package that provides reference implementations for eleven multilabel resampling methods, with an emphasis on efficiency since these algorithms are usually time-consuming

    Energy Disaggregation Using Elastic Matching Algorithms

    Get PDF
    © 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/)In this article an energy disaggregation architecture using elastic matching algorithms is presented. The architecture uses a database of reference energy consumption signatures and compares them with incoming energy consumption frames using template matching. In contrast to machine learning-based approaches which require significant amount of data to train a model, elastic matching-based approaches do not have a model training process but perform recognition using template matching. Five different elastic matching algorithms were evaluated across different datasets and the experimental results showed that the minimum variance matching algorithm outperforms all other evaluated matching algorithms. The best performing minimum variance matching algorithm improved the energy disaggregation accuracy by 2.7% when compared to the baseline dynamic time warping algorithm.Peer reviewedFinal Published versio
    • 

    corecore