• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 85
  • 20
  • 9
  • 8
  • 7
  • 7
  • 3
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 165
  • 165
  • 99
  • 95
  • 65
  • 50
  • 48
  • 40
  • 37
  • 37
  • 36
  • 36
  • 35
  • 25
  • 24
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
71

The Impact of Training Epoch Size on the Accuracy of Collaborative Filtering Models in GraphChi Utilizing a Multi-Cyclic Training Regimen

Curnalia, James W. 04 June 2013 (has links)
No description available.
72

A sentiment analysis approach to manage the new item problem of Slope One / En ansats att använda attitydsanalys för att hantera problemet med nya föremål i Slope one

Johansson, Jonas, Runnman, Kenneth January 2017 (has links)
This report targets a specific problem for recommender algorithms which is the new item problem and propose a method with sentiment analysis as the main tool. Collaborative filtering algorithms base their predictions on a database with users and their corresponding ratings to items. The new item problem occurs when a new item is introduced in the database because the item has no ratings. The item will therefore be unavailable as a recommendation for the users until it has gathered some ratings. Products that can be rated by users in the online community often has experts that get access to these products before its release date for the consumers, this can be taken advantage of in recommender systems. The experts can be used as initial guides for predictions. The method that is used in this report relies on sentiment analysis to translate written reviews by experts into a rating based on the sentiment of the text. This way when a new item is added it is also added with the ratings of experts in the field. The result from this study shows that the recommender algorithm slope one can generate more reliable recommendations with a group of expert users than without when a new item is added to the database. The expert users that is added must have ratings for other items as well as the ratings for the new item to get more accurate recommendations. / Denna rapport studerar påverkan av problemet med nya objekt i rekommendationsalgoritmen Slope One och en metod föreslås i rapporten för att lösa det specifika problemet. Problemet uppstår när ett nytt objekt läggs till i en databas då det inte finns några betyg som getts till objektet/produkten. Då rekommendationsalgoritmer som Slope One baserar sina rekommendationer på relationerna mellan användares betyg av filmer så blir träffsäkerheten låg för en rekommendation av en film med få betyg. Metoden som föreslås i rapporten involverar attitydanalys som det huvudsakliga verktyget för att få information som kan ersätta faktiska betyg som användare gett en produkt. När produkter kan bli betygsatta av användare på olika forum på internet så finns det ofta experter får tillgång till produkten innan den släpps till omvärlden, den information som dessa experter har kan användas för att fylla det informationsgap som finns när ett nytt objekt läggs till. Dessa experter kommer då initiellt att användas som guide för rekomendationssystemet. Så när ett nytt objekt läggs till så görs det tillsammans med betyg från experter för att få mer träffsäkra rekomendationer. Resultatet från denna studie visar att Slope One genererar mer träffsäkra rekommendationer då en ny produkt läggs till i databasen med ett antal betyg som genererats genom attitydanalysanalys på experters textrecensioner. Det är värt att notera att ett betyg enbart för dessa expertanvändare inte håller utan experterna måste ha betyg av andra produkter inom samma område för kunna influera rekommendationer för den nya produkten.
73

A CONCEPT-BASED FRAMEWORK AND ALGORITHMS FOR RECOMMENDER SYSTEMS

NARAYANASWAMY, SHRIRAM 08 October 2007 (has links)
No description available.
74

Latent Factor Models for Recommender Systems and Market Segmentation Through Clustering

Zeng, Jingying 29 August 2017 (has links)
No description available.
75

User Interfaces for Topic Management of Web Sites

Amento, Brian 15 December 2003 (has links)
Topic management is the task of gathering, evaluating, organizing, and sharing a set of web sites for a specific topic. Current web tools do not provide adequate support for this task. We created and continue to develop the TopicShop system to address this need. TopicShop includes (1) a web crawler/analyzer that discovers relevant web sites and builds site profiles, and (2) user interfaces for information workspaces. We conducted an empirical pilot study comparing user performance with TopicShop vs. Yahooï . Results from this study were used to improve the design of TopicShop. A number of key design changes were incorporated into a second version of TopicShop based on results and user comments of the pilot study including (1) the tasks of evaluation and organization are treated as integral instead of separable, (2) spatial organization is important to users and must be well supported in the interface, and (3) distinct user and global datasets help users deal with the large quantity of information available on the web. A full empirical study using the second iteration of TopicShop covered more areas of the World Wide Web and validated results from the pilot study. Across the two studies, TopicShop subjects found over 80% more high-quality sites (where quality was determined by independent expert judgements) while browsing only 81% as many sites and completing their task in 89% of the time. The site profile data that TopicShop provide -- in particular, the number of pages on a site and the number of other sites that link to it -- were the key to these results, as users exploited them to identify the most promising sites quickly and easily. We also evaluated a number of link- and content-based algorithms using a dataset of web documents rated for quality by human topic experts. Link-based metrics did a good job of picking out high-quality items. Precision at 5 (the common information retrieval metric indicating the percentage of high quality items selected that are actually high quality) is about 0.75, and precision at 10 is about 0.55; this is in a dataset where 32% of all documents were of high quality. Surprisingly, a simple content-based metric, which ranked documents by the total number of pages on their containing site, performed nearly as well. These studies give insight into users' needs for the task of topic management, and provide empirical evidence of the effectiveness of task-specific interfaces (such as TopicShop) for managing topical collections. / Ph. D.
76

