Academic literature on the topic 'Graphe de recommandation'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graphe de recommandation.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Graphe de recommandation"
Habak, Nawal, Dihia Bouaichi, Hanifa Abbache, Nadia OuldBessi, and Ammar Chikouche. "Interest of fasting in the exploration of the lipid balance." Batna Journal of Medical Sciences (BJMS) 7, no. 2 (November 9, 2020): 102–4. http://dx.doi.org/10.48087/bjmsoa.2020.7208.
Full textPhilippe, Carole. "Troubles respiratoires obstructifs du sommeil de l’adulte : diagnostic, conséquences et comorbidités." L'Orthodontie Française 90, no. 3-4 (September 2019): 289–99. http://dx.doi.org/10.1051/orthodfr/2019031.
Full textKleinschroth, Fritz, Sylvie Gourlet-Fleury, Valéry Gond, Plinio Sist, and John R. Healey. "LOGGING ROADS IN TROPICAL FORESTS: SYNTHESIS OF LITERATURE WRITTEN IN FRENCH AND ENGLISH HIGHLIGHTS ENVIRONMENTAL IMPACT REDUCTION THROUGH IMPROVED ENGINEERING." BOIS & FORETS DES TROPIQUES 328, no. 328 (July 20, 2017): 13. http://dx.doi.org/10.19182/bft2016.328.a31299.
Full textDissertations / Theses on the topic "Graphe de recommandation"
Slaimi, Fatma. "Découverte et recommandation de services Web." Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0069.
Full textThe Web has become an universal platform for content hosting and distributed heterogeneous applications that can be accessed manually or automatically. In this context, Web services have established themselves as a key technology for deploying interactions across applications. The standard Web services technologies allow and facilitate the manual programming of these applications. To promote automatic programming based on Web services, a major problem arises : that of their discovery. Several approaches addressing this problem have been proposed in the literature. The aim of this thesis is to improve the Web services discovery process. We proposed three approaches. We proposed a Web services discovery approach that combines several matching techniques. The second consists on the validation of the services returned by an automatic process of discovery using users’ competencies. These approaches do not take into account the evolution of services over time and user preferences. To address these shortcomings, several approaches incorporate referral techniques to assist the discovery process. A large majority of these approaches are based on assessments of QoS properties. In practice, these assessments are rarely available. In other systems, trust relationships between users and services are used. These relationships are established based on invocations evaluations of similar services. However, invoking the same service do not necessarily mean having the same preferences. Hence, we propose, in our third approach, the use of the relations of interest between users to recommend services. The approach relies on modeling services’ ecosystem by database graphs
Nzekon, Nzeko'o Armel Jacques. "Système de recommandation avec dynamique temporelle basée sur les flots de liens." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS454.
Full textRecommending appropriate items to users is crucial in many e-commerce platforms that propose a large number of items to users. Recommender systems are one favorite solution for this task. Most research in this area is based on explicit ratings that users give to items, while most of the time, ratings are not available in sufficient quantities. In these situations, it is important that recommender systems use implicit data which are link stream connecting users to items while maintaining timestamps i.e. users browsing, purchases and streaming history. We exploit this type of implicit data in this thesis. One common approach consists in selecting the N most relevant items to each user, for a given N, which is called top-N recommendation. To do so, recommender systems rely on various kinds of information, like content-based features of items, past interest of users for items and trust between users. However, they often use only one or two such pieces of information simultaneously, which can limit their performance because user's interest for an item can depend on more than two types of side information. To address this limitation, we make three contributions in the field of graph-based recommender systems. The first one is an extension of the Session-based Temporal Graph (STG) introduced by Xiang et al., which is a dynamic graph combining long-term and short-term preferences in order to better capture user preferences over time. STG ignores content-based features of items, and make no difference between the weight of newer edges and older edges. The new proposed graph Time-weight Content-based STG addresses STG limitations by adding a new node type for content-based features of items, and a penalization of older edges. The second contribution is the Link Stream Graph (LSG) for temporal recommendations. This graph is inspired by a formal representation of link stream, and has the particularity to consider time in a continuous way unlike others state-of-the-art graphs, which ignore the temporal dimension like the classical bipartite graph (BIP), or consider time discontinuously like STG where time is divided into slices. The third contribution in this thesis is GraFC2T2, a general graph-based framework for top-N recommendation. This framework integrates basic recommender graphs, and enriches them with content-based features of items, users' preferences temporal dynamics, and trust relationships between them. Implementations of these three contributions on CiteUlike, Delicious, Last.fm, Ponpare, Epinions and Ciao datasets confirm their relevance
Ruas, Olivier. "The many faces of approximation in KNN graph computation." Thesis, Rennes 1, 2018. http://www.theses.fr/2018REN1S088/document.
Full textThe incredible quantity of available content in online services makes content of interest incredibly difficult to find. The most emblematic way to help the users is to do item recommendation. The K-Nearest-Neighbors (KNN) graph connects each user to its k most similar other users, according to a given similarity metric. The computation time of an exact KNN graph is prohibitive in online services. Existing approaches approximate the set of candidates for each user’s neighborhood to decrease the computation time. In this thesis we push farther the notion of approximation : we approximate the data of each user, the similarity and the data locality. The resulting approach clearly outperforms all the other ones
Peoples, Bruce E. "Méthodologie d'analyse du centre de gravité de normes internationales publiées : une démarche innovante de recommandation." Thesis, Paris 8, 2016. http://www.theses.fr/2016PA080023.
Full text“Standards make a positive contribution to the world we live in. They facilitate trade, spreadknowledge, disseminate innovative advances in technology, and share good management andconformity assessment practices”7. There are a multitude of standard and standard consortiaorganizations producing market relevant standards, specifications, and technical reports in thedomain of Information Communication Technology (ICT). With the number of ICT relatedstandards and specifications numbering in the thousands, it is not readily apparent to users howthese standards inter-relate to form the basis of technical interoperability. There is a need todevelop and document a process to identify how standards inter-relate to form a basis ofinteroperability in multiple contexts; at a general horizontal technology level that covers alldomains, and within specific vertical technology domains and sub-domains. By analyzing whichstandards inter-relate through normative referencing, key standards can be identified as technicalcenters of gravity, allowing identification of specific standards that are required for thesuccessful implementation of standards that normatively reference them, and form a basis forinteroperability across horizontal and vertical technology domains. This Thesis focuses on defining a methodology to analyze ICT standards to identifynormatively referenced standards that form technical centers of gravity utilizing Data Mining(DM) and Social Network Analysis (SNA) graph technologies as a basis of analysis. As a proofof concept, the methodology focuses on the published International Standards (IS) published bythe International Organization of Standards/International Electrotechnical Committee; JointTechnical Committee 1, Sub-committee 36 Learning Education, and Training (ISO/IEC JTC1 SC36). The process is designed to be scalable for larger document sets within ISO/IEC JTC1 that covers all JTC1 Sub-Committees, and possibly other Standard Development Organizations(SDOs).Chapter 1 provides a review of literature of previous standard analysis projects and analysisof components used in this Thesis, such as data mining and graph theory. Identification of adataset for testing the developed methodology containing published International Standardsneeded for analysis and form specific technology domains and sub-domains is the focus ofChapter 2. Chapter 3 describes the specific methodology developed to analyze publishedInternational Standards documents, and to create and analyze the graphs to identify technicalcenters of gravity. Chapter 4 presents analysis of data which identifies technical center of gravitystandards for ICT learning, education, and training standards produced in ISO/IEC JTC1 SC 36.Conclusions of the analysis are contained in Chapter 5. Recommendations for further researchusing the output of the developed methodology are contained in Chapter 6
Poulain, Rémy. "Analyse et modélisation de la diversité des structures relationnelles à l'aide de graphes multipartis." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS453.
Full textThere is no longer any need to prove that digital technology, the Internet and the web have led to a revolution, particularly in the way people get information. Like any revolution, it is followed by a series of issues : equal treatment of users and suppliers, ecologically sustainable consumption, freedom of expression and censorship, etc. Research needs to provide a clear vision of these stakes. Among these issues, we can talk about two phenomena : the echo chamber phenomenon and the filter bubble phenomenon. These two phenomena are linked to the lack of diversity of information visible on the Internet, and one may wonder about the impact of recommendation algorithms. Even if this is our primary motivation, we are moving away from this subject to propose a general scientific framework to analyze diversity. We find that the graph formalism is useful enough to be able to represent relational data. More precisely, we will analyze relational data with entities of different natures. This is why we chose the n-part graph formalism because this is a good way to represent a great diversity of data. Even if the first data we studied is related to recommendation algorithms (music consumption or purchase of articles on a platform) we will see over the course of the manuscript how this formalism can be adapted to other types of data (politicized users on Twitter, guests of television shows, establishment of NGOs in different States ...). There are several objectives in this study : — Mathematically define diversity indicators on the n-part graphs. — Algorithmically define how to calculate them. — Program these algorithms to make them a usable computer object. — Use these programs on quite varied data. — See the different meanings that our indicators can have. We will begin by describing the mathematical formalism necessary for our study. Then we will apply our mathematical object to basic examples to see all the possibilities that our object offers us. This will show us the importance of normalizing our indicators, and will motivate us to study random normalization. Then we will see another series of examples which will allow us to go further on our indicators, going beyond the static and tripartite side to approach graphs with more layers and depending on time. To be able to have a better vision of what the real data brings us, we will study our indicators on completely randomly generated graphs
Dadoun, Amine. "Semantic data driven approach for merchandizing optimization." Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS191.
Full textThe overall objective of this PhD is to explore and propose new approaches leveraging a large volume of heterogeneous data that needs to be integrated and semantically enriched, and recent advances in machine and deep learning techniques, in order to exploit both the increased variety of offers that an airline can make to its customers as well as the knowledge it has of its customers with the ultimate goal of optimizing conversion and purchase. The overall goal of this thesis can be broken down into three main research questions: 1) What piece of content (ancillary services, third-party content) should be recommended and personalized to each traveler? 2) When should a recommendation be made and for which communication channel to optimize conversion? 3) How do we group ancillary services and third-party content and can we learn what often goes together based on purchase logs?
Lully, Vincent. "Vers un meilleur accès aux informations pertinentes à l’aide du Web sémantique : application au domaine du e-tourisme." Thesis, Sorbonne université, 2018. http://www.theses.fr/2018SORUL196.
Full textThis thesis starts with the observation that there is an increasing infobesity on the Web. The two main types of tools, namely the search engine and the recommender system, which are designed to help us explore the Web data, have several problems: (1) in helping users express their explicit information needs, (2) in selecting relevant documents, and (3) in valuing the selected documents. We propose several approaches using Semantic Web technologies to remedy these problems and to improve the access to relevant information. We propose particularly: (1) a semantic auto-completion approach which helps users formulate longer and richer search queries, (2) several recommendation approaches using the hierarchical and transversal links in knowledge graphs to improve the relevance of the recommendations, (3) a semantic affinity framework to integrate semantic and social data to yield qualitatively balanced recommendations in terms of relevance, diversity and novelty, (4) several recommendation explanation approaches aiming at improving the relevance, the intelligibility and the user-friendliness, (5) two image user profiling approaches and (6) an approach which selects the best images to accompany the recommended documents in recommendation banners. We implemented and applied our approaches in the e-tourism domain. They have been properly evaluated quantitatively with ground-truth datasets and qualitatively through user studies
Benchettara, Nasserine. "Prévision de nouveaux liens dans les réseaux d'interactions bipartis : Application au calcul de recommandation." Paris 13, 2011. http://scbd-sto.univ-paris13.fr/secure/edgalilee_th_2011_benchettara.pdf.
Full textIn this work, we handle the problem of new link prediction in dynamic complex networks. We mainly focus on studying networks having a bipartite underlaying structure. We propose to apply a propositionnalization approach where each couple of nodes in the network is described by a set of topological measures. One first contribution in this thesis is to consider measures computed in the bipartite graph and also in the associated projected graphs. A supervised machine learning approach is applied. This approach though it gives some good results, suffers from the obvious problem of class skewness. We hence focus on handling this problem. Informed sub-sampling approaches are first proposed. A semi-supervised machine learning approach is also applied. All proposed approaches are applied and evaluated on real datasets used in real application of academic collaboration recommendation and product recommendation in an e-commerce site
Draidi, Fady. "Recommandation Pair-à-Pair pour Communautés en Ligne à Grande Echelle." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2012. http://tel.archives-ouvertes.fr/tel-00766963.
Full textMoin, Afshin. "Les Techniques De Recommandation Et De Visualisation Pour Les Données A Une Grande Echelle." Phd thesis, Université Rennes 1, 2012. http://tel.archives-ouvertes.fr/tel-00724121.
Full textBooks on the topic "Graphe de recommandation"
Recommandations pour l’établissement d’un système national de surveillance de la morbidité maternelle extrêmement grave en Amérique latine et aux Caraïbes. Pan American Health Organization, 2022. http://dx.doi.org/10.37774/9789275223918.
Full textBook chapters on the topic "Graphe de recommandation"
"Conclusions et recommandations." In Chemin de fer transeuropéen à grande vitesse étude du plan directeur: Phase 2, 300–324. United Nations, 2023. http://dx.doi.org/10.18356/9789210054966c009.
Full textDOLZ, M. "Diagnostic et prise en charge des incidentalomes surrénaliens." In Médecine et Armées Vol. 44 No.3, 223–34. Editions des archives contemporaines, 2016. http://dx.doi.org/10.17184/eac.6811.
Full textGARCIA, C., L. BORDIER, and H. MAYAUDON. "Conduite à tenir devant un nodule thyroïdien." In Médecine et Armées Vol. 44 No.3, 217–22. Editions des archives contemporaines, 2016. http://dx.doi.org/10.17184/eac.6810.
Full textLEFORT, H., J. PANNETIER, O. BON, P. GINDRE, H. MARSAA, S. TRAVERS, and F. PEDUZZI. "Expert santé du mécanisme de protection civile de l’Union européenne." In Médecine et Armées Vol. 46 No.3, 289–98. Editions des archives contemporaines, 2018. http://dx.doi.org/10.17184/eac.7345.
Full textReports on the topic "Graphe de recommandation"
Palmer, Jennifer, and Diane Duclos. Considérations Clés : Surveillance à Base Communautaire dans le Domaine de la Santé Publique. Institute of Development Studies, June 2023. http://dx.doi.org/10.19088/sshap.2023.014.
Full textFontecave, Marc, and Candel Sébastien. Quelles perspectives énergétiques pour la biomasse ? Académie des sciences, January 2024. http://dx.doi.org/10.62686/1.
Full textDudoit, Alain. Les espaces européens communs de données : une initiative structurante nécessaire et adaptable au Canada. CIRANO, October 2023. http://dx.doi.org/10.54932/ryht5065.
Full text