Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

43 results about "Page rank" patented technology

Definition of Page Rank. Page Rank (often denoted PR) is a quantity defined by Google that provides a rough estimate of the overall importance of a web page. Many factors influence Page Rank, thus it is a poor indicator of how well a page ranks for particular keywords. Contrary to popular belief, the word "page" in Page Rank has nothing...

System, method and service for ranking search results using a modular scoring system

A modular scoring system using rank aggregation merges search results into an ordered list of results using many different features of documents. The ranking functions of the present system can easily be customized to the needs of a particular corpus or collection of users such as an intranet. Rank aggregation is independent of the underlying score distributions between the different factors, and can be applied to merge any set of ranking functions. Rank aggregation holds the advantage of combining the influence of many different heuristic factors in a robust way to produce high-quality results for queries. The modular scoring system combines factors such as indegree, page ranking, URL length, proximity to the root server of an intranet, etc, to form a single ordering on web pages that closely obeys the individual orderings, but also mediates between the collective wisdom of individual heuristics.
Owner:GOOGLE LLC

System, method and service for ranking search results using a modular scoring system

A modular scoring system using rank aggregation merges search results into an ordered list of results using many different features of documents. The ranking functions of the present system can easily be customized to the needs of a particular corpus or collection of users such as an intranet. Rank aggregation is independent of the underlying score distributions between the different factors, and can be applied to merge any set of ranking functions. Rank aggregation holds the advantage of combining the influence of many different heuristic factors in a robust way to produce high-quality results for queries. The modular scoring system combines factors such as indegree, page ranking, URL length, proximity to the root server of an intranet, etc, to form a single ordering on web pages that closely obeys the individual orderings, but also mediates between the collective wisdom of individual heuristics.
Owner:GOOGLE LLC

Computer search system for improved web page ranking and presentation

An Internet search system integrates additional concept-related information into a regular web search engine, providing better page ranking and richer presentation of search results. The additional information is directly related to the contents of the retrieved web pages but does not appear on the retrieved web pages and / or in the link structure. The new search system searches a conventional web page collection together with databases containing publications and semantic web data, which provides the aforesaid additional information.
Owner:CHEN ANJUN

Method for Detecting and Remediating Misleading Hyperlinks

A method for verifying the validity of a hyperlink, and determining whether the domain name of the website that the user is directed to is valid. In one embodiment, the method identifies a hyperlink, a URL within the hyperlink and a domain name within the URL. The identified domain name is then assigned a page rank parameter. If the page rank parameter is below a threshold value, then the method compares the identified domain name to a list of well-known or high page rank domain names. A similarity parameter is then assigned to the identified domain name to indicate if the hyperlink is misleading. If the link is misleading, the method may implement some configurable remedial action, such as alerting the user or disabling the hyperlink.
Owner:IBM CORP

Changing ranking algorithms based on customer settings

Search term ranking algorithms can be generated and updated based on customer settings, such as where a ranking algorithm is modeled as a combination function of different ranking factors. An end user of a search system provides personalized preferences for weighted attributes, generally or for a single instance of the query. The user also can indicate the relative importance of one or more ranking factors by specifying different weights to the factors. Ranking factors can specify document attributes, such as document title, document body, document page rank, etc. Based on the attribute weights and the received user query, a ranking algorithm function will produce the relevant value for each document corresponding to the user preferences and personalization configurations.
Owner:ORACLE INT CORP

Implicit links search enhancement system and method for search engines using implicit links generated by mining user access patterns

An implicit links enhancement system and method for search engines that generates implicit links obtained from mining user access logs to facilitate enhanced local searching of web sites and intranets. The implicit links search enhancement system and method includes extracting implicit links by mining users' access patterns and then using a modified link analysis algorithm to re-rank search results obtained from traditional search engines. More specifically, the implicit links search enhancement method includes extracting implicit links from a user access log, generating an implicit links graph from the extracted implicit links, and computing page rankings using the implicit links graph. The implicit links are extracted from the log using a two-item sequential pattern mining technique. Search results obtained from a search engine are re-ranked based on an implicit links analysis performed using an updated implicit links graph, a modified re-ranking formula, and at least one re-ranking technique.
Owner:MICROSOFT TECH LICENSING LLC

Efficiently ranking web pages via matrix index manipulation and improved caching

Methods and systems are described for computing page rankings more efficiently. Using an interconnectivity matrix describing the interconnection of web pages, a new matrix is computed. The new matrix is used to compute the average of values associated with each web page's neighboring web pages. The secondary eigenvector of this new matrix is computed, and indices for web pages are relabeled according to the eigenvector. The data structure storing the interconnectivity information is preferably also physically sorted according to the eigenvector. By reorganizing the matrix used in the web page ranking computations, caching is performed more efficiently, resulting in faster page ranking techniques. Methods for efficiently allocating the distribution of resources are also described.
Owner:MICROSOFT TECH LICENSING LLC

Page re-ranking system and re-ranking program to improve search result