SNAP Biclustering

Chan, William Hannibal 22 January 2010 (has links)
This thesis presents a new ant-optimized biclustering technique known as SNAP biclustering, which runs faster and produces results of superior quality to previous techniques. Biclustering techniques have been designed to compensate for the weaknesses of classical clustering algorithms by allowing cluster overlap, and allowing vectors to be grouped for a subset of their defined features. These techniques have performed well in many problem domains, particularly DNA microarray analysis and collaborative filtering. A motivation for this work has been the biclustering technique known as bicACO, which was the first to use ant colony optimization. As bicACO is time intensive, much emphasis was placed on decreasing SNAP's runtime. The superior speed and biclustering results of SNAP are due to its improved initialization and solution construction procedures. In experimental studies involving the Yeast Cell Cycle DNA microarray dataset and the MovieLens collaborative filtering dataset, SNAP has run at least 22 times faster than bicACO while generating superior results. Thus, SNAP is an effective choice of technique for microarray analysis and collaborative filtering applications. / Master of Science
77

Fördelar med att applicera Collaborative Filtering på Steam : En utforskande studie / Benefits of Applying Collaborative Filtering on Steam : An explorative study

Bergqvist, Martin, Glansk, Jim January 2018 (has links)
Rekommendationssystem används överallt. På populära plattformar såsom Netflix och Amazon får du alltid rekommendationer på vad som är nästa lämpliga film eller inköp, baserat på din personliga profil. Detta sker genom korsreferering mellan användare och produkter för att finna sannolika mönster. Syftet med studien har varit att jämföra de två prevalenta tillvägagångssätten att skapa rekommendationer, på en annorlunda datamängd, där ”best practice” inte nödvändigtvis är tillämpbart. Som följd därav, har jämförelse gjorts på effektiviteten av Content-based Filtering kontra Collaborative Filtering, på Steams spelplattform, i syfte att etablera potential för en bättre lösning. Detta angreps genom att samla in data från Steam; Bygga en Content-based Filtering motor som baslinje för att representera Steams nuvarande rekommendationssystem, samt en motsvarande Collaborative Filtering motor, baserad på en standard-implementation, att jämföra mot. Under studiens gång visade det sig att Content-based Filtering prestanda initiellt växte linjärt medan spelarbasen på ett givet spel ökade. Collaborative Filtering däremot hade en exponentiell prestationskurva för spel med få spelare, för att sedan plana ut på en nivå som prestationsmässigt överträffade jämförelsmetoden. Den praktiska signifikansen av dessa resultat torde rättfärdiga en mer utbredd implementering av Collaborative Filtering även där man normalt avstår till förmån för Content-based Filtering då det är enklare att implementera och ger acceptabla resultat. Då våra resultat visar på såpass stor avvikelse redan vid basmodeller, är det här en attityd som mycket väl kan förändras. Collaborative Filtering har varit sparsamt använt på mer mångfacetterade datamängder, men våra resultat visar på potential att överträffa Content-based Filtering med relativt liten insats även på sådana datamängder. Detta kan gynna alla inköps- och community-kombinerade plattformar, då det finns möjlighet att övervaka användandet av inköpen i realtid, vilket möjliggör för justeringar av de faktorer som kan visa sig resultera i felrepresentation. / The use of recommender systems is everywhere. On popular platforms such as Netflix and Amazon, you are always given new recommendations on what to consume next, based on your specific profiling. This is done by cross-referencing users and products to find probable patterns. The aims of this study were to compare the two main ways of generating recommendations, in an unorthodox dataset where “best practice” might not apply. Subsequently, recommendation efficiency was compared between Content Based Filtering and Collaborative Filtering, on the gaming-platform of Steam, in order to establish if there was potential for a better solution. We approached this by gathering data from Steam, building a representational baseline Content-based Filtering recommendation-engine based on what is currently used by Steam, and a competing Collaborative Filtering engine based on a standard implementation. In the course of this study, we found that while Content-based Filtering performance initially grew linearly as the player base of a game increased, Collaborative Filtering’s performance grew exponentially from a small player base, to plateau at a performance-level exceeding the comparison. The practical consequence of these findings would be the justification to apply Collaborative Filtering even on smaller, more complex sets of data than is normally done; The justification being that Content-based Filtering is easier to implement and yields decent results. With our findings showing such a big discrepancy even at basic models, this attitude might well change. The usage of Collaborative Filtering has been used scarcely on the more multifaceted datasets, but our results show that the potential to exceed Content-based Filtering is rather easily obtainable on such sets as well. This potentially benefits all purchase/community-combined platforms, as the usage of the purchase is monitorable on-line, and allows for the adjustments of misrepresentational factors as they appear.
78

