145results about How to "Handy search results" patented technology

A method, system, and computer-accessible medium are provided for automating the optimization of search result relevance in a search engine. The system and method continually collect data that represent various aspects of how a search result is performing and compare that performance data to the expected performance for the search result. The system and method further diagnose the possible causes of under performing results and automatically adjust the search engine operation to optimize the search result relevance.

Context, or user intent, is used for improving targeting of advertisements and for generating competition among advertisers for valuable ad space. Advertisers can bid for placement on search results pages based on combinations of keywords and context categories, or keywords and contexts. Such bids are compared to one another so that appropriate ads can be selected and displayed. By taking context into account, improved ad targeting is accomplished.

A system and method for searching and voting on Internet-accessible content is presented. One or more meta servers or sites store information about the structure and location of content on one or more Internet host servers. HTML-linked content on the one or more Internet host servers is indexed and stored on the one or more meta servers, and non-HTML content on the one or more Internet host servers is processed by the present invention into HTML content, indexed, and stored on the one or more meta servers. Each meta server includes a local search engine that can be queried by a user. A plurality of different types of queries can be conducted by the user, including local queries, global queries, and peer-to-peer network queries. The user is provided with search results which point to relevant content on one or more of the meta server and/or one or more of the Internet host servers. After viewing the content, the user can cast votes relating to the user's satisfaction with the search results. The present invention also includes a central repository which tracks user votes, query progressions, and information about content on each of the meta sites. The present invention also provides a plurality of enhancement plug-ins for standard web robots, including a toolbar for conventional web browsers. The toolbar can be used to securely solicit and collect authenticated user votes from standard web sites, as well as to vote-check top results returned by supported search engines. The plug-ins facilitate interoperability between existing Internet software (and technology) and the present invention.

A method and apparatus for using network traffic logs for search enhancement is disclosed. According to one embodiment, network usage is tracked by generating log files. These log files among other things indicate the frequency web pages are referenced and modified. These log files or information from these log files can then be used to improve document ranking, improve web crawling, determine tiers in a multi-tiered index, determine where to insert a document in a multi-tiered index, determine link weights, and update a search engine index.

An apparatus for finding resources on a network comprises a finder server having access to: (a) a database including: (i) an index of resources available on network of interconnected computers on which a plurality of resources reside; and (ii) information regarding user feedback gathered from previous operations of the apparatus by a user and plural previous users; and (b) a learning system operable to access and learn from information contained on the database. The finder server is operable to locate, in response to entry by the user of a resource identity signifier, a single intended target resource intended by the user to uniquely correspond to the resource identity signifier, from among a plurality of resources located on the network, by: receiving a resource identity signifier from the user; accessing the database to determine, based on the information in the database, which, if any, of the indexed resources is likely to be the intended target resource; and directing a computer of the user so as to cause that computer to connect the user to the address of the resource, if any, determined as likely to be the intended target resource.

The invention comprises a set of complementary techniques that dramatically improve enterprise search and navigation results. The core of the invention is an expertise or knowledge index, called UseRank that tracks the behavior of website visitors. The expertise-index is designed to focus on the four key discoveries of enterprise attributes: Subject Authority, Work Patterns, Content Freshness, and Group Know-how. The invention produces useful, timely, cross-application, expertise-based search and navigation results. In contrast, traditional Information Retrieval technologies such as inverted index, NLP, or taxonomy tackle the same problem with an opposite set of attributes than what the enterprise needs: Content Population, Word Patterns, Content Existence, and Statistical Trends. Overall, the invention emcompasses Baynote Search—a enhancement over existing IR searches, Baynote Guide—a set of community-driven navigations, and Baynote Insights—aggregated views of visitor interests and trends and content gaps.

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.

The present invention provides systems and methods that rank search results. Such ranking typically includes determining a relevance of individual search results via one or more feature-based relevance functions. These functions can be tailored to users and/or applications, and typically are based on scoped information (e.g., lexical), digital artifact author related attributes, digital artifact source repository attributes, and/or relationships between features, for example. In addition, relevance functions can be generated via training sets (e.g., machine learning) or initial guesses that are iteratively refined over time. Upon determining relevance, search results can be ordered with respect to one another, based on respective relevances. Additionally, thresholding can be utilized to mitigate returning results likely to be non-relevant to the query, user and/or application.

An optimal path selection system extracts a connection subgraph in real time from an undirected, edge-weighted graph such as a social network that best captures the connections between two nodes of the graph. The system models the undirected, edge-weighted graph as an electrical circuit and solves for a relationship between two nodes in the undirected edge-weighted graph based on electrical analogues in the electric graph model. The system optionally accelerates the computations to produce approximate, high-quality connection subgraphs in real time on very large (disk resident) graphs. The connection subgraph is constrained to the integer budget that comprises a first node, a second node and a collection of paths from the first node to the second node that maximizes a “goodness” function g(H). The goodness function g(H) is tailored to capture salient aspects of a relationship between the first node and the second node.