A page re-ranking system includes a super page producing part that produces a super page where page contents are combined between multiple versions for each of multiple Web pages that can be obtained as a search result page in compliance with a user's query and to which a page ranking is created, a super page analyzing part that analyzes a covering degree of a topic representation that is contained in the super page produced by the super page producing part, and a re-ranking part that grants a renewed page ranking to each of the Web pages by comparing the analysis results obtained by the super page analyzing part between the super pages.
Owner:NAT INST OF INFORMATION & COMM TECH

Changing ranking algorithms based on customer settings

Search term ranking algorithms can be generated and updated based on customer settings, such as where a ranking algorithm is modeled as a combination function of different ranking factors. An end user of a search system provides personalized preferences for weighted attributes, generally or for a single instance of the query. The user also can indicate the relative importance of one or more ranking factors by specifying different weights to the factors. Ranking factors can specify document attributes, such as document title, document body, document page rank, etc. Based on the attribute weights and the received user query, a ranking algorithm function will produce the relevant value for each document corresponding to the user preferences and personalization configurations.
Owner:ORACLE INT CORP

Method for identifying microblog key users based on improved Page Rank

The invention discloses a method for identifying microblog key users based on an improved Page Rank. The method comprises the steps that microblog information data are input, wherein the microblog information data comprise n microblogs; word segmentation is conducted on texts of the n microblogs; according to a word segmentation result, a reverse index structure is established, so that retrieval is conveniently conducted according to appointed keywords; according to the retrieved relevant microblog, forwarding hierarchy information of the microblog is extracted and a weighting directed graph is established, wherein the weighting directed graph is a forwarding network G; the forwarding network G is divided into a plurality of maximum connected subgraphs Gi; the Page rank algorithm is applied to each sub network Gi according to the parallelization computing technology; computing results of the sub networks are combined, so that ranking results of the whole network G are generated; the first m ranking results of the ranking results are selected, serve as the key users and are output. According to the method for identifying the microblog key users based on the improved Page Rank, the parallelization computing technology is adopted, a dynamic forwarding network of a microblog platform is ranked and computed in a big data environment, so that the key users in the information transmission process are identified, and the method is applied to the fields of network public opinion analysis and the like.
Owner:BEIHANG UNIV

Active Search Results Page Ranking Technology

Systems and methods for storing data regarding activities of a person and / or people associated with a website that is indexed in a search engine. Data regarding such activities is used to calculate a weighting factor that is combined with a relevance score for the website. The combined weighting factor and relevance score influences the relative position of the website among other websites in search results.
Owner:MCLELLAN MARK F

Method and system for detecting and remediating misleading hyperlinks

A method for verifying the validity of a hyperlink, and determining whether the domain name of the website that the user is directed to is valid. In one embodiment, the method identifies a hyperlink, a URL within the hyperlink and a domain name within the URL. The identified domain name is then assigned a page rank parameter. If the page rank parameter is below a threshold value, then the method compares the identified domain name to a list of well-known or high page rank domain names. A similarity parameter is then assigned to the identified domain name to indicate if the hyperlink is misleading. If the link is misleading, the method may implement some configurable remedial action, such as alerting the user or disabling the hyperlink.
Owner:INT BUSINESS MASCH CORP

Page-ranking method and system

ActiveUS20070219993A1Quickly and efficiently return a large number of highly relevant pagesData processing applicationsWeb data indexingWorkstationWorld Wide Web
A page-ranking method includes mining a portion of content of a user workstation which is connectable to a network to detect references to pages of the network. The pages may be ranked based on the detected references.
Owner:TWITTER INC

Processor engine, integrated circuit and method therefor

A processor engine for affecting a website's position on at least one Internet search engine's page ranking comprises at least one processor. The at least one processor is arranged to: load (425) at least one search term into a program (425) running on the at least one processor; load (445) a target list comprising at least one website that is to be promoted; and create (420) an Internet connection. The at least one processor is further arranged to request a search of the at least one search term on the at least one Internet search engine; identify at least one website search hit that matches at least one website on the target list; and access the identified at least one website a plurality of times, affecting the at least one website's position on the Internet search engine's page ranking.
Owner:LUXIAN

Improving results from search providers using a browsing-time relevancy factor

InactiveUS20080059446A1Promote resultsOvercomes manipulation of search resultWeb data indexingSpecial data processing applicationsTime factorPage rank
A method for searching Web pages that begins with the identification of query criteria entered into a search provider. A set of Web pages that satisfies the query criteria are determined. Then, a page ranking is ascertained for each Web page in the set. The Web pages are presented in order by page ranking. The page ranking is based upon at least one relevancy factor that includes a browsing-time factor. The browsing-time factor can be calculated from browsing behavior exhibited by users, who provided similar query criteria. The set of users from which the browsing-time factor is calculated can include a current user, a set of users sharing characteristics with the current user, and / or a general set of users. Browsing behavior can include time spent at a Web page, where the browsed Web page is a page that was previously presented as a search result for the similar query criteria.
Owner:IBM CORP

Calculating web page importance

