SlideShare ist ein Scribd-Unternehmen logo
1 von 28
Motivation
  1. Link algorithm(SALSA)
  2. Page Rank Algorithm
SEARCH PHRASE
• Keyword Density
• Accentuation within a
  document
  • HTML Tags
• Not resistant against
  automatically generated web
Link popularity
    algorithm
•    Inbound Links.
•    Decieve Search Engines
    • Creating masses of inbound links
Page rank
           algorithm
PageRank is an expected value for the random surfer visiting a
 page, when he restarts this procedure as often as the web has
                             pages

        •   Comparision of pages
            • The higher the better
        •    Recursive Determination
introduction



Sergey Brin   Larry Page
algorithm



PageRank does not rank web sites as a whole,
           but is determined for each page individually

 *This means that the more outbound links a page T has, the less will page A
 benefit from a link to it on page T.
The random surfer
      model
  • The probability that the random surfer
  clicks on one link is solely given by the
  number of links on that page
  • The surfer does not click on an infinite
  number of links, but gets bored sometimes and
  jumps to another page at random.



    damping factor ‘d’
Different
notation
characteristic
                                   A


             b                                        c
PR(A) = 0.5 + 0.5 PR(C)                 PR(A) = 14/13 = 1.07692308
PR(B) = 0.5 + 0.5 (PR(A) / 2)           PR(B) = 10/13 = 0.76923077
PR(C) = 0.5 + 0.5 (PR(A) / 2 + PR(B))   PR(C) = 15/13 = 1.15384615
The iterative
Iteration       PR(A)        PR(B)        PR(C)
   0               1             1           1
   1               1           0.75        1.125
   2             1.0625      0.765625    1.1484375

   3           1.07421875   0.76855469   1.15283203

   4           1.07641602   0.76910400   1.15365601

   5           1.07682800   0.76920700   1.15381050

   6           1.07690525   0.76922631   1.15383947

   7           1.07691973   0.76922993   1.15384490

   8           1.07692245   0.76923061   1.15384592

   9           1.07692296   0.76923074   1.15384611

   10          1.07692305   0.76923076   1.15384615

   11          1.07692307   0.76923077   1.15384615
Implementation in
google search engine
           • Page specific factors
              • Body text
              • Content of title tag
              • URL of document
           • Anchor text of inbound links
           • Page rank

  Page                      Inbound                      IR
factors                       links                     Score


          * IR score is multiplied with the Page Rank
Effect of
                                 inbound links

• d × PR(X) / C(X)
          where PR(X) is the PageRank of page X and C(X) is the total number of
its outbound links. But page A usually links to other pages itself. Thus, these pages
get a PageRank benefit also. If these pages link back to page A, page A will have an
even higher PageRank benefit from its additional inbound link

• Influence of Damping Factor
• Initially all have Pagerank 1
                                          • We presume a constant Pagerank PR(X) of 10
                                          • Damping factor is equal to 0.5




         PR(A)=     0.5   +   0.5 (PR(X) + PR(D)) = 5.5 + 0.5 PR(D)
         PR(B)=     0.5   +   0.5 PR(A)
         PR(C)=     0.5   +   0.5 PR(B)
         PR(D)=     0.5   +   0.5 PR(C)

                                               PR(A) = 19/3 = 6.33
                                               PR(B) = 11/3 = 3.67
                                               PR(C) = 7/3 = 2.33
   d × PR(X) / C(X) = 0,5 × 10 / 1 = 5
                                               PR(D) = 5/3 = 1.67

* The higher the damping factor, the larger is the effect of an additional inbound link for
the PageRank of the page that receives the link and the more evenly distributes
PageRank over the other pages of a site.
Effect of
                                             outbound links

PR(A) = 0.25 + 0.75 PR(B)
PR(B) = 0.25 + 0.375 PR(A)
PR(C) = 0.25 + 0.75 PR(D) + 0.375 PR(A)
PR(D) = 0.25 + 0.75 PR(C)



         PR(A) = 14/23                PR(C) = 35/23
         PR(B) = 11/23                PR(D) = 32/23




*Adding a link has no effect on the total PageRank of the web. Additionally, the
PageRank benefit for one site equals the PageRank loss of the other.
Dangling links
                      PR(A) = 0.25 + 0.75 PR(B)
                      PR(B) = 0.25 + 0.375 PR(A)
                      PR(C) = 0.25 + 0.375 PR(A)

                            PR(A) = 14/23
                            PR(B) = 11/23
                            PR(C) = 11/23


