1. Advertising
    y u no do it?

    Advertising (learn more)

    Advertise virtually anything here, with CPM banner ads, CPM email ads and CPC contextual links. You can target relevant areas of the site and show ads based on geographical location of the user if you wish.

    Starts at just $1 per CPM or $0.10 per CPC.

Basic Information About Google Algorithm

Discussion in 'Search Engine Optimization' started by ssitech, Jan 20, 2008.

  1. #1
    I wrote a basic information about Google Algorithms for SEO. I would appreciate any comments!

    In November of 2003, Google performed a major algorithm change. The goal of the change was to make it harder to manipulate their search result. It is believed that Google may have a number of algorithm and concept of the following section, including Hilltop, Topic Specific page rank, Trust Rank, Temporal analysis and Latent Semantic Indexing.

    Some of the these algorithm may not be part of the current search environment but the idea contained within them are still worth understanding see where search may be headed & what search topic search engineers think are important to improving there are overall relevancy scores.
    Hilltop's

    Hilltop is an algorithm with reorganizes search result based on an expert rating system.

    In the Hilltop white paper they talk about how expect documents can be used to help compute relevance. An expect document is a non-affiliated page which links to many related resources. If page A is related to page B and page B related to page C Then connection between A and C assumed.

    Additionally, Hilltop states that it strongly consider page title and page heading in relevance scores. Likely Hilltop also consider the link pointing into the page and site which your links come from.

    The benefit of Hilltop over raw page rank (Google) is that it is topic sensitive and is thus generally header to manipulate then buying some random high-power of link. The benefit of Hilltop over topic distillation (Teoma) at that Hilltop is quicker and cheaper to calculate. It is believed that Google might be using Hilltop to help sort the relevancy for some of their search results.
    Topic sensitive page rank:

    Topic Sensitive Page Rank biases both the query and the relevancy of returned documents based upon the perceived topical conte3xt of the query.

    The query context can be determined based on search history, user defined input (such as search personalization - try Googles Labs Search Personalization if you are interested), or related information in the document from which the query came.

    Topic Specific page rank for each page can be calculated off line. Using an exceptionally coarse topic set ( for example, the top leave Open Directory Projecst categories) still allows Topic Sensitive page rank to significantly enhance relevancy over using page rank alone, however T.S.P.R can be applied more specifically as well.

    Since much of it is calculated off line, Topic Specific page rank can also be rolled into other relevancy algorithms which are calculated in near real time.
    Latent Semantic Indexing:

    Latent semantic indexing allows machines to understand language by looking at it from purely mathematical view point.

    Latent semantic indexing adds an important step to the document indexing process. In addition to recording which keywords a documents contains, the method examines the document contain as a whole, to see which other documents contain some of those same words. LSI considers documents that have many words in common to be semantically close, and ones with few words in common to be semantically distant. This simple method correlates surprisingly well with how a human being, looking at content, might classify a document collection. Although the LSI algorithm doesn’t understand anything about what the words mean, patterns it notices can make it seem astonishingly intelligent.

    Latent semantic indexing is a rather expensive process and many SEO experts debate to what extent major search engines may be using the technology. If they are not using it much yet, in time they surely will.
    Temporal Analysis:

    Search engines can track how long things (sites, pages, and links) have been in existence and how quickly they change. They can track ling a domain has been in existence, how often page copy changes, how page copy changes, how large a site is, how quickly link popularity builds, how any particular link exists, how similar the link text is, how a site changes in rank over time, how related linking sites are, and how natural linkage data looks.

    In some cases, it makes sense for resources to acquire a bunch of linkage data in a burst. When news stories about a topic and search volumes on particular term are high it would also make sense that some sites may acquire a large amount of linkage data. Most the time if links build naturally, they build more slowly and evenly.

    If links build in hue spikes then search engines may discount- or even apply a penalty- to the domain receiving that linkage data if those links do not build in somewhat regular pattern.

    Stale pages may also be lowered in relevancy. A page may be considered fresh if it changes somewhat frequently of if it continues to acquire linkage data as time passes.

    Google may also look at how often your site is bookmarked, who your advertisers are, and other various feed back they can get from their toolbar.

    Google was awarded a patent on March 31, 2005 covering these types of topics (scout in much more detail).
    Trust Rank:

    Trust Rank is and algorithm which can be used to bias Page Rank by placing additional authority on human reviewed trusted sites. Trust propagates out from the trusted pages and sites to pages and sites they link to. Trust Rank also can be used to neutralize the effects of some types of low quality link building from un trusted sources, as well as flag high Page Rank low trust websites for human review.
     
    ssitech, Jan 20, 2008 IP
  2. WM7

    WM7 Peon

    Messages:
    778
    Likes Received:
    112
    Best Answers:
    0
    Trophy Points:
    0
    #2
    Good Info.
     
    WM7, Jan 20, 2008 IP
  3. yeswin

    yeswin Peon

    Messages:
    18
    Likes Received:
    0
    Best Answers:
    0
    Trophy Points:
    0
    #3
    Hi Dear,

    Nice, Thanks for posted sucha helpful info about google algoritham.

    sure, it will help to new users.


    Thanks
    Yeswin
     
    yeswin, Jan 20, 2008 IP
  4. wtlok

    wtlok Active Member

    Messages:
    178
    Likes Received:
    1
    Best Answers:
    0
    Trophy Points:
    53
    #4
    Thanks.very particupar for google algorithm.
     
    wtlok, Jan 20, 2008 IP
  5. Michael

    Michael Raider

    Messages:
    677
    Likes Received:
    92
    Best Answers:
    0
    Trophy Points:
    150
    #5
    Cut and paste job :rolleyes:

    If you learn something about the subject you might be able to cut and paste more useful snippets.

    - Michael
     
    Michael, Jan 21, 2008 IP
  6. Marty Rogers

    Marty Rogers Guest

    Messages:
    596
    Likes Received:
    9
    Best Answers:
    0
    Trophy Points:
    0
    #6
    Thank you.
     
    Marty Rogers, Jan 21, 2008 IP
  7. Abhik

    Abhik ..:: The ONE ::..

    Messages:
    11,338
    Likes Received:
    606
    Best Answers:
    0
    Trophy Points:
    410
    Digital Goods:
    2
    #7
    Nice Info
    Now, thats call for a proof.. :p
     
    Abhik, Jan 21, 2008 IP
  8. Michael

    Michael Raider

    Messages:
    677
    Likes Received:
    92
    Best Answers:
    0
    Trophy Points:
    150
    #8
    How about these two examples for starters:

    "In the Hilltop white paper they talk about how expect documents can be used to help compute relevance. An expect document is a non-affiliated page which links to many related resources. If page A is related to page B and page B related to page C Then connection between A and C assumed.

    Additionally, Hilltop states that it strongly consider page title and page heading in relevance scores".

    From http://www.seobook.com/archives/000626.shtml dated January 15th 2005

    "In the Hilltop white paper they talk about how they can use expert documents to help compute relevancy. An expert document is a non affiliated page which links to many related resources. If page A is related to page B and page B is related to page C then a connection between A & C are assumed.

    Additionally Hilltop states that it strongly considers page title and page headings in relevancy scores".


    "Latent semantic indexing adds an important step to the document indexing process. In addition to recording which keywords a documents contains, the method examines the document contain as a whole, to see which other documents contain some of those same words. LSI considers documents that have many words in common to be semantically close, and ones with few words in common to be semantically distant. This simple method correlates surprisingly well with how a human being, looking at content, might classify a document collection. Although the LSI algorithm doesn’t understand anything about what the words mean, patterns it notices can make it seem astonishingly intelligent".

    From http://www.seroundtable.com/archives/001481.html dated February 4, 2005

    Latent semantic indexing adds an important step to the document indexing process. In addition to recording which keywords a document contains, the method examines the document collection as a whole, to see which other documents contain some of those same words. LSI considers documents that have many words in common to be semantically close, and ones with few words in common to be semantically distant. This simple method correlates surprisingly well with how a human being, looking at content, might classify a document collection. Although the LSI algorithm doesn't understand anything about what the words mean, the patterns it notices can make it seem astonishingly intelligent.


    If you wanted to look for more I am sure you would find it!

    - Michael
     
    Michael, Jan 21, 2008 IP
    Abhik likes this.
  9. igme

    igme Banned

    Messages:
    1,048
    Likes Received:
    5
    Best Answers:
    0
    Trophy Points:
    0
    #9
    A usefull tips dude thanks for this information you share with Us. Another one is reading Mattcutts article for update of the alghorithims.
     
    igme, Jan 21, 2008 IP
  10. nalds20

    nalds20 Banned

    Messages:
    180
    Likes Received:
    2
    Best Answers:
    0
    Trophy Points:
    0
    #10
    Nice Information in algorithims.. Its very useful
     
    nalds20, Jan 21, 2008 IP
  11. nalds20

    nalds20 Banned

    Messages:
    180
    Likes Received:
    2
    Best Answers:
    0
    Trophy Points:
    0
    #11
    Nice Information in algorithims.. Its very useful specially to those people who are starting in SEO
     
    nalds20, Jan 21, 2008 IP
  12. Gatorade

    Gatorade Peon

    Messages:
    2,130
    Likes Received:
    222
    Best Answers:
    0
    Trophy Points:
    0
    #12
    Good information and thanks for sharing.
     
    Gatorade, Jan 21, 2008 IP
  13. Abhik

    Abhik ..:: The ONE ::..

    Messages:
    11,338
    Likes Received:
    606
    Best Answers:
    0
    Trophy Points:
    410
    Digital Goods:
    2
    #13
    WOW,
    Thats really a solid proof..
    God Job mate [​IMG], Rep added.
     
    Abhik, Jan 21, 2008 IP
  14. ssitech

    ssitech Member

    Messages:
    53
    Likes Received:
    3
    Best Answers:
    0
    Trophy Points:
    48
    #14
    Thanks a Lot for Google Algorithm comment.
     
    ssitech, Jan 22, 2008 IP
  15. magda

    magda Notable Member

    Messages:
    5,197
    Likes Received:
    315
    Best Answers:
    0
    Trophy Points:
    280
    #15
    Who are you thanking? the person that showed you up for C&Ping other people's work without crediting them?
     
    magda, Jan 22, 2008 IP
  16. tsc

    tsc Well-Known Member

    Messages:
    429
    Likes Received:
    10
    Best Answers:
    0
    Trophy Points:
    110
    #16
    Plagiarism aside, remember... quality content and natural link building...

    The algorithm(s) will be happy... :)
     
    tsc, Jan 22, 2008 IP
  17. ron21

    ron21 Banned

    Messages:
    799
    Likes Received:
    2
    Best Answers:
    0
    Trophy Points:
    0
    #17
    Its just a copy paste! but anyways thaks, it surely help . . .
     
    ron21, Jan 22, 2008 IP
  18. DDR3

    DDR3 Peon

    Messages:
    3
    Likes Received:
    0
    Best Answers:
    0
    Trophy Points:
    0
    #18
    Hi,

    Its really debatable that what you said and what is ruing under their algo but the most important information which you can get to walk through with Google's is to keep an eye on it and keep cheeking what they suggests and believe this is some thing you can do by using
     
    DDR3, Jan 22, 2008 IP
  19. mminfobase

    mminfobase Peon

    Messages:
    7
    Likes Received:
    0
    Best Answers:
    0
    Trophy Points:
    0
    #19
    Nice Information in algorithims.. Its very useful
     
    mminfobase, Jan 22, 2008 IP
  20. igme

    igme Banned

    Messages:
    1,048
    Likes Received:
    5
    Best Answers:
    0
    Trophy Points:
    0
    #20
    I hope Google reveal the Algorithm hheheheheheh.
     
    igme, Feb 8, 2008 IP