The page ranking technique described herein employs a Markov Skeleton Mirror Process (MSMP), which is a particular case of Markov Skeleton Processes, to model and calculate page importance scores. Given a web graph and its metadata, the technique builds an MSMP model on the web graph. It first estimates the stationary distribution of a EMC and views it as transition probability. It next computes the mean staying time using the metadata. Finally, it calculates the product of transition probability and mean staying time, which is actually the stationary distribution of MSMP. This is regarded as page importance.
Owner:MICROSOFT TECH LICENSING LLC

Efficiently ranking web pages via matrix index manipulation and improved caching

Methods and systems are described for computing page rankings more efficiently. Using an interconnectivity matrix describing the interconnection of web pages, a new matrix is computed. The new matrix is used to compute the average of values associated with each web page's neighboring web pages. The secondary eigenvector of this new matrix is computed, and indices for web pages are relabeled according to the eigenvector. The data structure storing the interconnectivity information is preferably also physically sorted according to the eigenvector. By reorganizing the matrix used in the web page ranking computations, caching is performed more efficiently, resulting in faster page ranking techniques. Methods for efficiently allocating the distribution of resources are also described.
Owner:MICROSOFT TECH LICENSING LLC

Page re-ranking system and re-ranking program to improve search result

A page re-ranking system includes a super page producing part that produces a super page where page contents are combined between multiple versions for each of multiple Web pages that can be obtained as a search result page in compliance with a user's query and to which a page ranking is created, a super page analyzing part that analyzes a covering degree of a topic representation that is contained in the super page produced by the super page producing part, and a re-ranking part that grants a renewed page ranking to each of the Web pages by comparing the analysis results obtained by the super page analyzing part between the super pages.
Owner:NAT INST OF INFORMATION & COMM TECH

Cluster page ranking equipment and method based on clustering/classification and time

The invention provides cluster page ranking equipment and method based on clustering / classification and time. The cluster page ranking equipment comprises a searcher, a cluster builder, a cluster page ranking calculator, a cluster trend generator and a cluster trend ranking device, wherein the searcher is configured to search relevant documents from data sets according to given query statements and calculate document related values of the searched documents, thus obtaining related document sets of the sequencing; the cluster builder is configured to cluster or classify the related document sets, thus obtaining a cluster; the cluster page ranking calculator based on time is configured to calculate cluster page ranking values (TCP values) based on cluster calculation on the basis of the cluster, and is a combination of document link values based on time of all the documents in the cluster and is used as a combination of the page ranking values based on time, author ranking values based on time and document library ranking values based on time of all the documents in the cluster; the cluster trend generator is configured to calculate the future TCP value of the cluster according to the TCP value; and the cluster trend ranking device is configured to sequence future TCP values, thus obtaining trend.
Owner:RICOH KK

Processor engine, integrated circuit and method therefor

A processor engine for affecting at least one authorised website's position on at least one Internet search engine's page ranking is described. The processor engine comprises at least one processor arranged to: identify a target list comprising at least one authorised website that is to be promoted; open a web browser; access an internet search engine on the first web browser; load at least a part of at least one search term into the internet search engine running on the web browser; associate at least the part of the at least one search term with the at least one authorised website on the target list; close the web browser, and repeat a plurality of times, the operations of open, access, load, associate, and close, thereby affecting the at least one authorised website's position on the internet search engine's page ranking.
Owner:LUXIAN

Friend recommendation method based on single-source SimRank exact solution

The invention discloses a friend recommendation method based on a single-source SimRank exact solution. The friend recommendation method comprises the following steps of: converting a target user, users and a relationship among the users into a graph structure G; calculating personalized Page ranks of a source node vi relative to all nodes on the graph, forming a personalized Page ranking vector pi<right arrow>, calculating a no-more-meeting probability of all nodes on the graph structure G, forming a no-more-meeting probability matrix D<^>, calculating the SimRank similarity of the sourcenode vi according to an n-dimensional vector pi<right arrow> and the no-more-meeting probability matrix D<^> to obtain an n-dimensional vector S<right arrow>, repeatedly executing L rounds of calculation of the SimRank similarity, and updating the n-dimensional vector S<right arrow>; and finding out a node corresponding to the t dimension with the maximum value in all dimensions of an n-dimensional vector S<right arrow L>, and recommending the users corresponding to the t nodes to the target user as a result. The friend recommendation method based on the single-source SimRank exact solutioncan guarantee to obtain the exact solution of the single-source SimRank similarity on a large-scale user group within valid time, and the quality and effect of a friend recommendation function are improved.
Owner:RENMIN UNIVERSITY OF CHINA

Processor engine, integrated circuit and method therefor

A processor engine for affecting a website's position on at least one Internet search engine's page ranking comprises at least one processor. The at least one processor is arranged to: load (425) at least one search term into a program (425) running on the at least one processor; load (445) a target list comprising at least one website that is to be promoted; and create (420) an Internet connection. The at least one processor is further arranged to request a search of the at least one search term on the at least one Internet search engine; identify at least one website search hit that matches at least one website on the target list; and access the identified at least one website a plurality of times, affecting the at least one website's position on the Internet search engine's page ranking.
Owner:LUXIAN
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products