Dangling links could have major impacts on PageRank.
• In order to prevent PageRank from the
                             negative effects of dangling links, pages
                             wihout outbound links have to be removed
                             from the database until the PageRank values
                             are computed.
                             • According to Page and Brin, the number
                             of outbound links on pages with dangling
                             links is thereby normalised




               PR(C) = 0.25 + 0.375 PR(A) = 0.625


*The accumulated PageRank does not equal the number of pages, but at least
all pages which have outbound links are not harmed from the danging links
Effect of the number
      of pages


 PR(A) = 260/14   PR(A) = 266/14            PR(A) = 13.97      PR(A)   = 11.97
 PR(B) = 101/14   PR(B) = 70/14             PR(B) = 10.73      PR(B)   = 9.23
 PR(C) = 101/14   PR(C) = 70/14             PR(C) = 8.30       PR(C)   = 7.17
                  PR(D) = 70/14                                PR(D)   = 5.63



  * The PageRank algorithm tends to privilege smaller web sites.
The distribution of
   pagerank for s.e.o.


                 PR(A) = 8                            PR(A) = 7
                 PR(B) = 2.5                          PR(B) = 3
                 PR(C) = 2.5                          PR(C) = 3


PageRank will distribute for the purpose of search engine optimisation more equally
among the pages of a site, the more the hierarchically lower pages are interlinked.
Concentration of
         outbound links


              PR(A) = 1                                            PR(A) = 17/13
              PR(B) = 2/3                                          PR(B) = 28/39
              PR(C) = 2/3                                          PR(C) = 28/39
              PR(D) = 2/3                                          PR(D) = 28/39


Concentrate external outbound links on as few pages as possible, as long as it does not lessen a
site's usabilty.
Link exchanges



     PR(A) = 4/3   PR(D) = 4/3      PR(A) = 3/2   PR(D) = 3/2
     PR(B) = 5/6   PR(E) = 5/6      PR(B) = 3/4   PR(E) = 3/4
     PR(C) = 5/6   PR(F) = 5/6      PR(C) = 3/4   PR(F) = 3/4


A link exchange is thus advisable, if one page (e.g. the root
page of a site) shall be optimised for one important key
Additional factors
• Visibility of a link
• Position of a link within a
document
• Distance       between   web
pages
• Importance of a linking page
Bibliography
•   Wikipedia
•   Pr.efactory.de
•   Youtube
•   Google Images
questionnaires
Motivation

Weitere ähnliche Inhalte

Ähnlich wie Motivation

Ähnlich wie Motivation (20)

Page rank2
Page rank2Page rank2
Page rank2
 
Dm page rank
Dm page rankDm page rank
Dm page rank
 
PageRank
PageRankPageRank
PageRank
 
Implementing page rank algorithm using hadoop map reduce
Implementing page rank algorithm using hadoop map reduceImplementing page rank algorithm using hadoop map reduce
Implementing page rank algorithm using hadoop map reduce
 
Pagerank Algorithm Explained
Pagerank Algorithm ExplainedPagerank Algorithm Explained
Pagerank Algorithm Explained
 
Page rank algortihm
Page rank algortihmPage rank algortihm
Page rank algortihm
 
How Google Works
How Google WorksHow Google Works
How Google Works
 
Pagerank
PagerankPagerank
Pagerank
 
PageRank & Searching
PageRank & SearchingPageRank & Searching
PageRank & Searching
 
Local Approximation of PageRank
Local Approximation of PageRankLocal Approximation of PageRank
Local Approximation of PageRank
 
Topological methods
Topological methods Topological methods
Topological methods
 
Page rank1
Page rank1Page rank1
Page rank1
 
Ranking Web Pages
Ranking Web PagesRanking Web Pages
Ranking Web Pages
 
BigData - PageRank Algorithm with Scala and Spark
BigData - PageRank Algorithm with Scala and SparkBigData - PageRank Algorithm with Scala and Spark
BigData - PageRank Algorithm with Scala and Spark
 
Page rank and hyperlink
Page rank and hyperlink Page rank and hyperlink
Page rank and hyperlink
 
Pr
PrPr
Pr
 
Google page rank
Google page rankGoogle page rank
Google page rank
 
Google page rank
Google page rankGoogle page rank
Google page rank
 
Pagerank
PagerankPagerank
Pagerank
 
