DOCSLIB.ORG

University of Cincinnati

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
University of Cincinnati UNIVERSITY OF CINCINNATI Date:___________________ I, _________________________________________________________, hereby submit this work as part of the requirements for the degree of: in: It is entitled: This work and its defense approved by: Chair: _______________________________ _______________________________ _______________________________ _______________________________ _______________________________ A Concept-Based Framework and Algorithms For Recommender Systems by Shriram Narayanaswamy Bachelor of Engineering(Hons.) Electronics and Instrumentation Birla Institute of Technology and Science(BITS), Pilani A Masters thesis submitted to the faculty of University of Cincinnati in partial fulfillment of the requirements for the degree of Master of Science Department of Computer Science University of Cincinnati June 2007 ABSTRACT In today’s consumer driven world, people are faced with the problem of plenty. Choices abound everywhere, be it in movies, books or music. Recommender systems spare the user the frustration of searching for the proverbial needle in the haystack by offering recommendations based on a user’s personal preferences. In this thesis, a generic framework and algorithms for building concept-based recommender sys- tems are presented. A concept-based approach leverages the deep structure of a rating-database and reveals complex, higher level inter-relationships between entities in the data. The algorithms encode user preferences from a ratings database into concepts using collaborative filtering, organize concepts into lattices efficiently, and enable fast querying of the lattices for recommendations. We apply our algorithms on two real-world datasets and demonstrate their capabilities in generating quality recommendations in real-time. ii ACKNOWLEDGMENTS I would to express my heartfelt gratitude to Dr.Raj Bhatnagar, my advisor, for being a constant source of motivation and guiding me through this thesis. I would also like to thank Dr.Ali Minai and Dr.Carla Purdy for their valuable suggestions and feedback. Thanks are due to my friends for all their encouragement. And finally, this work is dedicated to my parents, Ms.Revathi and Mr.Narayanaswamy, and I can only begin being grateful for their unconditional love, support and everything else... iv Contents Table of Contents v List of Figures viii List of Tables x 1 Introduction 1 1.1 Recommender Systems . 1 1.1.1 Why Recommender Systems? . 2 1.1.2 How to make recommendations? . 3 1.2 Concept-based approach . 4 1.3 Problem Statement . 5 1.4 Contributions . 6 1.5 Approach to the problem . 7 2 Related Research 10 2.1 Information Filtering . 10 2.2 Collaborative Filtering . 12 2.3 Concept Based Information Retrieval . 13 3 Framework & Algorithms 14 v 3.1 The Framework . 14 3.2 Components of the Framework . 16 3.3 Concept Generation . 18 3.4 Algorithm for Concept Generation . 18 3.4.1 Description of the algorithm . 20 3.4.2 Illustration of the algorithm . 22 3.4.3 Complexity Analysis . 24 3.5 Concept Partition . 25 3.5.1 Algorithm for Concept Partition . 26 3.5.2 Description of the algorithm . 27 3.5.3 Illustration of the algorithm . 28 3.5.4 Complexity Analysis of the algorithm . 30 3.6 Lattice Generation . 31 3.6.1 Algorithm for lattice generation . 31 3.6.2 Description of the algorithm . 34 3.6.3 Illustration of the algorithm . 35 3.6.4 Correctness Proof of the algorithm . 38 3.7 Lattice Querying . 41 3.7.1 Algorithm for Lattice Querying . 42 3.7.2 Description of the algorithm . 43 3.7.3 Illustration of the algorithm . 44 4 A Joke Recommender System 46 4.1 Components of the UI . 46 5 Case Study - Jester and MovieLens Datasets 52 5.1 Processing the Jester Dataset . 53 vi 5.2 Processing the MovieLens Dataset . 54 5.3 Concept Generation - Identifying repeatedly rated jokes/movies . 54 5.3.1 Exploding space requirements in subspace clustering of SCuBA 55 5.3.2 Results - Basic pair-wise comparisons Vs Optimized algorithm 56 5.4 Timing the Model Building Algorithms . 59 5.5 Space Requirement for the Model Building algorithms . 62 5.6 Real-time performance of Algorithm: Lattice Discover . 64 5.7 An Improved Performance . 67 6 Conclusion and Future Direction 69 6.1 What’s good in a concept based approach? . 69 6.2 Future Direction and Caveats . 70 Bibliography 72 vii List of Figures 1.1 A Sample Concept Lattice . 5 3.1 A framework for concept-based recommender systems . 16 3.2 A sparse dataset and its associated lattice . 26 3.3 Lattice after combining levels 1 and 2 . 36 3.4 Lattice after combining levels 1, 2 and 3 . 37 3.5 Lattice after combining all levels from 1 through 5 . 39 3.6 Example of a typical lattice to search for making recommendations 44 4.1 Main Screen of the GUI Applet for Joke recommendation . 48 4.2 GUI for Joke Recommendation: User has already rated the fol- lowing jokes: Joke #2, #5 and #6 and is currently viewing joke #7.................................... 49 4.3 GUI for Joke Recommendation: User is viewing recommendations. 50 4.4 The Clear All Button clears all ratings and recommendations and repopulates the Joke Database. 51 5.1 Naive Vs Optimized Concept Generation - Jester . 57 5.2 Naive Concept Generation - MovieLens . 57 5.3 Optimized Concept Generation - MovieLens . 58 viii 5.4 Percentage Pruning: Naive Vs Optimized Concept Generation - Jester dataset . 58 5.5 Percentage Pruning: Naive Vs Optimized Concept Generation - MovieLens dataset . 59 5.6 Jester dataset: Time taken to generate concepts . 60 5.7 MovieLens dataset: Time taken to generate concepts . 60 5.8 Jester dataset: Time taken to generate lattices from concepts . 61 5.9 MovieLens dataset: Time taken for concept generation, partition and lattice building . 61 5.10 Jester dataset: Space required to generate concepts . 63 5.11 Movielens dataset: Space required to generate concepts . 63 5.12 Jester dataset: Space required to generate lattices from concepts . 64 5.13 Jester dataset: Precision Measurement . 66 5.14 Jester dataset: Recall Measurement . 66 5.15 Jester dataset: Query processing time . 67 5.16 MovieLens dataset: Precision Measurement . 68 ix List of Tables 3.1 A typical ratings database . 15 3.2 Concept Generation: Initial database . 22 3.3 Concept Generation: currentTuple = {1 2 3 4}. Iteration 1 . 22 3.4 Concept Generation: currentTuple = {1 2 4}. Iteration 2 . 23 3.5 Concept Generation: currentTuple = {2 3 4}. Iteration 3 . 23 3.6 Concept Generation: currentTuple = {5 6 7}. Iteration 4 . 23 3.7 Concept Generation: currentTuple = {2 3}. Iteration 5 . 23 3.8 Concept Generation: currentTuple = {5 6}. Iteration 6 . 24 3.9 Concept Partition: After Sorting . 28 3.10 Concept Partition: currentConcept = {1 2 4}. Visited[1,2,4] = 0. Iteration 1. conceptSet[1] = (1 2 4) (2 4) (2). 29 3.11 Concept Partition: currentConcept = {2 3 4}. Visited[2 3 4] = 0. Iteration 2. conceptSet[2] = (2 3 4) (2 3) (2 4) (2) . 29 3.12 Concept Partition: currentConcept = {5 6}. Visited[5 6] = 0. Iteration 5. conceptSet[3] = (5 6) (6) . 29 3.13 Concept Partition: currentConcept = {6 7}. Visited[6 7] = 0. Iteration 6. conceptSet[3] = (6 7) (6) . 30 3.14 After partionining . 30 3.15 Lattice Generation: After applying splitByLength() . 36 x Chapter 1 Introduction 1.1 Recommender Systems In today’s consumer driven world people are faced with the problem of plenty. Choices abound everywhere, be it in movies, books or music. Consumers are forced to sift through a number of choices before they discover what they need. This is often time consuming and frustrating. Given today’s fast paced lifestyle, a slow and painstaking search for that elusive item of choice is surely not a sustainable option. People would rather look at items that are customized to their interests and preferences. The bottom line is customers want personalization. But how do we achieve personalization? A good approach is to listen to people whose interests match ours and try things they recommend [17]. Our work adopts this very spirit to make recommendations to users. A recommender system is a platform for providing recommendations to users based on their personal likes and dislikes. The following definition from Wikipedia [1] gives a concise and accurate definition of a recommender system. Recommender systems are a specific type of information filtering (IF) technique 1 that attempt to present to the user information items (movies, music, books, news, web pages) the user is interested in. To do this the user’s profile is compared to some reference characteristics. These characteristics may be from the information item (the content-based approach) or the user’s social environment (the collabora- tive filtering approach). Let us try and understand the important elements of this definition. A rec- ommender system is described as an information filtering technique that uses reference characteristics to group users together. In the following two sections, we explain how a recommender system functions as an information filtering tech- nique and reference characteristics can be used to make recommendations. We then briefly study concept-based knowledge structures called lattices. Section 1.3 titled Problem Statement gives a precise definition of the problem we are attempt- ing to solve. We then describe our expectations from this work and our contri- butions. Section 1.5 explains how recommender systems can be built through a concept-based framework. We then conclude the chapter with a brief outline of the rest of the thesis. 1.1.1 Why Recommender Systems? With the advent of the web, people have been engulfed in a sea of knowledge. Un- fortunately, searching through this vast space of knowledge is time consuming and frustrating. However, this cannot trivialize the utility of the web as a significant information source. Hence, massive efforts have been undertaken to present a user with the most pertinent information related to his/her search, as fast as possible.
Load more