Personalisierte Filterung von Nachrichten aus semistrukturierten Quellen: Personalisierte Filterung von Nachrichten aus semistrukturierten Quellen

Eixner, Thomas 04 May 2009 (has links)
Durch die Vielzahl von heterogenen Informationsquellen sehen sich viele Nutzer einer kaum überschaubaren Informationsflut gegenüber. Aus diesem Grund werden durch diese Arbeit die gängigen Nachrichtenformate analysiert und der aktuelle Stand der Technik im Bereich der Nachrichtenaggregatoren dargelegt. Dabei werden diese Analysen immer mit Blick auf die Möglichkeiten einer personalisierten Filterung der Inhalte durchgeführt. Anschließend wird eine im Rahmen dieser Arbeit entstandene Infrastruktur für die Aggregation, personalisierte Filterung und kollaborative Empfehlung von Inhalten aus heterogenen Nachrichtenquellen vorgestellt. Dabei wird detailiert auf die zu Grunde liegenden Konzepte eingegangen und deren praktische Umsetzung beschrieben.
79

Využití preferencí zájemců při obchodování s nemovitostmi / Using customer preferences in property market

Strnad, 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)
80

On enhancing recommender systems by utilizing general social networks combined with users goals and contextual awareness / Renforcement des systèmes de recommandation à l'aide de réseaux sociaux et en combinant les objectifs et les préférences des usagers et la prise en compte du contexte

Chamsi Abu Quba, Rana 18 May 2015 (has links)
Nous sommes amenés chaque jour à prendre un nombre important de décisions : quel nouveau livre lire ? Quel film regarder ce soir ou où aller ce week-end ? De plus en plus, nous utilisons les ressources en ligne pour nous aider à prendre des décisions. Comme la prise de décision est assistée par le domaine en ligne, l'utilisation de systèmes de recommandation est devenue essentielle dans la vie quotidienne. Dans le même temps, les réseaux sociaux sont devenus une partie indispensable de ce processus ; partout dans le monde on les utilise quotidiennement pour récupérer des données de personne et de sources d'information en qui on a confiance. Quand les internautes passent du temps sur les réseaux sociaux, ils laissent de précieuses informations sur eux-mêmes. Cela a attiré l'attention des chercheurs et les professionnels de nombreux domaines académiques et commerciaux. Comme le domaine de la recommandation est un domaine qui a assisté à des changements de grande ampleur attribuable à des réseaux sociaux, il y a un intérêt évident pour les systèmes de recommandation sociale. Cependant, dans la littérature de ce domaine, nous avons constaté que de nombreux systèmes de recommandation sociale ont été évalués en utilisant des réseaux sociaux spécialisés comme Epinions, Flixter et d'autres types des réseaux sociaux de recommandation, qui tendent à être composées d'utilisateurs, d'articles, de notes et de relations. Ces solutions ne peuvent pas être étendues directement à des réseaux sociaux à usage général (GPSNs) comme Facebook et Twitter, qui sont des réseaux sociaux ouverts où les utilisateurs peuvent réaliser une variété d'actions utiles pour l'aide à la recommandation / We are surrounded by decisions to take, what book to read next? What film to watch this night and in the week-end? As the number of items became tremendous the use of recommendation systems became essential in daily life. At the same time social network become indispensable in people’s daily lives; people from different countries and age groups use them on a daily basis. While people are spending time on social networks, they are leaving valuable information about them attracting researchers’ attention. Recommendation is one domain that has been affected by the social networks widespread; the result is the social recommenders’ studies. However, in the literature we’ve found that most of the social recommenders were evaluated over Epinions, flixter and other type of domains based recommender social networks, which are composed of (users, items, ratings and relations). The proposed solutions can’t be extended directly to General Purpose Social Networks (GPSN) like Facebook and Twitter which are open social networks where users can do a variety of useful actions that can be useful for recommendation, but as they can’t rate items, these information are not possible to be used in recommender systems! Moreover, evaluations are based on the known metrics like MAE, and RMSE. This can’t guarantee the satisfaction of users, neither the good quality of recommendation

Page generated in 0.5967 seconds