Link Analysis
Link AnalysisLink Analysis
Link Analysis
 

Kürzlich hochgeladen

How to do quick user assign in kanban in Odoo 17 ERP
How to do quick user assign in kanban in Odoo 17 ERPHow to do quick user assign in kanban in Odoo 17 ERP
How to do quick user assign in kanban in Odoo 17 ERPCeline George
 
Keynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-designKeynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-designMIPLM
 
Student Profile Sample - We help schools to connect the data they have, with ...
Student Profile Sample - We help schools to connect the data they have, with ...Student Profile Sample - We help schools to connect the data they have, with ...
Student Profile Sample - We help schools to connect the data they have, with ...Seán Kennedy
 
ENGLISH6-Q4-W3.pptxqurter our high choom
ENGLISH6-Q4-W3.pptxqurter our high choomENGLISH6-Q4-W3.pptxqurter our high choom
ENGLISH6-Q4-W3.pptxqurter our high choomnelietumpap1
 
Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17Celine George
 
Judging the Relevance and worth of ideas part 2.pptx
Judging the Relevance  and worth of ideas part 2.pptxJudging the Relevance  and worth of ideas part 2.pptx
Judging the Relevance and worth of ideas part 2.pptxSherlyMaeNeri
 
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxProudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxthorishapillay1
 
ACC 2024 Chronicles. Cardiology. Exam.pdf
ACC 2024 Chronicles. Cardiology. Exam.pdfACC 2024 Chronicles. Cardiology. Exam.pdf
ACC 2024 Chronicles. Cardiology. Exam.pdfSpandanaRallapalli
 
What is Model Inheritance in Odoo 17 ERP
What is Model Inheritance in Odoo 17 ERPWhat is Model Inheritance in Odoo 17 ERP
What is Model Inheritance in Odoo 17 ERPCeline George
 
FILIPINO PSYCHology sikolohiyang pilipino
FILIPINO PSYCHology sikolohiyang pilipinoFILIPINO PSYCHology sikolohiyang pilipino
FILIPINO PSYCHology sikolohiyang pilipinojohnmickonozaleda
 
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptxECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptxiammrhaywood
 
INTRODUCTION TO CATHOLIC CHRISTOLOGY.pptx
INTRODUCTION TO CATHOLIC CHRISTOLOGY.pptxINTRODUCTION TO CATHOLIC CHRISTOLOGY.pptx
INTRODUCTION TO CATHOLIC CHRISTOLOGY.pptxHumphrey A Beña
 
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfInclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfTechSoup
 
AUDIENCE THEORY -CULTIVATION THEORY - GERBNER.pptx
AUDIENCE THEORY -CULTIVATION THEORY -  GERBNER.pptxAUDIENCE THEORY -CULTIVATION THEORY -  GERBNER.pptx
AUDIENCE THEORY -CULTIVATION THEORY - GERBNER.pptxiammrhaywood
 
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)lakshayb543
 
Global Lehigh Strategic Initiatives (without descriptions)
Global Lehigh Strategic Initiatives (without descriptions)Global Lehigh Strategic Initiatives (without descriptions)
Global Lehigh Strategic Initiatives (without descriptions)cama23
 
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSGRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSJoshuaGantuangco2
 

Kürzlich hochgeladen (20)

How to do quick user assign in kanban in Odoo 17 ERP
How to do quick user assign in kanban in Odoo 17 ERPHow to do quick user assign in kanban in Odoo 17 ERP
How to do quick user assign in kanban in Odoo 17 ERP
 
Keynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-designKeynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-design
 
Student Profile Sample - We help schools to connect the data they have, with ...
Student Profile Sample - We help schools to connect the data they have, with ...Student Profile Sample - We help schools to connect the data they have, with ...
Student Profile Sample - We help schools to connect the data they have, with ...
 
ENGLISH6-Q4-W3.pptxqurter our high choom
ENGLISH6-Q4-W3.pptxqurter our high choomENGLISH6-Q4-W3.pptxqurter our high choom
ENGLISH6-Q4-W3.pptxqurter our high choom
 
Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17
 
Judging the Relevance and worth of ideas part 2.pptx
Judging the Relevance  and worth of ideas part 2.pptxJudging the Relevance  and worth of ideas part 2.pptx
Judging the Relevance and worth of ideas part 2.pptx
 
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxProudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptx
 