A search system and method for performing group-based searches. The system comprises a client system having a browser and a search engine plug-in, wherein the search engine plug-in allows group members to generate nomination data by nominating web pages; and a server having a control program and a group structure for storing nomination data, wherein the control program generates a primary search result list based on a search index, and further refines the search result list based on the stored nomination data.

The present invention provides a method and system for identifying, retrieving and presenting electronic documents responsive to user queries. The three distinct inventive concepts are relevancy ranking of responsive documents based on component query technique; cross-lingual searching; and search expansion using analytics of initial results to derive and generate a modified query. Each of these inventions enhances document search and retrieval systems and the three solutions may be used separately or in any combination. The three inventions apply in layers above an underlying search system, controlling the submission of requests to the underlying system in support of received search requests, typically originating with an end user. Invention (I) involves use of focus-spectrum expanded search queries and either of two general types of enhanced OR operator that may be offered by the underlying search system. Processing of the content domain informs automated generation of elaborated queries using these operators for submitting to such an underlying system so as to yield improved relevance ranking

The invention provides a query method and system and relates to the field of computer technology. The method comprises receiving a query word string and analyzing the speeches that the words in the query word string belong to, wherein the speeches comprises entity words, property words, property values corresponding to the property words, relative words, and relative values corresponding to the relative words; according to the speeches that the words in the query word string belong to, determining a query structure correspondingly matched with the query word string and query objects in the query structure, match-analyzing the query structure in a structuralized knowledge library to obtain object values corresponding to the query objects in the query structure; separately displaying the object values in a result area corresponding to the query word string. The query method and system can help a user to query required answers rapidly to achieve high searching efficiency; by avoiding the shortcoming of immature semantic parsing in the prior art, can precisely perform question query and answering; can also effectively answer uncommon questions.

Systems and methods are disclosed for improving search results returned to a user from one or more search domains, utilizing query features learned locally on the user's device. A search engine can receive, analyze and forward query results from multiple search domains and pass the query results to a client device. A search engine can determine a feature by analyzing query results, generate a predictor for the feature, instruct a client device to use the predictor to train on the feature, and report back to the search engine on training progress. A search engine can instruct a first and second set of client devices to train on set A and B of predictors, respectively, and report back training progress to the search engine. A client device can store search session context and share the context with a search engine between sessions with one or more search engines. A synchronization system can synchronize local predictors between multiple client devices of a user.

An interactive and intelligent user interface for inputting a query, generating a query result including one or more matching concepts stored in a knowledgebase of one or more media types, and presenting the user with a rich personalized query result based on the user's preferences and personal information, and provides improved relevant search results.

Architecture for improving text searches using information redundancy. A search component is coupled with an analysis component to rerank documents returned in a search according to a redundancy values. Each returned document is used to develop a corresponding word probability distribution that is further used to rerank the returned documents according to the associated redundancy values. In another aspect thereof, the query component is coupled with a projection component to project answer redundancy from one document search to another. This includes obtaining the benefit of considerable answer redundancy from a second data source by projecting the success of the search of the second data source against a first data source.

A visual method for enhancing search result navigation, comprising: obtaining a first search result from a search engine; clustering the first search result to get clustering information; calculating the correlations between the clustering information and the ranked list of the first search result, and performing visualization processing on the clustering information; and displaying the visual cluster hierarchy and the ranked list of the first search result in a joint manner based on the correlations. When a cluster is selected, further searching is performed and the search result is clustered again. Using the present invention, through combining a traditional ranked list of search results and the visual cluster hierarchy of these search results to display them in a joint manner, a convenient way is provided for the web user to find the potential correlations between the visual cluster hierarchy and the ranked list of the search results. Besides, through dynamically searching and clustering more search results again, the web user may get more detailed and more accurate search results easily.

A user enters a search query at interface 1 for performing a search on a computer network, such as the Internet. The search results are enhanced by adjusting their weightings to take into account previous searches carried out by members of a group, the membership of which is selected by the user. The group may be a user-defined co-user list, for example. Those previous search results that were of interest to members of the group are thus given greater prominence in the search results presented to the user at display 8. The user's behavior in considering the search results is monitored and the information gained used to update a database 5 holding group search information.

The invention relates to a method and a device for combining entities in a knowledge map. The method comprises the following steps of generating a first-grade feature vector according to structural data corresponding to the entities in the knowledge map; generating a second-grade feature vector according to terms in documents corresponding to the entities; determining the similarity of the different entities according to the first-grade feature vector and the second-grade feature vector. According to the method and the device, the first-grade feature vector and the second-grade feature vector are constructed by entity IDs respectively, and the similarity of the entity IDs with the same name is calculated, and whether the entity IDs with the same name are the same object or not can be accurately judged, so that a condition that one object in the knowledge map has a plurality of entity IDs can be reduced, the content of the knowledge map is more accurate and the structure is more compact.

The present invention provides a method and system for generating search results including receiving a search request including at least one search term and accessing a corpus of data to determine relevant content for inclusion in a search result set on the basis of the search request. The method and system includes determining a plurality of applications associated with the search request and generating a search result output display for the presentation of at least a portion of the search result set and at least a portion of the applications.