US20050165757A1 - Method and apparatus for ranking web page search results - Google Patents
Method and apparatus for ranking web page search results Download PDFInfo
- Publication number
- US20050165757A1 US20050165757A1 US10/974,483 US97448304A US2005165757A1 US 20050165757 A1 US20050165757 A1 US 20050165757A1 US 97448304 A US97448304 A US 97448304A US 2005165757 A1 US2005165757 A1 US 2005165757A1
- Authority
- US
- United States
- Prior art keywords
- matrices
- set forth
- pages
- matrix
- attractor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9538—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
- Y10S707/99934—Query formulation, input preparation, or translation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
- Y10S707/99935—Query augmenting and refining, e.g. inexact access
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99937—Sorting
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99942—Manipulating data structure, e.g. compression, compaction, compilation
Definitions
- This invention relates generally to computerized information retrieval, and more particularly to identifying related pages in a hyperlinked database environment such as the World Wide Web.
- a search engine such as Digital Equipment Corporation's AltaVista search engine, indexes hundreds of millions of Web pages maintained by computers all over the world.
- the users of the hosts compose queries, and the search engine identifies pages that match the queries, e.g., pages that include key words of the queries. These pages are known as a “result set.”
- the result set can be quite large, for example, thousands of pages.
- the pages in the result set may or may not satisfy the user's actual information needs.
- the vast majority of users are not interested in retrieving the entire huge set of resources. Most users will be quite satisfied with a few authoritative results which are highly relevant to the topic of the query.
- the challenge is to retrieve only the most relevant resources to the query.
- the Web is a hyperlinked collection.
- the link structure of such collections contains information which can, and should, be tapped when searching for authoritative sources.
- a link p suggests, or even recommends, that surfers visiting p follow the link and visit q. This may reflect the fact that pages p and q share a common topic of interest, and that the author of p thinks highly of q's content.
- Such a link called an informative link, is p's way to confer authority on q.
- informative links provide a positive critical assessment of q's contents which originates from outside the control of the author of q (as opposed to assessments based on q's textual content, which is under complete control of q's author).
- the vicinity of a Web page is defined by the hyperlinks that connect the page to others.
- a Web page can point to other pages, and the page can be pointed to by other pages. Close pages are directly linked, farther pages is are indirectly linked via intermediate pages.
- This connectivity can be expressed as a graph where nodes represent the pages, and the directed edges represent the links.
- the vicinity of all the pages in the result set, up to a certain distance, is called the neighborhood graph.
- the Kleinberg algorithm attempts to identify “hub” pages and “authority” pages in the neighborhood graph for a user query. Hubs and authorities exhibit a mutually reinforcing relationship.
- the Kleinberg algorithm determines related pages starting with a single page. The algorithm works by first finding a set of pages that point to the page, and then running the base algorithm on the resulting graph. However, this algorithm for finding related pages does not deal with popular URLs, with neighborhood graphs containing duplicate pages, or with cases where the computation is totally dominated by a single “hub” page. The algorithm also does not include an analysis of the contents of pages when it is computing the most related pages.
- the Google search engine uses a feature called PageRank to prioritize the results of web keyword searches.
- PageRank technique examines a single random walk on the entire Web. PageRank assumes page A has pages T1 . . . Tn which point to it (i.e., are citations).
- the parameter d is a damping factor which can be set between 0 and 1.
- C(A) is defined as the number of links going out of page A.
- PR PageRank
- PageRanks form a probability distribution over the web pages, so the sum of all web pages' PageRanks is one.
- PageRank or PR(A) corresponds to the principal eigenvector of the normalized link matrix of the web.
- the ranking of web sites is independent of the search query, and no distinction is made between hubs and authorities, as with the Kleinberg algorithm. There is also no provision for externally evaluating sites and using the evaluations to weigh the usefulness rankings.
- the method is based on considering a bipartite graph G, whose two parts correspond to hubs and authorities, where an edge between hub r and authority s means that there is an informative link from r to s. Then, authorities and hubs pertaining to the dominant topic of the sites in G should be highly visible (reachable) from many sites in G. These sites are identified by examining certain random walks in G, under the proviso that such random walks will tend to visit these highly visible sites more frequently than other, less connected sites.
- the SALSA approach is based upon the theory of Markov chains, and relies on the stochastic properties of random walks performed on a collection of sites. It differs from Kleinberg's Mutual Reinforcement approach in the manner in which the association matrices are defined. The SALSA approach also initially assumes uniform probability over all pages, and relies on the random walk process to determine the likelihood that a particular page will be visited.
- the invention provides a method whereby a linear combination of matrices that provide information about the pages can be used to rank the pages. This allows results to be ranked based on two or more “page qualities” that are sought by the user, thus providing highly relevant results to the user.
- a method of ranking a plurality of pages identified during a search of a linked database includes:
- the coefficients of the eigenvector provide a measure of the quality of each page in relation to the other pages.
- the eigenvector used to rank the results can be the principal eigenvector or a secondary eigenvector.
- the matrices are generally normalized, stochastic matrices.
- the invention accommodates external subjective or objective judgment regarding the quality of a page in relation to it content or the number of linkages included in the page that are likely to be useful.
- the judgments are represented in attractor matrices to indicate desirable or “high quality” sites, while non-attractor matrices indicate sites that are undesirable.
- Attractor matrices and non-attractor matrices can be used alone or in combination with each other in the linear combination. Additional bias toward high quality sites, or away from undesirable sites, can be further introduced with probability weighting matrices for attractor and non-attractor matrices.
- Other known matrices such as a co-citation matrix or a bibliographic coupling matrix, can also be used in the present invention.
- Ranking the pages based on the eigenvector includes determining ranking categories based on the number of pages to be ranked, and classifying each page in one of the categories.
- a fixed amount of storage for representing the rank of each page is allotted.
- Each bit in the fixed amount of storage represents one of the categories and the rank of each page is represented by the bit assigned to the page.
- the eigenvector coefficients of neighboring pages can be used to generate a hub score for one or more of the pages. This ranking method requires a relatively small amount of storage and computational resources.
- the method of the invention can also be distributed as a computer program product.
- FIG. 1 is a block diagram of a hyperlinked environment that uses the invention.
- FIG. 2 is a flow diagram of a method for ranking pages in a search result in accordance with the invention.
- FIG. 2 a is a flow diagram of an example of matrices that may be used in a method for ranking pages in a search result in accordance with the invention.
- FIG. 3 is a flow diagram of a method for ranking pages in a search result according eigenvector coefficients in accordance with the invention.
- FIG. 1 shows a database environment 100 where the invention can be used.
- the database environment is an arrangement of client computers 110 and server computers 120 (generally “hosts”) connected to each other by a network 130 , for example, the Internet.
- the network 130 includes an application level interface called the World Wide Web (the “Web”) 131 .
- the Web 131 allows the clients 110 to access documents, for example, multi-media Web pages 121 maintained by the servers 120 . Typically, this is done with a Web browser application program (B) 114 executing in the client 110 .
- the location of each page 121 is indicated by an associated Universal Resource Locator (URL) 122 .
- URL Universal Resource Locator
- Many of the pages include “hyperlinks” 123 to other pages.
- the hyperlinks are also in the form of URLs.
- a search engine 140 can maintain an index 141 of Web pages in a memory, for example, disk storage.
- the search engine 140 returns a result set 112 which satisfies the terms (key words) of the query 111 .
- the result set 112 particularly when the query 111 is loosely specified, can include a large number of qualifying pages. These pages may, or may not related to the user's actual information need. Therefore, the order in which the result 112 set is presented to the client 110 is indicative of the usefulness of the search engine 140 . A good ranking process will return only “useful” pages before pages that are less so.
- the present invention provides an improved ranking method that can be implemented as part of a search engine 140 .
- the present method can be implemented by one of the clients 110 as part of the Web browser 114 .
- the present method uses content analysis, as well as connectivity analysis, to improve the ranking of pages in the result set 112 so that just pages related to a particular topic are identified.
- the present method uses the eigenvectors of a linear combination of stochastic matrices to rank the results of a query.
- the matrices capture the relationship of pages to one another to determine the relevance, or “quality”, of a page in relation to the topic searched and to other pages.
- the present method generates a neighborhood graph and adjacency matrix in process 200 .
- a collection C of Web-sites which pertain to a given topic t is assembled.
- a root set S of sites is obtained by applying a term based search engine to the query q. This is typically done using a search engine that is capable of finding pages related to topic t on the Web.
- One such suitable search engine relies on the assumption that related pages will tend to be “near” the selected page in the Web neighborhood graph, or that the same keywords will appear as part of the content of related pages.
- An initial page is selected from the plurality of pages. Pages linked to the initial page are represented as a graph in a memory.
- This search engine is further disclosed in copending U.S. patent application Ser. No. 09/131,473 entitled “Method For Identifying Related Pages In A Hyperlinked Database,” which application is assigned to the same assignee as the present application and is hereby incorporated in its entirety by reference.
- a base set C which consists of (a) sites in the root set S, (b) sites which point to a site in S, and (c) sites which are pointed to by a site in S.
- a search engine that stores linkage information, and support queries such as “which sites point to [a given url]” is used.
- One such suitable search engine is further disclosed in copending U.S. patent application Ser. No. 09/664,647 entitled “Web Page Connectivity Server,” which application is assigned to the same assignee as the present application and is hereby incorporated in its entirety by reference.
- the collection C and its link structure induce a directed graph G.
- G's nodes are the sites in C, and for all i, j that are members of C, the directed edge ij appears in G if and only if site i contains a hyperlink to site j. This forms a
- matrices to be included in a linear combination of matrices are determined.
- One or more of several different types of matrices that indicate some quality or relationship between the pages can be used in the linear combination.
- One example of such a matrix is referred to as an “attractor matrix,” which is formed by determining the sites in the adjacency matrix that are externally endorsed.
- a site can be externally endorsed in one of several ways. One way is for a human to view the site and provide an indication that the site includes information on the topic that is likely to be useful to a user. For example, pages related to well-known, pertinent, directories that include a large number links to informative sites are likely to be deemed “attractor sites.”
- Another way to externally endorse a site is through the use of a computerized utility program that analyzes the content and recognizes keywords, key phrases, page links, and/or other features to determine whether the page includes information that is likely to be useful to the user.
- the utility program generates the attractor matrix, and may also generate a probability matrix to bias selection of the attractor sites.
- both of the methods for identifying attractor sites can be performed offline and the results stored for later use by the search engine.
- the offline attractor matrices can be updated periodically to incorporate changes in the information available on the Web.
- attractor sites can be identified at run time in response to a user's query.
- a combination of offline and runtime attractor sites can also be used.
- non-attractor matrix Another example of a matrix that can be included in the linear combination is referred to as a “non-attractor matrix,” which is formed by determining the sites in the adjacency matrix that are externally deemed to be avoided. Similar to attractor sites, a non-attractor site can be externally identified by a human who has viewed the site and deemed it to provide information on the topic that is not likely to be useful to a user. For example, pages that include sexually explicit content would be non-attractor sites for a family-friendly query.
- the co-citation matrix, W T W is another matrix that can be included in the linear combination instead of, or in addition to, the attractor matrix, the non-attractor matrix, and the probability weighting matrices.
- Each element in the co-citation matrix is the number of sites which jointly cite the page indexed by i and j.
- Another matrix that can be used in the linear combination is the bibliographic coupling matrix, WW T , the elements of which provide the number of sites jointly referred to by the page indexed by i and j.
- W T W and WW T are well known matrices in the field of Bibliometrics.
- probabilities for weighting the matrices used in the linear combination are determined, as required.
- the attractor matrix can be weighted by a probability matrix that represents the probability of a user going toward each attractor site.
- the probability matrix is uniform (i.e., every row includes the same numbers).
- the non-attractor matrix can be weighted by a probability matrix that represents the probability of a user going toward each non-attractor site. Note that the weightings can be chosen so that non-attractor sites appear lower in the rankings than attractor sites, making it less likely that a user would visit non-attractor sites.
- the eigenvectors are used to rank the relevance, or “quality” of the sites, as indicated in process 210 .
- the matrix L has a principal eigenvector which corresponds to the eigenvalue of highest magnitude of the matrix that can be determined using one of several known suitable numerical methods.
- the principal eigenvector includes a number corresponding to each page in the graph.
- the quality of the page corresponds to the eigenvector number for the page, i.e., the higher the value of the eigenvector coefficient, the more useful the site is likely to be in terms of the quality being sought.
- FIG. 2 a shows an example of the present method forming a linear combination of attractor and non-attractor matrices, and associated probability matrices.
- processes 224 and 226 split non-attractor sites into sites that are located on the same host and sites that are located on remote hosts.
- the linear combination of matrices is then multiplied and the eigenvectors for the resulting matrix are found using known numerical techniques, as indicated in processes 234 and 236 .
- the eigenvectors are used to rank the relevance, or “quality” of the sites, as indicated in process 238 .
- FIG. 3 is a flowchart of a method for ranking the pages based on the eigenvector coefficients. Since the neighborhood graph may include millions of pages, it is important to find a way to represent the ranking of the pages using minimal storage space.
- the present method first determines the power low distribution of the eigenvector of interest, whether it is the principal eigenvector, or one of the secondary eigenvectors. The power low distribution is the number of sites whose eigenvector coefficients have a value that is less than a chosen number.
- a fixed number of bits represent the ranking of each page is then chosen in process 302 .
- the number of bits used per page depends on the amount of storage space available, the number of pages returned during the search, and the desired granularity of the rankings. In general, it is desirable to use the lowest number of bits per page as possible.
- the distribution of the pages' coefficients is analyzed using the low power distribution, and this distribution is used to determine the granularity of the categories of the pages in process 304 .
- the results of a query that includes half a billion sites can be distributed geometrically as follows.
- the first category, representing the highest ranked pages, is allotted 50 pages.
- the second category includes the next highest ranked pages, and is allotted a geometric multiple of 50 pages.
- the multiple can be based on the power low distribution, with the final category being allotted approximately one percent of the pages.
- each page is assigned to a category by designating a corresponding bit from a multi-bit word in process 306 . For example, if 10 bits per page are allotted for ranking, then 1024 categories are available and each page will be assigned to one of the 1024 categories.
- the eigenvectors can be used to generate a hub score for one or more pages, as indicated in process 308 .
- a hub score can be generated based on the sum, or a function of the sum, of the eigenvector coefficients of neighboring pages. The hub score thus provides an indication regarding the quality of the page as a hub, or directory of other pages that may provide information that is valuable to the user.
- the invention provides a method whereby the linear combination of matrices that provide information about the pages can be used to rank the pages. This allows results to be ranked based on two or more “page qualities” that are sought by the user, thus providing highly relevant results to the user.
- the invention accommodates external, subjective or objective judgment regarding the quality of a page in relation to it content or the number of linkages included in the page that are likely to be useful.
- the judgments are represented in attractor matrices to indicate desirable or “high quality” sites, while non-attractor matrices indicate sites that are undesirable.
- Attractor matrices and non-attractor matrices can be used alone or in combination with each other in the linear combination. Additional bias toward high quality sites, or away from undesirable sites, can be further introduced with probability weighting matrices for attractor and non-attractor matrices.
- signal bearing media include: recordable type media such as floppy disks and CD-ROM, transmission type media such as digital and analog communications links, as well as other media storage and distribution systems.
Abstract
A method and apparatus for ranking a plurality of pages identified during a search of a linked database includes forming a linear combination of two or more matrices, and using the coefficients of the eigenvector of the resulting matrix to rank the quality of the pages. The matrices includes information about the pages and are generally normalized, stochastic matrices. The linear combination can include attractor matrices that indicate desirable or “high quality” sites, and/or non-attractor matrices that indicate sites that are undesirable. Attractor matrices and non-attractor matrices can be used alone or in combination with each other in the linear combination. Additional bias toward high quality sites, or away from undesirable sites, can be further introduced with probability weighting matrices for attractor and non-attractor matrices. Other known matrices, such as a co-citation matrix or a bibliographic coupling matrix, can also be used in the present invention.
Description
- 1. Field of the Invention
- This invention relates generally to computerized information retrieval, and more particularly to identifying related pages in a hyperlinked database environment such as the World Wide Web.
- 2. Description of the Related Art
- It has become common for users of host computers connected to the World Wide Web (the “Web”) to employ Web browsers and search engines to locate Web pages having specific content of interest to users. A search engine, such as Digital Equipment Corporation's AltaVista search engine, indexes hundreds of millions of Web pages maintained by computers all over the world. The users of the hosts compose queries, and the search engine identifies pages that match the queries, e.g., pages that include key words of the queries. These pages are known as a “result set.” In many cases, particularly when a query is short or not well defined, the result set can be quite large, for example, thousands of pages. The pages in the result set may or may not satisfy the user's actual information needs. The vast majority of users are not interested in retrieving the entire huge set of resources. Most users will be quite satisfied with a few authoritative results which are highly relevant to the topic of the query. The challenge is to retrieve only the most relevant resources to the query.
- The Web is a hyperlinked collection. In addition to the textual content of the individual pages, the link structure of such collections contains information which can, and should, be tapped when searching for authoritative sources. Consider the significance of a link p. With such a link p suggests, or even recommends, that surfers visiting p follow the link and visit q. This may reflect the fact that pages p and q share a common topic of interest, and that the author of p thinks highly of q's content. Such a link, called an informative link, is p's way to confer authority on q. Note that informative links provide a positive critical assessment of q's contents which originates from outside the control of the author of q (as opposed to assessments based on q's textual content, which is under complete control of q's author).
- The vicinity of a Web page is defined by the hyperlinks that connect the page to others. A Web page can point to other pages, and the page can be pointed to by other pages. Close pages are directly linked, farther pages is are indirectly linked via intermediate pages. This connectivity can be expressed as a graph where nodes represent the pages, and the directed edges represent the links. The vicinity of all the pages in the result set, up to a certain distance, is called the neighborhood graph.
- Specifically, the Kleinberg algorithm attempts to identify “hub” pages and “authority” pages in the neighborhood graph for a user query. Hubs and authorities exhibit a mutually reinforcing relationship. The Kleinberg algorithm determines related pages starting with a single page. The algorithm works by first finding a set of pages that point to the page, and then running the base algorithm on the resulting graph. However, this algorithm for finding related pages does not deal with popular URLs, with neighborhood graphs containing duplicate pages, or with cases where the computation is totally dominated by a single “hub” page. The algorithm also does not include an analysis of the contents of pages when it is computing the most related pages.
- The Google search engine uses a feature called PageRank to prioritize the results of web keyword searches. The PageRank technique examines a single random walk on the entire Web. PageRank assumes page A has pages T1 . . . Tn which point to it (i.e., are citations). The parameter d is a damping factor which can be set between 0 and 1. Also C(A) is defined as the number of links going out of page A. The PageRank (PR) of a page A is given as follows:
PR(A)=(1−d)+d(PR(T1)/C(T1)+ . . . +PR(Tn)/C(Tn))
The PageRanks form a probability distribution over the web pages, so the sum of all web pages' PageRanks is one. PageRank or PR(A) corresponds to the principal eigenvector of the normalized link matrix of the web. The ranking of web sites is independent of the search query, and no distinction is made between hubs and authorities, as with the Kleinberg algorithm. There is also no provision for externally evaluating sites and using the evaluations to weigh the usefulness rankings. - Another method for ranking pages in a search result known in the art is disclosed in a paper entitled “The Stochastic Approach for Link-Structure Analysis (SALSA) and the TKC Effect”, by Ronny Lempel and Shlomo Moran, which is published on the Web at http://www9.org/w9cdrom/175/175.html.http://www9.org/w9cdrom/175/175.html The SALSA method examines random walks on graphs derived from the link structure among pages in a search result. While preserving the theme that Web sites pertaining to a given topic should be split to hubs and authorities, it replaces Kleinberg's Mutual Reinforcement method by a stochastic method, in which the coupling between hubs and authorities is less tight. The method is based on considering a bipartite graph G, whose two parts correspond to hubs and authorities, where an edge between hub r and authority s means that there is an informative link from r to s. Then, authorities and hubs pertaining to the dominant topic of the sites in G should be highly visible (reachable) from many sites in G. These sites are identified by examining certain random walks in G, under the proviso that such random walks will tend to visit these highly visible sites more frequently than other, less connected sites. The SALSA approach is based upon the theory of Markov chains, and relies on the stochastic properties of random walks performed on a collection of sites. It differs from Kleinberg's Mutual Reinforcement approach in the manner in which the association matrices are defined. The SALSA approach also initially assumes uniform probability over all pages, and relies on the random walk process to determine the likelihood that a particular page will be visited.
- It is therefore desireable to provide a method for ranking the relative quality, or relevance, of pages with respect to one another, that factors in the probability of a page being viewed without requiring a random walk.
- The invention provides a method whereby a linear combination of matrices that provide information about the pages can be used to rank the pages. This allows results to be ranked based on two or more “page qualities” that are sought by the user, thus providing highly relevant results to the user.
- In one embodiment, a method of ranking a plurality of pages identified during a search of a linked database is provided that includes:
-
- forming a linear combination of two or more matrices, wherein each matrix includes information about at least a portion of the plurality of pages;
- determining an eigenvector of the linear combination; and
- ranking the plurality of pages based on the eigenvector.
- The coefficients of the eigenvector provide a measure of the quality of each page in relation to the other pages. The eigenvector used to rank the results can be the principal eigenvector or a secondary eigenvector. The matrices are generally normalized, stochastic matrices.
- The invention accommodates external subjective or objective judgment regarding the quality of a page in relation to it content or the number of linkages included in the page that are likely to be useful. The judgments are represented in attractor matrices to indicate desirable or “high quality” sites, while non-attractor matrices indicate sites that are undesirable. Attractor matrices and non-attractor matrices can be used alone or in combination with each other in the linear combination. Additional bias toward high quality sites, or away from undesirable sites, can be further introduced with probability weighting matrices for attractor and non-attractor matrices. Other known matrices, such as a co-citation matrix or a bibliographic coupling matrix, can also be used in the present invention.
- Ranking the pages based on the eigenvector includes determining ranking categories based on the number of pages to be ranked, and classifying each page in one of the categories. A fixed amount of storage for representing the rank of each page is allotted. Each bit in the fixed amount of storage represents one of the categories and the rank of each page is represented by the bit assigned to the page. The eigenvector coefficients of neighboring pages can be used to generate a hub score for one or more of the pages. This ranking method requires a relatively small amount of storage and computational resources.
- The method of the invention can also be distributed as a computer program product.
- The foregoing has outlined rather broadly the objects, features, and technical advantages of the present invention so that the detailed description of the invention that follows may be better understood.
-
FIG. 1 is a block diagram of a hyperlinked environment that uses the invention. -
FIG. 2 is a flow diagram of a method for ranking pages in a search result in accordance with the invention. -
FIG. 2 a is a flow diagram of an example of matrices that may be used in a method for ranking pages in a search result in accordance with the invention. -
FIG. 3 is a flow diagram of a method for ranking pages in a search result according eigenvector coefficients in accordance with the invention. - The present invention may be better understood, and its numerous objects, features, and advantages made apparent to those skilled in the art by referencing the accompanying drawings. The use of the same reference symbols in different drawings indicates similar or identical items.
-
FIG. 1 shows adatabase environment 100 where the invention can be used. The database environment is an arrangement ofclient computers 110 and server computers 120 (generally “hosts”) connected to each other by anetwork 130, for example, the Internet. Thenetwork 130 includes an application level interface called the World Wide Web (the “Web”) 131. TheWeb 131 allows theclients 110 to access documents, for example,multi-media Web pages 121 maintained by theservers 120. Typically, this is done with a Web browser application program (B) 114 executing in theclient 110. The location of eachpage 121 is indicated by an associated Universal Resource Locator (URL) 122. Many of the pages include “hyperlinks” 123 to other pages. The hyperlinks are also in the form of URLs. - Although the invention is described with respect to documents that are Web pages, it should be understood that the invention can also be applied to any linked data objects of a database whose content and connectivity can be characterized.
- In order to help users locate Web pages of interest, a
search engine 140 can maintain anindex 141 of Web pages in a memory, for example, disk storage. In response to a query 111 composed by a user using the Web browser (B) 114, thesearch engine 140 returns a result set 112 which satisfies the terms (key words) of the query 111. Because thesearch engine 140 stores many millions of pages, the result set 112, particularly when the query 111 is loosely specified, can include a large number of qualifying pages. These pages may, or may not related to the user's actual information need. Therefore, the order in which theresult 112 set is presented to theclient 110 is indicative of the usefulness of thesearch engine 140. A good ranking process will return only “useful” pages before pages that are less so. - The present invention provides an improved ranking method that can be implemented as part of a
search engine 140. Alternatively, the present method can be implemented by one of theclients 110 as part of theWeb browser 114. The present method uses content analysis, as well as connectivity analysis, to improve the ranking of pages in the result set 112 so that just pages related to a particular topic are identified. - The present method uses the eigenvectors of a linear combination of stochastic matrices to rank the results of a query. The matrices capture the relationship of pages to one another to determine the relevance, or “quality”, of a page in relation to the topic searched and to other pages.
- Referring to
FIG. 2 , the present method generates a neighborhood graph and adjacency matrix inprocess 200. In one implementation, a collection C of Web-sites which pertain to a given topic t is assembled. A root set S of sites is obtained by applying a term based search engine to the query q. This is typically done using a search engine that is capable of finding pages related to topic t on the Web. One such suitable search engine relies on the assumption that related pages will tend to be “near” the selected page in the Web neighborhood graph, or that the same keywords will appear as part of the content of related pages. An initial page is selected from the plurality of pages. Pages linked to the initial page are represented as a graph in a memory. This search engine is further disclosed in copending U.S. patent application Ser. No. 09/131,473 entitled “Method For Identifying Related Pages In A Hyperlinked Database,” which application is assigned to the same assignee as the present application and is hereby incorporated in its entirety by reference. - From S a base set C is derived which consists of (a) sites in the root set S, (b) sites which point to a site in S, and (c) sites which are pointed to by a site in S. In order to obtain (b), a search engine that stores linkage information, and support queries such as “which sites point to [a given url]” is used. One such suitable search engine is further disclosed in copending U.S. patent application Ser. No. 09/664,647 entitled “Web Page Connectivity Server,” which application is assigned to the same assignee as the present application and is hereby incorporated in its entirety by reference.
- The collection C and its link structure induce a directed graph G. G's nodes are the sites in C, and for all i, j that are members of C, the directed edge ij appears in G if and only if site i contains a hyperlink to site j. This forms a |C|×|C| matrix that is referred to as the adjacency matrix of G.
- Other methods of generating the neighborhood graph and adjacency matrix can also be used in addition to, or instead of, the methods described hereinabove.
- In
process 202, matrices to be included in a linear combination of matrices are determined. One or more of several different types of matrices that indicate some quality or relationship between the pages can be used in the linear combination. One example of such a matrix is referred to as an “attractor matrix,” which is formed by determining the sites in the adjacency matrix that are externally endorsed. A site can be externally endorsed in one of several ways. One way is for a human to view the site and provide an indication that the site includes information on the topic that is likely to be useful to a user. For example, pages related to well-known, pertinent, directories that include a large number links to informative sites are likely to be deemed “attractor sites.” - Another way to externally endorse a site is through the use of a computerized utility program that analyzes the content and recognizes keywords, key phrases, page links, and/or other features to determine whether the page includes information that is likely to be useful to the user. The utility program generates the attractor matrix, and may also generate a probability matrix to bias selection of the attractor sites.
- Note that both of the methods for identifying attractor sites can be performed offline and the results stored for later use by the search engine. The offline attractor matrices can be updated periodically to incorporate changes in the information available on the Web. Alternatively, attractor sites can be identified at run time in response to a user's query. A combination of offline and runtime attractor sites can also be used.
- Another example of a matrix that can be included in the linear combination is referred to as a “non-attractor matrix,” which is formed by determining the sites in the adjacency matrix that are externally deemed to be avoided. Similar to attractor sites, a non-attractor site can be externally identified by a human who has viewed the site and deemed it to provide information on the topic that is not likely to be useful to a user. For example, pages that include sexually explicit content would be non-attractor sites for a family-friendly query.
- The co-citation matrix, WTW, is another matrix that can be included in the linear combination instead of, or in addition to, the attractor matrix, the non-attractor matrix, and the probability weighting matrices. Each element in the co-citation matrix is the number of sites which jointly cite the page indexed by i and j. Another matrix that can be used in the linear combination is the bibliographic coupling matrix, WWT, the elements of which provide the number of sites jointly referred to by the page indexed by i and j. WTW and WWT are well known matrices in the field of bibliometrics.
- In
process 204, probabilities for weighting the matrices used in the linear combination are determined, as required. For example, the attractor matrix can be weighted by a probability matrix that represents the probability of a user going toward each attractor site. The probability matrix is uniform (i.e., every row includes the same numbers). Similarly, the non-attractor matrix can be weighted by a probability matrix that represents the probability of a user going toward each non-attractor site. Note that the weightings can be chosen so that non-attractor sites appear lower in the rankings than attractor sites, making it less likely that a user would visit non-attractor sites. - The linear combination of matrices is then multiplied and the eigenvectors for the resulting matrix are found using known numerical techniques, as indicated in
processes - When results are output to the user, it is common for users to look at only the top ten or so sites to find the information they are seeking. Thus, it is important to rank the pages in the most useful order. In the present method, the eigenvectors are used to rank the relevance, or “quality” of the sites, as indicated in
process 210. The matrix L has a principal eigenvector which corresponds to the eigenvalue of highest magnitude of the matrix that can be determined using one of several known suitable numerical methods. The principal eigenvector includes a number corresponding to each page in the graph. The quality of the page corresponds to the eigenvector number for the page, i.e., the higher the value of the eigenvector coefficient, the more useful the site is likely to be in terms of the quality being sought. - Notably, other eigenvectors beside the principle eigenvector can also be used to rank the pages, instead of or in addition to, the ranking achieved with the principle eigenvector.
-
FIG. 2 a shows an example of the present method forming a linear combination of attractor and non-attractor matrices, and associated probability matrices. Once the neighborhood graph and adjacency matrix is generated inprocess 218, processes 220 and 222 split the attractor matrix into sites that are located on the same server, or host, and sites that are located on remote servers or hosts. - The rational for splitting the matrix is that sites that are located on the same host are deemed to be related to one another, making it more likely that the information on the site would be useful. Thus, the related sites can be weighted more heavily in
process 224 so that the site appears higher in the rankings and increases the probability of the user visiting them. Similarly, processes 224 and 226 split non-attractor sites into sites that are located on the same host and sites that are located on remote hosts. - In processes 228 and 230, related non-attractor sites on the same host can also be weighted.
- The linear combination of matrices is then multiplied and the eigenvectors for the resulting matrix are found using known numerical techniques, as indicated in
processes -
FIG. 3 is a flowchart of a method for ranking the pages based on the eigenvector coefficients. Since the neighborhood graph may include millions of pages, it is important to find a way to represent the ranking of the pages using minimal storage space. Inprocess 300, the present method first determines the power low distribution of the eigenvector of interest, whether it is the principal eigenvector, or one of the secondary eigenvectors. The power low distribution is the number of sites whose eigenvector coefficients have a value that is less than a chosen number. - A fixed number of bits represent the ranking of each page is then chosen in
process 302. The number of bits used per page depends on the amount of storage space available, the number of pages returned during the search, and the desired granularity of the rankings. In general, it is desirable to use the lowest number of bits per page as possible. - The distribution of the pages' coefficients is analyzed using the low power distribution, and this distribution is used to determine the granularity of the categories of the pages in
process 304. For example, the results of a query that includes half a billion sites can be distributed geometrically as follows. The first category, representing the highest ranked pages, is allotted 50 pages. The second category includes the next highest ranked pages, and is allotted a geometric multiple of 50 pages. The multiple can be based on the power low distribution, with the final category being allotted approximately one percent of the pages. Then, each page is assigned to a category by designating a corresponding bit from a multi-bit word inprocess 306. For example, if 10 bits per page are allotted for ranking, then 1024 categories are available and each page will be assigned to one of the 1024 categories. - Another aspect of the present invention is that the eigenvectors can be used to generate a hub score for one or more pages, as indicated in process 308. A hub score can be generated based on the sum, or a function of the sum, of the eigenvector coefficients of neighboring pages. The hub score thus provides an indication regarding the quality of the page as a hub, or directory of other pages that may provide information that is valuable to the user.
- Advantages and Applications
- The invention provides a method whereby the linear combination of matrices that provide information about the pages can be used to rank the pages. This allows results to be ranked based on two or more “page qualities” that are sought by the user, thus providing highly relevant results to the user.
- The invention accommodates external, subjective or objective judgment regarding the quality of a page in relation to it content or the number of linkages included in the page that are likely to be useful. The judgments are represented in attractor matrices to indicate desirable or “high quality” sites, while non-attractor matrices indicate sites that are undesirable. Attractor matrices and non-attractor matrices can be used alone or in combination with each other in the linear combination. Additional bias toward high quality sites, or away from undesirable sites, can be further introduced with probability weighting matrices for attractor and non-attractor matrices.
- The present invention also includes an efficient ranking method that requires a relatively small amount of storage and computational resources.
- Those skilled in the art will appreciate that the present invention is capable of being distributed as a program product in a variety of forms, and that the present invention applies equally regardless of the particular type of signal bearing media used to actually carry out the distribution. Examples of signal bearing media include: recordable type media such as floppy disks and CD-ROM, transmission type media such as digital and analog communications links, as well as other media storage and distribution systems.
- Additionally, the foregoing detailed description has set forth various embodiments of the present invention via the use of block diagrams, flowcharts, and examples. It will be understood by those within the art that each block diagram component, flowchart step, and operations and/or components illustrated by the use of examples can be implemented, individually and/or collectively, by a wide range of hardware, software, firmware, or any combination thereof. In one embodiment, the present invention may be implemented via Application Specific Integrated Circuits (ASICs). However, those skilled in the art will recognize that the embodiments disclosed herein, in whole or in part, can be equivalently implemented in standard Integrated Circuits, as a computer program running on a computer, as firmware, or as virtually any combination thereof and that designing the circuitry and/or writing the code for the software or firmware would be well within the skill of one of ordinary skill in the art in light of this disclosure.
- While the invention has been described with respect to the embodiments and variations set forth above, these embodiments and variations are illustrative and the invention is not to be considered limited in scope to these embodiments and variations. Accordingly, various other embodiments and modifications and improvements not described herein may be within the spirit and scope of the present invention, as defined by the following claims.
Claims (39)
1. A method of ranking a plurality of pages identified during a search of a linked database, the method comprising:
forming a linear combination of two or more matrices, wherein each matrix includes information about at least a portion of the plurality of pages;
determining an eigenvector of the linear combination; and
ranking the plurality of pages based on the eigenvector.
2. The method, as set forth in claim 1 , wherein the eigenvector is the principal eigenvector.
3. The method, as set forth in claim 1 , wherein the matrices are stochastic matrices.
4. The method, as set forth in claim 1 , wherein at least one of the matrices is an attractor matrix.
5. The method, as set forth in claim 4 , wherein at least one of the matrices is a probability matrix for weighting the attractor matrix.
6. The method, as set forth in claim 1 , wherein at least one of the matrices is a non-attractor matrix.
7. The method, as set forth in claim 6 , wherein at least one of the matrices is a probability matrix for weighting the non-attractor matrix.
8. The method, as set forth in claim 1 , wherein at least one of the matrices is a co-citation matrix.
9. The method, as set forth in claim 1 , wherein at least one of the matrices is a bibliographic coupling matrix.
10. The method, as set forth in claim 1 , wherein ranking the plurality of pages based on the eigenvector comprises:
determining ranking categories based on the number of pages to be ranked; and
classifying each page in one of the categories.
11. The method, as set forth in claim 10 , further comprising:
allotting a fixed amount of storage for representing the rank of each page.
12. The method, as set forth in claim 10 , wherein each bit in the fixed amount of storage represents one of the categories and the rank of each page is represented by the bit assigned to the page.
13. The method, as set forth in claim 1 , further comprising:
combining eigenvector coefficients of neighboring pages to generate a hub score for at least one of the plurality of pages.
14. A computer program product for ranking a plurality of pages identified during a search of a linked database, the product comprising:
first program instructions for forming a linear combination of two or more matrices, wherein each matrix includes information about at least a portion of the plurality of pages;
second program instructions for determining an eigenvector of the linear combination; and
third program instructions for ranking the plurality of pages based on the eigenvector.
15. The product, as set forth in claim 14 , wherein the eigenvector is the principal eigenvector.
16. The product, as set forth in claim 14 , wherein the matrices are stochastic matrices.
17. The product, as set forth in claim 14 , wherein at least one of the matrices is an attractor matrix.
18. The product, as set forth in claim 17 , wherein at least one of the matrices is a probability matrix for weighting the attractor matrix.
19. The product, as set forth in claim 14 , wherein at least one of the matrices is a non-attractor matrix.
20. The product, as set forth in claim 19 , wherein at least one of the matrices is a probability matrix for weighting the non-attractor matrix.
21. The product, as set forth in claim 14 , wherein at least one of the matrices is a co-citation matrix.
22. The product, as set forth in claim 14 , wherein at least one of the matrices is a bibliographic coupling matrix.
23. The product, as set forth in claim 14 , wherein the third program are further operable to determine ranking categories based on the number of pages to be ranked; and classify each page in one of the categories.
24. The product, as set forth in claim 23 , wherein the third program instructions are further operable to allot a fixed amount of storage for representing the rank of each page.
25. The product, as set forth in claim 24 , wherein each bit in the fixed amount of storage represents one of the categories and the rank of each page is represented by the bit assigned to the page.
26. The product, as set forth in claim 14 , further comprising:
fourth program instructions for combining eigenvector coefficients of neighboring pages to generate a hub score for at least one of the plurality of pages.
27. A device for ranking a plurality of pages identified during a search of a linked database, the device comprising:
means for forming a linear combination of two or more matrices, wherein each matrix includes information about at least a portion of the plurality of pages;
means for determining an eigenvector of the linear combination; and
means for ranking the plurality of pages based on the eigenvector.
28. The device, as set forth in claim 27 , wherein the eigenvector is the principal eigenvector.
29. The device, as set forth in claim 27 , wherein the matrices are stochastic matrices.
30. The device, as set forth in claim 27 , wherein at least one of the matrices is an attractor matrix.
31. The device, as set forth in claim 30 , wherein at least one of the matrices is a probability matrix for weighting the attractor matrix.
32. The device, as set forth in claim 27 , wherein at least one of the matrices is a non-attractor matrix.
33. The device, as set forth in claim 32 , wherein at least one of the matrices is a probability matrix for weighting the non-attractor matrix.
34. The device, as set forth in claim 27 , wherein at least one of the matrices is a co-citation matrix.
35. The device, as set forth in claim 27 , wherein at least one of the matrices is a bibliographic coupling matrix.
36. The device, as set forth in claim 27 , wherein the means for ranking the plurality of pages based on the eigenvector comprises:
means for determining raking categories based on the number of pages to be ranked; and
means for classifying each page in one of the categories.
37. The device, as set forth in claim 36 , further comprising:
means for allotting a fixed amount of storage for representing the rank of each page.
38. The device, as set forth in claim 36 , wherein each bit in the fixed amount of storage represents one of the categories and the rank of each page is represented by the bit assigned to the page.
39. The device, as set forth in claim 27 , further comprising:
means for combining eigenvector coefficients of neighboring pages to generate a hub score for at least one of the plurality of pages.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/974,483 US20050165757A1 (en) | 2000-10-25 | 2004-10-27 | Method and apparatus for ranking web page search results |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/696,922 US6560600B1 (en) | 2000-10-25 | 2000-10-25 | Method and apparatus for ranking Web page search results |
US10/431,644 US6871202B2 (en) | 2000-10-25 | 2003-05-06 | Method and apparatus for ranking web page search results |
US10/974,483 US20050165757A1 (en) | 2000-10-25 | 2004-10-27 | Method and apparatus for ranking web page search results |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/431,644 Continuation US6871202B2 (en) | 2000-10-25 | 2003-05-06 | Method and apparatus for ranking web page search results |
Publications (1)
Publication Number | Publication Date |
---|---|
US20050165757A1 true US20050165757A1 (en) | 2005-07-28 |
Family
ID=24799063
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/696,922 Expired - Lifetime US6560600B1 (en) | 2000-10-25 | 2000-10-25 | Method and apparatus for ranking Web page search results |
US10/431,644 Expired - Lifetime US6871202B2 (en) | 2000-10-25 | 2003-05-06 | Method and apparatus for ranking web page search results |
US10/974,483 Abandoned US20050165757A1 (en) | 2000-10-25 | 2004-10-27 | Method and apparatus for ranking web page search results |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/696,922 Expired - Lifetime US6560600B1 (en) | 2000-10-25 | 2000-10-25 | Method and apparatus for ranking Web page search results |
US10/431,644 Expired - Lifetime US6871202B2 (en) | 2000-10-25 | 2003-05-06 | Method and apparatus for ranking web page search results |
Country Status (1)
Country | Link |
---|---|
US (3) | US6560600B1 (en) |
Cited By (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060072812A1 (en) * | 2004-09-15 | 2006-04-06 | Council Of Scientific And Industrial Research | Computer based method for finding the effect of an element in a domain of N-dimensional function with a provision for N‘dimensions |
US20060242139A1 (en) * | 2005-04-21 | 2006-10-26 | Yahoo! Inc. | Interestingness ranking of media objects |
US20060242178A1 (en) * | 2005-04-21 | 2006-10-26 | Yahoo! Inc. | Media object metadata association and ranking |
US20080016072A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Enterprise-Based Tag System |
US20080016098A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Using Tags in an Enterprise Search System |
US20080016053A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Administration Console to Select Rank Factors |
US20080016071A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Using Connections Between Users, Tags and Documents to Rank Documents in an Enterprise Search System |
US20080016061A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Using a Core Data Structure to Calculate Document Ranks |
US20080016052A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Using Connections Between Users and Documents to Rank Documents in an Enterprise Search System |
WO2008010849A2 (en) * | 2006-07-14 | 2008-01-24 | Bea Systems, Inc. | Improved enterprise search system |
WO2008010848A2 (en) * | 2006-07-14 | 2008-01-24 | Bea Systems, Inc. | Improved enterprise search system |
US20080243813A1 (en) * | 2007-03-30 | 2008-10-02 | Microsoft Corporation | Look-ahead document ranking system |
US20090157643A1 (en) * | 2007-12-12 | 2009-06-18 | Microsoft Corporation | Semi-supervised part-of-speech tagging |
US20100082563A1 (en) * | 2008-09-30 | 2010-04-01 | International Business Machines Corporation | System impact search engine |
US20110078148A1 (en) * | 2009-09-28 | 2011-03-31 | Fong Chin Lung | System, method and apparatus for information retrieval and data representation |
US20120271833A1 (en) * | 2011-04-21 | 2012-10-25 | Microsoft Corporation | Hybrid neighborhood graph search for scalable visual indexing |
US8645380B2 (en) | 2010-11-05 | 2014-02-04 | Microsoft Corporation | Optimized KD-tree for scalable search |
US11134054B2 (en) | 2019-11-05 | 2021-09-28 | International Business Machines Corporation | Classification of a domain name |
US11803918B2 (en) | 2015-07-07 | 2023-10-31 | Oracle International Corporation | System and method for identifying experts on arbitrary topics in an enterprise social network |
Families Citing this family (225)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7493553B1 (en) | 1998-12-29 | 2009-02-17 | Intel Corporation | Structured web advertising |
US6556992B1 (en) * | 1999-09-14 | 2003-04-29 | Patent Ratings, Llc | Method and system for rating patents and other intangible assets |
US20090259506A1 (en) * | 1999-09-14 | 2009-10-15 | Barney Jonathan A | Method and system for rating patents and other intangible assets |
US6754873B1 (en) * | 1999-09-20 | 2004-06-22 | Google Inc. | Techniques for finding related hyperlinked documents using link-based analysis |
US8127220B1 (en) | 1999-12-15 | 2012-02-28 | Google Inc. | Scoring links in a document |
US8271316B2 (en) * | 1999-12-17 | 2012-09-18 | Buzzmetrics Ltd | Consumer to business data capturing system |
US6883135B1 (en) | 2000-01-28 | 2005-04-19 | Microsoft Corporation | Proxy server using a statistical model |
US7047229B2 (en) * | 2000-08-08 | 2006-05-16 | America Online, Inc. | Searching content on web pages |
US7007008B2 (en) * | 2000-08-08 | 2006-02-28 | America Online, Inc. | Category searching |
US7359951B2 (en) | 2000-08-08 | 2008-04-15 | Aol Llc, A Delaware Limited Liability Company | Displaying search results |
US7225180B2 (en) * | 2000-08-08 | 2007-05-29 | Aol Llc | Filtering search results |
US20060074727A1 (en) | 2000-09-07 | 2006-04-06 | Briere Daniel D | Method and apparatus for collection and dissemination of information over a computer network |
US6701317B1 (en) * | 2000-09-19 | 2004-03-02 | Overture Services, Inc. | Web page connectivity server construction |
US7197470B1 (en) * | 2000-10-11 | 2007-03-27 | Buzzmetrics, Ltd. | System and method for collection analysis of electronic discussion methods |
US6560600B1 (en) * | 2000-10-25 | 2003-05-06 | Alta Vista Company | Method and apparatus for ranking Web page search results |
US7174453B2 (en) | 2000-12-29 | 2007-02-06 | America Online, Inc. | Message screening system |
US7356530B2 (en) * | 2001-01-10 | 2008-04-08 | Looksmart, Ltd. | Systems and methods of retrieving relevant information |
US20020120714A1 (en) * | 2001-02-26 | 2002-08-29 | Borislav Agapiev | Distributed-code, custom-generated dynamic internet inclusion agent |
US7171415B2 (en) * | 2001-05-04 | 2007-01-30 | Sun Microsystems, Inc. | Distributed information discovery through searching selected registered information providers |
US7013303B2 (en) * | 2001-05-04 | 2006-03-14 | Sun Microsystems, Inc. | System and method for multiple data sources to plug into a standardized interface for distributed deep search |
US7099871B2 (en) * | 2001-05-04 | 2006-08-29 | Sun Microsystems, Inc. | System and method for distributed real-time search |
US6961723B2 (en) * | 2001-05-04 | 2005-11-01 | Sun Microsystems, Inc. | System and method for determining relevancy of query responses in a distributed network search mechanism |
US6934702B2 (en) * | 2001-05-04 | 2005-08-23 | Sun Microsystems, Inc. | Method and system of routing messages in a distributed search network |
US6950821B2 (en) * | 2001-05-04 | 2005-09-27 | Sun Microsystems, Inc. | System and method for resolving distributed network search queries to information providers |
US7272594B1 (en) | 2001-05-31 | 2007-09-18 | Autonomy Corporation Ltd. | Method and apparatus to link to a related document |
US20030005046A1 (en) * | 2001-06-06 | 2003-01-02 | Lagniappe Marketing | System and method for managing marketing applications for a website |
US7076483B2 (en) * | 2001-08-27 | 2006-07-11 | Xyleme Sa | Ranking nodes in a graph |
US8590013B2 (en) | 2002-02-25 | 2013-11-19 | C. S. Lee Crawford | Method of managing and communicating data pertaining to software applications for processor-based devices comprising wireless communication circuitry |
US7693830B2 (en) | 2005-08-10 | 2010-04-06 | Google Inc. | Programmable search engine |
US7743045B2 (en) * | 2005-08-10 | 2010-06-22 | Google Inc. | Detecting spam related and biased contexts for programmable search engines |
US7716199B2 (en) | 2005-08-10 | 2010-05-11 | Google Inc. | Aggregating context data for programmable search engines |
US7089252B2 (en) * | 2002-04-25 | 2006-08-08 | International Business Machines Corporation | System and method for rapid computation of PageRank |
US7167871B2 (en) * | 2002-05-17 | 2007-01-23 | Xerox Corporation | Systems and methods for authoritativeness grading, estimation and sorting of documents in large heterogeneous document collections |
US7640336B1 (en) | 2002-12-30 | 2009-12-29 | Aol Llc | Supervising user interaction with online services |
US20040143644A1 (en) * | 2003-01-21 | 2004-07-22 | Nec Laboratories America, Inc. | Meta-search engine architecture |
US20050188300A1 (en) * | 2003-03-21 | 2005-08-25 | Xerox Corporation | Determination of member pages for a hyperlinked document with link and document analysis |
US20040237037A1 (en) * | 2003-03-21 | 2004-11-25 | Xerox Corporation | Determination of member pages for a hyperlinked document with recursive page-level link analysis |
US7216123B2 (en) * | 2003-03-28 | 2007-05-08 | Board Of Trustees Of The Leland Stanford Junior University | Methods for ranking nodes in large directed graphs |
US7028029B2 (en) * | 2003-03-28 | 2006-04-11 | Google Inc. | Adaptive computation of ranking |
US7194466B2 (en) * | 2003-05-01 | 2007-03-20 | Microsoft Corporation | Object clustering using inter-layer links |
US7792828B2 (en) | 2003-06-25 | 2010-09-07 | Jericho Systems Corporation | Method and system for selecting content items to be presented to a viewer |
US7509344B1 (en) | 2003-08-18 | 2009-03-24 | Google Inc. | Method for detecting link spam in hyperlinked databases |
US8321400B2 (en) * | 2003-08-29 | 2012-11-27 | Vortaloptics, Inc. | Method, device and software for querying and presenting search results |
US7440964B2 (en) * | 2003-08-29 | 2008-10-21 | Vortaloptics, Inc. | Method, device and software for querying and presenting search results |
US20050222989A1 (en) * | 2003-09-30 | 2005-10-06 | Taher Haveliwala | Results based personalization of advertisements in a search engine |
US8321278B2 (en) * | 2003-09-30 | 2012-11-27 | Google Inc. | Targeted advertisements based on user profiles and page profile |
US7281005B2 (en) * | 2003-10-20 | 2007-10-09 | Telenor Asa | Backward and forward non-normalized link weight analysis method, system, and computer program product |
US7464075B2 (en) * | 2004-01-05 | 2008-12-09 | Microsoft Corporation | Personalization of web page search rankings |
GB2411014A (en) * | 2004-02-11 | 2005-08-17 | Autonomy Corp Ltd | Automatic searching for relevant information |
US20050203924A1 (en) * | 2004-03-13 | 2005-09-15 | Rosenberg Gerald B. | System and methods for analytic research and literate reporting of authoritative document collections |
US8595146B1 (en) | 2004-03-15 | 2013-11-26 | Aol Inc. | Social networking permissions |
US7725414B2 (en) | 2004-03-16 | 2010-05-25 | Buzzmetrics, Ltd An Israel Corporation | Method for developing a classifier for classifying communications |
US7584221B2 (en) * | 2004-03-18 | 2009-09-01 | Microsoft Corporation | Field weighting in text searching |
US7716223B2 (en) | 2004-03-29 | 2010-05-11 | Google Inc. | Variable personalization of search results in a search engine |
US7260568B2 (en) * | 2004-04-15 | 2007-08-21 | Microsoft Corporation | Verifying relevance between keywords and web site contents |
US7289985B2 (en) | 2004-04-15 | 2007-10-30 | Microsoft Corporation | Enhanced document retrieval |
US7689585B2 (en) | 2004-04-15 | 2010-03-30 | Microsoft Corporation | Reinforced clustering of multi-type data objects for search term suggestion |
US7305389B2 (en) * | 2004-04-15 | 2007-12-04 | Microsoft Corporation | Content propagation for enhanced document retrieval |
US7366705B2 (en) | 2004-04-15 | 2008-04-29 | Microsoft Corporation | Clustering based text classification |
US7565630B1 (en) | 2004-06-15 | 2009-07-21 | Google Inc. | Customization of search results for search queries received from third party sites |
US7379947B2 (en) * | 2004-07-30 | 2008-05-27 | Microsoft Corporation | Efficiently ranking web pages via matrix index manipulation and improved caching |
US20060036598A1 (en) * | 2004-08-09 | 2006-02-16 | Jie Wu | Computerized method for ranking linked information items in distributed sources |
US7493320B2 (en) | 2004-08-16 | 2009-02-17 | Telenor Asa | Method, system, and computer program product for ranking of documents using link analysis, with remedies for sinks |
WO2006033763A2 (en) | 2004-09-16 | 2006-03-30 | Telenor Asa | A method, system, and computer program product for searching for, navigating among, and ranking of documents in a personal web |
US20060074910A1 (en) * | 2004-09-17 | 2006-04-06 | Become, Inc. | Systems and methods of retrieving topic specific information |
US7340672B2 (en) * | 2004-09-20 | 2008-03-04 | Intel Corporation | Providing data integrity for data streams |
US7606793B2 (en) | 2004-09-27 | 2009-10-20 | Microsoft Corporation | System and method for scoping searches using index keys |
US7761448B2 (en) | 2004-09-30 | 2010-07-20 | Microsoft Corporation | System and method for ranking search results using click distance |
US7739277B2 (en) * | 2004-09-30 | 2010-06-15 | Microsoft Corporation | System and method for incorporating anchor text into ranking search results |
US7827181B2 (en) * | 2004-09-30 | 2010-11-02 | Microsoft Corporation | Click distance determination |
WO2006039566A2 (en) | 2004-09-30 | 2006-04-13 | Intelliseek, Inc. | Topical sentiments in electronically stored communications |
US7779001B2 (en) * | 2004-10-29 | 2010-08-17 | Microsoft Corporation | Web page ranking with hierarchical considerations |
US7574409B2 (en) * | 2004-11-04 | 2009-08-11 | Vericept Corporation | Method, apparatus, and system for clustering and classification |
US20060123014A1 (en) * | 2004-12-07 | 2006-06-08 | David Ng | Ranking Internet Search Results Based on Number of Mobile Device Visits to Physical Locations Related to the Search Results |
US7716198B2 (en) * | 2004-12-21 | 2010-05-11 | Microsoft Corporation | Ranking search results using feature extraction |
US7797344B2 (en) * | 2004-12-23 | 2010-09-14 | Become, Inc. | Method for assigning relative quality scores to a collection of linked documents |
US7668822B2 (en) * | 2004-12-23 | 2010-02-23 | Become, Inc. | Method for assigning quality scores to documents in a linked database |
US7792811B2 (en) * | 2005-02-16 | 2010-09-07 | Transaxtions Llc | Intelligent search with guiding info |
US20060200461A1 (en) * | 2005-03-01 | 2006-09-07 | Lucas Marshall D | Process for identifying weighted contextural relationships between unrelated documents |
US7792833B2 (en) * | 2005-03-03 | 2010-09-07 | Microsoft Corporation | Ranking search results using language types |
US20060200460A1 (en) * | 2005-03-03 | 2006-09-07 | Microsoft Corporation | System and method for ranking search results using file types |
US20060282455A1 (en) * | 2005-06-13 | 2006-12-14 | It Interactive Services Inc. | System and method for ranking web content |
US8996514B1 (en) | 2005-06-15 | 2015-03-31 | Google Inc. | Mobile to non-mobile document correlation |
US9158855B2 (en) | 2005-06-16 | 2015-10-13 | Buzzmetrics, Ltd | Extracting structured data from weblogs |
US20070100779A1 (en) * | 2005-08-05 | 2007-05-03 | Ori Levy | Method and system for extracting web data |
US7599917B2 (en) | 2005-08-15 | 2009-10-06 | Microsoft Corporation | Ranking search results using biased click distance |
US8719255B1 (en) | 2005-08-23 | 2014-05-06 | Amazon Technologies, Inc. | Method and system for determining interest levels of online content based on rates of change of content access |
US7860895B1 (en) | 2005-08-23 | 2010-12-28 | Amazon Technologies, Inc. | Method and system for determining interest spaces among online content sources |
US7949581B2 (en) * | 2005-09-07 | 2011-05-24 | Patentratings, Llc | Method of determining an obsolescence rate of a technology |
US20080215614A1 (en) * | 2005-09-08 | 2008-09-04 | Slattery Michael J | Pyramid Information Quantification or PIQ or Pyramid Database or Pyramided Database or Pyramided or Selective Pressure Database Management System |
US7577665B2 (en) * | 2005-09-14 | 2009-08-18 | Jumptap, Inc. | User characteristic influenced search results |
US20080214153A1 (en) * | 2005-09-14 | 2008-09-04 | Jorey Ramer | Mobile User Profile Creation based on User Browse Behaviors |
US10038756B2 (en) | 2005-09-14 | 2018-07-31 | Millenial Media LLC | Managing sponsored content based on device characteristics |
US8229914B2 (en) | 2005-09-14 | 2012-07-24 | Jumptap, Inc. | Mobile content spidering and compatibility determination |
US8660891B2 (en) | 2005-11-01 | 2014-02-25 | Millennial Media | Interactive mobile advertisement banners |
US20080214151A1 (en) * | 2005-09-14 | 2008-09-04 | Jorey Ramer | Methods and systems for mobile coupon placement |
US20070073718A1 (en) * | 2005-09-14 | 2007-03-29 | Jorey Ramer | Mobile search service instant activation |
US8503995B2 (en) | 2005-09-14 | 2013-08-06 | Jumptap, Inc. | Mobile dynamic advertisement creation and placement |
US8103545B2 (en) * | 2005-09-14 | 2012-01-24 | Jumptap, Inc. | Managing payment for sponsored content presented to mobile communication facilities |
US20080214204A1 (en) * | 2005-11-01 | 2008-09-04 | Jorey Ramer | Similarity based location mapping of mobile comm facility users |
US8819659B2 (en) | 2005-09-14 | 2014-08-26 | Millennial Media, Inc. | Mobile search service instant activation |
US8688671B2 (en) | 2005-09-14 | 2014-04-01 | Millennial Media | Managing sponsored content based on geographic region |
US9703892B2 (en) | 2005-09-14 | 2017-07-11 | Millennial Media Llc | Predictive text completion for a mobile communication facility |
US20070073719A1 (en) * | 2005-09-14 | 2007-03-29 | Jorey Ramer | Physical navigation of a mobile search application |
US20070061303A1 (en) * | 2005-09-14 | 2007-03-15 | Jorey Ramer | Mobile search result clustering |
US8195133B2 (en) | 2005-09-14 | 2012-06-05 | Jumptap, Inc. | Mobile dynamic advertisement creation and placement |
US8131271B2 (en) | 2005-11-05 | 2012-03-06 | Jumptap, Inc. | Categorization of a mobile user profile based on browse behavior |
US20070073717A1 (en) * | 2005-09-14 | 2007-03-29 | Jorey Ramer | Mobile comparison shopping |
US7752209B2 (en) | 2005-09-14 | 2010-07-06 | Jumptap, Inc. | Presenting sponsored content on a mobile communication facility |
US20070061246A1 (en) * | 2005-09-14 | 2007-03-15 | Jorey Ramer | Mobile campaign creation |
US20070061247A1 (en) * | 2005-09-14 | 2007-03-15 | Jorey Ramer | Expected value and prioritization of mobile content |
US8364540B2 (en) * | 2005-09-14 | 2013-01-29 | Jumptap, Inc. | Contextual targeting of content using a monetization platform |
US8156128B2 (en) | 2005-09-14 | 2012-04-10 | Jumptap, Inc. | Contextual mobile content placement on a mobile communication facility |
US20070100653A1 (en) * | 2005-11-01 | 2007-05-03 | Jorey Ramer | Mobile website analyzer |
US7660581B2 (en) | 2005-09-14 | 2010-02-09 | Jumptap, Inc. | Managing sponsored content based on usage history |
US8615719B2 (en) | 2005-09-14 | 2013-12-24 | Jumptap, Inc. | Managing sponsored content for delivery to mobile communication facilities |
US20080215557A1 (en) * | 2005-11-05 | 2008-09-04 | Jorey Ramer | Methods and systems of mobile query classification |
US9076175B2 (en) | 2005-09-14 | 2015-07-07 | Millennial Media, Inc. | Mobile comparison shopping |
US20070100806A1 (en) * | 2005-11-01 | 2007-05-03 | Jorey Ramer | Client libraries for mobile content |
US8290810B2 (en) * | 2005-09-14 | 2012-10-16 | Jumptap, Inc. | Realtime surveying within mobile sponsored content |
US8364521B2 (en) * | 2005-09-14 | 2013-01-29 | Jumptap, Inc. | Rendering targeted advertisement on mobile communication facilities |
US20070061317A1 (en) * | 2005-09-14 | 2007-03-15 | Jorey Ramer | Mobile search substring query completion |
US20070100652A1 (en) * | 2005-11-01 | 2007-05-03 | Jorey Ramer | Mobile pay per call |
US20070061242A1 (en) * | 2005-09-14 | 2007-03-15 | Jorey Ramer | Implicit searching for mobile content |
US8989718B2 (en) | 2005-09-14 | 2015-03-24 | Millennial Media, Inc. | Idle screen advertising |
US8515401B2 (en) | 2005-09-14 | 2013-08-20 | Jumptap, Inc. | System for targeting advertising content to a plurality of mobile communication facilities |
US7702318B2 (en) * | 2005-09-14 | 2010-04-20 | Jumptap, Inc. | Presentation of sponsored content based on mobile transaction event |
US20070239724A1 (en) * | 2005-09-14 | 2007-10-11 | Jorey Ramer | Mobile search services related to direct identifiers |
US20080214154A1 (en) * | 2005-11-01 | 2008-09-04 | Jorey Ramer | Associating mobile and non mobile web content |
US9201979B2 (en) | 2005-09-14 | 2015-12-01 | Millennial Media, Inc. | Syndication of a behavioral profile associated with an availability condition using a monetization platform |
US7548915B2 (en) | 2005-09-14 | 2009-06-16 | Jorey Ramer | Contextual mobile content placement on a mobile communication facility |
US20070100651A1 (en) * | 2005-11-01 | 2007-05-03 | Jorey Ramer | Mobile payment facilitation |
US20080214152A1 (en) * | 2005-09-14 | 2008-09-04 | Jorey Ramer | Methods and systems of mobile dynamic content presentation |
US8311888B2 (en) | 2005-09-14 | 2012-11-13 | Jumptap, Inc. | Revenue models associated with syndication of a behavioral profile using a monetization platform |
US8238888B2 (en) * | 2006-09-13 | 2012-08-07 | Jumptap, Inc. | Methods and systems for mobile coupon placement |
US8666376B2 (en) * | 2005-09-14 | 2014-03-04 | Millennial Media | Location based mobile shopping affinity program |
US10911894B2 (en) | 2005-09-14 | 2021-02-02 | Verizon Media Inc. | Use of dynamic content generation parameters based on previous performance of those parameters |
US8812526B2 (en) | 2005-09-14 | 2014-08-19 | Millennial Media, Inc. | Mobile content cross-inventory yield optimization |
US8805339B2 (en) | 2005-09-14 | 2014-08-12 | Millennial Media, Inc. | Categorization of a mobile user profile based on browse and viewing behavior |
US7603360B2 (en) * | 2005-09-14 | 2009-10-13 | Jumptap, Inc. | Location influenced search results |
US8209344B2 (en) | 2005-09-14 | 2012-06-26 | Jumptap, Inc. | Embedding sponsored content in mobile applications |
US7769764B2 (en) | 2005-09-14 | 2010-08-03 | Jumptap, Inc. | Mobile advertisement syndication |
US20080270220A1 (en) * | 2005-11-05 | 2008-10-30 | Jorey Ramer | Embedding a nonsponsored mobile content within a sponsored mobile content |
US20070100650A1 (en) * | 2005-09-14 | 2007-05-03 | Jorey Ramer | Action functionality for mobile content search results |
US8832100B2 (en) | 2005-09-14 | 2014-09-09 | Millennial Media, Inc. | User transaction history influenced search results |
US7912458B2 (en) | 2005-09-14 | 2011-03-22 | Jumptap, Inc. | Interaction analysis and prioritization of mobile content |
US20080214155A1 (en) * | 2005-11-01 | 2008-09-04 | Jorey Ramer | Integrating subscription content into mobile search results |
US20070060109A1 (en) * | 2005-09-14 | 2007-03-15 | Jorey Ramer | Managing sponsored content based on user characteristics |
US7676394B2 (en) | 2005-09-14 | 2010-03-09 | Jumptap, Inc. | Dynamic bidding and expected value |
US20070073722A1 (en) * | 2005-09-14 | 2007-03-29 | Jorey Ramer | Calculation and presentation of mobile content expected value |
US20070168354A1 (en) * | 2005-11-01 | 2007-07-19 | Jorey Ramer | Combined algorithmic and editorial-reviewed mobile content search results |
US9058406B2 (en) | 2005-09-14 | 2015-06-16 | Millennial Media, Inc. | Management of multiple advertising inventories using a monetization platform |
US10592930B2 (en) | 2005-09-14 | 2020-03-17 | Millenial Media, LLC | Syndication of a behavioral profile using a monetization platform |
US9471925B2 (en) | 2005-09-14 | 2016-10-18 | Millennial Media Llc | Increasing mobile interactivity |
US20070061245A1 (en) * | 2005-09-14 | 2007-03-15 | Jorey Ramer | Location based presentation of mobile content |
US8027879B2 (en) * | 2005-11-05 | 2011-09-27 | Jumptap, Inc. | Exclusivity bidding for mobile sponsored content |
US20070060173A1 (en) * | 2005-09-14 | 2007-03-15 | Jorey Ramer | Managing sponsored content based on transaction history |
US20070100805A1 (en) * | 2005-09-14 | 2007-05-03 | Jorey Ramer | Mobile content cross-inventory yield optimization |
US20110313853A1 (en) | 2005-09-14 | 2011-12-22 | Jorey Ramer | System for targeting advertising content to a plurality of mobile communication facilities |
US20090029687A1 (en) * | 2005-09-14 | 2009-01-29 | Jorey Ramer | Combining mobile and transcoded content in a mobile search result |
US20080215623A1 (en) * | 2005-09-14 | 2008-09-04 | Jorey Ramer | Mobile communication facility usage and social network creation |
US7860871B2 (en) | 2005-09-14 | 2010-12-28 | Jumptap, Inc. | User history influenced search results |
US8302030B2 (en) | 2005-09-14 | 2012-10-30 | Jumptap, Inc. | Management of multiple advertising inventories using a monetization platform |
US7716226B2 (en) | 2005-09-27 | 2010-05-11 | Patentratings, Llc | Method and system for probabilistically quantifying and visualizing relevance between two or more citationally or contextually related data objects |
US7676517B2 (en) * | 2005-10-14 | 2010-03-09 | Microsoft Corporation | Search results injected into client applications |
US7783632B2 (en) * | 2005-11-03 | 2010-08-24 | Microsoft Corporation | Using popularity data for ranking |
US8175585B2 (en) | 2005-11-05 | 2012-05-08 | Jumptap, Inc. | System for targeting advertising content to a plurality of mobile communication facilities |
US8571999B2 (en) | 2005-11-14 | 2013-10-29 | C. S. Lee Crawford | Method of conducting operations for a social network application including activity list generation |
US20100285818A1 (en) * | 2009-05-08 | 2010-11-11 | Crawford C S Lee | Location based service for directing ads to subscribers |
US20070143255A1 (en) * | 2005-11-28 | 2007-06-21 | Webaroo, Inc. | Method and system for delivering internet content to mobile devices |
US8095565B2 (en) * | 2005-12-05 | 2012-01-10 | Microsoft Corporation | Metadata driven user interface |
US8489614B2 (en) * | 2005-12-14 | 2013-07-16 | Google Inc. | Ranking academic event related search results using event member metrics |
US7814099B2 (en) * | 2006-01-31 | 2010-10-12 | Louis S. Wang | Method for ranking and sorting electronic documents in a search result list based on relevance |
US20070203888A1 (en) * | 2006-02-24 | 2007-08-30 | Cun Wang | Simple hierarchical Web search engine |
US7580931B2 (en) * | 2006-03-13 | 2009-08-25 | Microsoft Corporation | Topic distillation via subsite retrieval |
US20070266025A1 (en) * | 2006-05-12 | 2007-11-15 | Microsoft Corporation | Implicit tokenized result ranking |
BRPI0712593A2 (en) * | 2006-05-19 | 2012-07-03 | Jorn Lyseggen | method and apparatus. |
US8386509B1 (en) | 2006-06-30 | 2013-02-26 | Amazon Technologies, Inc. | Method and system for associating search keywords with interest spaces |
US7660815B1 (en) | 2006-06-30 | 2010-02-09 | Amazon Technologies, Inc. | Method and system for occurrence frequency-based scaling of navigation path weights among online content sources |
US7685192B1 (en) | 2006-06-30 | 2010-03-23 | Amazon Technologies, Inc. | Method and system for displaying interest space user communities |
US7634476B2 (en) * | 2006-07-25 | 2009-12-15 | Microsoft Corporation | Ranking of web sites by aggregating web page ranks |
US7949661B2 (en) * | 2006-08-24 | 2011-05-24 | Yahoo! Inc. | System and method for identifying web communities from seed sets of web pages |
US7660783B2 (en) * | 2006-09-27 | 2010-02-09 | Buzzmetrics, Inc. | System and method of ad-hoc analysis of data |
TWI337712B (en) * | 2006-10-30 | 2011-02-21 | Inst Information Industry | Systems and methods for measuring behavior characteristics, and machine readable medium thereof |
US20080133476A1 (en) * | 2006-12-05 | 2008-06-05 | Ivo Welch | Automated peer performance measurement system for academic citation databases |
US7797421B1 (en) | 2006-12-15 | 2010-09-14 | Amazon Technologies, Inc. | Method and system for determining and notifying users of undesirable network content |
US7885952B2 (en) * | 2006-12-20 | 2011-02-08 | Microsoft Corporation | Cloaking detection utilizing popularity and market value |
US7617194B2 (en) * | 2006-12-29 | 2009-11-10 | Microsoft Corporation | Supervised ranking of vertices of a directed graph |
US7707162B2 (en) * | 2007-01-08 | 2010-04-27 | International Business Machines Corporation | Method and apparatus for classifying multimedia artifacts using ontology selection and semantic classification |
US7693833B2 (en) * | 2007-02-01 | 2010-04-06 | John Nagle | System and method for improving integrity of internet search |
ITBG20070012A1 (en) * | 2007-02-13 | 2008-08-14 | Web Lion Sas | SEARCH METHOD AND SELECTION OF WEB SITES |
US20080243830A1 (en) * | 2007-03-30 | 2008-10-02 | Fatdoor, Inc. | User suggested ordering to influence search result ranking |
US7676520B2 (en) * | 2007-04-12 | 2010-03-09 | Microsoft Corporation | Calculating importance of documents factoring historical importance |
US20080313117A1 (en) * | 2007-06-12 | 2008-12-18 | Brian Galvin | Methods and Systems for Creating a Behavioral WEB Graph |
US20090013068A1 (en) * | 2007-07-02 | 2009-01-08 | Eaglestone Robert J | Systems and processes for evaluating webpages |
US20090055436A1 (en) * | 2007-08-20 | 2009-02-26 | Olakunle Olaniyi Ayeni | System and Method for Integrating on Demand/Pull and Push Flow of Goods-and-Services Meta-Data, Including Coupon and Advertising, with Mobile and Wireless Applications |
US7877385B2 (en) | 2007-09-21 | 2011-01-25 | Microsoft Corporation | Information retrieval using query-document pair information |
US9348912B2 (en) | 2007-10-18 | 2016-05-24 | Microsoft Technology Licensing, Llc | Document length as a static relevance feature for ranking search results |
US20090106221A1 (en) * | 2007-10-18 | 2009-04-23 | Microsoft Corporation | Ranking and Providing Search Results Based In Part On A Number Of Click-Through Features |
US7840569B2 (en) * | 2007-10-18 | 2010-11-23 | Microsoft Corporation | Enterprise relevancy ranking using a neural network |
US8332411B2 (en) * | 2007-10-19 | 2012-12-11 | Microsoft Corporation | Boosting a ranker for improved ranking accuracy |
US7779019B2 (en) * | 2007-10-19 | 2010-08-17 | Microsoft Corporation | Linear combination of rankers |
US7818334B2 (en) * | 2007-10-22 | 2010-10-19 | Microsoft Corporation | Query dependant link-based ranking using authority scores |
US7792854B2 (en) * | 2007-10-22 | 2010-09-07 | Microsoft Corporation | Query dependent link-based ranking |
US9922119B2 (en) * | 2007-11-08 | 2018-03-20 | Entit Software Llc | Navigational ranking for focused crawling |
TWI352934B (en) * | 2007-11-27 | 2011-11-21 | Inst Information Industry | Advertisement selection systems and methods for in |
US8347326B2 (en) | 2007-12-18 | 2013-01-01 | The Nielsen Company (US) | Identifying key media events and modeling causal relationships between key events and reported feelings |
US8346953B1 (en) | 2007-12-18 | 2013-01-01 | AOL, Inc. | Methods and systems for restricting electronic content access based on guardian control decisions |
US20090234829A1 (en) * | 2008-03-11 | 2009-09-17 | Microsoft Corporation | Link based ranking of search results using summaries of result neighborhoods |
US8812493B2 (en) | 2008-04-11 | 2014-08-19 | Microsoft Corporation | Search results ranking using editing distance and document information |
CN101299729B (en) * | 2008-06-25 | 2011-05-11 | 哈尔滨工程大学 | Method for judging rubbish mail based on topological action |
JP5327784B2 (en) * | 2008-07-30 | 2013-10-30 | 株式会社日立製作所 | Computer system, information collection support device, and information collection support method |
CN101930438B (en) | 2009-06-19 | 2016-08-31 | 阿里巴巴集团控股有限公司 | A kind of Search Results generates method and information search system |
TWI497322B (en) * | 2009-10-01 | 2015-08-21 | Alibaba Group Holding Ltd | The method of determining and using the method of web page evaluation |
US8150859B2 (en) * | 2010-02-05 | 2012-04-03 | Microsoft Corporation | Semantic table of contents for search results |
US8260664B2 (en) * | 2010-02-05 | 2012-09-04 | Microsoft Corporation | Semantic advertising selection from lateral concepts and topics |
US8983989B2 (en) * | 2010-02-05 | 2015-03-17 | Microsoft Technology Licensing, Llc | Contextual queries |
US20110231395A1 (en) * | 2010-03-19 | 2011-09-22 | Microsoft Corporation | Presenting answers |
US9491055B1 (en) * | 2010-04-21 | 2016-11-08 | Sprint Communications Company L.P. | Determining user communities in communication networks |
US8874727B2 (en) | 2010-05-31 | 2014-10-28 | The Nielsen Company (Us), Llc | Methods, apparatus, and articles of manufacture to rank users in an online social network |
US8738635B2 (en) | 2010-06-01 | 2014-05-27 | Microsoft Corporation | Detection of junk in search result ranking |
US8793706B2 (en) | 2010-12-16 | 2014-07-29 | Microsoft Corporation | Metadata-based eventing supporting operations on data |
US9495462B2 (en) | 2012-01-27 | 2016-11-15 | Microsoft Technology Licensing, Llc | Re-ranking search results |
US10261938B1 (en) | 2012-08-31 | 2019-04-16 | Amazon Technologies, Inc. | Content preloading using predictive models |
US9323767B2 (en) | 2012-10-01 | 2016-04-26 | Longsand Limited | Performance and scalability in an intelligent data operating layer system |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6560600B1 (en) * | 2000-10-25 | 2003-05-06 | Alta Vista Company | Method and apparatus for ranking Web page search results |
US20030208482A1 (en) * | 2001-01-10 | 2003-11-06 | Kim Brian S. | Systems and methods of retrieving relevant information |
US20050216533A1 (en) * | 2004-03-29 | 2005-09-29 | Yahoo! Inc. | Search using graph colorization and personalized bookmark processing |
US20050246328A1 (en) * | 2004-04-30 | 2005-11-03 | Microsoft Corporation | Method and system for ranking documents of a search result to improve diversity and information richness |
US20060095430A1 (en) * | 2004-10-29 | 2006-05-04 | Microsoft Corporation | Web page ranking with hierarchical considerations |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5873056A (en) * | 1993-10-12 | 1999-02-16 | The Syracuse University | Natural language processing system for semantic vector representation which accounts for lexical ambiguity |
JP3669016B2 (en) * | 1994-09-30 | 2005-07-06 | 株式会社日立製作所 | Document information classification device |
US6285999B1 (en) * | 1997-01-10 | 2001-09-04 | The Board Of Trustees Of The Leland Stanford Junior University | Method for node ranking in a linked database |
US5835905A (en) * | 1997-04-09 | 1998-11-10 | Xerox Corporation | System for predicting documents relevant to focus documents by spreading activation through network representations of a linked collection of documents |
US5895470A (en) * | 1997-04-09 | 1999-04-20 | Xerox Corporation | System for categorizing documents in a linked collection of documents |
US6026399A (en) * | 1997-05-30 | 2000-02-15 | Silicon Graphics, Inc. | System and method for selection of important attributes |
US5930788A (en) * | 1997-07-17 | 1999-07-27 | Oracle Corporation | Disambiguation of themes in a document classification system |
US6389436B1 (en) * | 1997-12-15 | 2002-05-14 | International Business Machines Corporation | Enhanced hypertext categorization using hyperlinks |
US6073135A (en) * | 1998-03-10 | 2000-06-06 | Alta Vista Company | Connectivity server for locating linkage information between Web pages |
US6112203A (en) * | 1998-04-09 | 2000-08-29 | Altavista Company | Method for ranking documents in a hyperlinked environment using connectivity and selective content analysis |
US6138113A (en) * | 1998-08-10 | 2000-10-24 | Altavista Company | Method for identifying near duplicate pages in a hyperlinked database |
US6321220B1 (en) * | 1998-12-07 | 2001-11-20 | Altavista Company | Method and apparatus for preventing topic drift in queries in hyperlinked environments |
US6549896B1 (en) * | 2000-04-07 | 2003-04-15 | Nec Usa, Inc. | System and method employing random walks for mining web page associations and usage to optimize user-oriented web page refresh and pre-fetch scheduling |
-
2000
- 2000-10-25 US US09/696,922 patent/US6560600B1/en not_active Expired - Lifetime
-
2003
- 2003-05-06 US US10/431,644 patent/US6871202B2/en not_active Expired - Lifetime
-
2004
- 2004-10-27 US US10/974,483 patent/US20050165757A1/en not_active Abandoned
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6560600B1 (en) * | 2000-10-25 | 2003-05-06 | Alta Vista Company | Method and apparatus for ranking Web page search results |
US6871202B2 (en) * | 2000-10-25 | 2005-03-22 | Overture Services, Inc. | Method and apparatus for ranking web page search results |
US20030208482A1 (en) * | 2001-01-10 | 2003-11-06 | Kim Brian S. | Systems and methods of retrieving relevant information |
US20050216533A1 (en) * | 2004-03-29 | 2005-09-29 | Yahoo! Inc. | Search using graph colorization and personalized bookmark processing |
US20050246328A1 (en) * | 2004-04-30 | 2005-11-03 | Microsoft Corporation | Method and system for ranking documents of a search result to improve diversity and information richness |
US20060095430A1 (en) * | 2004-10-29 | 2006-05-04 | Microsoft Corporation | Web page ranking with hierarchical considerations |
Cited By (35)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7328136B2 (en) * | 2004-09-15 | 2008-02-05 | Council Of Scientific & Industrial Research | Computer based method for finding the effect of an element in a domain of N-dimensional function with a provision for N+1 dimensions |
US20060072812A1 (en) * | 2004-09-15 | 2006-04-06 | Council Of Scientific And Industrial Research | Computer based method for finding the effect of an element in a domain of N-dimensional function with a provision for N‘dimensions |
US20060242139A1 (en) * | 2005-04-21 | 2006-10-26 | Yahoo! Inc. | Interestingness ranking of media objects |
US20060242178A1 (en) * | 2005-04-21 | 2006-10-26 | Yahoo! Inc. | Media object metadata association and ranking |
US10216763B2 (en) | 2005-04-21 | 2019-02-26 | Oath Inc. | Interestingness ranking of media objects |
US10210159B2 (en) | 2005-04-21 | 2019-02-19 | Oath Inc. | Media object metadata association and ranking |
US8732175B2 (en) * | 2005-04-21 | 2014-05-20 | Yahoo! Inc. | Interestingness ranking of media objects |
US20100057555A1 (en) * | 2005-04-21 | 2010-03-04 | Yahoo! Inc. | Media object metadata association and ranking |
US8204888B2 (en) * | 2006-07-14 | 2012-06-19 | Oracle International Corporation | Using tags in an enterprise search system |
WO2008010849A2 (en) * | 2006-07-14 | 2008-01-24 | Bea Systems, Inc. | Improved enterprise search system |
WO2008010848A2 (en) * | 2006-07-14 | 2008-01-24 | Bea Systems, Inc. | Improved enterprise search system |
US20080016052A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Using Connections Between Users and Documents to Rank Documents in an Enterprise Search System |
WO2008010848A3 (en) * | 2006-07-14 | 2008-04-10 | Bea Systems Inc | Improved enterprise search system |
WO2008010849A3 (en) * | 2006-07-14 | 2008-05-02 | Bea Systems Inc | Improved enterprise search system |
US20080016053A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Administration Console to Select Rank Factors |
US20080016098A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Using Tags in an Enterprise Search System |
US20080016072A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Enterprise-Based Tag System |
US20080016071A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Using Connections Between Users, Tags and Documents to Rank Documents in an Enterprise Search System |
US20080016061A1 (en) * | 2006-07-14 | 2008-01-17 | Bea Systems, Inc. | Using a Core Data Structure to Calculate Document Ranks |
US20110125760A1 (en) * | 2006-07-14 | 2011-05-26 | Bea Systems, Inc. | Using tags in an enterprise search system |
US7873641B2 (en) * | 2006-07-14 | 2011-01-18 | Bea Systems, Inc. | Using tags in an enterprise search system |
US8484193B2 (en) | 2007-03-30 | 2013-07-09 | Microsoft Corporation | Look-ahead document ranking system |
US20090282031A1 (en) * | 2007-03-30 | 2009-11-12 | Microsoft Corporation | Look-ahead document ranking system |
US7580945B2 (en) | 2007-03-30 | 2009-08-25 | Microsoft Corporation | Look-ahead document ranking system |
US20080243813A1 (en) * | 2007-03-30 | 2008-10-02 | Microsoft Corporation | Look-ahead document ranking system |
US8099417B2 (en) | 2007-12-12 | 2012-01-17 | Microsoft Corporation | Semi-supervised part-of-speech tagging |
US20090157643A1 (en) * | 2007-12-12 | 2009-06-18 | Microsoft Corporation | Semi-supervised part-of-speech tagging |
US20100082563A1 (en) * | 2008-09-30 | 2010-04-01 | International Business Machines Corporation | System impact search engine |
US20110078148A1 (en) * | 2009-09-28 | 2011-03-31 | Fong Chin Lung | System, method and apparatus for information retrieval and data representation |
US8244711B2 (en) * | 2009-09-28 | 2012-08-14 | Chin Lung Fong | System, method and apparatus for information retrieval and data representation |
US8645380B2 (en) | 2010-11-05 | 2014-02-04 | Microsoft Corporation | Optimized KD-tree for scalable search |
US8370363B2 (en) * | 2011-04-21 | 2013-02-05 | Microsoft Corporation | Hybrid neighborhood graph search for scalable visual indexing |
US20120271833A1 (en) * | 2011-04-21 | 2012-10-25 | Microsoft Corporation | Hybrid neighborhood graph search for scalable visual indexing |
US11803918B2 (en) | 2015-07-07 | 2023-10-31 | Oracle International Corporation | System and method for identifying experts on arbitrary topics in an enterprise social network |
US11134054B2 (en) | 2019-11-05 | 2021-09-28 | International Business Machines Corporation | Classification of a domain name |
Also Published As
Publication number | Publication date |
---|---|
US6871202B2 (en) | 2005-03-22 |
US20040111412A1 (en) | 2004-06-10 |
US6560600B1 (en) | 2003-05-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6560600B1 (en) | Method and apparatus for ranking Web page search results | |
US6112203A (en) | Method for ranking documents in a hyperlinked environment using connectivity and selective content analysis | |
US6738678B1 (en) | Method for ranking hyperlinked pages using content and connectivity analysis | |
US10055461B1 (en) | Ranking documents based on large data sets | |
AU2006279520B2 (en) | Ranking functions using a biased click distance of a document on a network | |
US6321220B1 (en) | Method and apparatus for preventing topic drift in queries in hyperlinked environments | |
US7630973B2 (en) | Method for identifying related pages in a hyperlinked database | |
US6418433B1 (en) | System and method for focussed web crawling | |
US7020679B2 (en) | Two-level internet search service system | |
US7260573B1 (en) | Personalizing anchor text scores in a search engine | |
JP5638031B2 (en) | Rating method, search result classification method, rating system, and search result classification system | |
US6954755B2 (en) | Task/domain segmentation in applying feedback to command control | |
US20040215606A1 (en) | Method and apparatus for machine learning a document relevance function | |
EP1653380A1 (en) | Web page ranking with hierarchical considerations | |
US20050216478A1 (en) | Techniques for web site integration | |
WO2007127676A1 (en) | System and method for indexing web content using click-through features | |
US9275145B2 (en) | Electronic document retrieval system with links to external documents | |
Singh et al. | A comparative study of page ranking algorithms for information retrieval | |
Edosomwan et al. | Comparative analysis of some search engines | |
Chen et al. | A unified framework for web link analysis | |
US20040205049A1 (en) | Methods and apparatus for user-centered web crawling | |
KR20030082109A (en) | Method and System for Providing Information and Retrieving Index Word using AND Operator | |
KR20030082110A (en) | Method and System for Providing Information and Retrieving Index Word using AND Operator and Relationship in a Document | |
Paksima et al. | The Surfer Model with a Hybrid Approach to Ranking the Web | |
Pardakhe et al. | Enhancement of the Web Search Engine Results using Page Ranking Algorithm |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |
|
AS | Assignment |
Owner name: YAHOO HOLDINGS, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:YAHOO| INC.;REEL/FRAME:042963/0211 Effective date: 20170613 |
|
AS | Assignment |
Owner name: OATH INC., NEW YORK Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:YAHOO HOLDINGS, INC.;REEL/FRAME:045240/0310 Effective date: 20171231 |