ACC 2024 Chronicles. Cardiology. Exam.pdf
ACC 2024 Chronicles. Cardiology. Exam.pdfACC 2024 Chronicles. Cardiology. Exam.pdf
ACC 2024 Chronicles. Cardiology. Exam.pdf
 
What is Model Inheritance in Odoo 17 ERP
What is Model Inheritance in Odoo 17 ERPWhat is Model Inheritance in Odoo 17 ERP
What is Model Inheritance in Odoo 17 ERP
 
YOUVE_GOT_EMAIL_PRELIMS_EL_DORADO_2024.pptx
YOUVE_GOT_EMAIL_PRELIMS_EL_DORADO_2024.pptxYOUVE_GOT_EMAIL_PRELIMS_EL_DORADO_2024.pptx
YOUVE_GOT_EMAIL_PRELIMS_EL_DORADO_2024.pptx
 
FILIPINO PSYCHology sikolohiyang pilipino
FILIPINO PSYCHology sikolohiyang pilipinoFILIPINO PSYCHology sikolohiyang pilipino
FILIPINO PSYCHology sikolohiyang pilipino
 
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptxECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
 
INTRODUCTION TO CATHOLIC CHRISTOLOGY.pptx
INTRODUCTION TO CATHOLIC CHRISTOLOGY.pptxINTRODUCTION TO CATHOLIC CHRISTOLOGY.pptx
INTRODUCTION TO CATHOLIC CHRISTOLOGY.pptx
 
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptxYOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
 
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfInclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
 
AUDIENCE THEORY -CULTIVATION THEORY - GERBNER.pptx
AUDIENCE THEORY -CULTIVATION THEORY -  GERBNER.pptxAUDIENCE THEORY -CULTIVATION THEORY -  GERBNER.pptx
AUDIENCE THEORY -CULTIVATION THEORY - GERBNER.pptx
 
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
 
Global Lehigh Strategic Initiatives (without descriptions)
Global Lehigh Strategic Initiatives (without descriptions)Global Lehigh Strategic Initiatives (without descriptions)
Global Lehigh Strategic Initiatives (without descriptions)
 
FINALS_OF_LEFT_ON_C'N_EL_DORADO_2024.pptx
FINALS_OF_LEFT_ON_C'N_EL_DORADO_2024.pptxFINALS_OF_LEFT_ON_C'N_EL_DORADO_2024.pptx
FINALS_OF_LEFT_ON_C'N_EL_DORADO_2024.pptx
 
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSGRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
 