Recommended publications
  • Movie Genome: Alleviating New Item Cold Start in Movie Recommendation
    User Modeling and User-Adapted Interaction https://doi.org/10.1007/s11257-019-09221-y Movie genome: alleviating new item cold start in movie recommendation Yashar Deldjoo, et al. [full author details at the end of the article] Received: 23 December 2017 / Accepted in revised form: 19 January 2019 © The Author(s) 2019 Abstract As of today, most movie recommendation services base their recommendations on col- laborative filtering (CF) and/or content-based filtering (CBF) models that use metadata (e.g., genre or cast). In most video-on-demand and streaming services, however, new movies and TV series are continuously added. CF models are unable to make predic- tions in such a scenario, since the newly added videos lack interactions—a problem technically known as new item cold start (CS). Currently, the most common approach to this problem is to switch to a purely CBF method, usually by exploiting textual meta- data. This approach is known to have lower accuracy than CF because it ignores useful collaborative information and relies on human-generated textual metadata, which are expensive to collect and often prone to errors. User-generated content, such as tags, can also be rare or absent in CS situations. In this paper, we introduce a new movie recommender system that addresses the new item problem in the movie domain by (i) integrating state-of-the-art audio and visual descriptors, which can be automati- cally extracted from video content and constitute what we call the movie genome; (ii) exploiting an effective data fusion method named canonical correlation analysis, which was successfully tested in our previous works Deldjoo et al.
    [Show full text]
  • Intelligent User Interfaces for Music Discovery
    Knees, P., et al. (2020). Intelligent User Interfaces for Music Discovery. Transactions of the International Society for Music Information 7,60,5 Retrieval, 3(1), pp. 165–179. DOI: https://doi.org/10.5334/tismir.60 OVERVIEW ARTICLE Intelligent User Interfaces for Music Discovery Peter Knees*, Markus Schedl† and Masataka Goto‡ Assisting the user in finding music is one of the original motivations that led to the establishment of Music Information Retrieval (MIR) as a research field. This encompasses classic Information Retrieval inspired access to music repositories that aims at meeting an information need of an expert user. Beyond this, however, music as a cultural art form is also connected to an entertainment need of potential listeners, requiring more intuitive and engaging means for music discovery. A central aspect in this process is the user interface. In this article, we reflect on the evolution of MIR-driven intelligent user interfaces for music browsing and discovery over the past two decades. We argue that three major developments have transformed and shaped user interfaces during this period, each connected to a phase of new listening practices. Phase 1 has seen the development of content-based music retrieval interfaces built upon audio processing and content description algorithms facilitating the automatic organization of repositories and finding music according to sound qualities. These interfaces are primarily connected to personal music collections or (still) small commercial catalogs. Phase 2 comprises interfaces incorporating collaborative and automatic semantic description of music, exploiting knowledge captured in user-generated metadata. These interfaces are connected to collective web platforms. Phase 3 is dominated by recommender systems built upon the collection of online music interaction traces on a large scale.
    [Show full text]
  • Recommender Systems User-Facing Decision Support Systems
    Recommender Systems User-Facing Decision Support Systems Michael Hahsler Intelligent Data Analysis Lab (IDA@SMU) CSE, Lyle School of Engineering Southern Methodist University EMIS 5/7357: Decision Support Systems February 22, 2012 Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 1 / 44 Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 2 / 44 Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 3 / 44 Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 4 / 44 Table of Contents 1 Recommender Systems & DSS 2 Content-based Approach 3 Collaborative Filtering (CF) Memory-based CF Model-based CF 4 Strategies for the Cold Start Problem 5 Open-Source Implementations 6 Example: recommenderlab for R 7 Empirical Evidence Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 5 / 44 Decision Support Systems ? Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 6 / 44 Decision Support Systems \Decision Support Systems are defined broadly [...] as interactive computer-based systems that help people use computer communications, data, documents, knowledge, and models to solve problems and make decisions." Power (2002) Main Components: Knowledge base Model User interface Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 6 / 44 ! A recommender system is a decision support systems which help a seller to choose suitable items to offer given a limited information channel. Recommender Systems Recommender systems apply statistical and knowledge discovery techniques to the problem of making product recommendations. Sarwar et al. (2000) Advantages of recommender systems (Schafer et al., 2001): Improve conversion rate: Help customers find a product she/he wants to buy.
    [Show full text]
  • Pandora's Music Recommender 1 Introduction to Pandora 2 Description of Pandora Problem Space
    Pandora’s Music Recommender Michael Howe 1 Introduction to Pandora One of the great promises of the internet and Web 2.0 is the opportunity to expose people to new types of content. Companies like Amazon and Netflix provide customers with ideas for new items to purchase based on current or previous selections. For instance, someone who rented “Star Wars” at Netflix might be presented with “The Matrix” as another movie to rent. The challenge in this strategy is to make suggestions in a reasonable amount of time that the user will mostly like based on the known list of what the user already enjoys. People will only pay attention to the recommendations of a service a finite number of times before they lose trust. Repeatedly suggest content that the user hates and the user will look for new content elsewhere. Also, a user will only pay attention to a service’s recommendation if they arrive in a reasonable amount of time. Make the user wait longer than they are willing and they will again turn elsewhere for content suggestions. Accuracy and speed are critical to a service’s success. Pandora exposes people to music with an online radio station where a user builds up “stations” based on musical interests. The user indicates in each station one or more songs or artists that he or she likes. Based on these preferences Pandora plays similar songs that the user might also like. As Pandora plays the user can further refine the station by giving a “thumbs up” or a “thumbs down” to a particular song.
    [Show full text]
  • Music Recommendation Algorithms: Discovering Weekly Or Discovering
    MUSIC RECOMMENDATION ALGORITHMS Music Recommendation Algorithms: Discovering Weekly or Discovering Weakly? Jennie Silber Muhlenberg College, Allentown, PA, USA Media & Communication Department Undergraduate High Honors Thesis April 1, 2019 1 MUSIC RECOMMENDATION ALGORITHMS 2 MUSIC RECOMMENDATION ALGORITHMS Abstract This thesis analyzes and assesses the cultural impact and economic viability that the top music streaming platforms have on the consumption and discovery of music, with a specific focus on recommendation algorithms. Through the support of scholarly and journalistic research as well as my own user experience, I evaluate the known constructs that fuel algorithmic recommendations, but also make educated inferences about the variables concealed from public knowledge. One of the most significant variables delineated throughout this thesis is the power held by human curators and the way they interact with algorithms to frame and legitimize content. Additionally, I execute my own experiment by creating new user profiles on the two streaming platforms popularly used for the purpose of discovery, Spotify and SoundCloud, and record each step of the music discovery process experienced by a new user. After listening to an equal representation of all genre categories within each platform, I then compare the genre, release year, artist status, and content promotion gathered from my listening history to the algorithmically-generated songs listed in my ‘Discover Weekly’ and ‘SoundCloud Weekly’ personalized playlists. The results from this experiment demonstrate that the recommendation algorithms that power these discovery playlists intrinsically facilitate the perpetuation of a star- driven, “winner-take-all” marketplace, where new, popular, trendy, music is favored, despite how diverse of a selection the music being listened to is.
    [Show full text]
  • UNIVERSITY of CALIFORNIA, SAN DIEGO Bag-Of-Concepts As a Movie
    UNIVERSITY OF CALIFORNIA, SAN DIEGO Bag-of-Concepts as a Movie Genome and Representation A Thesis submitted in partial satisfaction of the requirements for the degree Master of Science in Computer Science by Colin Zhou Committee in charge: Professor Shlomo Dubnov, Chair Professor Sanjoy Dasgupta Professor Lawrence Saul 2016 The Thesis of Colin Zhou is approved, and it is acceptable in quality and form for publication on microfilm and electronically: Chair University of California, San Diego 2016 iii DEDICATION For Mom and Dad iv TABLE OF CONTENTS Signature Page........................................................................................................... iii Dedication.................................................................................................................. iv Table of Contents....................................................................................................... v List of Figures and Tables.......................................................................................... vi Abstract of the Thesis................................................................................................ vii Introduction................................................................................................................ 1 Chapter 1 Background............................................................................................... 3 1.1 Vector Space Models............................................................................... 3 1.1.1. Bag-of-Words........................................................................
    [Show full text]
  • A Movie Recommender System: MOVREC Using Machine Learning Techniques Ashrita Kashyap1, Sunita
    ISSN 2321 3361 © 2020 IJESC Research Article Volume 10 Issue No.6 A Movie Recommender System: MOVREC using Machine Learning Techniques Ashrita Kashyap1, Sunita. B2, Sneh Srivastava3, Aishwarya. PH4, Anup Jung Shah5 Department of Computer Science & Engineering SAIT, Bengaluru, Karnataka, India Abstract: This paper discuss about recommendations of the movies. A movie recommendation is important in our social life due to its strength in providing enhanced entertainment. Such a system can suggest a set of movies to users based on their interest, or the popularities of the movies. A recommendation system is used for the purpose of suggesting items to purchase or to see. They direct users towards those items which can meet their needs through cutting down large database of Information. A recommender system, or a recommendation system (sometimes replacing 'system' with a synonym such as platform or engine), is a subclass of information filtering system that seeks to predict the "rating" or "preference" a user would give to an item[1][2]. They are primarily used in commercial applications. MOVREC also help users to find the movies of their choices based on the movie experience of other users in efficient and effective manner without wasting much time in useless browsing. Keywords: Filtering, Recommendation System, Recommender. I. INTRODUCTION emphasizing other attributes when a user "likes" a song. This is an example of a content-based approach. Recommender systems usually make use of either or both collaborative filtering and content-based filtering (also known as Each type of system has its strengths and weaknesses. In the the personality-based approach),[3] as well as other systems above example, Last.fm requires a large amount of information such as knowledge-based systems.
    [Show full text]
  • Five Approaches to Collecting Tags for Music
    FIVE APPROACHES TO COLLECTING TAGS FOR MUSIC Douglas Turnbull Luke Barrington Gert Lanckriet UC San Diego UC San Diego UC San Diego [email protected] [email protected] [email protected] ABSTRACT There are a number of key concepts to consider when com- paring these approaches. The cold start problem refers to the We compare five approaches to collecting tags for music: fact songs that are not annotated cannot be retrieved. This conducting a survey, harvesting social tags, deploying anno- problem is related to popularity bias in that popular songs (in tation games, mining web documents, and autotagging audio the short-head) tend to be annotated more thoroughly than content. The comparison includes a discussion of both scala- unpopular songs (in the long-tail)[11]. This often leads bility (financial cost, human involvement, and computational to a situation in which a short-head song is ranked above resources) and quality (the cold start problem & popularity a long-tail song despite the fact that the long-tail song may bias, strong vs. weak labeling, vocabulary structure & size, be more semantically relevant. We prefer an approach that and annotation accuracy). We then describe one state-of- avoids the cold start problem (e.g., autotagging). If this is the-art system for each approach. The performance of each not possible, we prefer approaches in which we can explic- system is evaluated using a tag-based music information itly control which songs are annotated (e.g., survey, games), retrieval task. Using this task, we are able to quantify the rather than an approach in which only the more popular songs effect of popularity bias on each approach by making use are annotated (e.g., social tags, web documents).
    [Show full text]
  • DEEP LEARNING for MUSIC RECOMMENDATION: Machine Listening & Collaborative Filtering
    DEEP LEARNING FOR MUSIC RECOMMENDATION: Machine Listening & Collaborative Filtering ORIOL NIETO [email protected] SEMINAR ON MUSIC KNOWLEDGE EXTRACTION USING MACHINE LEARNING POMPEU FABRA UNIVERSITY BARCELONA DECEMBER 4, 2016 Outline • Pandora Overview • Large Scale Music Recommendation with Deep Learning: • Machine Listening • Collaborative Filtering Outline • Pandora Overview • Large Scale Music Recommendation with Deep Learning: • Machine Listening • Collaborative Filtering TODAY 78 M 22 H 75 B + Monthly Listeners Average Listening per Month Thumbs 10 B 180 K 55 % Stations Artists Spinning per Month of all Music Streaming in USA Content&Based Collective) Intelligence Personalized Filtering Outline • Pandora Overview • Large Scale Music Recommendation with Deep Learning: • Machine Listening • Collaborative Filtering Content&Based Collective) Intelligence Personalized Filtering Short Time Fourier Transform MY GUITAR GENTLY WEEPS - THE BEATLES Extracting Information Beats Downbeats Chords Structure “electric guitar”, “drums”, “male singer”, “pop”, “classic rock” Hand Crafted Features Beats Downbeats Chords MFCCs Structure Spectral Rolloff Spectral Centroid Structural Features Chromagrams Tempograms “electric guitar”, CERNs “drums”, … “male singer”, “pop”, “classic rock” Learned Features Beats Downbeats Chords Structure DEEP LEARNING (Mostly Convolutional Neural Networks) “electric guitar”, “drums”, “male singer”, “pop”, http://blogs-images.forbes.com/kevinmurnane/files/2016/03/google-deepmind-artificial-intelligence-2-970x0-970x646.jpg
    [Show full text]
  • A Hybrid Approach to Music Recommendation: Exploiting Collaborative Music Tags and Acoustic Features Jaime C
    UNF Digital Commons UNF Graduate Theses and Dissertations Student Scholarship 2014 A Hybrid Approach to Music Recommendation: Exploiting Collaborative Music Tags and Acoustic Features Jaime C. Kaufman University of North Florida Suggested Citation Kaufman, Jaime C., "A Hybrid Approach to Music Recommendation: Exploiting Collaborative Music Tags and Acoustic Features" (2014). UNF Graduate Theses and Dissertations. 540. https://digitalcommons.unf.edu/etd/540 This Master's Thesis is brought to you for free and open access by the Student Scholarship at UNF Digital Commons. It has been accepted for inclusion in UNF Graduate Theses and Dissertations by an authorized administrator of UNF Digital Commons. For more information, please contact Digital Projects. © 2014 All Rights Reserved A HYBRID APPROACH TO MUSIC RECOMMENDATION: EXPLOITING COLLABORATIVE MUSIC TAGS AND ACOUSTIC FEATURES by Jaime C. Kaufman A thesis submitted to the School of Computing in partial fulfillment of the requirements for the degree of Master of Science in Computer and Information Sciences UNIVERSITY OF NORTH FLORIDA SCHOOL OF COMPUTING December 2014 Copyright (©) 2014 by Jaime C. Kaufman All rights reserved. Reproduction in whole or in part in any form requires the prior written permission of Jaime C. Kaufman or designated representative. ii The thesis, “A Hybrid Approach to Music Recommendation: Exploiting Collaborative Music Tags and Acoustic Features,” submitted by Jaime C. Kaufman in partial fulfillment of the requirements for the degree of Master of Science in Computer and Information Sciences has been Approved by the thesis committee: Date Dr. Ching-Hua Chuan Thesis Advisor and Committee Chairperson Dr. Sherif Elfayoumy Dr. Karthikeyan Umapathy Accepted for the School of Computing: Dr.
    [Show full text]
  • Combining Content Information with an Item-Based Collaborative Filter
    Volume 2 │ Issue 2 │ 2017 Combining Content Information with an Item-Based Collaborative Filter Daryl Bagley Harding University Arkansas Eta Chapter Vol. 2(2), 2017 Article Title: Combining Content Information with an Item-Based Collaborative Filter DOI: 10.21081/AX0126 ISSN: 2381-800X Key Words: algorithms, anime, collaborative filtering, content analysis, recommendation This work is licensed under a Creative Commons Attribution 4.0 International License. Author contact information is available from the Editor at [email protected]. Aletheia—The Alpha Chi Journal of Undergraduate Scholarship • This publication is an online, peer-reviewed, interdisciplinary undergraduate journal, whose mission is to promote high quality research and scholarship among undergraduates by showcasing exemplary work. • Submissions can be in any basic or applied field of study, including the physical and life sciences, the social sciences, the humanities, education, engineering, and the arts. • Publication in Aletheia will recognize students who excel academically and foster mentor/mentee relationships between faculty and students. • In keeping with the strong tradition of student involvement in all levels of Alpha Chi, the journal will also provide a forum for students to become actively involved in the writing, peer review, and publication process. • More information and instructions for authors is available under the publications tab at www.AlphaChiHonor.org. Questions to the editor may be directed to [email protected]. Alpha Chi is a national college honor society that admits students from all academic disciplines, with membership limited to the top 10 percent of an institution’s juniors, seniors, and graduate students. Invitation to membership comes only through an institutional chapter.
    [Show full text]
  • Kandidat 109
    INFO310 0 Advanced Topics in Model-Based Information Systems Kandidat 109 Oppgaver Oppgavetype Vurdering Status Introduction Dokument Automatisk poengsum Levert Plagiarism and Declaration Dokument Automatisk poengsum Levert 1 Essay Filopplasting Manuell poengsum Levert INFO310 0 Advanced Topics in Model-Based Information Systems Emnekode INFO310 PDF opprettet 16.11.2016 16:36 Vurderingsform INFO310 Opprettet av Andreas Lothe Opdahl Starttidspunkt: 03.11.2016 14:00 Antall sider 22 Sluttidspunkt: 09.11.2016 14:00 Oppgaver inkludert Nei Sensurfrist Ikke satt Skriv ut automatisk rettede Nei 1 Kandidat 109 Seksjon 1 1 OPPGAVE Essay Upload your file here. Maximum one file. BESVARELSE Filopplasting Filnavn 9066477_cand-9333784_9157556 Filtype pdf Filstørrelse 1660.232 KB Opplastingstid 09.11.2016 09:38:21 Neste side Besvarelse vedlagt INFO310 0 Advanced Topics in Model-Based Information Systems Page 2 av 22 Kandidat 109 SEMANTICS TECHNOLOGIES IN STREAMING SERVICES By Gonzalo Molina Gallego INFO310 0 Advanced Topics in Model-Based Information Systems Page 3 av 22 Kandidat 109 INDEX INTRODUCTION ......................................................................................................................... 3 THE ARISING OF STREAMING SERVICES ............................................................................ 3 VIDEO STREAMING SERVICES .......................................................................................... 4 MUSIC STREAMING SERVICES .........................................................................................
    [Show full text]