Microsoft Technology Licensing, LLC

Krishna Chaitanya Gade

Christian Herwarth Borgs

Jennifer Tour Chayes

John E Hopcroft

Amit Prakash

Tao Tao

Seyed Vahab Mirrokni

Hugh Evan Williams

Nitin Agrawal

Nicholas Eric Craswell

Reid Andersen

Rangan Majumder

Srinath Reddy Aaleti

Janine Crumb

Vishnu Challam

Vahab Mirrokni

Shang-Hua Teng

Ranking domains for search engines is provided herein. To rank a domain, contributing domains associated with the domain are identified. Additionally, the maturity of each of the contributing domains is determined. A rank for the domain is then determined based at least in part on the maturity of each of the contributing domains. The domain rankings may then be used to order results for search queries.

Ranking domains using domain maturity

A SPAM detection system is provided. The system includes a graph clustering component to analyze web data. A link analysis component can be associated with the graph clustering component to facilitate SPAM detection in accordance with the web data.

Spam score propagation for web spam detection

The claimed subject matter relates to an architecture that can identify, store, and/or output local contributions to a rank of a vertex in a directed graph. The architecture can receive a directed graph and a parameter, and examine a local subset of vertices (e.g., local to a given vertex) in order to determine a local supporting set. The local supporting set can include a local set of vertices that each contributes a minimum fraction of the parameter to a rank of the vertex. The local supporting set can be the basis for an estimate of the supporting set and/or rank of the vertex for the entire graph and can be employed as a means for detecting link or web spam as well as other influence-based social network applications.

Local computation of rank contributions

An inversion of the basic format of searching is provided herein. Instead of receiving a search query and providing web page results, a search engine receives a web page identifier as search input from an end user, determines related search queries for the associated web page, and provides the related search queries to the end user issuing the search. Related search queries for web pages may also be used to refine search engines performing the basic form of searching by facilitating the determination of web pages to index and the ranking of web pages as search results to user queries. Additionally, related search queries may be used in advertising revenue generation and sharing.

Related search queries for a webpage and their applications

A method for suggesting related queries to a user query using semantic relationships that are present in informational content stored in public domains. Semantic relationships between named entities are discovered and the named entities are extracted. The entities are indexed according to the relationships. When a user query is received that includes one of the entities, query suggestions are returned to the user based on indexed relationships corresponding to the entity named in the user query.

Generating query suggestions from semantic relationships in content

Neighborhood clustering for web spam detection

Growing community of inventors

Redmond, WA, United States of America

Krishna Chaitanya Gade