Spelling suggestions: "subject:"recommender systems."" "subject:"recommenders systems.""
151 |
Distributed Local Trust Propagation Model and its Cloud-based Implementation.Althuru, Dharan Kumar Reddy 23 May 2014 (has links)
No description available.
|
152 |
A CONCEPT-BASED FRAMEWORK AND ALGORITHMS FOR RECOMMENDER SYSTEMSNARAYANASWAMY, SHRIRAM 08 October 2007 (has links)
No description available.
|
153 |
Latent Factor Models for Recommender Systems and Market Segmentation Through ClusteringZeng, Jingying 29 August 2017 (has links)
No description available.
|
154 |
Rekommendationssystem för livestreamingtjänsterSunmark, Henrik January 2016 (has links)
Användningen och behovet av rekommendationssystem i digitala tjänster har växt i takt med att utbudet i dessa blivit allt större och svårare för användare att navigera i. Rekommendationssystem används idag i allt ifrån E-handel till musikoch filmstreaming. För att förse användare med rekommendationer på objekt används en mängd olika väl beprövade algoritmer, filtreringsmetoder och datainsamlingsmetoder. Att applicera dessa i livestreamingtjänster ställer nya krav på systemen eftersom innehållet byts ut mer frekvent, helt nytt innehåll tillkommer regelbundet och explicit data samt metadata är sällan tillräcklig för att ta fram träffsäkra rekommendationer. I en fallstudie med företaget Liveguide undersöks hur rekommendationssystem kan appliceras i livestreamingtjänster med avseende på de utmaningar och krav som finns. Metoder presenteras där aktuella lösningar testas, utvärderas och anpassas till att fungera bra i livestreamingsammanhang. Slutligen föreslås tre modeller för rekommendationssystem som tagits fram utifrån det resultat metoderna leder till. För att tillfredsställa de identifierade utmaningarna inom området visade sig hybrida, mångsidiga modeller fördelaktiga i livestreaming. / The usage and demand of recommender systems in digital services has increased in line with their huge range of products, making it more difficult for users to navigate through the content. Recommender systems are used in a wide scope of digital services ranging from E-commerce to music and film streaming. In order to provide users with recommendations on objects, a variety of algorithms, filtering methods and methods of data collections are being used. Applying these in live streaming services puts new demands on such systems since the content is replaced frequently and new objects added regularly. Furthermore, livestreaming services often lack explicit data and metadata, making recommendations less accurate. In a case study with Liveguide, recommender systems are evaluated, focusing on whether they are applicable to live streaming services, respecting requirements and demands on such systems. Methods are presented which tests, evaluates and adapts existing solutions to fit in well in context of live streaming. Finally, three models for recommender systems are suggested, based on the methods result. In order to satisfy the identified challenges, hybrid models turned out to be preferable in the context.
|
155 |
Runtime Algorithm Selection For Grid Environments: A Component Based FrameworkBora, Prachi 22 July 2003 (has links)
Grid environments are inherently heterogeneous. If the computational power provided by collaborations on the Grid is to be harnessed in the true sense, there is a need for applications that can automatically adapt to changes in the execution environment. The application writer should not be burdened with the job of choosing the right algorithm and implementation every time the resources on which the application runs are changed.
A lot of research has been done in adapting applications to changing conditions. The existing systems do not address the issue of providing a unified interface to permit algorithm selection at runtime. The goal of this research is to design and develop a unified interface to applications in order to permit seamless access to different algorithms providing similar functionalities. Long running, computationally intensive scientific applications can produce huge amounts of performance data. Often, this data is discarded once the application's execution is complete. This data can be utilized in extracting information about algorithms and their performance. This information can be used to choose algorithms intelligently.
The research described in this thesis aims at designing and developing a component based unified interface for runtime algorithm selection in grid environments. This unified interface is necessary so that the application code does not change if a new algorithm is used to solve the problem. The overhead associated with making the algorithm choice transparent to the application is evaluated. We use a data mining approach to algorithm selection and evaluate its potential effectiveness for scientific applications. / Master of Science
|
156 |
Využití preferencí zájemců při obchodování s nemovitostmi / Using customer preferences in property marketStrnad, Radek January 2015 (has links)
In recent years the market share of major real estate companies, at least the Czech ones, has not changed much. Statistical data don't reflect any significal upward trend in volumes of properties for rent or sale. In case the real estate company would like to access larger market share, they have to secure a competitive advantage over the others. One of the ways how to attract more potential customers might be speeding up the company website's property search process. In many cases the website visitors are facing hundreds or thousands of property offers before finding couple satisfactories. The aim of the thesis is to explore possibilities of applicating customer preferences in property trading. The focus is put on research of recommender system algorithms, their characteristics and limtations. The author is evaluating usage of each algorithm variant and its suitability for a real world deployment in a real estate area. Apart from the theoretical part of the work one can find a part, where real estate information system is extended with a framework for implementing recommendation system algorithms. The author is in possesion of production data of a medium sized real estate company. He uses the recommender system framework to build and evaluate example algorithm. Powered by TCPDF (www.tcpdf.org)
|
157 |
[en] SECOND LEVEL RECOMMENDATION SYSTEM TO SUPPORT NEWS EDITING / [pt] SISTEMA DE RECOMENDAÇÃO DE SEGUNDO NÍVEL PARA SUPORTE À PRODUÇÃO DE MATÉRIAS JORNALÍSTICASDEMETRIUS COSTA RAPELLO 10 April 2014 (has links)
[pt] Sistemas de recomendação têm sido amplamente utilizados pelos grandes
portais na Web, em decorrência do aumento do volume de dados disponíveis na
Web. Tais sistemas são basicamente utilizados para sugerir informações
relevantes para os seus usuários. Esta dissertação apresenta um sistema de
recomendação de segundo nível para auxiliar equipes de jornalistas de portais de
notícias no processo de recomendação de notícias relacionadas para os usuários do
portal. O sistema é chamado de segundo nível pois apresenta recomendações aos
jornalistas para que, por sua vez, geram recomendações aos usuários do portal. O
modelo seguido pelo sistema consiste na recomendação de notícias relacionadas
com base em características extraídas do próprio texto da notícia original. As
características extraídas permitem a criação de consultas contra um banco de
dados de notícias anteriormente publicadas. O resultado de uma consulta é uma
lista de notícias candidatas à recomendação, ordenada pela similaridade com a
notícia original e pela data de publicação, que o editor da notícia original
manualmente processa para gerar a lista final de notícias relacionadas. / [en] Recommendation systems are widely used by major Web portals due to the
increase in the volume of data available on the Web. Such systems are basically
used to suggest information relevant to their users. This dissertation presents a
second-level recommendation system, which aims at assisting the team of
journalists of a news Web portal in the process of recommending related news for
the users of the Web portal. The system is called second level since it creates
recommendations to the journalists Who, in turn, generate recommendations to
the users. The system follows a model based on features extracted from the text
itself. The extracted features permit creating queries against a news database. The
query result is a list of candidate news, sorted by score and date of publication,
which the news editor manually processes to generate the final list of related
news.
|
158 |
Système de recommandation de ressources pédagogiques fondé sur les liens sociaux : Formalisation et évaluation / Educational resource recommendation system based on social links : Formalization and evaluationTadlaoui, Mohammed 03 July 2018 (has links)
Avec la quantité croissante du contenu pédagogique produit chaque jour par les utilisateurs, il devient très difficile pour les apprenants de trouver les ressources les plus adaptées à leurs besoins. Les systèmes de recommandation sont utilisés dans les plateformes éducatives pour résoudre le problème de surcharge d'information. Ils sont conçus pour fournir des ressources pertinentes à un apprenant en utilisant certaines informations sur les utilisateurs et les ressources. Le présent travail s'inscrit dans le contexte des systèmes de recommandation des ressources pédagogiques, en particulier les systèmes qui utilisent des informations sociales. Nous avons défini une approche de recommandation de ressources éducatives en se basant sur les résultats de recherche dans le domaine des systèmes de recommandation, des réseaux sociaux et des environnements informatiques pour l’apprentissage humain. Nous nous appuyons sur les relations sociales entre apprenants pour améliorer la précision des recommandations. Notre proposition est basée sur des modèles formels qui calculent la similarité entre les utilisateurs d'un environnement d'apprentissage pour générer trois types de recommandation, à savoir la recommandation des 1) ressources populaires, 2) ressources utiles et 3) ressources récemment consultées. Nous avons développé une plateforme d'apprentissage, appelée Icraa, qui intègre nos modèles de recommandation. La plateforme Icraa est un environnement d’apprentissage social qui permet aux apprenants de télécharger, de visualiser et d’évaluer les ressources éducatives. Dans cette thèse, nous présentons les résultats d'une expérimentation menée pendant deux ans qui a impliqué un groupe de 372 apprenants d'Icraa dans un contexte éducatif réel. L'objectif de cette expérimentation est de mesurer la pertinence, la qualité et l'utilité des ressources recommandées. Cette étude nous a permis d'analyser les retours des utilisateurs concernant les trois types de recommandations. Cette analyse a été basée sur les traces des utilisateurs enregistrées avec Icraa et sur un questionnaire. Nous avons également effectué une analyse hors ligne en utilisant un jeu de données afin de comparer notre approche avec quatre algorithmes de référence. / With the increasing amount of educational content produced daily by users, it becomes very difficult for learners to find the resources that are best suited to their needs. Recommendation systems are used in educational platforms to solve the problem of information overload. They are designed to provide relevant resources to a learner using some information about users and resources. The present work fits in the context of recommender systems for educational resources, especially systems that use social information. We have defined an educational resource recommendation approach based on research findings in the area of recommender systems, social networks, and Technology-Enhanced Learning. We rely on social relations between learners to improve the accuracy of recommendations. Our proposal is based on formal models that calculate the similarity between users of a learning environment to generate three types of recommendation, namely the recommendation of 1) popular resources; 2) useful resources; and 3) resources recently consulted. We have developed a learning platform, called Icraa, which integrates our recommendation models. The Icraa platform is a social learning environment that allows learners to download, view and evaluate educational resources. In this thesis, we present the results of an experiment conducted for almost two years on a group of 372 learners of Icraa in a real educational context. The objective of this experiment is to measure the relevance, quality and usefulness of the recommended resources. This study allowed us to analyze the user’s feedback on the three types of recommendations. This analysis is based on the users’ traces which was saved with Icraa and on a questionnaire. We have also performed an offline analysis using a dataset to compare our approach with four base line algorithms.
|
159 |
Agrupamento de dados baseado em predições de modelos de regressão: desenvolvimentos e aplicações em sistemas de recomendação / Data clustering based on prediction regression models: developments and applications in recommender systemsPereira, André Luiz Vizine 12 May 2016 (has links)
Sistemas de Recomendação (SR) vêm se apresentando como poderosas ferramentas para portais web tais como sítios de comércio eletrônico. Para fazer suas recomendações, os SR se utilizam de fontes de dados variadas, as quais capturam as características dos usuários, dos itens e suas transações, bem como de modelos de predição. Dada a grande quantidade de dados envolvidos, é improvável que todas as recomendações possam ser bem representadas por um único modelo global de predição. Um outro importante aspecto a ser observado é o problema conhecido por cold-start, que apesar dos avanços na área de SR, é ainda uma questão relevante que merece uma maior atenção. O problema está relacionado com a falta de informação prévia sobre novos usuários ou novos itens do sistema. Esta tese apresenta uma abordagem híbrida de recomendação capaz de lidar com situações extremas de cold-start. A abordagem foi desenvolvida com base no algoritmo SCOAL (Simultaneous Co-Clustering and Learning). Na sua versão original, baseada em múltiplos modelos lineares de predição, o algoritmo SCOAL mostrou-se eficiente e versátil, podendo ser utilizado numa ampla gama de problemas de classificação e/ou regressão. Para melhorar o algoritmo SCOAL no sentido de deixá-lo mais versátil por meio do uso de modelos não lineares, esta tese apresenta uma variante do algoritmo SCOAL que utiliza modelos de predição baseados em Máquinas de Aprendizado Extremo. Além da capacidade de predição, um outro fator que deve ser levado em consideração no desenvolvimento de SR é a escalabilidade do sistema. Neste sentido, foi desenvolvida uma versão paralela do algoritmo SCOAL baseada em OpenMP, que minimiza o tempo envolvido no cálculo dos modelos de predição. Experimentos computacionais controlados, por meio de bases de dados amplamente usadas na prática, comprovam que todos os desenvolvimentos propostos tornam o SCOAL ainda mais atraente para aplicações práticas variadas. / Recommender Systems (RS) are powerful and popular tools for e-commerce. To build its recommendations, RS make use of multiple data sources, capture the characteristics of items, users and their transactions, and take advantage of prediction models. Given the large amount of data involved in the predictions made by RS, is unlikely that all predictions can be well represented by a single global model. Another important aspect to note is the problem known as cold-start that, despite that recent advances in the RS area, it is still a relevant issue that deserves further attention. The problem arises due to the lack of prior information about new users and new items. This thesis presents a hybrid recommendation approach that addresses the (pure) cold start problem, where no collaborative information (ratings) is available for new users. The approach is based on an existing algorithm, named SCOAL (Simultaneous Co-Clustering and Learning). In its original version, based on multiple linear prediction models, the SCOAL algorithm has shown to be efficient and versatile. In addition, it can be used in a wide range of problems of classification and / or regression. The SCOAL algorithm showed impressive results with the use of linear prediction models, but there is still room for improvements with nonlinear models. From this perspective, this thesis presents a variant of the SCOAL based on Extreme Learning Machines. Besides improving the accuracy, another important issue related to the development of RS is system scalability. In this sense, a parallel version of the SCOAL, based on OpenMP, was developed, aimed at minimizing the computational cost involved as prediction models are learned. Experiments using real-world datasets has shown that all proposed developments make SCOAL algorithm even more attractive for a variety of practical applications.
|
160 |
Ensemble de agrupamentos para sistemas de recomendação baseados em conteúdo / Cluster ensemble to content-based recommender systemsCosta, Fernando Henrique da Silva 05 November 2018 (has links)
O crescimento acelerado da internet proporcionou uma quantidade grande de informações acessíveis aos usuários. Ainda que tal quantidade possua algumas vantagens, os usuários que possuem pouca ou nenhuma experiência para escolher uma alternativa dentre as várias apresentadas terão dificuldades em encontrar informações (ou itens, considerando o escopo deste trabalho) úteis e que atendam às suas necessidades. Devido a esse contexto, os sistemas de recomendação foram desenvolvidos para auxiliar os usuários a encontrar itens relevantes e personalizados. Tais sistemas são divididos em diversas arquiteturas. Como exemplo estão as arquiteturas baseadas em: conteúdo, filtro colaborativo e conhecimento. Para este trabalho, a primeira arquitetura foi explorada. A arquitetura baseada em conteúdo recomenda itens ao usuário com base na similaridade desses aos itens que o usuário mostrou interesse no passado. Por consequência, essa arquitetura possui a limitação de, geralmente, realizar recomendações com baixa serendipidade, uma vez que os itens recomendados tendem a ser semelhantes àqueles observados pelo o usuário e, portanto, não apresentam novidade ou surpresa. Diante desta limitação, o aspecto de serendipidade tem destaque nas discussões apresentadas neste trabalho. Assim, o objetivo deste trabalho é minimizar o problema da baixa serendipidade das recomendações por meio da utilização da análise de similaridades parciais implementada usando ensemble de agrupamentos. Para alcançar este objetivo, estratégias de recomendação baseadas em conteúdo implementadas usando agrupamento e ensemble de agrupamento foram propostas e avaliadas neste trabalho. A avaliação contou com análises qualitativas sobre as recomendações produzidas e com um estudo com usuários. Nesse estudo, quatro estratégias de recomendação de notícias foram avaliadas, incluindo as duas propostas neste trabalhos, uma estratégia baseada em recomendação aleatória, e uma estratégia baseada em coagrupamento. As avaliações consideraram aspectos de relevância, surpresa e serendipidade de recomendações. Esse último aspecto é descrito como itens que apresentam tanto surpresa quanto relevância ao usuário. Os resultados de ambas análises mostraram a viabilidade da utilização de agrupamento como base de recomendação, uma vez que o ensemble de agrupamentos obteve resultados satisfatórios em todos os aspectos, principalmente em surpresa, enquanto a estratégia baseada em agrupamento simples obteve os melhores resultados em relevância e serendipidade / The accelerated growth of the internet has provided a large amount of information accessible to users. Although this amount of information has some advantages, users who have little or no experience in choosing one of several alternatives will find it difficulty to find useful information (or items, considering the scope of this work) that meets their needs. Due to this context, recommender systems have been developed to help users find relevant and personalized items. Such systems are divided into several architectures as content-based, collaborative filtering and knowledge-based. The first architecture was explored in this work. The content-based architecture recommends items to the user based on their similarity to items that the user has shown interest in the past. Consequently, this architecture has the limitation of generally making recommendations with low serendipity, since the recommended items tend to be similar to those observed by the user and, therefore, do not present novelty or surprise. Given this limitation, the aspect of serendipity is highlighted in the discussions presented in this work. Thus, the objective of this work is to minimize the problem of the low serendipity of the recommendations through the use of the partial similarity analysis implemented using cluster ensemble. To achieve this goal, content-based recommendation strategies implemented using clustering and cluster ensemble were proposed and evaluated. The evaluation involved qualitative analysis of the recommendations and a study with users. In such a study, four news recommendation strategies were evaluated including the two strategies proposed in this work, a strategy based on random recommendation, and a strategy based on co-clustering. The evaluations considered aspects of relevance, surprise and serendipity of recommendations. This last aspect is described as items that present both surprise and relevance to the user. The results of both analyzes showed the feasibility of using clustering as the basis of recommendation, since cluster ensemble had satisfactory results in all aspects, mainly in surprise, whereas the simple clustering-based strategy obtained the best results in relevance and serendipity
|
Page generated in 0.0602 seconds