1554 results about "Search engine" patented technology

The present invention is directed to methods of and systems for ranking results returned by a search engine. A method in accordance with the invention comprises determining a formula having variables and parameters, wherein the formula is for computing a relevance score for a document and a search query; and ranking the document based on the relevance score. Preferably, determining the formula comprises tuning the parameters based on user input. Preferably, the parameters are determined using a machine learning technique, such as one that includes a form of statistical classification.

A user of a meta-search engine submits a query formulated with operators defining relationships between keywords. Information sources are selected for interrogation by the user or by the meta-search engine. If necessary, the query is translated for each selected source to adapt the operators of the query to a form accepted by that source. The query is submitted to each selected source and answers are retrieved from each source as a summary of each document found that satisfies the query. The answers are post-filtered from each source to determine if the answers satisfy the originally formulated query. Answers that satisfy the query are displayed as a list of selectable document summaries. The analysis includes computing a subsumption ratio of filtered answers to answers received that satisfy a translated query. The subsumption ratio is used to improve the accuracy of subsequent queries submitted by the user to the meta-search engine.

A system and related techniques accepts user search or query terms over of the Internet or other network or connection. In addition to presenting regularly generated search results, according to embodiments of the invention the search engine and related logic may examine the search string for suggested refinements or improvements to the search terms, to attempt to derive improved results or results closer to the user's search intent. According to embodiments of the invention in one regard, the alternative search logic may attempt to extract related or more meaningful search terms from sources including past usage patterns by users, and other data. That alternative search logic may thus examine the user's search terms to determine a substring match to prior searches, for instance stored by the search host for all users. In embodiments, the alternative search logic may likewise present user search extensions or refinement paths selected by prior users running the same search, as an indicator of likely content or source relevance. In further embodiments, the alternative search logic may perform a reverse query lookup to trace queries which resulted in the same Web site or other hit, as the present search and present those other queries as possible alternatives for the user to pursue. These and other search refinements may be performed, taking advantage of usage patterns and other information to improve search quality beyond straightforward spelling-type correction.

A system and method for aggregating rankings from a plurality of ranking sources to generate a maximally consistent ranking by minimizing a distance measure. The ranking sources may be search engines executing queries on web pages that have been deliberately modified to cause an incorrect estimate of their relevance. The invention supports combining partial rankings.

A federated search engine groups search results from information sources using attributes of the search results. In grouping the search results, a first set and a second set of attributes are extracted from content in each set of search results received using information source wrappers. The first set of attributes defines a main clustering strategy, and the second set of attributes defines a sub-clustering strategy. A main grouping of the sets of search results received from the information sources is generated using the first set of attributes. The main grouping of search results includes a plurality of labeled groups with a plurality of search results in each group. A sub-grouping of search results is generated for each labeled group of search results in the main grouping of search results using the second set of attributes.

A real-time financial search engine retrieves financial updates in real-time. A condensation memory in the real-time financial search engine stores financial data in a compacted space that allows computation of a smaller set of numbers. Real-time feed is converted into a two-dimensional (X, Y) location code for placement on a linear location code array of a security symbol. A single number of a location code efficiently represents (time, price) or (time, volume) in a 2D coordinate plane for real-time search of financial data.

The present invention relates to a system and methodology to facilitate extraction of information from a large unstructured corpora such as from the World Wide Web and/or other unstructured sources. Information in the form of answers to questions can be automatically composed from such sources via probabilistic models and cost-benefit analyses to guide resource-intensive information-extraction procedures employed by a knowledge-based question answering system. The analyses can leverage predictions of the ultimate quality of answers generated by the system provided by Bayesian or other statistical models. Such predictions, when coupled with a utility model can provide the system with the ability to make decisions about the number of queries issued to a search engine (or engines), given the cost of queries and the expected value of query results in refining an ultimate answer. Given a preference model, information extraction actions can be taken with the highest expected utility. In this manner, the accuracy of answers to questions can be balanced with the cost of information extraction and analysis to compose the answers.

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.

