Empirical Bayes approaches to PageRank type algorithms for rating scientific journals
|
|
- Julie Pierce
- 6 years ago
- Views:
Transcription
1 Empirical Bayes approaches to PageRank type algorithms for rating scientific journals Jean-Louis Foulley, Gilles Celeux, Julie Josse INRIA, École Polytechnique May 29, 2017 Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
2 Overview 1 Motivations 2 A Bayesian Dirichlet-multinomial model without diagonal Model Estimating the hyperparameters in an empirical Bayes framework 3 Ranking statistical journals Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
3 Motivation Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
4 Assessing and ranking journals Impact Factor (Garfield, 1972): average number of annual citations received / published article in the last 2 years. Impacts scientific life. Highly criticized: + or - assessment of citations; depends on the field; citation window too narrow; self-citations influence; equal weight to each quotation whatever its origin, etc. Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
5 Assessing and ranking journals Impact Factor (Garfield, 1972): average number of annual citations received / published article in the last 2 years. Impacts scientific life. Highly criticized: + or - assessment of citations; depends on the field; citation window too narrow; self-citations influence; equal weight to each quotation whatever its origin, etc. Alternatives: increase the citation window, standardize by field, etc... Take into account the importance of citing sources: Group lasso, stochastic bloc models, etc. (Varin et al., 2016) Google PageRank algorithms (Waltman et van Eck, 2010) : Prestige Scimago Journal Rank (PSJR) EigenFactor (EIFA): excludes self-citations Widely use: ease of computation. Lacks a probabilistic model. Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
6 PageRank influence scores Table: C N N N cross-citation: citing (issuing ref) in rows and cited (receiving cit) in cols. c ij : number of times i, in a given year, quotes articles published by j over a previous period of time (5 years). AmS AISM AoS ANZS Bern 1 AmS AISM AoS ANZS Bern BioJ Adjacency matrix P p ij := ( c ij c i+ ): weighted oriented network citing cited. PageRank: random surfer of Google, teleportation matrix π = 1 N 1 N G = αp + (1 α)1 N π. (1) Discrete-time, irreducible & aperiodic Markov chain between the N nodes. The parameter α damping factor a Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
7 PageRank influence scores PageRank (Brin and Page, 1998) r l+1 j = N i=1 g ij r l i, j = 1,..., N. (2) A quotation from JRRS-B does not have the same weight than others. Solution: eigenvector r with unit norm, r = r G. Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
8 PageRank influence scores PageRank (Brin and Page, 1998) r l+1 j = N i=1 g ij r l i, j = 1,..., N. (2) A quotation from JRRS-B does not have the same weight than others. Solution: eigenvector r with unit norm, r = r G. EIFA Bergstrom (2007): self-citations excluded (c ii = 0, p ii = 0, i); ( π = ai a + ): freq of references published by each journal in 5 years. r eigenvector of G. r = P r and r = r. This is equivalent to r r = 1 N r (1 α)π. (3) α EIFA introduces the teleportation part and then attenuate its effect. Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
9 A Bayesian Dirichlet-multinomial model without diagonal Model Empirical Bayes Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
10 A Bayesian Dirichlet-multinomial model without diagonal Let C i := (c ij ): the row i of C without its diagonal elements. C (N N 1) 1 Multinomial sampling of the elements of C i C i θ i M(n i, θ i ) n i = j i c ij and θ i = (θ i1,..., θ i,i 1, θ i,i+1,..., θ i,n ). 2 Dirichlet prior distributions θ i γ \i D(γ \i ) where γ \i = (γ 1, γ 2,..., γ i 1, γ i+1,..., γ N ). Posterior distributions are Dirichlet: θ i γ \i, C i D(C i + γ\i ), i = 1,..., N. Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
11 A Bayesian Dirichlet-multinomial model without diagonal Epost(θ ij ) = c ij + γ j j i c ij + j i γ, for j i, i = 1,..., N. j G i = α i p i + (1 α i )(π i ) Parametrization with prior expectation E(θ i ) = (π i ) : prior proba that i cites any other journals. πi = γ \i K with K \i \i = K γ i, K = N i=1 γ i. K \i, concentration: total number of fictive quotes given by i to others. Same form as EIFA but with shrinkage factor no longer fixed: α i = n i n i + K \i, 0 α i 1: large when n i large & K \i small (large prior variance). Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
12 Empirical Bayes approach L(C γ) = Π N i=1l(c i γ \i ) L(C i γ \i ) = p(c i θ i )p(θ i γ \i )dθ i Multinomial component: p(c i θ i ) = n i! Π j i c ij! Π j iθ c ij ij Dirichlet component: p(θ i γ \i ) = Γ( j i γ j) Π j i Γ(γ j ) Π j iθ γ j 1 ij ( ) n i!γ L i (C j i γ j Γ(c i γ \i ) = ( ij + γ j ) )Π j i. Π j i c ij!γ j i (c ij + γ j ) Γ(γ j ) Clear distinction between structural and sampling zeroes. Multinomial part: no impact, it multiplies the likelihood by 1. Dirichlet part: impact, θ i of size (N 1) instead of N. Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
13 Fixed point algorithm The log-likelihood can be written as: L i (γ \i ) = logγ(k \i ) logγ(n i + K \i ) + [logγ(c ij + γ j ) logγ(γ j )], and ( j i its gradient can be written as: dl i (C i γ \i ) dγ j = ψ(k \i ) + ψ(n i + K \i ) + ψ(c ij + γ j ) ψ(γ j ), for all i j First order algorithms: Majorize-Minimize algorithm. Fixed point iteration algorithm (Minka, 2012) γ l+1 j = γ l j i j ψ(c ij + γ l j ) (N 1)ψ(γl j ) i j ψ(n i + K l \i ) ψ(k l \i ). Second order algorithms: Levenberg-Marquardt, EM variant. Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
14 Ranking statistical journals Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
15 Statistical journals 47 statistical journals (Varin, 2016), citations published in 2010 related to articles published from 2001 to EBEF α i = 0.95 for CSDA, STMED α i = 0.39 STATAJ (mean 0.77). Teleportation decreasing with the number of references emitted. EIFA 2 scores with self-citations: EBPR (Empirical Bayes Page Rank): Multinomial-Dirichlet with diag Prestige Scimago Journal Rank (PSJR) (Scimago Lab, Scopus) G 2 = α 2 P + (1 α 2 β)1π + β 11 N, π := a i /a +, α 2 = 0.90, β = First eigenvector: G 2 r 2 = r 2. self-citations restricted to 33% Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
16 Total scores & rankings Journal PSJR EBPR EIFA EBEF EBPR PSJR EIFA EBEF 1 JASA JASA JASA JASA JASA 2 AOS AOS AOS AOS AOS 3 JRSS-B JRSS-B JRSS-B JRSS-B JRSS-B 4 BKA STMED BKA BKA BKA 5 BCS BCS BCS BCS BCS 6 STMED BKA STMED STMED STMED 7 JSPI CSDA CSDA JSPI JSPI 8 CSDA JSPI JSPI CSDA CSDA 9 STSIN STSIN STSIN STSIN STSIN 10 JMA JMA JMA JMA JMA 11 BIOST SPL BIOST BIOST BIOST 12 JCGS BIOST SPL JCGS JCGS 13 SPL JCGS JCGS SPL SPL 14 SJS STSCI STSCI STSCI SJS 15 STSCI SJS SJS SJS STSCI 16 BERN JSS BERN BERN BERN 17 CJS BERN CJS CJS CJS 18 STCMP CSTM STCMP STCMP STCMP 19 BIOJ SMMR TECH BIOJ BIOJ 20 TECH BIOJ BIOJ CSTM TECH 21 CSTM STCMP CSTM TECH CSTM 22 JRSS-C TECH JRSS-A JRSS-C JRSS-C 23 TEST EES AMS JRSS-A TEST 24 JRSS-A CJS JRSS-C TEST JRSS-A 25 AISM JRSS-A AISM AISM AISM 26 AMS JBS TEST AMS AMS 27 JNS AMS LTA LTA JNS 28 LTA JRSS-C JNS JNS LTA 29 JSCS JNS ENVR ENVR JSCS 30 ENVR AISM JSCS SMMR ENVR 31 SMMR TEST JSS JSCS SMMR Julie 32Josse MTKA (Polytechnique) Empirical 5.52 Bayes 5.77PageRank 32 ENVR SMMR May MTKA 29, 2017 MTKA 14 / 16
17 Articles scores & rankings Journal PSJR EBPR EIFA EBEF EBPR PSJR EIFA EBEF 1 JRSS-B JRSS-B JRSS-B JRSS-B JRSS-B 2 STSCI AOS AOS STSCI STSCI 3 JASA STSCI STSCI JASA JASA 4 AOS JASA JASA AOS AOS 5 BKA BKA BKA BKA BKA 6 SJS BCS BCS BCS SJS 7 JCGS JCGS JCGS JCGS JCGS 8 BCS SJS SJS SJS BCS 9 TEST CJS TEST TEST TEST 10 CJS TEST CJS CJS CJS 11 BERN JRSS-A TECH BERN BERN 12 TECH TECH BERN LTA TECH 13 LTA BERN JRSS-A TECH LTA 14 JRSS-A LTA LTA JRSS-A JRSS-A 15 JMA STMED JMA JMA JMA 16 STMOD JMA STMED STMOD STMOD 17 AMS AMS AMS STMED AMS 18 ISR ISR ISR AMS ISR 19 AISM STMOD STMOD ISR AISM 20 STMED CSDA CSDA AISM STMED 21 STCMP AISM AISM STCMP STCMP 22 CSDA STCMP STCMP CSDA CSDA 23 JSPI JSPI JSPI JSPI JSPI 24 ANZS BIOJ BIOJ BIOJ ANZS 25 BIOJ JTSA ANZS BIOST BIOJ 26 JRSS-C BIOST JTSA ANZS JRSS-C 27 STNEE ENVR BIOST JRSS-C STNEE 28 STATS JRSS-C ENVR ENVR STATS 29 BIOST ANZS JRSS-C JTSA BIOST 30 JTSA STATAJ STNEE STATS JTSA 31 ENVR STATS STATS STNEE ENVR Julie 32 Josse CMPST (Polytechnique) Empirical 0.54 Bayes 0.59 PageRank 32 STNEE STSIN May STSIN 29, 2017 CMPST 15 / 16
18 Discussion EBEF for EigenFactor with Dirichlet-multinomial model (cor 0.90) Teleportation varies from one journal to another Simplicity - Quick (6s/ 35s second order algo) Taking into account the zeros: exclusion of a specific field. Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
19 Discussion EBEF for EigenFactor with Dirichlet-multinomial model (cor 0.90) Teleportation varies from one journal to another Simplicity - Quick (6s/ 35s second order algo) Taking into account the zeros: exclusion of a specific field. Underweight self-citations in a data-driven way? (PSJR 33%). total received (R) / total made (M): S i = c +i c i+ S i (κ) = κc ii + R i κc ii + M i. = c ii +R i c ii +M i. Let κ [0, 1] if S i (0) < 1, S i (κ) increasing function of κ upper bounded by 1. if S i (0) = 1, S i (κ) = 1 for any κ. if S i (0) > 1, S i (κ) decreasing function of κ lower bounded by 1. ( ) Good journals no interest in self-citations: κ i = min min(ri,m i ) c ii, 1 Julie Josse (Polytechnique) Empirical Bayes PageRank May 29, / 16
Empirical Bayes approaches to PageRank type algorithms for rating scientific journals
Empirical Bayes approaches to PageRank type algorithms for rating scientific journals Jean-Louis Foulley, Gilles Celeux, Julie Josse To cite this version: Jean-Louis Foulley, Gilles Celeux, Julie Josse.
More informationPseudocode for calculating Eigenfactor TM Score and Article Influence TM Score using data from Thomson-Reuters Journal Citations Reports
Pseudocode for calculating Eigenfactor TM Score and Article Influence TM Score using data from Thomson-Reuters Journal Citations Reports Jevin West and Carl T. Bergstrom November 25, 2008 1 Overview There
More informationLink Analysis. Stony Brook University CSE545, Fall 2016
Link Analysis Stony Brook University CSE545, Fall 2016 The Web, circa 1998 The Web, circa 1998 The Web, circa 1998 Match keywords, language (information retrieval) Explore directory The Web, circa 1998
More informationLink Analysis Ranking
Link Analysis Ranking How do search engines decide how to rank your query results? Guess why Google ranks the query results the way it does How would you do it? Naïve ranking of query results Given query
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu 2/7/2012 Jure Leskovec, Stanford C246: Mining Massive Datasets 2 Web pages are not equally important www.joe-schmoe.com
More informationLink Analysis. Leonid E. Zhukov
Link Analysis Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural Analysis and Visualization
More informationNode and Link Analysis
Node and Link Analysis Leonid E. Zhukov School of Applied Mathematics and Information Science National Research University Higher School of Economics 10.02.2014 Leonid E. Zhukov (HSE) Lecture 5 10.02.2014
More informationDATA MINING LECTURE 13. Link Analysis Ranking PageRank -- Random walks HITS
DATA MINING LECTURE 3 Link Analysis Ranking PageRank -- Random walks HITS How to organize the web First try: Manually curated Web Directories How to organize the web Second try: Web Search Information
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Lecture 11 CRFs, Exponential Family CS/CNS/EE 155 Andreas Krause Announcements Homework 2 due today Project milestones due next Monday (Nov 9) About half the work should
More informationIntroduction to Search Engine Technology Introduction to Link Structure Analysis. Ronny Lempel Yahoo Labs, Haifa
Introduction to Search Engine Technology Introduction to Link Structure Analysis Ronny Lempel Yahoo Labs, Haifa Outline Anchor-text indexing Mathematical Background Motivation for link structure analysis
More informationGraphical Models for Collaborative Filtering
Graphical Models for Collaborative Filtering Le Song Machine Learning II: Advanced Topics CSE 8803ML, Spring 2012 Sequence modeling HMM, Kalman Filter, etc.: Similarity: the same graphical model topology,
More informationPage rank computation HPC course project a.y
Page rank computation HPC course project a.y. 2015-16 Compute efficient and scalable Pagerank MPI, Multithreading, SSE 1 PageRank PageRank is a link analysis algorithm, named after Brin & Page [1], and
More informationCalculating Web Page Authority Using the PageRank Algorithm
Jacob Miles Prystowsky and Levi Gill Math 45, Fall 2005 1 Introduction 1.1 Abstract In this document, we examine how the Google Internet search engine uses the PageRank algorithm to assign quantitatively
More informationLEARNING DYNAMIC SYSTEMS: MARKOV MODELS
LEARNING DYNAMIC SYSTEMS: MARKOV MODELS Markov Process and Markov Chains Hidden Markov Models Kalman Filters Types of dynamic systems Problem of future state prediction Predictability Observability Easily
More information1998: enter Link Analysis
1998: enter Link Analysis uses hyperlink structure to focus the relevant set combine traditional IR score with popularity score Page and Brin 1998 Kleinberg Web Information Retrieval IR before the Web
More informationOnline Social Networks and Media. Link Analysis and Web Search
Online Social Networks and Media Link Analysis and Web Search How to Organize the Web First try: Human curated Web directories Yahoo, DMOZ, LookSmart How to organize the web Second try: Web Search Information
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 informationPatterns of Scalable Bayesian Inference Background (Session 1)
Patterns of Scalable Bayesian Inference Background (Session 1) Jerónimo Arenas-García Universidad Carlos III de Madrid jeronimo.arenas@gmail.com June 14, 2017 1 / 15 Motivation. Bayesian Learning principles
More informationGraph Models The PageRank Algorithm
Graph Models The PageRank Algorithm Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2013 The PageRank Algorithm I Invented by Larry Page and Sergey Brin around 1998 and
More informationSlide source: Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University.
Slide source: Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University http://www.mmds.org #1: C4.5 Decision Tree - Classification (61 votes) #2: K-Means - Clustering
More informationPageRank algorithm Hubs and Authorities. Data mining. Web Data Mining PageRank, Hubs and Authorities. University of Szeged.
Web Data Mining PageRank, University of Szeged Why ranking web pages is useful? We are starving for knowledge It earns Google a bunch of money. How? How does the Web looks like? Big strongly connected
More informationLecture 4. Generative Models for Discrete Data - Part 3. Luigi Freda. ALCOR Lab DIAG University of Rome La Sapienza.
Lecture 4 Generative Models for Discrete Data - Part 3 Luigi Freda ALCOR Lab DIAG University of Rome La Sapienza October 6, 2017 Luigi Freda ( La Sapienza University) Lecture 4 October 6, 2017 1 / 46 Outline
More informationBayesian Methods for Machine Learning
Bayesian Methods for Machine Learning CS 584: Big Data Analytics Material adapted from Radford Neal s tutorial (http://ftp.cs.utoronto.ca/pub/radford/bayes-tut.pdf), Zoubin Ghahramni (http://hunch.net/~coms-4771/zoubin_ghahramani_bayesian_learning.pdf),
More informationBayesian Regression Linear and Logistic Regression
When we want more than point estimates Bayesian Regression Linear and Logistic Regression Nicole Beckage Ordinary Least Squares Regression and Lasso Regression return only point estimates But what if we
More information1 Bayesian Linear Regression (BLR)
Statistical Techniques in Robotics (STR, S15) Lecture#10 (Wednesday, February 11) Lecturer: Byron Boots Gaussian Properties, Bayesian Linear Regression 1 Bayesian Linear Regression (BLR) In linear regression,
More informationSTA141C: Big Data & High Performance Statistical Computing
STA141C: Big Data & High Performance Statistical Computing Lecture 6: Numerical Linear Algebra: Applications in Machine Learning Cho-Jui Hsieh UC Davis April 27, 2017 Principal Component Analysis Principal
More informationComputing PageRank using Power Extrapolation
Computing PageRank using Power Extrapolation Taher Haveliwala, Sepandar Kamvar, Dan Klein, Chris Manning, and Gene Golub Stanford University Abstract. We present a novel technique for speeding up the computation
More informationIR: Information Retrieval
/ 44 IR: Information Retrieval FIB, Master in Innovation and Research in Informatics Slides by Marta Arias, José Luis Balcázar, Ramon Ferrer-i-Cancho, Ricard Gavaldá Department of Computer Science, UPC
More informationComputational Biology Lecture #3: Probability and Statistics. Bud Mishra Professor of Computer Science, Mathematics, & Cell Biology Sept
Computational Biology Lecture #3: Probability and Statistics Bud Mishra Professor of Computer Science, Mathematics, & Cell Biology Sept 26 2005 L2-1 Basic Probabilities L2-2 1 Random Variables L2-3 Examples
More informationLecture 12: Link Analysis for Web Retrieval
Lecture 12: Link Analysis for Web Retrieval Trevor Cohn COMP90042, 2015, Semester 1 What we ll learn in this lecture The web as a graph Page-rank method for deriving the importance of pages Hubs and authorities
More informationThe PageRank Computation in Google: Randomization and Ergodicity
The PageRank Computation in Google: Randomization and Ergodicity Roberto Tempo CNR-IEIIT Consiglio Nazionale delle Ricerche Politecnico di Torino roberto.tempo@polito.it Randomization over Networks - 1
More information0.1 Naive formulation of PageRank
PageRank is a ranking system designed to find the best pages on the web. A webpage is considered good if it is endorsed (i.e. linked to) by other good webpages. The more webpages link to it, and the more
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 informationPr[positive test virus] Pr[virus] Pr[positive test] = Pr[positive test] = Pr[positive test]
146 Probability Pr[virus] = 0.00001 Pr[no virus] = 0.99999 Pr[positive test virus] = 0.99 Pr[positive test no virus] = 0.01 Pr[virus positive test] = Pr[positive test virus] Pr[virus] = 0.99 0.00001 =
More informationPattern Recognition and Machine Learning. Bishop Chapter 2: Probability Distributions
Pattern Recognition and Machine Learning Chapter 2: Probability Distributions Cécile Amblard Alex Kläser Jakob Verbeek October 11, 27 Probability Distributions: General Density Estimation: given a finite
More informationCS 277: Data Mining. Mining Web Link Structure. CS 277: Data Mining Lectures Analyzing Web Link Structure Padhraic Smyth, UC Irvine
CS 277: Data Mining Mining Web Link Structure Class Presentations In-class, Tuesday and Thursday next week 2-person teams: 6 minutes, up to 6 slides, 3 minutes/slides each person 1-person teams 4 minutes,
More informationWeb Ranking. Classification (manual, automatic) Link Analysis (today s lesson)
Link Analysis Web Ranking Documents on the web are first ranked according to their relevance vrs the query Additional ranking methods are needed to cope with huge amount of information Additional ranking
More informationSTA 4273H: Sta-s-cal Machine Learning
STA 4273H: Sta-s-cal Machine Learning Russ Salakhutdinov Department of Computer Science! Department of Statistical Sciences! rsalakhu@cs.toronto.edu! h0p://www.cs.utoronto.ca/~rsalakhu/ Lecture 2 In our
More informationLink Mining PageRank. From Stanford C246
Link Mining PageRank From Stanford C246 Broad Question: How to organize the Web? First try: Human curated Web dictionaries Yahoo, DMOZ LookSmart Second try: Web Search Information Retrieval investigates
More informationSTA414/2104. Lecture 11: Gaussian Processes. Department of Statistics
STA414/2104 Lecture 11: Gaussian Processes Department of Statistics www.utstat.utoronto.ca Delivered by Mark Ebden with thanks to Russ Salakhutdinov Outline Gaussian Processes Exam review Course evaluations
More informationSTAT Advanced Bayesian Inference
1 / 8 STAT 625 - Advanced Bayesian Inference Meng Li Department of Statistics March 5, 2018 Distributional approximations 2 / 8 Distributional approximations are useful for quick inferences, as starting
More informationA Note on Google s PageRank
A Note on Google s PageRank According to Google, google-search on a given topic results in a listing of most relevant web pages related to the topic. Google ranks the importance of webpages according to
More informationMotif representation using position weight matrix
Motif representation using position weight matrix Xiaohui Xie University of California, Irvine Motif representation using position weight matrix p.1/31 Position weight matrix Position weight matrix representation
More informationMATH36001 Perron Frobenius Theory 2015
MATH361 Perron Frobenius Theory 215 In addition to saying something useful, the Perron Frobenius theory is elegant. It is a testament to the fact that beautiful mathematics eventually tends to be useful,
More informationUpdating PageRank. Amy Langville Carl Meyer
Updating PageRank Amy Langville Carl Meyer Department of Mathematics North Carolina State University Raleigh, NC SCCM 11/17/2003 Indexing Google Must index key terms on each page Robots crawl the web software
More informationData and Algorithms of the Web
Data and Algorithms of the Web Link Analysis Algorithms Page Rank some slides from: Anand Rajaraman, Jeffrey D. Ullman InfoLab (Stanford University) Link Analysis Algorithms Page Rank Hubs and Authorities
More informationIntroduction to Restricted Boltzmann Machines
Introduction to Restricted Boltzmann Machines Ilija Bogunovic and Edo Collins EPFL {ilija.bogunovic,edo.collins}@epfl.ch October 13, 2014 Introduction Ingredients: 1. Probabilistic graphical models (undirected,
More informationThe PageRank Problem, Multi-Agent. Consensus and Web Aggregation
The PageRank Problem, Multi-Agent Consensus and Web Aggregation A Systems and Control Viewpoint arxiv:32.904v [cs.sy] 6 Dec 203 Hideaki Ishii and Roberto Tempo PageRank is an algorithm introduced in 998
More informationA hybrid reordered Arnoldi method to accelerate PageRank computations
A hybrid reordered Arnoldi method to accelerate PageRank computations Danielle Parker Final Presentation Background Modeling the Web The Web The Graph (A) Ranks of Web pages v = v 1... Dominant Eigenvector
More informationINTRODUCTION TO MCMC AND PAGERANK. Eric Vigoda Georgia Tech. Lecture for CS 6505
INTRODUCTION TO MCMC AND PAGERANK Eric Vigoda Georgia Tech Lecture for CS 6505 1 MARKOV CHAIN BASICS 2 ERGODICITY 3 WHAT IS THE STATIONARY DISTRIBUTION? 4 PAGERANK 5 MIXING TIME 6 PREVIEW OF FURTHER TOPICS
More informationCourse 495: Advanced Statistical Machine Learning/Pattern Recognition
Course 495: Advanced Statistical Machine Learning/Pattern Recognition Lecturer: Stefanos Zafeiriou Goal (Lectures): To present discrete and continuous valued probabilistic linear dynamical systems (HMMs
More informationThe Monte Carlo Method: Bayesian Networks
The Method: Bayesian Networks Dieter W. Heermann Methods 2009 Dieter W. Heermann ( Methods)The Method: Bayesian Networks 2009 1 / 18 Outline 1 Bayesian Networks 2 Gene Expression Data 3 Bayesian Networks
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu How to organize/navigate it? First try: Human curated Web directories Yahoo, DMOZ, LookSmart
More informationTen good reasons to use the Eigenfactor TM metrics
Ten good reasons to use the Eigenfactor TM metrics Massimo Franceschet Department of Mathematics and Computer Science, University of Udine Via delle Scienze 206 33100 Udine, Italy massimo.franceschet@dimi.uniud.it
More informationCS6220: DATA MINING TECHNIQUES
CS6220: DATA MINING TECHNIQUES Mining Graph/Network Data Instructor: Yizhou Sun yzsun@ccs.neu.edu November 16, 2015 Methods to Learn Classification Clustering Frequent Pattern Mining Matrix Data Decision
More informationUncertainty and Randomization
Uncertainty and Randomization The PageRank Computation in Google Roberto Tempo IEIIT-CNR Politecnico di Torino tempo@polito.it 1993: Robustness of Linear Systems 1993: Robustness of Linear Systems 16 Years
More informationModeling Environment
Topic Model Modeling Environment What does it mean to understand/ your environment? Ability to predict Two approaches to ing environment of words and text Latent Semantic Analysis (LSA) Topic Model LSA
More informationParametric Models. Dr. Shuang LIANG. School of Software Engineering TongJi University Fall, 2012
Parametric Models Dr. Shuang LIANG School of Software Engineering TongJi University Fall, 2012 Today s Topics Maximum Likelihood Estimation Bayesian Density Estimation Today s Topics Maximum Likelihood
More informationChain ladder with random effects
Greg Fry Consulting Actuaries Sydney Australia Astin Colloquium, The Hague 21-24 May 2013 Overview Fixed effects models Families of chain ladder models Maximum likelihood estimators Random effects models
More informationData Mining and Matrices
Data Mining and Matrices 10 Graphs II Rainer Gemulla, Pauli Miettinen Jul 4, 2013 Link analysis The web as a directed graph Set of web pages with associated textual content Hyperlinks between webpages
More informationECEN 689 Special Topics in Data Science for Communications Networks
ECEN 689 Special Topics in Data Science for Communications Networks Nick Duffield Department of Electrical & Computer Engineering Texas A&M University Lecture 8 Random Walks, Matrices and PageRank Graphs
More informationName: Matriculation Number: Tutorial Group: A B C D E
Name: Matriculation Number: Tutorial Group: A B C D E Question: 1 (5 Points) 2 (6 Points) 3 (5 Points) 4 (5 Points) Total (21 points) Score: General instructions: The written test contains 4 questions
More informationLecture 8 Learning Sequence Motif Models Using Expectation Maximization (EM) Colin Dewey February 14, 2008
Lecture 8 Learning Sequence Motif Models Using Expectation Maximization (EM) Colin Dewey February 14, 2008 1 Sequence Motifs what is a sequence motif? a sequence pattern of biological significance typically
More informationLecture 5. Gaussian Models - Part 1. Luigi Freda. ALCOR Lab DIAG University of Rome La Sapienza. November 29, 2016
Lecture 5 Gaussian Models - Part 1 Luigi Freda ALCOR Lab DIAG University of Rome La Sapienza November 29, 2016 Luigi Freda ( La Sapienza University) Lecture 5 November 29, 2016 1 / 42 Outline 1 Basics
More informationLink Analysis. Reference: Introduction to Information Retrieval by C. Manning, P. Raghavan, H. Schutze
Link Analysis Reference: Introduction to Information Retrieval by C. Manning, P. Raghavan, H. Schutze 1 The Web as a Directed Graph Page A Anchor hyperlink Page B Assumption 1: A hyperlink between pages
More informationCOS513 LECTURE 8 STATISTICAL CONCEPTS
COS513 LECTURE 8 STATISTICAL CONCEPTS NIKOLAI SLAVOV AND ANKUR PARIKH 1. MAKING MEANINGFUL STATEMENTS FROM JOINT PROBABILITY DISTRIBUTIONS. A graphical model (GM) represents a family of probability distributions
More informationKrylov Subspace Methods to Calculate PageRank
Krylov Subspace Methods to Calculate PageRank B. Vadala-Roth REU Final Presentation August 1st, 2013 How does Google Rank Web Pages? The Web The Graph (A) Ranks of Web pages v = v 1... Dominant Eigenvector
More informationThe Google Markov Chain: convergence speed and eigenvalues
U.U.D.M. Project Report 2012:14 The Google Markov Chain: convergence speed and eigenvalues Fredrik Backåker Examensarbete i matematik, 15 hp Handledare och examinator: Jakob Björnberg Juni 2012 Department
More informationPart 1: Expectation Propagation
Chalmers Machine Learning Summer School Approximate message passing and biomedicine Part 1: Expectation Propagation Tom Heskes Machine Learning Group, Institute for Computing and Information Sciences Radboud
More informationOverall Objective Priors
Overall Objective Priors Jim Berger, Jose Bernardo and Dongchu Sun Duke University, University of Valencia and University of Missouri Recent advances in statistical inference: theory and case studies University
More informationNon-Parametric Bayes
Non-Parametric Bayes Mark Schmidt UBC Machine Learning Reading Group January 2016 Current Hot Topics in Machine Learning Bayesian learning includes: Gaussian processes. Approximate inference. Bayesian
More informationComputational statistics
Computational statistics Markov Chain Monte Carlo methods Thierry Denœux March 2017 Thierry Denœux Computational statistics March 2017 1 / 71 Contents of this chapter When a target density f can be evaluated
More informationMCMC: Markov Chain Monte Carlo
I529: Machine Learning in Bioinformatics (Spring 2013) MCMC: Markov Chain Monte Carlo Yuzhen Ye School of Informatics and Computing Indiana University, Bloomington Spring 2013 Contents Review of Markov
More informationINTRODUCTION TO MCMC AND PAGERANK. Eric Vigoda Georgia Tech. Lecture for CS 6505
INTRODUCTION TO MCMC AND PAGERANK Eric Vigoda Georgia Tech Lecture for CS 6505 1 MARKOV CHAIN BASICS 2 ERGODICITY 3 WHAT IS THE STATIONARY DISTRIBUTION? 4 PAGERANK 5 MIXING TIME 6 PREVIEW OF FURTHER TOPICS
More informationp(d θ ) l(θ ) 1.2 x x x
p(d θ ).2 x 0-7 0.8 x 0-7 0.4 x 0-7 l(θ ) -20-40 -60-80 -00 2 3 4 5 6 7 θ ˆ 2 3 4 5 6 7 θ ˆ 2 3 4 5 6 7 θ θ x FIGURE 3.. The top graph shows several training points in one dimension, known or assumed to
More informationML estimation: Random-intercepts logistic model. and z
ML estimation: Random-intercepts logistic model log p ij 1 p = x ijβ + υ i with υ i N(0, συ) 2 ij Standardizing the random effect, θ i = υ i /σ υ, yields log p ij 1 p = x ij β + σ υθ i with θ i N(0, 1)
More informationeigenvalues, markov matrices, and the power method
eigenvalues, markov matrices, and the power method Slides by Olson. Some taken loosely from Jeff Jauregui, Some from Semeraro L. Olson Department of Computer Science University of Illinois at Urbana-Champaign
More informationProbabilistic modeling. The slides are closely adapted from Subhransu Maji s slides
Probabilistic modeling The slides are closely adapted from Subhransu Maji s slides Overview So far the models and algorithms you have learned about are relatively disconnected Probabilistic modeling framework
More informationRobust PageRank: Stationary Distribution on a Growing Network Structure
oname manuscript o. will be inserted by the editor Robust PageRank: Stationary Distribution on a Growing etwork Structure Anna Timonina-Farkas Received: date / Accepted: date Abstract PageRank PR is a
More informationOnline Social Networks and Media. Link Analysis and Web Search
Online Social Networks and Media Link Analysis and Web Search How to Organize the Web First try: Human curated Web directories Yahoo, DMOZ, LookSmart How to organize the web Second try: Web Search Information
More informationProbabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis Yuriy Sverchkov Intelligent Systems Program University of Pittsburgh October 6, 2011 Outline Latent Semantic Analysis (LSA) A quick review Probabilistic LSA (plsa)
More informationRandomization and Gossiping in Techno-Social Networks
Randomization and Gossiping in Techno-Social Networks Roberto Tempo CNR-IEIIT Consiglio Nazionale delle Ricerche Politecnico ditorino roberto.tempo@polito.it CPSN Social Network Layer humans Physical Layer
More informationMAS275 Probability Modelling Exercises
MAS75 Probability Modelling Exercises Note: these questions are intended to be of variable difficulty. In particular: Questions or part questions labelled (*) are intended to be a bit more challenging.
More informationMixed Membership Stochastic Blockmodels
Mixed Membership Stochastic Blockmodels Journal of Machine Learning Research, 2008 by E.M. Airoldi, D.M. Blei, S.E. Fienberg, E.P. Xing as interpreted by Ted Westling STAT 572 Final Talk May 8, 2014 Ted
More informationIntroduction to Bayesian inference
Introduction to Bayesian inference Thomas Alexander Brouwer University of Cambridge tab43@cam.ac.uk 17 November 2015 Probabilistic models Describe how data was generated using probability distributions
More informationCS249: ADVANCED DATA MINING
CS249: ADVANCED DATA MINING Graph and Network Instructor: Yizhou Sun yzsun@cs.ucla.edu May 31, 2017 Methods Learnt Classification Clustering Vector Data Text Data Recommender System Decision Tree; Naïve
More informationPageRank. Ryan Tibshirani /36-662: Data Mining. January Optional reading: ESL 14.10
PageRank Ryan Tibshirani 36-462/36-662: Data Mining January 24 2012 Optional reading: ESL 14.10 1 Information retrieval with the web Last time we learned about information retrieval. We learned how to
More informationIntroduction to Data Mining
Introduction to Data Mining Lecture #9: Link Analysis Seoul National University 1 In This Lecture Motivation for link analysis Pagerank: an important graph ranking algorithm Flow and random walk formulation
More informationThe Second Eigenvalue of the Google Matrix
The Second Eigenvalue of the Google Matrix Taher H. Haveliwala and Sepandar D. Kamvar Stanford University {taherh,sdkamvar}@cs.stanford.edu Abstract. We determine analytically the modulus of the second
More informationUpdating Markov Chains Carl Meyer Amy Langville
Updating Markov Chains Carl Meyer Amy Langville Department of Mathematics North Carolina State University Raleigh, NC A. A. Markov Anniversary Meeting June 13, 2006 Intro Assumptions Very large irreducible
More informationPROBABILISTIC LATENT SEMANTIC ANALYSIS
PROBABILISTIC LATENT SEMANTIC ANALYSIS Lingjia Deng Revised from slides of Shuguang Wang Outline Review of previous notes PCA/SVD HITS Latent Semantic Analysis Probabilistic Latent Semantic Analysis Applications
More informationConstruction of an Informative Hierarchical Prior Distribution: Application to Electricity Load Forecasting
Construction of an Informative Hierarchical Prior Distribution: Application to Electricity Load Forecasting Anne Philippe Laboratoire de Mathématiques Jean Leray Université de Nantes Workshop EDF-INRIA,
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning MCMC and Non-Parametric Bayes Mark Schmidt University of British Columbia Winter 2016 Admin I went through project proposals: Some of you got a message on Piazza. No news is
More informationLeast Absolute Shrinkage is Equivalent to Quadratic Penalization
Least Absolute Shrinkage is Equivalent to Quadratic Penalization Yves Grandvalet Heudiasyc, UMR CNRS 6599, Université de Technologie de Compiègne, BP 20.529, 60205 Compiègne Cedex, France Yves.Grandvalet@hds.utc.fr
More informationComplex Social System, Elections. Introduction to Network Analysis 1
Complex Social System, Elections Introduction to Network Analysis 1 Complex Social System, Network I person A voted for B A is more central than B if more people voted for A In-degree centrality index
More informationAnalysis of Google s PageRank
Analysis of Google s PageRank Ilse Ipsen North Carolina State University Joint work with Rebecca M. Wills AN05 p.1 PageRank An objective measure of the citation importance of a web page [Brin & Page 1998]
More information6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities
6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities 1 Outline Outline Dynamical systems. Linear and Non-linear. Convergence. Linear algebra and Lyapunov functions. Markov
More informationCS340 Winter 2010: HW3 Out Wed. 2nd February, due Friday 11th February
CS340 Winter 2010: HW3 Out Wed. 2nd February, due Friday 11th February 1 PageRank You are given in the file adjency.mat a matrix G of size n n where n = 1000 such that { 1 if outbound link from i to j,
More informationReview. DS GA 1002 Statistical and Mathematical Models. Carlos Fernandez-Granda
Review DS GA 1002 Statistical and Mathematical Models http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall16 Carlos Fernandez-Granda Probability and statistics Probability: Framework for dealing with
More informationAn Introduction to mixture models
An Introduction to mixture models by Franck Picard Research Report No. 7 March 2007 Statistics for Systems Biology Group Jouy-en-Josas/Paris/Evry, France http://genome.jouy.inra.fr/ssb/ An introduction
More information