Web Movie Recommendation Using Reviews on the Web
|
|
- Darren Winfred Hopkins
- 5 years ago
- Views:
Transcription
1 SP1-E 2015 Web Web Movie Recommendation Using Reviews on the Web Takahiro Hayashi Rikio Onai Department of Information Engineering, Faculty of Engineering, Niigata University hayashi@ie.niigata-u.ac.jp Department of Informatics, Faculty of Informatics and Engineering onai@cs.uec.ac.jp keywords: recommendation systems, movie recommendation, user reviews Summary This paper proposes a movie recommendation system using movie reviews on the Web. The system receives a movie review from a user, estimates the user s interests on movies from the review, and provides other persons reviews to the user based on interest matching. This paper assumes that user s interests on movies appear on words which are positively or negatively evaluated in a review. Under the assumption, the system detects such words from the user s review, and choosesother persons reviews to recommend in which the detected words are positively evaluated. Experimental results have shown that more than 1/3 of recommended reviews can motivate users to watch the movies mentioned in the reviews. In addition, the results have indicated that combining the proposed recommendation method and a conventional TF-IDF based recommendation method is important for more efficient recommendation. 1. [Choi 12, Ding 05, Fleischman 03, Ghosh 99, 08, Roy 13, Said 10, Sarwar 01] () TF-IDF TF-IDF 1 2 1
2 Web 103 () 1 ( 1 ) 2 () 2 ( 2 ) TF-IDF ( ) 4 2 ( 1, 2) 5 6 1, [Choi 12, Ding 05, Ghosh 99, Said 10, Sarwar 01] 1 [Sinha 02] [Fleischman 03] [ 01] Park [Park 07] ( ) MineBlog [ 06] MineBlog Web 3 MineBlog
3 SP1-E 2015 TF-IDF 3. (TF-IDF ) 3 1 (4 ) TF-IDF TF-IDF ( ) ( DB ) (TF-IDF ) DB N T = {t 1,t 2,,t N } d v(d) v(d)=(w d t 1,w d t 2,,w d t N ) (1) wt d t d (TF-IDF ) w d t = tf n (t,d) idf(t) (2) tf n (d,t)= tf(d,t) n(d) (3) idf(t)=log M +1 (4) df (t) tf(t,d) d t n(d) d M (DB ) df (t) t tf(t,d) tf(t,d) n(d) tf n (t,d) TF-IDF 3 2 d d S 0 (d d) d d TF-IDF d d ( ) v(d) v(d ) S 0 (d d)= v(d) v(d ) v(d) v(d (5) ) 4. ( ) 1 2 ( 1, 2) 4 1 1( ) 1 d d v p (d) v p (d ) v p (d)=(wp d t 1,wp d t 2,,wp d t N ) (6) v p (d )=(wp d t 1,wp d t 2,,wp d t N ) (7) wp d t d t T { wp d wt d (if t T p (d)) t = (8) 0 (otherwise) T p (d) d ( ) TF-IDF TF-IDF 0 1 d d S 1 (d d) S 1 (d d)= v p(d) v p (d ) v p (d) v p (d (9) ) ( ) 2 d v n (d) d (7) v p (d ) v n (d)=(wn d t 1,wn d t 2,,wn d t N ) (10)
4 Web 105 wn d t d t T { wn d wt d (if t T n (d)) t = (11) 0 (otherwise) T n (d) d ( ) TF- IDF TF-IDF d d S 2 (d d) S 2 (d d)= v n(d) v p (d ) v n (d) v p (d (12) ) , 2 [ 04] 1 (1) (2) MeCab[Kubo 04] CaboCha[ 02] (3) [ 05] [ 08] 1 [ 04] 1 2 (4)
5 SP1-E Web HTML 5 2 Web 2 HTML MySQL Web Web Web 3 3(a) 3(c) 3(b) 1, 2 2 ( ) 5 4 1, 2 (1) (2) TF-IDF (3) 1 (4) 2 3 ( MySQL( 3 (5) TF-IDF (6) S 1 ( (9)) S 2 (12)) (7) , , 2 3 TF-IDF Web 20, ,
6 Web ( ( ) ( A (1) (2) ) ) [%] 95% [%] 26(67/257) [21,31] 32(62/191) [26,39] 1 38(87/232) [31,44] 2 36(84/233) [30,42] 4 A (1) (2) (3) (4) (5) A (1)(2) 2 95% 1 32% 3 1 6% 95% 1 38% 2 36% 1 12% 2 10% 95% 1 6% 2 4%95% 1 2 α =5% Welch t ( ) 1, 2 (p p =0.01,p=0.01) (p p =0.15,p=0.22) (p =0.08) %(236/300) 2 81%(244/300) 91%(272/300) 1 38%(73/192) 2 36%(71/195) 33%(58/175) ( ( ) ( A (1) (2) ) )
7 SP1-E , 2 (5 ) (1) (2) (1) 1 2 (2) A B A B 5 1 A (1)(2) B 2 5 B ( ( A (1) (2) ) ( ) ) 95% 1 C 1 47% (120/253) [42, 51] C 2 41% (176/434) [37, 47] C 5 38% (333/872) [30, 42] 2 C 3 45% (95/212) [41, 50] C 4 39% (136/348) [34, 46] C 5 38% (333/872) [30, 42] C 1 C 2 ( ) C 3 C 4 ( ) C 5 1 C 1 A (1)(2) C 1 C 2 C C 3 C 4 C , C 1
8 Web % C 2 41% C 5 38% C 1 C 1 C 2 C 5 5% Welch t ( ) C 1 C 3 C 5 ( p =0.03,p=0.01) C 3 45% C 4 39% C 5 38% C 3 C 3 C 4 C 5 α =5% Welch t ( ) C 3 C 5 (p =0.02) C 4 (p =0.08) α = 10% ! ( ) 1, ( 3 5 ) 1, 2 OR 1, , d v u (d)=(wu d t 1,wu d t 2,,wu d t N ) wu d t d t T { w wu d t = d t (if t T p (d) T n (d)) 0 (otherwise) T p (d) T n (d) d 3 d d S 3 (d d ) S 3 (d d)= v u(d) v p (d ) v u (d) v p (d 3 )
9 SP1-E ( ( ) ( A (1) (2) ) ) [%] 95% [%] 29(77/266) [22, 36] 32(67/209) [27, 37] 3 38(88/232) [35, 43] 6 1, 2, , 2, ( 1 10 ) 2 1, 2, %(250/300) 1 2 1, 2 3 1, ( ) 3 () ( 3 ) , 2 ( 1) 3 1, % α =5% Weltch t ( ) 3 (p =0.031) (p =0.055) ( 3 1 ) 7. 2 (
10 Web ) ( ) ( ) [Choi 12] S. Choi, S. Ko, and Y. Han: A Movie Recommendation Algorithm Based on Genre Correlations, Expert Systems with Applications, Vol. 39, No. 9, pp (2012) [Ding 05] Y. Ding and X. Li: Time Weight Collaborative Filtering, Proceedings of ACM International Conerence on Information and Knowledge Management, pp (2005) [Fleischman 03] M. Fleischman, and E. Hovy: Recommendations without User Preferences: A Natural Language Processing Approach, Proceedings of International Conference on Intelligent User Interfaces, pp (2003) [Ghosh 99] S. Ghosh, M. Mundhe, K. Hernandez. and S. Sen: Voting for Movies: the Anatomy of a Recommender System, Proceedings of Annual Conference on Autonomous Agents, pp (1999) [ 05] Vol. 12, No. 2, pp (2005) [ 01] ZASH : Vol. 42, No. 8, pp (2001) [Kubo 04] T. Kudo, K. Yamamoto. and Y. Matsumoto: Applying Conditional Random Fields to Japanese Morphological Analysis, Proceedings of Conference on Empirical Methods in Natural Language Processing, pp (2004) [ 02] Vol. 43 No. 6 pp , [ 06] MineBlog: blog Vol. 47, No. 4, pp (2006) [ 08] Vol. 49, No. 1, pp (2008) [Park 07] S.T. Park and D.M. Pennock: Applying Collaborative Filtering Techniques to Movie Search for Better Ranking and Browsing, Proceedings ofacm International Conference on Knowledge Discovery and Data Mining, pp (2007) [Roy 13] D. Roy and A. Kundu: Design of Movie Recommendation System by Means of Collaborative Filtering, International Journal of Emerging Technology and Advanced Engineering, Vol. 3, No. 4, pp (2013) [Said 10] A. Said, S. Berkovsky and E.W. Luca: Putting Things in Context: Challenge on Context-Aware Movie Recommendation, Proceedings of the Workshop on Context-Aware Movie Recommendation, pp. 2-6 (2010) [Sarwar 01] B. Sarwar, G. Karypis, J. Konstan and J. Riedl: Item- Based Collaborative Filtering Recommendation Algorithms, Proceedings of International Conference on World Wide Web, pp (2001) [Sinha 02] R. Sinha and K. Swearingen: The Role of Transparency in Recommender Systems, Proceedings of Conference on Human Factors in Computing Systems, pp (2002) [ 04],, Weblog ( ) SIG-SWO-A (2004) [ 08],, 14 pp (2008) ( ) IEEE ( NTT) ICOT RWC 2000 ( ) ACM
Web. Web. Web Google *1. Web [1] SBM SBM. iphone [2][3] Web. Web Web. Web. Web
Web 1 1 1 1 Web 0.81 1. Web Google *1 Yahoo *2 Web [1] iphone [2][3] Web Web Web Web 1 *1 https://www.google.co.jp/ *2 http://www.yahoo.co.jp/ Web ( ) 2 Web Web Web ( SBM ) SBM Web Web 2. Web SBM Web SBM
More informationCollaborative Filtering with Temporal Dynamics with Using Singular Value Decomposition
ISSN 1330-3651 (Print), ISSN 1848-6339 (Online) https://doi.org/10.17559/tv-20160708140839 Original scientific paper Collaborative Filtering with Temporal Dynamics with Using Singular Value Decomposition
More informationNantonac Collaborative Filtering Recommendation Based on Order Responces. 1 SD Recommender System [23] [26] Collaborative Filtering; CF
Nantonac Collaborative Filtering Recommendation Based on Order Responces (Toshihiro KAMISHIMA) (National Institute of Advanced Industrial Science and Technology (AIST)) Abstract: A recommender system suggests
More informationMatrix Factorization In Recommender Systems. Yong Zheng, PhDc Center for Web Intelligence, DePaul University, USA March 4, 2015
Matrix Factorization In Recommender Systems Yong Zheng, PhDc Center for Web Intelligence, DePaul University, USA March 4, 2015 Table of Contents Background: Recommender Systems (RS) Evolution of Matrix
More informationRetrieval by Content. Part 2: Text Retrieval Term Frequency and Inverse Document Frequency. Srihari: CSE 626 1
Retrieval by Content Part 2: Text Retrieval Term Frequency and Inverse Document Frequency Srihari: CSE 626 1 Text Retrieval Retrieval of text-based information is referred to as Information Retrieval (IR)
More informationPredicting Neighbor Goodness in Collaborative Filtering
Predicting Neighbor Goodness in Collaborative Filtering Alejandro Bellogín and Pablo Castells {alejandro.bellogin, pablo.castells}@uam.es Universidad Autónoma de Madrid Escuela Politécnica Superior Introduction:
More informationService Selection based on Similarity Measurement for Conditional Qualitative Preference
Service Selection based on Similarity Measurement for Conditional Qualitative Preference Hongbing Wang, Jie Zhang, Hualan Wang, Yangyu Tang, and Guibing Guo School of Computer Science and Engineering,
More informationRanked IR. Lecture Objectives. Text Technologies for Data Science INFR Learn about Ranked IR. Implement: 10/10/2018. Instructor: Walid Magdy
Text Technologies for Data Science INFR11145 Ranked IR Instructor: Walid Magdy 10-Oct-2018 Lecture Objectives Learn about Ranked IR TFIDF VSM SMART notation Implement: TFIDF 2 1 Boolean Retrieval Thus
More informationRandom Surfing on Multipartite Graphs
Random Surfing on Multipartite Graphs Athanasios N. Nikolakopoulos, Antonia Korba and John D. Garofalakis Department of Computer Engineering and Informatics, University of Patras December 07, 2016 IEEE
More informationProbabilistic Partial User Model Similarity for Collaborative Filtering
Probabilistic Partial User Model Similarity for Collaborative Filtering Amancio Bouza, Gerald Reif, Abraham Bernstein Department of Informatics, University of Zurich {bouza,reif,bernstein}@ifi.uzh.ch Abstract.
More informationRanked IR. Lecture Objectives. Text Technologies for Data Science INFR Learn about Ranked IR. Implement: 10/10/2017. Instructor: Walid Magdy
Text Technologies for Data Science INFR11145 Ranked IR Instructor: Walid Magdy 10-Oct-017 Lecture Objectives Learn about Ranked IR TFIDF VSM SMART notation Implement: TFIDF 1 Boolean Retrieval Thus far,
More informationNTT/NAIST s Text Summarization Systems for TSC-2
Proceedings of the Third NTCIR Workshop NTT/NAIST s Text Summarization Systems for TSC-2 Tsutomu Hirao Kazuhiro Takeuchi Hideki Isozaki Yutaka Sasaki Eisaku Maeda NTT Communication Science Laboratories,
More informationRecommender Systems. From Content to Latent Factor Analysis. Michael Hahsler
Recommender Systems From Content to Latent Factor Analysis Michael Hahsler Intelligent Data Analysis Lab (IDA@SMU) CSE Department, Lyle School of Engineering Southern Methodist University CSE Seminar September
More informationCollaborative topic models: motivations cont
Collaborative topic models: motivations cont Two topics: machine learning social network analysis Two people: " boy Two articles: article A! girl article B Preferences: The boy likes A and B --- no problem.
More informationRecommendation Method for Extending Subscription Periods
Recommendation Method for Extending Subscription Periods Tomoharu Iwata, Kazumi Saito, Takeshi Yamada NTT Communication Science Laboratories 2-4, Hikaridai, Seika-cho, Keihanna Science City Kyoto 619-0237
More informationImpact of Data Characteristics on Recommender Systems Performance
Impact of Data Characteristics on Recommender Systems Performance Gediminas Adomavicius YoungOk Kwon Jingjing Zhang Department of Information and Decision Sciences Carlson School of Management, University
More informationNatural Language Processing. Topics in Information Retrieval. Updated 5/10
Natural Language Processing Topics in Information Retrieval Updated 5/10 Outline Introduction to IR Design features of IR systems Evaluation measures The vector space model Latent semantic indexing Background
More informationInformation Retrieval
Introduction to Information Retrieval Lecture 12: Language Models for IR Outline Language models Language Models for IR Discussion What is a language model? We can view a finite state automaton as a deterministic
More informationOntology-Based News Recommendation
Ontology-Based News Recommendation Wouter IJntema Frank Goossen Flavius Frasincar Frederik Hogenboom Erasmus University Rotterdam, the Netherlands frasincar@ese.eur.nl Outline Introduction Hermes: News
More informationCollaborative Filtering Using Orthogonal Nonnegative Matrix Tri-factorization
Collaborative Filtering Using Orthogonal Nonnegative Matrix Tri-factorization Gang Chen 1,FeiWang 1, Changshui Zhang 2 State Key Laboratory of Intelligent Technologies and Systems Tsinghua University 1
More informationExploring the Ratings Prediction Task in a Group Recommender System that Automatically Detects Groups
Exploring the Ratings Prediction Task in a Group Recommender System that Automatically Detects Groups Ludovico Boratto and Salvatore Carta Dip.to di Matematica e Informatica Università di Cagliari Via
More informationMotivation. User. Retrieval Model Result: Query. Document Collection. Information Need. Information Retrieval / Chapter 3: Retrieval Models
3. Retrieval Models Motivation Information Need User Retrieval Model Result: Query 1. 2. 3. Document Collection 2 Agenda 3.1 Boolean Retrieval 3.2 Vector Space Model 3.3 Probabilistic IR 3.4 Statistical
More informationRecommendation Systems
Recommendation Systems Popularity Recommendation Systems Predicting user responses to options Offering news articles based on users interests Offering suggestions on what the user might like to buy/consume
More informationSynergies that Matter: Efficient Interaction Selection via Sparse Factorization Machine
Synergies that Matter: Efficient Interaction Selection via Sparse Factorization Machine Jianpeng Xu, Kaixiang Lin, Pang-Ning Tan, Jiayu Zhou Department of Computer Science and Engineering, Michigan State
More informationCollaborative Filtering via Gaussian Probabilistic Latent Semantic Analysis
Collaborative Filtering via Gaussian robabilistic Latent Semantic Analysis Thomas Hofmann Department of Computer Science Brown University, rovidence, RI, USA th@cs.brown.edu ABSTRACT Collaborative filtering
More informationNonnegative Matrix Factorization
Nonnegative Matrix Factorization Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr
More informationComputer science research seminar: VideoLectures.Net recommender system challenge: presentation of baseline solution
Computer science research seminar: VideoLectures.Net recommender system challenge: presentation of baseline solution Nino Antulov-Fantulin 1, Mentors: Tomislav Šmuc 1 and Mile Šikić 2 3 1 Institute Rudjer
More informationCollaborative Filtering with Aspect-based Opinion Mining: A Tensor Factorization Approach
2012 IEEE 12th International Conference on Data Mining Collaborative Filtering with Aspect-based Opinion Mining: A Tensor Factorization Approach Yuanhong Wang,Yang Liu, Xiaohui Yu School of Computer Science
More informationFAQs. Fitting h θ (x)
10/15/2018 - FALL 2018 W9.A.0.0 10/15/2018 - FALL 2018 W9.A.1 FAs How to iprove the ter project proposal? Brainstor with your teaates Make an appointent with e (eeting ust include all of the tea ebers)
More informationAPPLICATIONS OF MINING HETEROGENEOUS INFORMATION NETWORKS
APPLICATIONS OF MINING HETEROGENEOUS INFORMATION NETWORKS Yizhou Sun College of Computer and Information Science Northeastern University yzsun@ccs.neu.edu July 25, 2015 Heterogeneous Information Networks
More informationInformation Retrieval
Introduction to Information Retrieval CS276: Information Retrieval and Web Search Pandu Nayak and Prabhakar Raghavan Lecture 6: Scoring, Term Weighting and the Vector Space Model This lecture; IIR Sections
More informationCubeSVD: A Novel Approach to Personalized Web Search
CubeSVD: A Novel Approach to Personalized Web Search Jian-Tao Sun Dept. of Computer Science TsingHua University Beijing 84, China sjt@mails.tsinghua.edu.cn Hua-Jun Zeng Microsoft Research Asia 5F, Sigma
More informationCS276A Text Information Retrieval, Mining, and Exploitation. Lecture 4 15 Oct 2002
CS276A Text Information Retrieval, Mining, and Exploitation Lecture 4 15 Oct 2002 Recap of last time Index size Index construction techniques Dynamic indices Real world considerations 2 Back of the envelope
More informationTerm Weighting and the Vector Space Model. borrowing from: Pandu Nayak and Prabhakar Raghavan
Term Weighting and the Vector Space Model borrowing from: Pandu Nayak and Prabhakar Raghavan IIR Sections 6.2 6.4.3 Ranked retrieval Scoring documents Term frequency Collection statistics Weighting schemes
More informationInformation Retrieval and Organisation
Information Retrieval and Organisation Chapter 13 Text Classification and Naïve Bayes Dell Zhang Birkbeck, University of London Motivation Relevance Feedback revisited The user marks a number of documents
More informationCollaborative Filtering on Ordinal User Feedback
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Collaborative Filtering on Ordinal User Feedback Yehuda Koren Google yehudako@gmail.com Joseph Sill Analytics Consultant
More informationTerms in Time and Times in Context: A Graph-based Term-Time Ranking Model
Terms in Time and Times in Context: A Graph-based Term-Time Ranking Model Andreas Spitz, Jannik Strötgen, Thomas Bögel and Michael Gertz Heidelberg University Institute of Computer Science Database Systems
More informationRanked Retrieval (2)
Text Technologies for Data Science INFR11145 Ranked Retrieval (2) Instructor: Walid Magdy 31-Oct-2017 Lecture Objectives Learn about Probabilistic models BM25 Learn about LM for IR 2 1 Recall: VSM & TFIDF
More informationarxiv: v2 [cs.ir] 14 May 2018
A Probabilistic Model for the Cold-Start Problem in Rating Prediction using Click Data ThaiBinh Nguyen 1 and Atsuhiro Takasu 1, 1 Department of Informatics, SOKENDAI (The Graduate University for Advanced
More informationPV211: Introduction to Information Retrieval
PV211: Introduction to Information Retrieval http://www.fi.muni.cz/~sojka/pv211 IIR 6: Scoring, term weighting, the vector space model Handout version Petr Sojka, Hinrich Schütze et al. Faculty of Informatics,
More informationRelated Term Suggestion using Cooking Recipe Document Structure and its Application to Interactive Query Expansion
Related Term Suggestion using Cooking Recipe Document Structure and its Application to Interactive Query Expansion 1 Michiko Yasukawa 1 1 1 Faculty of Science and Technology, Gunma University Abstract:
More informationScienceDirect. Defining Measures for Location Visiting Preference
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 63 (2015 ) 142 147 6th International Conference on Emerging Ubiquitous Systems and Pervasive Networks, EUSPN-2015 Defining
More informationPredicting the Performance of Collaborative Filtering Algorithms
Predicting the Performance of Collaborative Filtering Algorithms Pawel Matuszyk and Myra Spiliopoulou Knowledge Management and Discovery Otto-von-Guericke University Magdeburg, Germany 04. June 2014 Pawel
More informationCross-domain recommendation without shared users or items by sharing latent vector distributions
Cross-domain recommendation without shared users or items by sharing latent vector distributions Tomoharu Iwata Koh Takeuchi NTT Communication Science Laboratories Abstract We propose a cross-domain recommendation
More informationRanking-II. Temporal Representation and Retrieval Models. Temporal Information Retrieval
Ranking-II Temporal Representation and Retrieval Models Temporal Information Retrieval Ranking in Information Retrieval Ranking documents important for information overload, quickly finding documents which
More informationRecommender Systems. Dipanjan Das Language Technologies Institute Carnegie Mellon University. 20 November, 2007
Recommender Systems Dipanjan Das Language Technologies Institute Carnegie Mellon University 20 November, 2007 Today s Outline What are Recommender Systems? Two approaches Content Based Methods Collaborative
More information6.034 Introduction to Artificial Intelligence
6.34 Introduction to Artificial Intelligence Tommi Jaakkola MIT CSAIL The world is drowning in data... The world is drowning in data...... access to information is based on recommendations Recommending
More informationCS425: Algorithms for Web Scale Data
CS: Algorithms for Web Scale Data Most of the slides are from the Mining of Massive Datasets book. These slides have been modified for CS. The original slides can be accessed at: www.mmds.org Customer
More informationMatrix Factorization and Neighbor Based Algorithms for the Netflix Prize Problem
Matrix Factorization and Neighbor Based Algorithms for the Netflix Prize Problem Gábor Takács Dept. of Mathematics and Computer Science Széchenyi István University Egyetem tér 1. Győr, Hungary gtakacs@sze.hu
More informationLanguage Models. Web Search. LM Jelinek-Mercer Smoothing and LM Dirichlet Smoothing. Slides based on the books: 13
Language Models LM Jelinek-Mercer Smoothing and LM Dirichlet Smoothing Web Search Slides based on the books: 13 Overview Indexes Query Indexing Ranking Results Application Documents User Information analysis
More informationCollaborative Nowcasting for Contextual Recommendation
Collaborative for Contextual Recommendation Yu Sun 1, Nicholas Jing Yuan 2, Xing Xie 3, Kieran McDonald 4, Rui Zhang 5 University of Melbourne { 1 sun.y, 5 rui.zhang}@unimelb.edu.au Microsoft Research
More informationEE 381V: Large Scale Learning Spring Lecture 16 March 7
EE 381V: Large Scale Learning Spring 2013 Lecture 16 March 7 Lecturer: Caramanis & Sanghavi Scribe: Tianyang Bai 16.1 Topics Covered In this lecture, we introduced one method of matrix completion via SVD-based
More informationAn Application of Link Prediction in Bipartite Graphs: Personalized Blog Feedback Prediction
An Application of Link Prediction in Bipartite Graphs: Personalized Blog Feedback Prediction Krisztian Buza Dpt. of Computer Science and Inf. Theory Budapest University of Techn. and Economics 1117 Budapest,
More informationData Mining Techniques
Data Mining Techniques CS 622 - Section 2 - Spring 27 Pre-final Review Jan-Willem van de Meent Feedback Feedback https://goo.gl/er7eo8 (also posted on Piazza) Also, please fill out your TRACE evaluations!
More informationConstruction and Analysis of Climate Networks
Construction and Analysis of Climate Networks Karsten Steinhaeuser University of Minnesota Workshop on Understanding Climate Change from Data Minneapolis, MN August 15, 2011 Working Definitions Knowledge
More informationPredictive Discrete Latent Factor Models for large incomplete dyadic data
Predictive Discrete Latent Factor Models for large incomplete dyadic data Deepak Agarwal, Srujana Merugu, Abhishek Agarwal Y! Research MMDS Workshop, Stanford University 6/25/2008 Agenda Motivating applications
More informationCAIM: Cerca i Anàlisi d Informació Massiva
1 / 21 CAIM: Cerca i Anàlisi d Informació Massiva FIB, Grau en Enginyeria Informàtica Slides by Marta Arias, José Balcázar, Ricard Gavaldá Department of Computer Science, UPC Fall 2016 http://www.cs.upc.edu/~caim
More informationNon-Boolean models of retrieval: Agenda
Non-Boolean models of retrieval: Agenda Review of Boolean model and TF/IDF Simple extensions thereof Vector model Language Model-based retrieval Matrix decomposition methods Non-Boolean models of retrieval:
More informationDiscovery and Access of Geospatial Resources using the Geoportal Extension. Marten Hogeweg Geoportal Extension Product Manager
Discovery and Access of Geospatial Resources using the Geoportal Extension Marten Hogeweg Geoportal Extension Product Manager DISCOVERY AND ACCESS USING THE GEOPORTAL EXTENSION Geospatial Data Is Very
More informationBiCycle: Item Recommendation with Life Cycles
: Item Recommendation with Life Cycles Xinyue Liu, Yuanfang Song, Charu Aggarwal, Yao Zhang and Xiangnan Kong Worcester Polytechnic Institute, Worcester, MA, USA University of Wisconsin-Madison, Madison,
More informationUsing Conservative Estimation for Conditional Probability instead of Ignoring Infrequent Case
Using Conservative Estimation for Conditional Probability instead of Ignoring Infrequent Case Masato Kikuchi, Eiko Yamamoto, Mitsuo Yoshida, Masayuki Okabe, Kyoji Umemura Department of Computer Science
More informationComparative Summarization via Latent Dirichlet Allocation
Comparative Summarization via Latent Dirichlet Allocation Michal Campr and Karel Jezek Department of Computer Science and Engineering, FAV, University of West Bohemia, 11 February 2013, 301 00, Plzen,
More informationDEIM Forum 2016 C1-3 606-8501 E-mail: {stanaka,adam,tanaka}@dl.kuis.kyoto-u.ac.jp 1., 1 Greek Prime Minister Calls for Referendum on Bailout Terms 1 Friday, June 26, 2015 In an unexpected move, Prime Minister
More informationEconomic and Social Council 2 July 2015
ADVANCE UNEDITED VERSION UNITED NATIONS E/C.20/2015/11/Add.1 Economic and Social Council 2 July 2015 Committee of Experts on Global Geospatial Information Management Fifth session New York, 5-7 August
More informationCollaborative Filtering via Ensembles of Matrix Factorizations
Collaborative Ftering via Ensembles of Matrix Factorizations Mingrui Wu Max Planck Institute for Biological Cybernetics Spemannstrasse 38, 72076 Tübingen, Germany mingrui.wu@tuebingen.mpg.de ABSTRACT We
More informationMatrix Factorization Techniques For Recommender Systems. Collaborative Filtering
Matrix Factorization Techniques For Recommender Systems Collaborative Filtering Markus Freitag, Jan-Felix Schwarz 28 April 2011 Agenda 2 1. Paper Backgrounds 2. Latent Factor Models 3. Overfitting & Regularization
More informationModeling User Rating Profiles For Collaborative Filtering
Modeling User Rating Profiles For Collaborative Filtering Benjamin Marlin Department of Computer Science University of Toronto Toronto, ON, M5S 3H5, CANADA marlin@cs.toronto.edu Abstract In this paper
More informationInfinite Hidden Relational Models
Infinite Hidden Relational Models Zhao Xu Institute for Computer Science University of Munich Munich, Germany Volker Tresp, Kai Yu Information and Communications Corporate Technology, Siemens AG Munich,
More informationFall 2018: Introduction to Data Science GIRI NARASIMHAN, SCIS, FIU
Fall 2018: Introduction to Data Science GIRI NARASIMHAN, SCIS, FIU !2 Data Wrangling !3 Database Join (Python merge) unames = ['user_id', 'gender', 'age', 'occupation', 'zip'] users = pd.read_table('data/ml-1m/users.dat',
More informationRETRIEVAL MODELS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS
RETRIEVAL MODELS Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Retrieval models Boolean model Vector space model Probabilistic
More informationModeling of Growing Networks with Directional Attachment and Communities
Modeling of Growing Networks with Directional Attachment and Communities Masahiro KIMURA, Kazumi SAITO, Naonori UEDA NTT Communication Science Laboratories 2-4 Hikaridai, Seika-cho, Kyoto 619-0237, Japan
More informationScalable Hierarchical Recommendations Using Spatial Autocorrelation
Scalable Hierarchical Recommendations Using Spatial Autocorrelation Ayushi Dalmia, Joydeep Das, Prosenjit Gupta, Subhashis Majumder, Debarshi Dutta Ayushi Dalmia, JoydeepScalable Das, Prosenjit Hierarchical
More informationIntensity-Duration-Frequency (IDF) Curves Example
Intensity-Duration-Frequency (IDF) Curves Example Intensity-Duration-Frequency (IDF) curves describe the relationship between rainfall intensity, rainfall duration, and return period (or its inverse, probability
More informationFast Comparison of Software Birthmarks for Detecting the Theft with the Search Engine
2016 4th Intl Conf on Applied Computing and Information Technology/3rd Intl Conf on Computational Science/Intelligence and Applied Informatics/1st Intl Conf on Big Data, Cloud Computing, Data Science &
More informationUnified Modeling of User Activities on Social Networking Sites
Unified Modeling of User Activities on Social Networking Sites Himabindu Lakkaraju IBM Research - India Manyata Embassy Business Park Bangalore, Karnataka - 5645 klakkara@in.ibm.com Angshu Rai IBM Research
More informationTAPER: A Contextual Tensor- Based Approach for Personalized Expert Recommendation
TAPER: A Contextual Tensor- Based Approach for Personalized Expert Recommendation Hancheng Ge, James Caverlee and Haokai Lu Department of Computer Science and Engineering Texas A&M University, USA ACM
More informationData Mining Recitation Notes Week 3
Data Mining Recitation Notes Week 3 Jack Rae January 28, 2013 1 Information Retrieval Given a set of documents, pull the (k) most similar document(s) to a given query. 1.1 Setup Say we have D documents
More informationBiased Assimilation, Homophily, and the Dynamics of Polarization
Biased Assimilation, Homophily, and the Dynamics of Polarization Pranav Dandekar joint work with A. Goel D. Lee Motivating Questions Are we as a society getting polarized? If so, why? Do recommender systems
More informationFactorization models for context-aware recommendations
INFOCOMMUNICATIONS JOURNAL Factorization Models for Context-aware Recommendations Factorization models for context-aware recommendations Balázs Hidasi Abstract The field of implicit feedback based recommender
More informationA New Approach for Item Ranking Based on Review Scores Reflecting Temporal Trust Factor
A New Approach for Item Ranking Based on Review Scores Reflecting Temporal Trust Factor Kazumi Saito 1, Masahiro Kimura 2, Kouzou Ohara 3, and Hiroshi Motoda 4,5 1 School of Administration and Informatics,
More informationTopic Models and Applications to Short Documents
Topic Models and Applications to Short Documents Dieu-Thu Le Email: dieuthu.le@unitn.it Trento University April 6, 2011 1 / 43 Outline Introduction Latent Dirichlet Allocation Gibbs Sampling Short Text
More informationAnalysis of the Axiomatic Foundations of Collaborative Filtering
Analysis of the Axiomatic Foundations of Collaborative Filtering David M. Pennock University of Michigan Artificial Intelligence Lab 1101 Beal Ave Ann Arbor, MI 48109-2110 dpennock@umich.edu Eric Horvitz
More informationTest and Evaluation of an Electronic Database Selection Expert System
282 Test and Evaluation of an Electronic Database Selection Expert System Introduction As the number of electronic bibliographic databases available continues to increase, library users are confronted
More informationA Survey of Point-of-Interest Recommendation in Location-Based Social Networks
Trajectory-Based Behavior Analytics: Papers from the 2015 AAAI Workshop A Survey of Point-of-Interest Recommendation in Location-Based Social Networks Yonghong Yu Xingguo Chen Tongda College School of
More informationPV211: Introduction to Information Retrieval
PV211: Introduction to Information Retrieval http://www.fi.muni.cz/~sojka/pv211 IIR 11: Probabilistic Information Retrieval Handout version Petr Sojka, Hinrich Schütze et al. Faculty of Informatics, Masaryk
More informationLearning in Probabilistic Graphs exploiting Language-Constrained Patterns
Learning in Probabilistic Graphs exploiting Language-Constrained Patterns Claudio Taranto, Nicola Di Mauro, and Floriana Esposito Department of Computer Science, University of Bari "Aldo Moro" via E. Orabona,
More informationAn Axiomatic Framework for Result Diversification
An Axiomatic Framework for Result Diversification Sreenivas Gollapudi Microsoft Search Labs, Microsoft Research sreenig@microsoft.com Aneesh Sharma Institute for Computational and Mathematical Engineering,
More informationKnowledge Discovery in Data: Overview. Naïve Bayesian Classification. .. Spring 2009 CSC 466: Knowledge Discovery from Data Alexander Dekhtyar..
Spring 2009 CSC 466: Knowledge Discovery from Data Alexander Dekhtyar Knowledge Discovery in Data: Naïve Bayes Overview Naïve Bayes methodology refers to a probabilistic approach to information discovery
More informationPreliminaries. Data Mining. The art of extracting knowledge from large bodies of structured data. Let s put it to use!
Data Mining The art of extracting knowledge from large bodies of structured data. Let s put it to use! 1 Recommendations 2 Basic Recommendations with Collaborative Filtering Making Recommendations 4 The
More informationIdentification of Bursts in a Document Stream
Identification of Bursts in a Document Stream Toshiaki FUJIKI 1, Tomoyuki NANNO 1, Yasuhiro SUZUKI 1 and Manabu OKUMURA 2 1 Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute
More informationClustering based tensor decomposition
Clustering based tensor decomposition Huan He huan.he@emory.edu Shihua Wang shihua.wang@emory.edu Emory University November 29, 2017 (Huan)(Shihua) (Emory University) Clustering based tensor decomposition
More informationA Bayesian Treatment of Social Links in Recommender Systems ; CU-CS
University of Colorado, Boulder CU Scholar Computer Science Technical Reports Computer Science Spring 5--0 A Bayesian Treatment of Social Links in Recommender Systems ; CU-CS-09- Mike Gartrell University
More informationMulti-theme Sentiment Analysis using Quantified Contextual
Multi-theme Sentiment Analysis using Quantified Contextual Valence Shifters Hongkun Yu, Jingbo Shang, MeichunHsu, Malú Castellanos, Jiawei Han Presented by Jingbo Shang University of Illinois at Urbana-Champaign
More informationSpatial Information Retrieval
Spatial Information Retrieval Wenwen LI 1, 2, Phil Yang 1, Bin Zhou 1, 3 [1] Joint Center for Intelligent Spatial Computing, and Earth System & GeoInformation Sciences College of Science, George Mason
More informationLocal Low-Rank Matrix Approximation with Preference Selection of Anchor Points
Local Low-Rank Matrix Approximation with Preference Selection of Anchor Points Menghao Zhang Beijing University of Posts and Telecommunications Beijing,China Jack@bupt.edu.cn Binbin Hu Beijing University
More informationCollaborative Recommendation with Multiclass Preference Context
Collaborative Recommendation with Multiclass Preference Context Weike Pan and Zhong Ming {panweike,mingz}@szu.edu.cn College of Computer Science and Software Engineering Shenzhen University Pan and Ming
More informationBoolean and Vector Space Retrieval Models
Boolean and Vector Space Retrieval Models Many slides in this section are adapted from Prof. Joydeep Ghosh (UT ECE) who in turn adapted them from Prof. Dik Lee (Univ. of Science and Tech, Hong Kong) 1
More informationLarge-Scale Social Network Data Mining with Multi-View Information. Hao Wang
Large-Scale Social Network Data Mining with Multi-View Information Hao Wang Dept. of Computer Science and Engineering Shanghai Jiao Tong University Supervisor: Wu-Jun Li 2013.6.19 Hao Wang Multi-View Social
More informationDatabase Privacy: k-anonymity and de-anonymization attacks
18734: Foundations of Privacy Database Privacy: k-anonymity and de-anonymization attacks Piotr Mardziel or Anupam Datta CMU Fall 2018 Publicly Released Large Datasets } Useful for improving recommendation
More informationFusion-Based Recommender System
Fusion-Based Recommender System Keshu Zhang Applied Research Center Motorola, Inc. Tempe, AZ, U.S.A. keshu.zhang@motorola.com Haifeng Li Applied Research Center Motorola, Inc. Tempe, AZ, U.S.A. A00050@motorola.com
More information