Motivation

  • 1. Motivation 1. Link algorithm(SALSA) 2. Page Rank Algorithm
  • 2. SEARCH PHRASE • Keyword Density • Accentuation within a document • HTML Tags • Not resistant against automatically generated web
  • 3. Link popularity algorithm • Inbound Links. • Decieve Search Engines • Creating masses of inbound links
  • 4.
  • 5.
  • 6. Page rank algorithm PageRank is an expected value for the random surfer visiting a page, when he restarts this procedure as often as the web has pages • Comparision of pages • The higher the better • Recursive Determination
  • 7.
  • 9. algorithm PageRank does not rank web sites as a whole, but is determined for each page individually *This means that the more outbound links a page T has, the less will page A benefit from a link to it on page T.
  • 10. The random surfer model • The probability that the random surfer clicks on one link is solely given by the number of links on that page • The surfer does not click on an infinite number of links, but gets bored sometimes and jumps to another page at random. damping factor ‘d’
  • 12. characteristic A b c PR(A) = 0.5 + 0.5 PR(C) PR(A) = 14/13 = 1.07692308 PR(B) = 0.5 + 0.5 (PR(A) / 2) PR(B) = 10/13 = 0.76923077 PR(C) = 0.5 + 0.5 (PR(A) / 2 + PR(B)) PR(C) = 15/13 = 1.15384615
  • 13. The iterative Iteration PR(A) PR(B) PR(C) 0 1 1 1 1 1 0.75 1.125 2 1.0625 0.765625 1.1484375 3 1.07421875 0.76855469 1.15283203 4 1.07641602 0.76910400 1.15365601 5 1.07682800 0.76920700 1.15381050 6 1.07690525 0.76922631 1.15383947 7 1.07691973 0.76922993 1.15384490 8 1.07692245 0.76923061 1.15384592 9 1.07692296 0.76923074 1.15384611 10 1.07692305 0.76923076 1.15384615 11 1.07692307 0.76923077 1.15384615
  • 14. Implementation in google search engine • Page specific factors • Body text • Content of title tag • URL of document • Anchor text of inbound links • Page rank Page Inbound IR factors links Score * IR score is multiplied with the Page Rank
  • 15.
  • 16. Effect of inbound links • d × PR(X) / C(X) where PR(X) is the PageRank of page X and C(X) is the total number of its outbound links. But page A usually links to other pages itself. Thus, these pages get a PageRank benefit also. If these pages link back to page A, page A will have an even higher PageRank benefit from its additional inbound link • Influence of Damping Factor
  • 17. • Initially all have Pagerank 1 • We presume a constant Pagerank PR(X) of 10 • Damping factor is equal to 0.5 PR(A)= 0.5 + 0.5 (PR(X) + PR(D)) = 5.5 + 0.5 PR(D) PR(B)= 0.5 + 0.5 PR(A) PR(C)= 0.5 + 0.5 PR(B) PR(D)= 0.5 + 0.5 PR(C) PR(A) = 19/3 = 6.33 PR(B) = 11/3 = 3.67 PR(C) = 7/3 = 2.33 d × PR(X) / C(X) = 0,5 × 10 / 1 = 5 PR(D) = 5/3 = 1.67 * The higher the damping factor, the larger is the effect of an additional inbound link for the PageRank of the page that receives the link and the more evenly distributes PageRank over the other pages of a site.
  • 18. Effect of outbound links PR(A) = 0.25 + 0.75 PR(B) PR(B) = 0.25 + 0.375 PR(A) PR(C) = 0.25 + 0.75 PR(D) + 0.375 PR(A) PR(D) = 0.25 + 0.75 PR(C) PR(A) = 14/23 PR(C) = 35/23 PR(B) = 11/23 PR(D) = 32/23 *Adding a link has no effect on the total PageRank of the web. Additionally, the PageRank benefit for one site equals the PageRank loss of the other.
  • 19. Dangling links PR(A) = 0.25 + 0.75 PR(B) PR(B) = 0.25 + 0.375 PR(A) PR(C) = 0.25 + 0.375 PR(A) PR(A) = 14/23 PR(B) = 11/23 PR(C) = 11/23 Dangling links could have major impacts on PageRank.
  • 20. • In order to prevent PageRank from the negative effects of dangling links, pages wihout outbound links have to be removed from the database until the PageRank values are computed. • According to Page and Brin, the number of outbound links on pages with dangling links is thereby normalised PR(C) = 0.25 + 0.375 PR(A) = 0.625 *The accumulated PageRank does not equal the number of pages, but at least all pages which have outbound links are not harmed from the danging links
  • 21. Effect of the number of pages PR(A) = 260/14 PR(A) = 266/14 PR(A) = 13.97 PR(A) = 11.97 PR(B) = 101/14 PR(B) = 70/14 PR(B) = 10.73 PR(B) = 9.23 PR(C) = 101/14 PR(C) = 70/14 PR(C) = 8.30 PR(C) = 7.17 PR(D) = 70/14 PR(D) = 5.63 * The PageRank algorithm tends to privilege smaller web sites.
  • 22. The distribution of pagerank for s.e.o. PR(A) = 8 PR(A) = 7 PR(B) = 2.5 PR(B) = 3 PR(C) = 2.5 PR(C) = 3 PageRank will distribute for the purpose of search engine optimisation more equally among the pages of a site, the more the hierarchically lower pages are interlinked.
  • 23. Concentration of outbound links PR(A) = 1 PR(A) = 17/13 PR(B) = 2/3 PR(B) = 28/39 PR(C) = 2/3 PR(C) = 28/39 PR(D) = 2/3 PR(D) = 28/39 Concentrate external outbound links on as few pages as possible, as long as it does not lessen a site's usabilty.
  • 24. Link exchanges PR(A) = 4/3 PR(D) = 4/3 PR(A) = 3/2 PR(D) = 3/2 PR(B) = 5/6 PR(E) = 5/6 PR(B) = 3/4 PR(E) = 3/4 PR(C) = 5/6 PR(F) = 5/6 PR(C) = 3/4 PR(F) = 3/4 A link exchange is thus advisable, if one page (e.g. the root page of a site) shall be optimised for one important key
  • 25. Additional factors • Visibility of a link • Position of a link within a document • Distance between web pages • Importance of a linking page
  • 26. Bibliography • Wikipedia • Pr.efactory.de • Youtube • Google Images