KnowledgeByGo is a knowledge based Internet application service provider system (ASP), that tracks and analyzes browser behavior in real-time. Data analysis is delivered to the website owner or marketing agent to decide if a real time response or off line campaign needs to be initiated. KnowledgeByGo allows real-time behavioral tracking and prediction; customer relation management; one-to-one banner manager; site analysis reporting service; industry wide marketing research reports; product management; order processing; secure payment system; and customer contact manager. Subscribers get the immediate benefits of: collaborative filtering; real-time behavioral prediction; up-selling and/or cross-sell selling; banner advertisement income; Customer Relation Management (CRM); one-to-one banner management; site analysis reporting server; network-wide sales and marketing reports; product content and online pricing spidering; site management, backend product management, backend order processing, RMA processing, secured payment system, customer contact manager, price-search engine utility, and consolidated participation purchasing.

To maintain the integrity and operability of enterprise database systems, queries intended for a particular database engine are intercepted, preferably by a separate processing system, prior to being acted upon by the database engine. The query is evaluated to determine its projected impact on available database system resources. The variables evaluated include user rights, administrator-imposed limits to searches, the amount of presently-available system resources, the cost of query and the like. If the query's potential impact does not surpass a predetermined threshold, it is submitted to the search engine. If the query is too resource-intensive or costly, the query may be (i) optimized by a query-optimization system, (ii) stored until more system resources are available, or (iii) rejected.

An underlying schema is discovered for an HTML document or a set of HTML documents, authored in various styles. Prior domain knowledge regarding punctuation, keywords, synonyms and HTML tags is used to 1) break a document up into separate objects, 2) identify the objects corresponding to keywords, 3) regroup objects: into hierarchical layers of abstraction, 4) logically order objects at the same level of abstraction, and 5) finally remove any non-keyword related information from the document's discovered schematic structure. The discovered schema supports structural queries from search engines that locate data that are more semantically related to the requested information than data located by simple keyword searching.

A device for managing document search-pattern records. The device comprises an associative memory for recording the usage in keywords of search queries such that each keyword is associated with at least one document responsive to the search query. The device is configured for managing access to the associative memory. The device is configured, in one embodiment of the present invention, to retrieve related keywords of the recorded keywords in response to an address of a certain document which is associated with the related keywords.

A system and method for a comparative web search engines, search result summarization, web snippet processing, comparison analysis, information visualization, meta-clustering, and quantitative evaluation of web snippet quality are disclosed. The present invention extends the capabilities of web searching and informational retrieval by providing a succinct comparative summary of search results at either the object or thematic levels.

A method and a system for re-ranking an existing result set of documents. A user starts a search by entering search term(s). The search term(s) is (are) transferred to a search engine which generates a result set ranked by the search term(s). The search engine, in parallel, automatically retrieves context information from returned result set which is related to the original set of documents. The search engine presents the context information to the user and asks for a feedback. The user performs a weighting of the presented context information in a range from “important” to “non-important”. The result set is then re-ranked with the user-weighted context information to increase the “rank distance” of important and non important documents. The documents that are on top of the list (highest context-weighted ranking value) represent the desired information.

The invention discloses a method and system for recommending query based on user log. The method comprises acquiring an effective query log set according to the data set in the user log; selecting a typical query string as the training set, extracting 6 characteristic indexes of each query string in the effective query log set, such as support degree, popularity, recommendation degree, co-occurrence degree, similarity, and association degree, and constructing a composite prediction model based on the training set; and extracting the 6 characteristic indexes of candidate query strings inputted by a user, inputting the extracted characteristic indexes into the composite prediction model as variables, calculating the relevancy between each candidate query string and a given query string, and outputting n query strings with higher rank. The system comprises a data preparation module, a prediction model construction module, and a processing output model for realizing the above method. By fully utilizing the user log of a search engine, the method and system can recommend query strings with higher quality for the user.

A method for search engine keyword bidding, including providing a search engine that is used by shoppers to search for products and services, maintaining by an advertiser a keyword database used by the search engine, collecting by the advertiser statistics for revenue generated during each Internet session on the advertiser's website that begins when a shopper visits the advertiser's landing page in response to the shopper clicking on an advertiser's sponsored ad, maintaining by the advertiser a tracking database comprising records of Internet sessions for a plurality of shoppers, and periodically revising by the advertiser a bid amount for a keyword in the keyword database, based on total revenue in the tracking database corresponding to the keyword over a given time period.