Search Engines Considered Harmful In Search of an Unbiased Web Ranking
|
|
|
- Dinah Stephens
- 6 years ago
- Views:
Transcription
1 Search Engines Considered Harmful In Search of an Unbiased Web Ranking Junghoo John Cho UCLA Search Engines Considered Harmful Junghoo John Cho 1/45
2 World-Wide Web 10 years ago With Web Search Engines Considered Harmful Junghoo John Cho 2/45
3 Information Overload Too much information, too much junk Too little time Search Engines Considered Harmful Junghoo John Cho 3/45
4 Search Engines: The Savior Search Engines Considered Harmful Junghoo John Cho 4/45
5 Search Engine Success: Flip Side If you are not indexed by Google, you do not exist on the Web News.com article, 10/23/2002 Only a few major players 75% market share by Google alone People discover pages through search engines Top results: many users Bottom results: no new users Search Engines Considered Harmful Junghoo John Cho 5/45
6 Search Engine Success: Flip Side If you are not indexed by Google, you do not exist on the Web News.com article, 10/23/2002 Only a few major players 75% market share by Google alone People discover pages through search engines Top results: many users Bottom results: no new users Big question: Are we biased by search engines? Search Engines Considered Harmful Junghoo John Cho 5/45
7 PageRank: Secret Ranking Recipe Intuition: You are important if many other pages link to you High PageRank Low PageRank Popular pages are returned at the top More details later... Search Engines Considered Harmful Junghoo John Cho 6/45
8 PageRank: Secret Ranking Recipe Intuition: You are important if many other pages link to you High PageRank Low PageRank Popular pages are returned at the top More details later... Rich-get-richer problem? Search Engines Considered Harmful Junghoo John Cho 6/45
9 Outline Web popularity-evolution experiment Is rich-get-richer happening? Impact of search engines How much bias do search engines introduce? New ranking metric Can we avoid search-engine bias? Search Engines Considered Harmful Junghoo John Cho 7/45
10 Web Evolution Experiment Collect Web history data Is rich-get-richer happening? From Oct until Oct sites monitored Top sites from each category of Open Directory Pages downloaded every week All pages in each site A total of average 4M pages every week (65GB) Search Engines Considered Harmful Junghoo John Cho 8/45
11 Rich-Get-Richer Problem Construct weekly Web-link graph From the downloaded data Partition pages into 10 groups Based on initial link popularity Top 10% group, 10%-20% group, etc. How many new links to each group after a month? Rich-get-richer More new links to top groups Search Engines Considered Harmful Junghoo John Cho 9/45
12 Result: Simple Link Count Increase in number of in links Popularity After 7 months 70% of new links to top 20% pages No new links to bottom 60% pages Search Engines Considered Harmful Junghoo John Cho 10/45
13 Result: PageRank Increase in PageRank Popularity After 7 months Decrease in PageRank for bottom 50% pages Due to normalization of PageRank Search Engines Considered Harmful Junghoo John Cho 11/45
14 Outline Web popularity-evolution experiment Rich-get-richer is indeed happening Unpopular pages get no attention Impact of search engines How much bias do search engines introduce? New ranking metric Page quality Search Engines Considered Harmful Junghoo John Cho 12/45
15 Outline Web popularity-evolution experiment Rich-get-richer is indeed happening Unpopular pages get no attention Impact of search engines How much bias do search engines introduce? New ranking metric Page quality Search Engines Considered Harmful Junghoo John Cho 12/45
16 Search Engine Impact How much bias do search engines introduce? Search Engines Considered Harmful Junghoo John Cho 13/45
17 Search Engine Impact How much bias do search engines introduce? What we mean by bias? Search Engines Considered Harmful Junghoo John Cho 13/45
18 Search Engine Impact How much bias do search engines introduce? What we mean by bias? What is the ideal ranking? How do search engines rank pages? Search Engines Considered Harmful Junghoo John Cho 13/45
19 What is the Ideal Ranking? What do we mean by page quality? Search Engines Considered Harmful Junghoo John Cho 14/45
20 What is the Ideal Ranking? What do we mean by page quality? Very subjective notion Different quality judgment on the same page Can there be an objective definition? Search Engines Considered Harmful Junghoo John Cho 14/45
21 Page Quality Q(p) Definition The probability that an average Web user will like page p enough to create a link to it if he looks at it Idea: More people will like a higher quality page Democratic measure of quality p 1 : 10,000 people, 8,000 liked it, Q(p 1 ) = 0.8 p 2 : 10,000 people, 2,000 liked it, Q(p 2 ) = 0.2 Q(p 1 ) > Q(p 2 ) Search Engines Considered Harmful Junghoo John Cho 15/45
22 Page Quality Q(p) Cont. In principle, we can measure Q(p) by 1. showing p to all Web users and 2. counting how many people like it When consensus is hard to reach, pick the one that more people like Search Engines Considered Harmful Junghoo John Cho 16/45
23 PageRank: Intuition A page is important if many pages link to it Search Engines Considered Harmful Junghoo John Cho 17/45
24 PageRank: Intuition A page is important if many pages link to it Not every link is equal A link from an important page matters more than others e.g. Link from Yahoo vs Link from a random home page Search Engines Considered Harmful Junghoo John Cho 17/45
25 PageRank: Detail PageRank of p i, P R(p i ): P R(p i ) = [P R(p 1 )/c P R(p m )/c m ] p 1,..., p m : pages with links to p i c j : number of outgoing links from p j Links from high PageRank pages have high weights Damping factor is ignored for simplicity Search Engines Considered Harmful Junghoo John Cho 18/45
26 PageRank: Random-Surfer Model Random-Surfer Model When users follow links randomly, P R(p i ) is the probability to reach p i Search Engines Considered Harmful Junghoo John Cho 19/45
27 PageRank: Random-Surfer Model Random-Surfer Model When users follow links randomly, P R(p i ) is the probability to reach p i P R(p 1 ): probability to be at p 1 p 1 p i Search Engines Considered Harmful Junghoo John Cho 19/45
28 PageRank: Random-Surfer Model Random-Surfer Model When users follow links randomly, P R(p i ) is the probability to reach p i P R(p 1 ): probability to be at p 1 p 1 Q: Probability to go from p 1 to p i? p i Search Engines Considered Harmful Junghoo John Cho 19/45
29 PageRank: Random-Surfer Model Random-Surfer Model When users follow links randomly, P R(p i ) is the probability to reach p i P R(p 1 ): probability to be at p 1 p 1 Q: Probability to go from p 1 to p i? A: P R(p 1 )/3 p i Search Engines Considered Harmful Junghoo John Cho 19/45
30 PageRank: Random-Surfer Model Random-Surfer Model When users follow links randomly, P R(p i ) is the probability to reach p i P R(p 1 ): probability to be at p 1 p 2 p 1 p i Q: Probability to go from p 1 to p i? A: P R(p 1 )/3 Q: Probability to be at p i, P R(p i )? p 3 Search Engines Considered Harmful Junghoo John Cho 19/45
31 PageRank: Random-Surfer Model Random-Surfer Model When users follow links randomly, P R(p i ) is the probability to reach p i P R(p 1 ): probability to be at p 1 p 2 p 3 p 1 p i Q: Probability to go from p 1 to p i? A: P R(p 1 )/3 Q: Probability to be at p i, P R(p i )? A: P R(p 1 )/3 + P R(p 2 ) + P R(p 3 )/2 Search Engines Considered Harmful Junghoo John Cho 19/45
32 Page Quality vs PageRank High PageRank The page is currently popular PageRank Page quality if everyone is given equal chance Before Google, PageRank may have been fair What about now? High PageRank High Quality? Low PageRank Low Quality? Search Engines Considered Harmful Junghoo John Cho 20/45
33 Page Quality vs PageRank High PageRank The page is currently popular PageRank Page quality if everyone is given equal chance Before Google, PageRank may have been fair What about now? High PageRank High Quality? Low PageRank Low Quality? PageRank is biased against new pages How to measure the PageRank bias? Search Engines Considered Harmful Junghoo John Cho 20/45
34 Measuring Search-Engine Bias Ideal experiment: Divide the world into two groups The users who do not use search engines The users who use search engines very heavily Compare popularity evolution Search Engines Considered Harmful Junghoo John Cho 21/45
35 Measuring Search-Engine Bias Ideal experiment: Divide the world into two groups The users who do not use search engines The users who use search engines very heavily Compare popularity evolution Problem: Difficult to conduct in practice Search Engines Considered Harmful Junghoo John Cho 21/45
36 Theoretical Web-User Models Let us do theoretical experiments! Random-surfer model Users follow links randomly Never use search engines Search-dominant model Users always start with a search engine Only visit pages returned by the search engine Compare popularity evolution Search Engines Considered Harmful Junghoo John Cho 22/45
37 Basic Definitions for the Models (Simple) Popularity P(p, t) Fraction of Web users that like p at time t E.g, 100,000 users, 10,000 like p, P(p, t) = 0.1 Visit Popularity V(p, t) Number of users that visit p in a unit time Awareness A(p, t) Fraction of Web users who are aware of p E.g., 100,000 users, 30,000 aware of p, A(p, t) = 0.3 Search Engines Considered Harmful Junghoo John Cho 23/45
38 Basic Definitions for the Models (Simple) Popularity P(p, t) Fraction of Web users that like p at time t E.g, 100,000 users, 10,000 like p, P(p, t) = 0.1 Visit Popularity V(p, t) Number of users that visit p in a unit time Awareness A(p, t) Fraction of Web users who are aware of p E.g., 100,000 users, 30,000 aware of p, A(p, t) = 0.3 P(p, t) = Q(p) A(p, t) Search Engines Considered Harmful Junghoo John Cho 23/45
39 Random-Surfer Model Popularity-Equivalence Hypothesis V(p, t) = r P(p, t) (or V(p, t) P(p, t)) PageRank is visit probability under random-surfer model Higher popularity More visitors Random-Visit Hypothesis A visit is done by any user with equal probability Search Engines Considered Harmful Junghoo John Cho 24/45
40 Random-Surfer Model: Analysis Current popularity P(p, t) Number of visitors from V(p, t) = r P(p, t) Awareness increase A(p, t) Popularity increase P(p, t) New popularity P(p, t + 1) Search Engines Considered Harmful Junghoo John Cho 25/45
41 Random-Surfer Model: Analysis Current popularity P(p, t) Number of visitors from V(p, t) = r P(p, t) Awareness increase A(p, t) Popularity increase P(p, t) New popularity P(p, t + 1) Formal Analysis: Differential Equation [ P(p, t) = 1 e r t ] n 0 P(p,t)dt Q(p) Search Engines Considered Harmful Junghoo John Cho 25/45
42 Random-Surfer Model: Result Theorem The popularity of page p evolves over time through the following formula: P(p, t) = Q(p) 1 + [ Q(p) P(p,0) 1] e [ r n Q(p) ]t Q(p): quality of p P(p, 0): initial popularity of p at time zero n: total number of Web users. r: normalization constant in V(p, t) = r P(p, t) Search Engines Considered Harmful Junghoo John Cho 26/45
43 Random-Surfer Model: Popularity Graph Popularity Infant Expansion Maturity Q(p) = 1, P(p, 0) = 10 8 r, n = 1 Time Search Engines Considered Harmful Junghoo John Cho 27/45
44 Comparison with Google Evolution Audience reach Jan98 Jan99 Jan00 Jan01 Jan02 Jan03 Time Data from Nielsen//NetRatings Q(p) = 0.3, P(p, 0) = r, n = 8 Search Engines Considered Harmful Junghoo John Cho 28/45
45 Search-Dominant Model V(p, t) P(p, t)? Search Engines Considered Harmful Junghoo John Cho 29/45
46 Search-Dominant Model V(p, t) P(p, t)? For ith result, how many clicks? For PageRank P(p, t), what ranking? Search Engines Considered Harmful Junghoo John Cho 29/45
47 Search-Dominant Model V(p, t) P(p, t)? For ith result, how many clicks? For PageRank P(p, t), what ranking? Empirical measurement by Lempel et al. and us Search Engines Considered Harmful Junghoo John Cho 29/45
48 Search-Dominant Model V(p, t) P(p, t)? For ith result, how many clicks? For PageRank P(p, t), what ranking? Empirical measurement by Lempel et al. and us New Visit-Popularity Hypothesis V(p, t) = r P(p, t) 9 4 Search Engines Considered Harmful Junghoo John Cho 29/45
49 Search-Dominant Model V(p, t) P(p, t)? For ith result, how many clicks? For PageRank P(p, t), what ranking? Empirical measurement by Lempel et al. and us New Visit-Popularity Hypothesis V(p, t) = r P(p, t) 9 4 Random-Visit Hypothesis A visit is done by any user with equal probability Search Engines Considered Harmful Junghoo John Cho 29/45
50 Search-Dominant Model: Result Popularity Time [P(p, t)] (i 9 4 ) [P(p, 0)] (i 9 4 ( ) ) i 9 = r t (same parameters as before) 4 Q(p) i n i=1 Search Engines Considered Harmful Junghoo John Cho 30/45
51 Comparison of Two Models Time to final popularity Random surfer: 25 time units Search dominant: 1650 time units 66 times increases! Expansion stage Random surfer: 12 time units Search dominant: non existent Popularity Infant Expansion Maturity Popularity Time Time Search Engines Considered Harmful Junghoo John Cho 31/45
52 Outline Web popularity-evolution experiment Is rich-get-richer happening? Impact of search engines Random-surfer model Search-dominant model New ranking metric How to measure page quality? Search Engines Considered Harmful Junghoo John Cho 32/45
53 Measuring Quality: Basic Idea Quality: probability of link creation by a new visitor Search Engines Considered Harmful Junghoo John Cho 33/45
54 Measuring Quality: Basic Idea Quality: probability of link creation by a new visitor Assuming the same number of visitors Q(p) Number of new links (or popularity increase) Search Engines Considered Harmful Junghoo John Cho 33/45
55 Measuring Quality: Basic Idea Quality: probability of link creation by a new visitor Assuming the same number of visitors Q(p) Number of new links (or popularity increase) Quality Estimator Q(p) = P(p) Search Engines Considered Harmful Junghoo John Cho 33/45
56 Measuring Quality: Problem 1 Different number of visitors to each page More visitors to more popular page How to account for number of visitors? Quality Estimator Q(p) = P(p) Search Engines Considered Harmful Junghoo John Cho 34/45
57 Measuring Quality: Problem 1 Different number of visitors to each page More visitors to more popular page How to account for number of visitors? Idea: PageRank = visit probability Quality Estimator Q(p) = P(p) Search Engines Considered Harmful Junghoo John Cho 34/45
58 Measuring Quality: Problem 1 Different number of visitors to each page More visitors to more popular page How to account for number of visitors? Idea: PageRank = visit probability Quality Estimator Q(p) = P(p)/P(p) Search Engines Considered Harmful Junghoo John Cho 34/45
59 Measuring Quality: Problem 2 No more new links to very popular pages Everyone already knows them P(p)/P(p) 0 for well-known pages How to account for well-known pages? Quality Estimator Q(p) = P(p)/P(p) Search Engines Considered Harmful Junghoo John Cho 35/45
60 Measuring Quality: Problem 2 No more new links to very popular pages Everyone already knows them P(p)/P(p) 0 for well-known pages How to account for well-known pages? Idea: P(p) = Q(p) when everyone knows p Use P(p) to measure Q(p) for well-known pages Quality Estimator Q(p) = P(p)/P(p) Search Engines Considered Harmful Junghoo John Cho 35/45
61 Measuring Quality: Problem 2 No more new links to very popular pages Everyone already knows them P(p)/P(p) 0 for well-known pages How to account for well-known pages? Idea: P(p) = Q(p) when everyone knows p Use P(p) to measure Q(p) for well-known pages Quality C: relative Estimator weight given to popularity increase Q(p) = C P(p)/P(p) + P(p) C: weight given to popularity increase Search Engines Considered Harmful Junghoo John Cho 35/45
62 Measuring Quality: Theoretical Proof Theorem Under the random-surfer model, the quality of page p, Q(p), always satisfies the following equation: ( n Q(p) = r ) ( dp(p, t)/dt P(p, t) ) + P(p, t) Compare it with Q(p) = C P(p) P(p) + P(p) Search Engines Considered Harmful Junghoo John Cho 36/45
63 Is Page Quality Effective? How to measure its effectiveness? Implement it to a major search engine? Any other alternatives? Search Engines Considered Harmful Junghoo John Cho 37/45
64 Is Page Quality Effective? How to measure its effectiveness? Implement it to a major search engine? Any other alternatives? Idea: Pages eventually obtain deserved popularity (however long it may take...) Future PageRank Q(p) Search Engines Considered Harmful Junghoo John Cho 37/45
65 Page Quality: Evaluation (1) Q(p) as a predictor of future PageRank Compare the correlations of current Q(p) with future PageRank current PageRank with future PageRank Q(p) predicts future PageRank better? Search Engines Considered Harmful Junghoo John Cho 38/45
66 Page Quality: Evaluation (1) Q(p) as a predictor of future PageRank Compare the correlations of current Q(p) with future PageRank current PageRank with future PageRank Q(p) predicts future PageRank better? Download the Web multiple times with long intervals 1 month 4 months t 1 t 2 t 3 t 4 Search Engines Considered Harmful Junghoo John Cho 38/45
67 Page Quality: Evaluation (1) Q(p) as a predictor of future PageRank Compare the correlations of current Q(p) with future PageRank current PageRank with future PageRank Q(p) predicts future PageRank better? Download the Web multiple times with long intervals 1 month 4 months t 1 t 2 t 3 t 4 P R(p, t 3 ) P R(p, t 4 )? Search Engines Considered Harmful Junghoo John Cho 38/45
68 Page Quality: Evaluation (1) Q(p) as a predictor of future PageRank Compare the correlations of current Q(p) with future PageRank current PageRank with future PageRank Q(p) predicts future PageRank better? Download the Web multiple times with long intervals 1 month 4 months t 1 t 2 t 3 t 4 Q(p, t 3 ) P R(p, t 4 )? Search Engines Considered Harmful Junghoo John Cho 38/45
69 Page Quality: Evaluation (2) Compare the average relative error P R(p,t 4 ) err(p) = P R(p,t 4) Q(p,t 3 ) P R(p,t 4) P R(p,t 3 ) P R(p,t 4 ) For the pages whose PageRank consistently increased/decreased from t 1 through t 3. Search Engines Considered Harmful Junghoo John Cho 39/45
70 Page Quality: Evaluation (2) Compare the average relative error P R(p,t 4 ) err(p) = Result P R(p,t 4) Q(p,t 3 ) P R(p,t 4) P R(p,t 3 ) P R(p,t 4 ) For Q(p, t 3 ): average err = 0.32 For P R(p, t 3 ): average err = 0.78 Q(p, t 3 ) twice as accurate. For the pages whose PageRank consistently increased/decreased from t 1 through t 3. Search Engines Considered Harmful Junghoo John Cho 39/45
71 Quality Evaluation: More Detail Fraction of pages Q(p) PR(p) err(p) Search Engines Considered Harmful Junghoo John Cho 40/45
72 Summary Web popularity-evolution experiment Rich-get-richer is indeed happening Impact of search engines Random-surfer model Search-dominant model Search engines have worrisome impact New ranking metric Page quality: Based on popularity evolution Identify high-quality pages early on Search Engines Considered Harmful Junghoo John Cho 41/45
73 Thank You For more details, see A. Ntoulas, J. Cho and C. Olston. What s New on the Web? In WWW Conference, J. Cho and S. Roy Impact of Web Search Engines on Page Popularity In WWW Conference, J. Cho and R. Adams. Page Quality: In Search of an Unbiased Web Ranking UCLA CS Department, Nov Any Questions? Search Engines Considered Harmful Junghoo John Cho 42/45
74 Popularity Increase: Relative Link Count Relative increase in number of in inks Popularity Search Engines Considered Harmful Junghoo John Cho 43/45
75 Popularity Increase: Relative PageRank Relative increase in PageRank Popularity Search Engines Considered Harmful Junghoo John Cho 44/45
76 Search-Dominant Model: Result Popularity Time Search Engines Considered Harmful Junghoo John Cho 45/45
Search Engines Considered Harmful In Search of an Unbiased Web Ranking
Search Engines Considered Harmful In Search of an Unbiased Web Ranking Junghoo John Cho cho@cs.ucla.edu UCLA Search Engines Considered Harmful Junghoo John Cho 1/38 Motivation If you are not indexed by
Impact of Search Engines on Page Popularity
Impact of Search Engines on Page Popularity Junghoo John Cho (cho@cs.ucla.edu) Sourashis Roy (roys@cs.ucla.edu) University of California, Los Angeles Impact of Search Engines on Page Popularity J. Cho,
Impact of Search Engines on Page Popularity
Introduction October 10, 2007 Outline Introduction Introduction 1 Introduction Introduction 2 Number of incoming links 3 Random-surfer model Case study 4 Search-dominant model 5 Summary and conclusion
Effective Page Refresh Policies for Web Crawlers
For CS561 Web Data Management Spring 2013 University of Crete Effective Page Refresh Policies for Web Crawlers and a Semantic Web Document Ranking Model Roger-Alekos Berkley IMSE 2012/2014 Paper 1: Main
Promotional Ranking of Search Engine Results: Giving New Web Pages a Chance to Prove Their Values
Promotional Ranking of Search Engine Results: Giving New Web Pages a Chance to Prove Their Values Yizhen Zhu 1, Mingda Wu 1, Yan Zhang 1,, and Xiaoming Li 2 1 National Laboratory on Machine Perception,
Mathematical Analysis of Google PageRank
INRIA Sophia Antipolis, France Ranking Answers to User Query Ranking Answers to User Query How a search engine should sort the retrieved answers? Possible solutions: (a) use the frequency of the searched
Recent Researches in Ranking Bias of Modern Search Engines
DEWS2007 C7-7 Web,, 169 8050 1 104 169 8555 3 4 1 101 8430 2 1 2 E-mail: {hirate,yoshida,yamana}@yama.info.waseda.ac.jp Web Web Web Recent Researches in Ranking Bias of Modern Search Engines Yu HIRATE,,
RankMass Crawler: A Crawler with High Personalized PageRank Coverage Guarantee
Crawler: A Crawler with High Personalized PageRank Coverage Guarantee Junghoo Cho University of California Los Angeles 4732 Boelter Hall Los Angeles, CA 90095 cho@cs.ucla.edu Uri Schonfeld University of
Time-aware Authority Ranking
Klaus Berberich 1 Michalis Vazirgiannis 1,2 Gerhard Weikum 1 1 Max Planck Institute for Informatics {kberberi, mvazirgi, weikum}@mpi-inf.mpg.de 2 Athens University of Economics & Business {mvazirg}@aueb.gr
How to Crawl the Web. Hector Garcia-Molina Stanford University. Joint work with Junghoo Cho
How to Crawl the Web Hector Garcia-Molina Stanford University Joint work with Junghoo Cho Stanford InterLib Technologies Information Overload Service Heterogeneity Interoperability Economic Concerns Information
Information Retrieval (IR) Introduction to Information Retrieval. Lecture Overview. Why do we need IR? Basics of an IR system.
Introduction to Information Retrieval Ethan Phelps-Goodman Some slides taken from http://www.cs.utexas.edu/users/mooney/ir-course/ Information Retrieval (IR) The indexing and retrieval of textual documents.
Brief (non-technical) history
Web Data Management Part 2 Advanced Topics in Database Management (INFSCI 2711) Textbooks: Database System Concepts - 2010 Introduction to Information Retrieval - 2008 Vladimir Zadorozhny, DINS, SCI, University
Breadth-First Search Crawling Yields High-Quality Pages
Breadth-First Search Crawling Yields High-Quality Pages Marc Najork Compaq Systems Research Center 13 Lytton Avenue Palo Alto, CA 9431, USA marc.najork@compaq.com Janet L. Wiener Compaq Systems Research
Link Analysis and Web Search
Link Analysis and Web Search Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna http://www.moreno.marzolla.name/ based on material by prof. Bing Liu http://www.cs.uic.edu/~liub/webminingbook.html
CS224W: 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 the Web? First try: Human curated Web directories Yahoo, DMOZ, LookSmart Second
Scalable Web Programming. CS193S - Jan Jannink - 2/16/10
Scalable Web Programming CS193S - Jan Jannink - 2/16/10 Administrative Stuff Submit a running website on Thursday some functionality can still be simple some placeholders acceptable Some tests required
Distributed Data Store
Distributed Data Store Large-Scale Distributed le system Q: What if we have too much data to store in a single machine? Q: How can we create one big filesystem over a cluster of machines, whose data is
Automatic Identification of User Interest For Personalized Search
Automatic Identification of User Interest For Personalized Search Feng Qiu University of California Los Angeles, CA 90095 fqiu@cs.ucla.edu Junghoo Cho University of California Los Angeles, CA 90095 cho@cs.ucla.edu
Contractors Guide to Search Engine Optimization
Contractors Guide to Search Engine Optimization CONTENTS What is Search Engine Optimization (SEO)? Why Do Businesses Need SEO (If They Want To Generate Business Online)? Which Search Engines Should You
Part 1: Link Analysis & Page Rank
Chapter 8: Graph Data Part 1: Link Analysis & Page Rank Based on Leskovec, Rajaraman, Ullman 214: Mining of Massive Datasets 1 Graph Data: Social Networks [Source: 4-degrees of separation, Backstrom-Boldi-Rosa-Ugander-Vigna,
A STUDY ON THE EVOLUTION OF THE WEB
A STUDY ON THE EVOLUTION OF THE WEB Alexandros Ntoulas, Junghoo Cho, Hyun Kyu Cho 2, Hyeonsung Cho 2, and Young-Jo Cho 2 Summary We seek to gain improved insight into how Web search engines should cope
arxiv:cs/ v1 [cs.ir] 4 Mar 2005
![arxiv:cs/ v1 [cs.ir] 4 Mar 2005](/thumbs/76/73196462.jpg "arxiv:cs/ v1 [cs.ir] 4 Mar 2005")
arxiv:cs/0503011v1 [cs.ir] 4 Mar 2005 Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results Sandeep Pandey Sourashis Roy Christopher Olston Carnegie Mellon University
Agenda. Math Google PageRank algorithm. 2 Developing a formula for ranking web pages. 3 Interpretation. 4 Computing the score of each page
Agenda Math 104 1 Google PageRank algorithm 2 Developing a formula for ranking web pages 3 Interpretation 4 Computing the score of each page Google: background Mid nineties: many search engines often times
Lecture 8: Linkage algorithms and web search
Lecture 8: Linkage algorithms and web search Information Retrieval Computer Science Tripos Part II Ronan Cummins 1 Natural Language and Information Processing (NLIP) Group ronan.cummins@cl.cam.ac.uk 2017
World Wide Web has specific challenges and opportunities
6. Web Search Motivation Web search, as offered by commercial search engines such as Google, Bing, and DuckDuckGo, is arguably one of the most popular applications of IR methods today World Wide Web has
Introduction to Information Retrieval
Introduction to Information Retrieval http://informationretrieval.org IIR 21: Link Analysis Hinrich Schütze Center for Information and Language Processing, University of Munich 2014-06-18 1/80 Overview
Some Interesting Applications of Theory. PageRank Minhashing Locality-Sensitive Hashing
Some Interesting Applications of Theory PageRank Minhashing Locality-Sensitive Hashing 1 PageRank The thing that makes Google work. Intuition: solve the recursive equation: a page is important if important
Myths about Links, Links and More Links:
Myths about Links, Links and More Links: CedarValleyGroup.com Myth 1: You have to pay to be submitted to Google search engine. Well let me explode that one myth. When your website is first launched Google
Proximity Prestige using Incremental Iteration in Page Rank Algorithm
Indian Journal of Science and Technology, Vol 9(48), DOI: 10.17485/ijst/2016/v9i48/107962, December 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Proximity Prestige using Incremental Iteration
Nearest Neighbor Classification
Nearest Neighbor Classification Professor Ameet Talwalkar Professor Ameet Talwalkar CS260 Machine Learning Algorithms January 11, 2017 1 / 48 Outline 1 Administration 2 First learning algorithm: Nearest
Automatic Identification of User Goals in Web Search [WWW 05]
![Automatic Identification of User Goals in Web Search [WWW 05]](/thumbs/87/96071045.jpg "Automatic Identification of User Goals in Web Search [WWW 05]")
Automatic Identification of User Goals in Web Search [WWW 05] UichinLee @ UCLA ZhenyuLiu @ UCLA JunghooCho @ UCLA Presenter: Emiran Curtmola@ UC San Diego CSE 291 4/29/2008 Need to improve the quality
Learn SEO Copywriting
This is video 1.1 in the online course: Learn SEO Copywriting Module 1: An introduction to SEO copywriting What we ll cover in this session What is SEO? What is SEO copywriting? How does Google work Factors
Administrative. Web crawlers. Web Crawlers and Link Analysis!
Web Crawlers and Link Analysis! David Kauchak cs458 Fall 2011 adapted from: http://www.stanford.edu/class/cs276/handouts/lecture15-linkanalysis.ppt http://webcourse.cs.technion.ac.il/236522/spring2007/ho/wcfiles/tutorial05.ppt
Media Pack. Home About User Benefits Advertiser Benefits Advertising Packages
Media Pack About Hotfrog One of Australia s largest online business directories Launched in May 2005 with the purpose to generate targeted sales leads for businesses Owned by the global Reed Elsevier publishing
Delay Injection for. Service Dependency Detection
Delay Injection for Service Dependency Detection Richard A. Kemmerer Computer Security Group Department of Computer Science University of California, Santa Barbara http://seclab.cs.ucsb.edu ARO/MURI Meeting
Empirical risk minimization (ERM) A first model of learning. The excess risk. Getting a uniform guarantee
A first model of learning Let s restrict our attention to binary classification our labels belong to (or ) Empirical risk minimization (ERM) Recall the definitions of risk/empirical risk We observe the
5 Choosing keywords Initially choosing keywords Frequent and rare keywords Evaluating the competition rates of search
Seo tutorial Seo tutorial Introduction to seo... 4 1. General seo information... 5 1.1 History of search engines... 5 1.2 Common search engine principles... 6 2. Internal ranking factors... 8 2.1 Web page
Downloading Hidden Web Content
Downloading Hidden Web Content Alexandros Ntoulas Petros Zerfos Junghoo Cho UCLA Computer Science {ntoulas, pzerfos, cho}@cs.ucla.edu Abstract An ever-increasing amount of information on the Web today
Graph and Link Mining
Graph and Link Mining Graphs - Basics A graph is a powerful abstraction for modeling entities and their pairwise relationships. G = (V,E) Set of nodes V = v,, v 5 Set of edges E = { v, v 2, v 4, v 5 }
Parallel Crawlers. Junghoo Cho University of California, Los Angeles. Hector Garcia-Molina Stanford University.
Parallel Crawlers Junghoo Cho University of California, Los Angeles cho@cs.ucla.edu Hector Garcia-Molina Stanford University cho@cs.stanford.edu ABSTRACT In this paper we study how we can design an effective
Personalized Information Retrieval
Personalized Information Retrieval Shihn Yuarn Chen Traditional Information Retrieval Content based approaches Statistical and natural language techniques Results that contain a specific set of words or
What is SEO? How to improve search engines ranking (SEO)? Keywords Domain name Page URL address
What is SEO? How to improve search engines ranking (SEO)? Keywords Domain name Page URL address Title and description tags Web page title tag Page description Principal title page (h1) Alternative texts
Below, we will walk through the three main elements of the algorithm, which include Domain Attributes, On-Page and Off-Page factors.
Search engine optimization is the active practicing of improving your websites ability to rank in the natural search engine results. Each of the major search engines have a proprietary algorithm that makes
A Survey of Google's PageRank
http://pr.efactory.de/ A Survey of Google's PageRank Within the past few years, Google has become the far most utilized search engine worldwide. A decisive factor therefore was, besides high performance
Lecture on Modeling Tools for Clustering & Regression
Lecture on Modeling Tools for Clustering & Regression CS 590.21 Analysis and Modeling of Brain Networks Department of Computer Science University of Crete Data Clustering Overview Organizing data into
CS224W: Social and Information Network Analysis Project Report: Edge Detection in Review Networks
CS224W: Social and Information Network Analysis Project Report: Edge Detection in Review Networks Archana Sulebele, Usha Prabhu, William Yang (Group 29) Keywords: Link Prediction, Review Networks, Adamic/Adar,
Page rank computation HPC course project a.y Compute efficient and scalable Pagerank
Page rank computation HPC course project a.y. 2012-13 Compute efficient and scalable Pagerank 1 PageRank PageRank is a link analysis algorithm, named after Brin & Page [1], and used by the Google Internet
Link Analysis. CSE 454 Advanced Internet Systems University of Washington. 1/26/12 16:36 1 Copyright D.S.Weld
Link Analysis CSE 454 Advanced Internet Systems University of Washington 1/26/12 16:36 1 Ranking Search Results TF / IDF or BM25 Tag Information Title, headers Font Size / Capitalization Anchor Text on
MAXIMIZING ROI FROM AKAMAI ION USING BLUE TRIANGLE TECHNOLOGIES FOR NEW AND EXISTING ECOMMERCE CUSTOMERS CONSIDERING ION CONTENTS EXECUTIVE SUMMARY... THE CUSTOMER SITUATION... HOW BLUE TRIANGLE IS UTILIZED
Parallel Crawlers. 1 Introduction. Junghoo Cho, Hector Garcia-Molina Stanford University {cho,
Parallel Crawlers Junghoo Cho, Hector Garcia-Molina Stanford University {cho, hector}@cs.stanford.edu Abstract In this paper we study how we can design an effective parallel crawler. As the size of the
Downloading Textual Hidden Web Content Through Keyword Queries
Downloading Textual Hidden Web Content Through Keyword Queries Alexandros Ntoulas UCLA Computer Science ntoulas@cs.ucla.edu Petros Zerfos UCLA Computer Science pzerfos@cs.ucla.edu Junghoo Cho UCLA Computer
SEO & GOOGLE ANALYTICS
SEO & GOOGLE ANALYTICS SUMMARY OVERVIEW By Rebecca L. Cooney, MSC Clinical Assistant Professor Washington State University SEARCH ENGINE OPTIMIZATION SEO PROCESS SEO influences popularity and relevance
RCA Business & Technical Conference
RCA Business & Technical Conference Website Marketing for Customer Gain and Retention ti Oct. 14, 2010 Agenda Sources of Website Traffic How to Generate More Site Traffic How to Keep More Visitors On Site
CCP: Conflicts Check Protocol for Bitcoin Block Security 1
CCP: Conflicts Check Protocol for Bitcoin Block Security Chen Yang Peking University, China yc900@pku.edu.cn Abstract In this work, we present our early stage results on a Conflicts Check Protocol (CCP)
Search Engine Optimization Miniseries: Rich Website, Poor Website - A Website Visibility Battle of Epic Proportions
Search Engine Optimization Miniseries: Rich Website, Poor Website - A Website Visibility Battle of Epic Proportions Part Two: Tracking Website Performance July 1, 2007 By Bill Schwartz EBIZ Machine 1115
EXTRACTION OF RELEVANT WEB PAGES USING DATA MINING
Chapter 3 EXTRACTION OF RELEVANT WEB PAGES USING DATA MINING 3.1 INTRODUCTION Generally web pages are retrieved with the help of search engines which deploy crawlers for downloading purpose. Given a query,
The NEW Rules of SEO
The NEW Rules of SEO About DealerOn DrivingSales Top Rated Website Provider, 2011-2017 Only provider to have won the last 7 Years In A Row! 2X Digital Dealer Website Excellence Award Winner DrivingSales
Comparative Analysis of Clicks and Judgments for IR Evaluation
Comparative Analysis of Clicks and Judgments for IR Evaluation Jaap Kamps 1,3 Marijn Koolen 1 Andrew Trotman 2,3 1 University of Amsterdam, The Netherlands 2 University of Otago, New Zealand 3 INitiative
CS144: Sessions. Cookie : CS144: Web Applications
CS144: Sessions HTTP is a stateless protocol. The server s response is purely based on the single request, not anything else Q: How does a web site like Amazon can remember a user and customize its results?
Motivation. Motivation
COMS11 Motivation PageRank Department of Computer Science, University of Bristol Bristol, UK 1 November 1 The World-Wide Web was invented by Tim Berners-Lee circa 1991. By the late 199s, the amount of
Knowing something about how to create this optimization to harness the best benefits will definitely be advantageous.
Blog Post Optimizer Contents Intro... 3 Page Rank Basics... 3 Using Articles And Blog Posts... 4 Using Backlinks... 4 Using Directories... 5 Using Social Media And Site Maps... 6 The Downfall Of Not Using
UNIT-V WEB MINING. 3/18/2012 Prof. Asha Ambhaikar, RCET Bhilai.
UNIT-V WEB MINING 1 Mining the World-Wide Web 2 What is Web Mining? Discovering useful information from the World-Wide Web and its usage patterns. 3 Web search engines Index-based: search the Web, index
CS 6604: Data Mining Large Networks and Time-Series
CS 6604: Data Mining Large Networks and Time-Series Soumya Vundekode Lecture #12: Centrality Metrics Prof. B Aditya Prakash Agenda Link Analysis and Web Search Searching the Web: The Problem of Ranking
The Evolution of Web Content and Search Engines
The Evolution of Web Content and Search Engines Ricardo Baeza-Yates Yahoo! Research Barcelona, Spain & Santiago, Chile ricardo@baeza.cl Álvaro Pereira Jr Dept. of Computer Science Federal Univ. of Minas
PageRank & the Random Surfer Model
PageRank & the Random Surfer pg 1 of 4 PageRank & the Random Surfer Model This activity explores how a simulation of randomly surfing the web can be used to rank web search results. I. Pages and Links
Lecture 1: Perfect Security
CS 290G (Fall 2014) Introduction to Cryptography Oct 2nd, 2014 Instructor: Rachel Lin 1 Recap Lecture 1: Perfect Security Scribe: John Retterer-Moore Last class, we introduced modern cryptography and gave
Lecture #3: PageRank Algorithm The Mathematics of Google Search
Lecture #3: PageRank Algorithm The Mathematics of Google Search We live in a computer era. Internet is part of our everyday lives and information is only a click away. Just open your favorite search engine,
CS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam. Sample Solutions
CS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam Sample Solutions Question 1: Cardinality How many distinct elements does the set S contain in each case? Check the appropriate
PageRank for Product Image Search. Research Paper By: Shumeet Baluja, Yushi Jing
PageRank for Product Image Search Research Paper By: Shumeet Baluja, Yushi Jing Topics Motivation What is PageRank? ImageRank Algorithm Features generation & Similarity measure Concept of Centrality PageRank
Application of PageRank Algorithm on Sorting Problem Su weijun1, a
International Conference on Mechanics, Materials and Structural Engineering (ICMMSE ) Application of PageRank Algorithm on Sorting Problem Su weijun, a Department of mathematics, Gansu normal university
Truth, Lies, and Random Bits
Truth, Lies, and Random Bits Jared Saia University of New Mexico, Albuquerque, NM, USA January, 2015 The Searchers, 1956 Westerns Wide-open spaces Epic struggles Borrow from many sources Westerns
Data Science Center Eindhoven. The Mathematics Behind Big Data. Alessandro Di Bucchianico
Data Science Center Eindhoven The Mathematics Behind Big Data Alessandro Di Bucchianico 4TU AMI SRO Big Data Meeting Big Data: Mathematics in Action! November 24, 2017 Outline Big Data Some real-life examples
A novel approach of web search based on community wisdom
University of Wollongong Research Online Faculty of Engineering - Papers (Archive) Faculty of Engineering and Information Sciences 2008 A novel approach of web search based on community wisdom Weiliang
Introduction to Data Mining
Introduction to Data Mining Lecture #10: Link Analysis-2 Seoul National University 1 In This Lecture Pagerank: Google formulation Make the solution to converge Computing Pagerank for very large graphs
Evolutionary origins of modularity
Evolutionary origins of modularity Jeff Clune, Jean-Baptiste Mouret and Hod Lipson Proceedings of the Royal Society B 2013 Presented by Raghav Partha Evolvability Evolvability capacity to rapidly adapt
SEO basics. Chris
SEO basics Chris Snider @chrissnider Who invented the toilet? How would we find out? What if you needed a plumber to fix that toilet? How would you find one? Then what? Search engine optimization (SEO)
Exploring both Content and Link Quality for Anti-Spamming
Exploring both Content and Link Quality for Anti-Spamming Lei Zhang, Yi Zhang, Yan Zhang National Laboratory on Machine Perception Peking University 100871 Beijing, China zhangl, zhangyi, zhy @cis.pku.edu.cn
MAP4C_C Per 1 WEEK 2 Thursday Sept Lesson - Learning Excel LG: I know how to use an Excel spreadsheet.
MAP4C_C Per 1 WEEK 1 Tuesday Sept 2 2014 Lesson - Intro/Census Unit 1-1 Var Stats BIG IDEAS: 1) STATISTICS AND SURVEYS ARE IMPORTANT TOOLS FOR ANALYZING THE WORLD AROUND US. 2) STATISTICS AND SURVEYS CAN
by Jimmy's Value World Ashish H Thakkar
RSS Solution Package by Jimmy's Value World Ashish H Thakkar http://jvw.name/ 1)RSS Feeds info. 2)What, Where and How for RSS feeds. 3)Tools from Jvw. 4)I need more tools. 5)I have a question. 1)RSS Feeds
Metrics and OO. SE 3S03 - Tutorial 12. Alicia Marinache. Week of Apr 04, Department of Computer Science McMaster University
and OO OO and OO SE 3S03 - Tutorial 12 Department of Computer Science McMaster University Complexity Lorenz CK Week of Apr 04, 2016 Acknowledgments: The material of these slides is based on [1] (chapter
Lecture Notes to Big Data Management and Analytics Winter Term 2017/2018 Node Importance and Neighborhoods
Lecture Notes to Big Data Management and Analytics Winter Term 2017/2018 Node Importance and Neighborhoods Matthias Schubert, Matthias Renz, Felix Borutta, Evgeniy Faerman, Christian Frey, Klaus Arthur
CS249: SPECIAL TOPICS MINING INFORMATION/SOCIAL NETWORKS
CS249: SPECIAL TOPICS MINING INFORMATION/SOCIAL NETWORKS Overview of Networks Instructor: Yizhou Sun yzsun@cs.ucla.edu January 10, 2017 Overview of Information Network Analysis Network Representation Network
Roadmap. Roadmap. Ranking Web Pages. PageRank. Roadmap. Random Walks in Ranking Query Results in Semistructured Databases
Roadmap Random Walks in Ranking Query in Vagelis Hristidis Roadmap Ranking Web Pages Rank according to Relevance of page to query Quality of page Roadmap PageRank Stanford project Lawrence Page, Sergey
1 GOOGLE NOW ALLOWS EDITING BUSINESS LISTINGS
1 GOOGLE NOW ALLOWS EDITING BUSINESS LISTINGS DIRECTLY FROM THE SEARCH RESULTS If you area verified business in Google My Business, you can now update your business info directly from Google search engine
Information Networks: PageRank
Information Networks: PageRank Web Science (VU) (706.716) Elisabeth Lex ISDS, TU Graz June 18, 2018 Elisabeth Lex (ISDS, TU Graz) Links June 18, 2018 1 / 38 Repetition Information Networks Shape of the
Model Selection and Assessment
Model Selection and Assessment CS4780/5780 Machine Learning Fall 2014 Thorsten Joachims Cornell University Reading: Mitchell Chapter 5 Dietterich, T. G., (1998). Approximate Statistical Tests for Comparing
Information Search in Web Archives
Information Search in Web Archives Miguel Costa Advisor: Prof. Mário J. Silva Co-Advisor: Prof. Francisco Couto Department of Informatics, Faculty of Sciences, University of Lisbon PhD thesis defense,
Algorithms, Games, and Networks February 21, Lecture 12
Algorithms, Games, and Networks February, 03 Lecturer: Ariel Procaccia Lecture Scribe: Sercan Yıldız Overview In this lecture, we introduce the axiomatic approach to social choice theory. In particular,
CS6200 Information Retreival. The WebGraph. July 13, 2015
CS6200 Information Retreival The WebGraph The WebGraph July 13, 2015 1 Web Graph: pages and links The WebGraph describes the directed links between pages of the World Wide Web. A directed edge connects
From Correlation to Causation: Active Delay Injection for Service Dependency Detection
From Correlation to Causation: Active Delay Injection for Service Dependency Detection Christopher Kruegel Computer Security Group ARO MURI Meeting ICSI, Berkeley, November 15, 2012 Correlation Engine
Secure Multiparty Computation
Secure Multiparty Computation Li Xiong CS573 Data Privacy and Security Outline Secure multiparty computation Problem and security definitions Basic cryptographic tools and general constructions Yao s Millionnare
Predicting Vulnerable Software Components
Predicting Vulnerable Software Components Stephan Neuhaus, et. al. 10/29/2008 Stuart A Jaskowiak, CSC 682 1 What's in the paper? Introduction Scope of this Work Components and Vulnerabilities Imports and
Search Engines Chapter 8 Evaluating Search Engines Felix Naumann
Search Engines Chapter 8 Evaluating Search Engines 9.7.2009 Felix Naumann Evaluation 2 Evaluation is key to building effective and efficient search engines. Drives advancement of search engines When intuition
Evaluation Metrics. (Classifiers) CS229 Section Anand Avati
Evaluation Metrics (Classifiers) CS Section Anand Avati Topics Why? Binary classifiers Metrics Rank view Thresholding Confusion Matrix Point metrics: Accuracy, Precision, Recall / Sensitivity, Specificity,
3. EXCEL FORMULAS & TABLES
Winter 2019 CS130 - Excel Formulas & Tables 1 3. EXCEL FORMULAS & TABLES Winter 2019 Winter 2019 CS130 - Excel Formulas & Tables 2 Cell References Absolute reference - refer to cells by their fixed position.
The Evolution of the Web and Implications for an Incremental Crawler
The Evolution of the Web and Implications for an Incremental Crawler Junghoo Cho, Hector Garcia-Molina Department of Computer Science Stanford, CA 94305 {cho, hector}@cs.stanford.edu December 2, 1999 Abstract
A New Empirical Analysis Technique for Shale Reservoirs
A New Empirical Analysis Technique for Shale Reservoirs HE Zhang, P.E., Ph.D. An Engineer at Ryder Scott Company SPEE Meeting of Houston Chapter October 5, 2016 Disclaimer The following presentation does
Hyperplane Ranking in. Simple Genetic Algorithms. D. Whitley, K. Mathias, and L. Pyeatt. Department of Computer Science. Colorado State University
Hyperplane Ranking in Simple Genetic Algorithms D. Whitley, K. Mathias, and L. yeatt Department of Computer Science Colorado State University Fort Collins, Colorado 8523 USA whitley,mathiask,pyeatt@cs.colostate.edu
Author(s): Rahul Sami, 2009
Author(s): Rahul Sami, 2009 License: Unless otherwise noted, this material is made available under the terms of the Creative Commons Attribution Noncommercial Share Alike 3.0 License: http://creativecommons.org/licenses/by-nc-sa/3.0/
google SEO UpdatE the RiSE Of NOt provided and hummingbird october 2013
google SEO Update The Rise of Not Provided and Hummingbird October 2013 Lead contributors David Freeman Head of SEO Havas Media UK david.freeman@havasmedia.com Winston Burton VP, Director of SEO Havas