Search Engines Considered Harmful In Search of an Unbiased Web Ranking
|
|
|
- Amelia Goodman
- 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/38
2 Motivation If you are not indexed by Google, you do not exist on the Web News.com article, 10/23/2002 People discover pages through search engines Top results: many users Bottom results: no new users Are we biased by search engines? Search Engines Considered Harmful Junghoo John Cho 2/38
3 Outline Are the rich getting richer? Web popularity-evolution experiment How much bias do search engines introduce? Impact of search engines Can we avoid search-engine bias? New ranking metric Search Engines Considered Harmful Junghoo John Cho 3/38
4 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 4/38
5 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 5/38
6 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 6/38
7 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 7/38
8 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 8/38
9 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 8/38
10 Search Engine Bias What we mean by bias? Search Engines Considered Harmful Junghoo John Cho 9/38
11 Search Engine Bias What we mean by bias? What is the ideal ranking? How do search engines rank pages? Search Engines Considered Harmful Junghoo John Cho 9/38
12 What is the Ideal Ranking? Rank by intrinsic quality of a page? Search Engines Considered Harmful Junghoo John Cho 10/38
13 What is the Ideal Ranking? Rank by intrinsic quality of a page? Very subjective notion Different quality judgment on the same page Can there be an objective definition? Search Engines Considered Harmful Junghoo John Cho 10/38
14 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 Search Engines Considered Harmful Junghoo John Cho 11/38
15 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 In principle, we can measure Q(p) by 1. showing p to all Web users and 2. counting how many people like it 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 Search Engines Considered Harmful Junghoo John Cho 11/38
16 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 In principle, we can measure Q(p) by 1. showing p to all Web users and 2. counting how many people like it 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 Democratic measure of quality When consensus is hard to reach, pick the one that more people like Search Engines Considered Harmful Junghoo John Cho 11/38
17 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 P R(p i ) = (1 d) + d [P R(p 1 )/c P R(p m )/c m ] 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 12/38
18 Page Quality vs PageRank PageRank Page quality if everyone is given equal chance High PageRank high quality To obtain high PageRank, many people should look at the page and like it. Low PageRank low quality? PageRank is biased against new pages How much bias for low PageRank pages? Search Engines Considered Harmful Junghoo John Cho 13/38
19 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 14/38
20 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 14/38
21 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 15/38
22 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 16/38
23 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 16/38
24 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 17/38
25 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 18/38
26 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 18/38
27 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 19/38
28 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 20/38
29 Search-Dominant Model V(p, t) P(p, t)? Search Engines Considered Harmful Junghoo John Cho 21/38
30 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 21/38
31 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 21/38
32 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 21/38
33 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 21/38
34 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 22/38
35 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 23/38
36 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 24/38
37 Measuring Quality: Basic Idea Quality: probability of link creation by a new visitor Search Engines Considered Harmful Junghoo John Cho 25/38
38 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 25/38
39 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 25/38
40 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 26/38
41 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 26/38
42 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 26/38
43 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 27/38
44 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 27/38
45 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 27/38
46 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 28/38
47 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 29/38
48 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 29/38
49 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 30/38
50 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 30/38
51 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 30/38
52 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 30/38
53 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 31/38
54 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 31/38
55 Quality Evaluation: More Detail Fraction of pages Q(p) PR(p) err(p) Search Engines Considered Harmful Junghoo John Cho 32/38
56 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 Search Engines Considered Harmful Junghoo John Cho 33/38
57 Page Quality Improved version of PageRank Accounts for different levels of exposure Third-generation ranking principle 1 st : Term frequency 2 nd : Link structure 3 rd : Link evolution Potential to reduce Web inequality Identify high-quality pages early on Search Engines Considered Harmful Junghoo John Cho 34/38
58 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 35/38
59 Popularity Increase: Relative Link Count Relative increase in number of in inks Popularity Search Engines Considered Harmful Junghoo John Cho 36/38
60 Popularity Increase: Relative PageRank Relative increase in PageRank Popularity Search Engines Considered Harmful Junghoo John Cho 37/38
61 Search-Dominant Model: Result Popularity Time Search Engines Considered Harmful Junghoo John Cho 38/38
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/45 World-Wide Web 10 years ago With Web
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
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,
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
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,,
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
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
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
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
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
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
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
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
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
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,
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
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
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
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
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
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,
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
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
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
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
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
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
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
Document version Cohorts
Document version 1.1 2018 Cohorts Table of contents 1 Cohorts overview 2 Date of first visit 2.1 Predefined analyses 2.2 Daily and weekly cohorts 2.3 Filtering cohorts 2.4 Use Cases 3 Time since first
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
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
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
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
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,
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
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
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,
Let be a function. We say, is a plane curve given by the. Let a curve be given by function where is differentiable with continuous.
Module 8 : Applications of Integration - II Lecture 22 : Arc Length of a Plane Curve [Section 221] Objectives In this section you will learn the following : How to find the length of a plane curve 221
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
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
Are people biased in their use of search engines? Keane, Mark T.; O'Brien, Maeve; Smyth, Barry. Communications of the ACM, 51 (2): 49-52
Provided by the author(s) and University College Dublin Library in accordance with publisher policies. Please cite the published version when available. Title Are people biased in their use of search engines?
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.
CPSC 340: Machine Learning and Data Mining
CPSC 340: Machine Learning and Data Mining Fundamentals of learning (continued) and the k-nearest neighbours classifier Original version of these slides by Mark Schmidt, with modifications by Mike Gelbart.
A Probabilistic Approach to Metasearching with Adaptive Probing
A Probabilistic Approach to Metasearching with Adaptive Probing Zhenyu Liu, Chang Luo, Junghoo Cho, Wesley W. Chu Computer Science Department University of California, Los Angeles, CA 995 {vicliu, lc,
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
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
FUNCTIONS, ALGEBRA, & DATA ANALYSIS CURRICULUM GUIDE Overview and Scope & Sequence
FUNCTIONS, ALGEBRA, & DATA ANALYSIS CURRICULUM GUIDE Overview and Scope & Sequence Loudoun County Public Schools 2017-2018 (Additional curriculum information and resources for teachers can be accessed
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
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
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
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
Multiple Pivot Sort Algorithm is Faster than Quick Sort Algorithms: An Empirical Study
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol: 11 No: 03 14 Multiple Algorithm is Faster than Quick Sort Algorithms: An Empirical Study Salman Faiz Solehria 1, Sultanullah Jadoon
8 th Grade Pre Algebra Pacing Guide 1 st Nine Weeks
8 th Grade Pre Algebra Pacing Guide 1 st Nine Weeks MS Objective CCSS Standard I Can Statements Included in MS Framework + Included in Phase 1 infusion Included in Phase 2 infusion 1a. Define, classify,
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
Big picture. Definitions. Internal sorting. Exchange sorts. Insertion sort Bubble sort Selection sort Comparison. Comp Sci 1575 Data Structures
Internal sorting Comp Sci 1575 Data Structures Admin notes Advising appointments will eclipse office hours this week, so no guarantees about availability during normal times. With 130 appointments at 15
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
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
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
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
Genealogical Trees on the Web: A Search Engine User Perspective
Genealogical Trees on the Web: A Search Engine User Perspective Ricardo Baeza-Yates Yahoo! Research Ocata 1 Barcelona, Spain rbaeza@acm.org Álvaro Pereira Federal Univ. of Minas Gerais Dept. of Computer
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
The PageRank Citation Ranking: Bringing Order to the Web
The PageRank Citation Ranking: Bringing Order to the Web Marlon Dias msdias@dcc.ufmg.br Information Retrieval DCC/UFMG - 2017 Introduction Paper: The PageRank Citation Ranking: Bringing Order to the Web,
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
CS 526 Advanced Topics in Compiler Construction. 1 of 12
CS 526 Advanced Topics in Compiler Construction 1 of 12 Course Organization Instructor: David Padua 3-4223 padua@uiuc.edu Office hours: By appointment Course material: Website Textbook: Randy Allen and
Predict Topic Trend in Blogosphere
Predict Topic Trend in Blogosphere Jack Guo 05596882 jackguo@stanford.edu Abstract Graphical relationship among web pages has been used to rank their relative importance. In this paper, we introduce a
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
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,
Pruning Policies for Two-Tiered Inverted Index with Correctness Guarantee
Pruning Policies for Two-Tiered Inverted Index with Correctness Guarantee Alexandros Ntoulas Microsoft Search Labs 65 La Avenida Mountain View, CA 9443, USA antoulas@microsoft.com Junghoo Cho UCLA Computer
Cost-Effective Conceptual Design. over Taxonomies. Yodsawalai Chodpathumwan. University of Illinois at Urbana-Champaign.
Cost-Effective Conceptual Design over Taxonomies Yodsawalai Chodpathumwan University of Illinois at Urbana-Champaign Ali Vakilian Massachusetts Institute of Technology Arash Termehchy, Amir Nayyeri Oregon
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/
Computational Methods. Randomness and Monte Carlo Methods
Computational Methods Randomness and Monte Carlo Methods Manfred Huber 2010 1 Randomness and Monte Carlo Methods Introducing randomness in an algorithm can lead to improved efficiencies Random sampling
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
How to organize the Web?
How to organize the Web? First try: Human curated Web directories Yahoo, DMOZ, LookSmart Second try: Web Search Information Retrieval attempts to find relevant docs in a small and trusted set Newspaper
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
Search Engine Optimization
Search Engine Optimization A necessary campaign for heightened corporate awareness What is SEO? Definition: The practice of building or transforming a Web site so that its content is seen as highly readable,
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
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
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
A P2P-based Incremental Web Ranking Algorithm
A P2P-based Incremental Web Ranking Algorithm Sumalee Sangamuang Pruet Boonma Juggapong Natwichai Computer Engineering Department Faculty of Engineering, Chiang Mai University, Thailand sangamuang.s@gmail.com,
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?
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
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
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
CS 347 Parallel and Distributed Data Processing
CS 347 Parallel and Distributed Data Processing Spring 2016 Notes 12: Distributed Information Retrieval CS 347 Notes 12 2 CS 347 Notes 12 3 CS 347 Notes 12 4 CS 347 Notes 12 5 Web Search Engine Crawling
CS 347 Parallel and Distributed Data Processing
CS 347 Parallel and Distributed Data Processing Spring 2016 Notes 12: Distributed Information Retrieval CS 347 Notes 12 2 CS 347 Notes 12 3 CS 347 Notes 12 4 Web Search Engine Crawling Indexing Computing
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
Information Retrieval
Introduction to Information Retrieval CS3245 12 Lecture 12: Crawling and Link Analysis Information Retrieval Last Time Chapter 11 1. Probabilistic Approach to Retrieval / Basic Probability Theory 2. Probability
Big Data Analytics CSCI 4030
High dim. data Graph data Infinite data Machine learning Apps Locality sensitive hashing PageRank, SimRank Filtering data streams SVM Recommen der systems Clustering Community Detection Web advertising
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
Unit VIII. Chapter 9. Link Analysis
Unit VIII Link Analysis: Page Ranking in web search engines, Efficient Computation of Page Rank using Map-Reduce and other approaches, Topic-Sensitive Page Rank, Link Spam, Hubs and Authorities (Text Book:2
Why is the Internet so important? Reaching clients on the Internet
Why is the Internet so important? According to a recent study,* 70% of U.S. households use the Internet to search for local goods and services. *March 2005, The Kelsey Group Reaching clients 1 Reaching
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 }
Optimizing Search Engines using Click-through Data
Optimizing Search Engines using Click-through Data By Sameep - 100050003 Rahee - 100050028 Anil - 100050082 1 Overview Web Search Engines : Creating a good information retrieval system Previous Approaches
Big Data Analytics CSCI 4030
High dim. data Graph data Infinite data Machine learning Apps Locality sensitive hashing PageRank, SimRank Filtering data streams SVM Recommen der systems Clustering Community Detection Web advertising
BUBBLE RAP: Social-Based Forwarding in Delay-Tolerant Networks
1 BUBBLE RAP: Social-Based Forwarding in Delay-Tolerant Networks Pan Hui, Jon Crowcroft, Eiko Yoneki Presented By: Shaymaa Khater 2 Outline Introduction. Goals. Data Sets. Community Detection Algorithms
Modern Retrieval Evaluations. Hongning Wang
Modern Retrieval Evaluations Hongning Wang CS@UVa What we have known about IR evaluations Three key elements for IR evaluation A document collection A test suite of information needs A set of relevance
Empirical Characterization of P2P Systems
Empirical Characterization of P2P Systems Reza Rejaie Mirage Research Group Department of Computer & Information Science University of Oregon http://mirage.cs.uoregon.edu/ Collaborators: Daniel Stutzbach