articlechef.com articlechef.com
   Home Page -> About Us -> Security & Privacy -> Terms & Conditions -> Place Your Link -> Add Article
Search:   
Add Url
 

Jobs & Careers

Estate & Realty

Academics & Education

Children

Healthcare & Medicine

Fashion & Lifestyle

Policies & Law

Science & Research

Travel & Vacation

Automotive

Art & Culture

Finance & Investment

Fitness & Health

Computers & Software

Self Management

Sports & Adventure

Music & Entertainment

Online & Board Games

News & Events

Shopping Online

Drink & Food

Family & Home

Companies & Business

People & Society

 

Home Page –› Computers & Software –› SEO Solutions
 

Singular Value Decomposition (SVD) and Search Engines (SEO)

 
Author: Jose Nu?ez
By Jose Nu?ez

Singular Value Decomposition (SVD) is a powerful and fully automatic statistical method used by Latent Semantic Analysis (LSA). The SVD algorithm is O(N2 k3), where N is the number of terms + documents, k is the number of dimensions in concept space. The SVD algorithm is unusable for a large, dynamic collection because it is hard to find the number of dimensions.

Latent Semantic Indexing (LSI) is slow because of using this SVD method to create concept spaces. LSI assumes that there is some underlying or latent structure in word usage that is partially obscured by variability in word choice. So, a truncated Singular Value decomposition (SVD) is used to estimate the structure in word usage across documents. Retrieval is then performed using the database of singular values and vectors obtained from the truncated SVD. Data shows that these statistically derived vectors are more robust indicators of meaning than of individual terms.

SVD and LSI are least-squares methods. The projection into the latent semantic space is chosen so that the representations in the original space are changed as little as possible when measured by the sum of the squares of these differences. The projection transforms a document's vector in n-dimensional word space into a vector in the k-dimensional reduced space.

One can conclude or prove that SVD is unique, that is, there is only one possible decomposition of a given matrix. Because SVD finds an optimal projection to a low dimensional space, that is the key property for word co-occurrence patterns.

Author Bio:

Jose Nu?ez is a SEO/SEM Specialist for Omniture He can be reached by email at jnunez@omniture.com More Web Analytics info at www.omniture.com/

You can search for this article using: search engine optimization services, search engine optimization firm
 
 
 

Related Articles

 
Climbing the Google Mountain
 
Should You Be Here?
 
Generate More Sales in ANY Affiliate Program - Part Two
 
The Skinny on eGroups
 
The 13 Key Success Factors Of A Well-Executed Joint Venture
 
Web Site SEO - Terrific Title Tags
 
Internet Marketing Success - Is Search Engine Optimization Dead?
 
How To Become A Data-Feed Super Affiliate
 
How to Install and Configure Drupal CMS
 
Custom Icons For Your Specific Brand
 
 
 
Home Page -> Security & Privacy -> Terms & Conditions  
Copyright © 2008 www.articlechef.com All Rights Reserved.