| Patent application number | Description | Published |
|---|
| 20080215541 | TECHNIQUES FOR SEARCHING WEB FORUMS - A search system provides various techniques for facilitating information retrieval. The search system may identify alternate queries for an initial query submitted by a user to a search system. Upon receiving the initial query, the search system identifies questions that are related to the initial query and presents to the user the related questions as alternate queries. The search system may also identify messages within a discussion thread that include answers. The search system may also identify an expert relating to the subject of a query by searching through expert profiles containing keywords of discussion threads in which the expert participated. | 09-04-2008 |
| 20080222062 | SUPERVISED RANK AGGREGATION BASED ON RANKINGS - A method and system for rank aggregation of entities based on supervised learning is provided. A rank aggregation system provides an order-based aggregation of rankings of entities by learning weights within an optimization framework for combining the rankings of the entities using labeled training data and the ordering of the individual rankings. The rank aggregation system is provided with multiple rankings of entities. The rank aggregation system is also provided with training data that indicates the relative ranking of pairs of entities. The rank aggregation system then learns weights for each of the ranking sources by attempting to optimize the difference between the relative rankings of pairs of entities using the weights and the relative rankings of pairs of entities of the training data. | 09-11-2008 |
| 20080222451 | ACTIVE SPAM TESTING SYSTEM - A method and system for introducing spam into a search engine for testing purposes is provided. An active spam testing system receives from a tester a specification of spam that is to be introduced into the search engine for testing purposes. The testing system may then generate auxiliary data structures for storing indications of the spam that is to be introduced. A search engine has original data structures that may include a content index and a link data structure. The testing system stores the indications of the spam in the auxiliary data structures so that use of the search engine for non-testing purposes is not affected. When the search engine is used for testing purposes, the search engine generates search results based on a combination of the original data structures and the auxiliary data structures. | 09-11-2008 |
| 20080256051 | CALCULATING IMPORTANCE OF DOCUMENTS FACTORING HISTORICAL IMPORTANCE - A method and system for determining temporal importance of documents having links between documents based on a temporal analysis of the links is provided. A temporal ranking system collects link information or snapshots indicating the links between documents at various snapshot times. The temporal ranking system calculates a current temporal importance of a document by factoring in the current importance of the document derived from the current snapshot (i.e., with the latest snapshot time) and the historical importance of the document derived from the past snapshots. To calculate the current temporal importance of a web page, the temporal ranking system aggregates the importance of the web page for each snapshot. | 10-16-2008 |
| 20080270377 | CALCULATING GLOBAL IMPORTANCE OF DOCUMENTS BASED ON GLOBAL HITTING TIMES - A calculate importance system calculates the global importance of a web page based on a “mean hitting time.” Hitting time of a target web page is a measure of the minimum number of transitions needed to land on the target web page. Mean hitting time of a target web page is an average number of such transitions for all possible starting web pages. The calculate importance system calculates a global importance score for a web page based on the reciprocal of a mean hitting time. A search engine may rank web pages of a search result based on a combination of relevance of the web pages to the search request and global importance of the web pages based on a global hitting time. | 10-30-2008 |
| 20080313168 | RANKING DOCUMENTS BASED ON A SERIES OF DOCUMENT GRAPHS - Ranking documents based on a series of web graphs collected over time is provided. A ranking system provides multiple transition probability distributions representing different snapshots or times. Each transition probability distribution represents a probability of transitioning from one document to another document within a collection of documents using a link of the document. The ranking system determines a stationary probability distribution for each snapshot based on the transition probability distributions for that snapshot and the stationary probability distribution of the previous snapshot. The stationary probability distributions represent a ranking of the documents over time. | 12-18-2008 |
| 20090037401 | Information Retrieval and Ranking - A learning method is used to generate ranking models. The learning method can create a ranking function that assigns scores to documents and then ranks the documents using the scores. In this learning method, a training set along with performance measures are used to generate weak rankers which a used in the ranking model. During information retrieval, for a given query, the system may return a ranked list of documents in descending order of the relevance scores. | 02-05-2009 |
| 20090083248 | Multi-Ranker For Search - Systems and methods for processing user queries and identifying a set of documents relevant to the user query from a database using multi ranker search are described. In one implementation, the retrieved documents can be paired to form document pairs, or instance pairs, in a variety of combinations. Such instance pairs may have a rank order between them as they all have different ranks. A classifier, hyperplane, and a base ranker may be constructed for identifying the rank order relationships between the two instances in an instance pair. The base ranker may be generated for each rank pair. The systems use a divide and conquer strategy for learning to rank the instance pairs by employing multiple hyperplanes and aggregate the base rankers to form an ensemble of base rankers. Such an ensemble of base rankers can be used to rank the documents or instances. | 03-26-2009 |
| 20090106222 | Listwise Ranking - Procedures for learning and ranking items in a listwise manner are discussed. A listwise methodology may consider a ranked list, of individual items, as a specific permutation of the items being ranked. In implementations, a listwise loss function may be used in ranking items. A listwise loss function may be a metric which reflects the departure or disorder from an exemplary ranking for one or more sample listwise rankings used in learning. In this manner, the loss function may approximate the exemplary ranking for the plurality of items being ranked. | 04-23-2009 |
| 20090182723 | RANKING SEARCH RESULTS USING AUTHOR EXTRACTION - Architecture that extracts author information from general documents and uses the author information for search results ranking. The architecture performs automatic author value extraction and makes the extracted value available at index time for subsequent use at query processing and results ranking. Machine learning (e.g., a perceptron algorithm) is employed and a set of input features for the perceptron algorithm utilized for author value extraction. The extracted author value is converted into a feature for input a ranking function for generating a ranking score for each document. The input features can also be weighted according to weighting criteria. | 07-16-2009 |
| 20090187555 | FEATURE SELECTION FOR RANKING - This disclosure describes various exemplary methods, computer program products, and systems for selecting features for ranking in information retrieval. This disclosure describes calculating importance scores for features, measuring similarity scores between two features, selecting features that maximizes total importance scores of the features and minimizes total similarity scores between the features. Also, the disclosure includes selecting features for ranking that solves an optimization problem. Thus, this disclosure identifies relevant features by removing noisy and redundant features and speeds up a process of model training. | 07-23-2009 |
| 20090198673 | Forum Mining for Suspicious Link Spam Sites Detection - An anti-spam technique for protecting search engine ranking is based on mining search engine optimization (SEO) forums. The anti-spam technique collects webpages such as SEO forum posts from a list of suspect spam websites, and extracts suspicious link exchange URLs and corresponding link formation from the collected webpages. A search engine ranking penalty is then applied to the suspicious link exchange URLs. The penalty is at least partially determined by the link information associated with the respective suspicious link exchange URL. To detect more suspicious link exchange URLs, the technique may propagate one or more levels from a seed set of suspicious link exchange URLs generated by mining SEO forums. | 08-06-2009 |
| 20090216868 | ANTI-SPAM TOOL FOR BROWSER - An anti-spam tool works with a web browser to detect spam webpages locally on a client machine. The anti-spam tool can be implemented either as a plug-in module or an integral part of the browser, and manifested as a toolbar. The tool can perform an anti-spam action whenever a webpage is accessed through the browser, and does not require direct involvement of a search engine. A spam detection module installed on the computing device determines whether a webpage being accessed or whether a link contained in the webpage being accessed is spam, by comparing the URL of the webpage or the link with a spam list. The spam list can be downloaded from a remote search engine server, stored locally and updated from time to time. A two-level indexing technique is also introduced to improve the efficiency of the anti-spam tool's use of the spam list. | 08-27-2009 |
| 20090259651 | SEARCH RESULTS RANKING USING EDITING DISTANCE AND DOCUMENT INFORMATION - Architecture for extracting document information from documents received as search results based on a query string, and computing an edit distance between the data string and the query string. The edit distance is employed in determining relevance of the document as part of result ranking by detecting near-matches of a whole query or part of the query. The edit distance evaluates how close the query string is to a given data stream that includes document information such as TAUC (title, anchor text, URL, clicks) information, etc. The architecture includes the index-time splitting of compound terms in the URL to allow the more effective discovery of query terms. Additionally, index-time filtering of anchor text is utilized to find the top N anchors of one or more of the document results. The TAUC information can be input to a neural network (e.g., 2-layer) to improve relevance metrics for ranking the search results. | 10-15-2009 |
| 20090281791 | UNIFIED TAGGING OF TOKENS FOR TEXT NORMALIZATION - Raw input text is received, and divided into sequences of tokens. Each token is marked with a text normalization tag that identifies a text normalization operation to be performed on the token during text normalization. The tags are assigned to the tokens by determining a most likely tag sequence, given the sequence of tokens being processed. The text normalization operations are performed on the tokens in order to provide clean output text, which can be output for further natural language processing. | 11-12-2009 |
| 20090319505 | TECHNIQUES FOR EXTRACTING AUTHORSHIP DATES OF DOCUMENTS - Various technologies and techniques are disclosed for calculating authorship dates for a document. A portion of a document to select to look for possible authorship dates is determined. The possible authorship dates are extracted from the portion of the document. A revised authorship date of the document is generated using a neural network. The revised authorship date is returned to an application or process that requested the date. | 12-24-2009 |
| 20090327264 | Topics in Relevance Ranking Model for Web Search - Described is a technology by which topics corresponding to web pages are used in relevance ranking of those pages. Topics are extracted from each web page of a set of web pages that are found via a query. For example, text such as nouns may be extracted from the title, anchor texts and URL of a page, and used as the topics. The extracted topics from a page are used to compute a relevance score for that page based on an evaluation of that page's topics against the query. The pages are then ranked relative to one another based at least in part on the relevance score computed for each page, such as by determining a matching level for each page, ranking pages by each level, and ranking pages within each level. Also described is training a model to perform the relevance scoring and/or ranking. | 12-31-2009 |
| 20100073374 | CALCULATING A WEBPAGE IMPORTANCE FROM A WEB BROWSING GRAPH - Method for creating a graph representing web browsing behavior, including receiving web browsing behavior data from one or more web browsers; adding a node on the graph for each web page listed in the web browsing behavior data; adding a first link connecting two or more nodes on the graph, wherein the first link representing a hyperlink for accessing a webpage; calculating an amount of time in which each web page is being accessed; determining a number of units of time in the calculated amount of time; adding one or more virtual nodes to the graph based on the number of units of time; and adding a second link connecting two or more virtual nodes on the graph, wherein the second link representing a virtual hyperlink for accessing a webpage. | 03-25-2010 |
| 20100076910 | CALCULATING WEB PAGE IMPORTANCE BASED ON WEB BEHAVIOR MODEL - Method for determining a webpage importance, including receiving web browsing behavior data of one or more users; creating a model of the web browsing behavior data; calculating a stationary probability distribution of the model; and correlating the stationary probability distribution to the webpage importance. | 03-25-2010 |
| 20100082606 | DIRECTLY OPTIMIZING EVALUATION MEASURES IN LEARNING TO RANK - The present invention provides methods for improving a ranking model. In one embodiment, a method includes the step of obtaining queries, documents, and document labels. The process then initializes active sets using the document labels, wherein two active sets are established for each query, a perfect active set and an imperfect active set. Then, the process optimizes an empirical loss function by the use of the first and second active set, whereby parameters of the ranking model are modified in accordance to the empirical loss function. The method then updates the active sets with additional ranking data, wherein the updates are configured to work in conjunction with the optimized loss function and modified ranking model. The recalculated active sets provide an indication for ranking the documents in a way that is more consistent with the document metadata. | 04-01-2010 |
| 20100082613 | OPTIMIZING RANKING OF DOCUMENTS USING CONTINUOUS CONDITIONAL RANDOM FIELDS - The present invention provides an improved method for ranking documents using a ranking model. One embodiment employs Continuous Conditional Random Fields (CRF) as a model, which is a conditional probability distribution representing a mapping relationship from retrieved documents to their ranking scores. The model can naturally utilize features of the content information of documents as well as the relation information between documents for global ranking. The present invention also provides a learning algorithm for creating Continuous CRF. Also provided, the invention introduces Pseudo Relevance Feedback and Topic Distillation. | 04-01-2010 |
| 20100082617 | PAIR-WISE RANKING MODEL FOR INFORMATION RETRIEVAL - The present invention provides techniques for generating data that is used for ranking documents. In one embodiment, a method involves the step of extracting data features from a number of documents to be ranked. The data features extracted from the documents are established in conjunction with a first feature map and a second feature map, wherein the first feature map and the second feature map are capable of keeping the relative ordering between two document instances. In one embodiment, the two feature maps are specially a divide feature map and a minus feature map. Once the data is mapped, the method involves the step of generating pairwise preferences from the first feature map and the second feature map. Then the pairwise preferences are aggregated into a total order, which can be used to produce one or more relevancy scores. | 04-01-2010 |
| 20100082639 | PROCESSING MAXIMUM LIKELIHOOD FOR LISTWISE RANKINGS - The present invention introduces a new approach to learning systems. More specifically, the present invention provides learned methods for optimize ranking models. In one aspect of the present invention, an objective function is defined as the likelihood of ground truth based on a Luce model. In another aspect, techniques of the present invention provide a way of representing different kinds of ground truths as a constraint set of permutations. In yet another aspect of the present invention, techniques of the present invention provide a way of learning the model parameter by maximizing the likelihood of the ground truth. | 04-01-2010 |
| 20100095567 | Handle with Advertising Areas - A handle with advertising areas is an advertisement display device for use on the poles in bus, subway, and so on. The device can be installed on and removed from a handrail easily and can help people hold on easier and better than on handrail. This device has a fixing part and a handle part connecting by a knitting strip ring. The device has five gaps to hold advertisement sheets and dispensing tracts. Advertisement sheet and tracts can be removably inserted into a gap. Each tract has an exposed end outside the handle part for people to take it out. Fastening members are provided for clamping the multi-piece device onto a handrail. | 04-22-2010 |
| 20100169323 | Query-Dependent Ranking Using K-Nearest Neighbor - Described is a technology in which documents associated with a query are ranked by a ranking model that depends on the query. When a query is processed, a ranking model for the query is selected/determined based upon nearest neighbors to the query in query feature space. In one aspect, the ranking model is trained online, based on a training set obtained from a number of nearest neighbors to the query. In an alternative aspect, ranking models are trained offline using training sets; the query is used to find a most similar training set based on nearest neighbors of the query, with the ranking model that corresponds to the most similar training set being selected for ranking. In another alternative aspect, the ranking models are trained offline, with the nearest neighbor to the query determined and used to select its associated ranking model. | 07-01-2010 |
| 20100190663 | DEVICE FOR WASHING AND HYBRIDIZATION OF BIOCHIPS - A device for biochip hybridization or washing is provided, which comprises a carousel ( | 07-29-2010 |
| 20100208676 | Signal Transmission Method and Apparatus for OFDMA Wireless Communication System - Embodiments of the present invention provide a signal transmission method and apparatus used in an Orthogonal Frequency Division Multiple Access (OFDMA) wireless communication system, to enhance stability of signal transmission and resist time-frequency dispersion. The signal transmission method used in the OFDMA wireless communication system provided by an embodiment of the invention includes: converting an L×1 symbol vector into an N×1 modulating signal vector according to a loading factor fed back by a receiving party, in which value of N is known, both L and N are natural numbers larger than one, N is larger than or equal to L, the loading factor is a ratio of L and N; mapping the N×1 modulating signal vector into N time-frequency grids; and converting the N time-frequency grids into a signal waveform and sending the signal waveform to the receiving party. | 08-19-2010 |
| 20100211588 | Context-Aware Query Suggestion By Mining Log Data - Techniques described herein describe a context-aware query suggestion process. Context of a current query may be calculated by analyzing a sequence of previous queries. Historical search data may be mined to generate groups of query suggestion candidates. Using the context of the current query, the current query may be matched with the groups of query suggestion candidates to find a matching query suggestion candidate, which may be provided to the user. | 08-19-2010 |
| 20100220677 | METHOD AND DEVICE FOR TRANSMITTING VOICE IN WIRELESS SYSTEM - Embodiments of the present invention provide a method and device for transmitting voice in a wireless system. The method includes: identifying, by a transmitter, each original voice encoding packet needed to be sent out with a number indicating playback order, and performing channel encoding on each identified original voice encoding packet to construct a voice session packet; establishing a voice session or voice data mixed session between the transmitter and a receiver; allocating a channel dynamically for the voice session or the voice data mixed session; sending, by the transmitter, newly-arrived voice session packets, delayed voice session packets, voice session packets needed to be re-transmitted, data session packets and control command packets according to pre-configured priority; receiving and detecting, by the receiver, the voice session packets, sending an NACK packet comprising number of a lost voice session packet to the transmitter to inform the transmitter to re-transmit the voice session packet, if it is confirmed that the voice session packet is lost; and putting voice session packets properly received into a jitter buffer controller at the receiver if the receiver is a terminal. In embodiments of the present invention, spectral efficiency and reliability of real-time voice services in a wireless multi-service transmission system may be improved while satisfying the Quality of Service (QoS) requirements of real-time services, such as voice service. | 09-02-2010 |
| 20100220694 | Ranging Method and Apparatus in Wireless Communication System - The present invention provides a ranging method and apparatus, a frame structure includes one or more downlink service time slots, a guard interval between downlink sub-frame and uplink sub-frame and one or more uplink service time slots, and the method includes calculating start time of the first uplink service time slot, configuring the start time as reference time; generating a ranging signal; subtract a sum of time period needed for sending the ranging signal and reference time delay from the reference time and configure obtained time result as time of starting to send the ranging signal; subtract the length of a special ranging time slot from the reference time and configure obtained time result as time of starting to receive the ranging signal by a BS; receiving and processing the ranging signal. By the method and apparatus, all kinds of interference are minimized and an optimum ranging function is implemented. | 09-02-2010 |
| 20100228711 | Enterprise Search Method and System - A system and method for enterprise search includes one or more computer-readable media storing computer-executable instructions that, when executed on one or more processors that perform acts including extracting one or more of term data, personal data and metadata from one or more predetermined resources; retrieving a set of information derived from the extracted term data, personal data and metadata responsive to a query; and receiving feedback responsive to the set of information, the feedback augmenting at least one of the one or more predetermined resources. | 09-09-2010 |
| 20100238846 | WIRELESS COMMUNICATION SYSTEM BASED ON CODE SPREADING-ORTHOGONAL FREQUENCY DIVISION MULTIPLE ACCESS AND SMART ANTENNA - A time division duplex wireless communication system based on Code Spreading-Orthogonal Frequency Division Multiple Access (CS-OFDMA) and a smart antenna includes: an antenna array and multichannel transceiver, a space processor, a demodulator, an L2 processor and a modulator. The CS-OFDMA system provided by the present invention combines synchronous CDMA technique and OFDMA technique, overcomes the severe ISI caused by spectrum-spreading by the conventional CDMA system while transmitting wideband data, effectively counteracts frequency-selective fading and inter-cell interference, and is beneficial to reliable transmission of narrowband voice and wideband data and also beneficial to co-frequency networking. | 09-23-2010 |
| 20100246641 | TIME-FREQUENCY CODE SPREADING METHOD AND APPARATUS IN OFDMA SYSTEM - The present invention provides a time-frequency code spreading method in an OFDMA system. The method includes: converting a transmission message into one or more modulating signal vectors, and each bit of the transmission message is spread onto all vector elements of a modulating signal vector; mapping one or more modulating signal vectors to a set of time-frequency grids, wherein in an OFDMA time-frequency plane, two time-frequency grids to which any two vector elements in each modulating signal vector are mapped do not have the same frequency location or time location. In addition, the present invention also provides a time-frequency code spreading apparatus in an OFDMA system. | 09-30-2010 |
| 20100296385 | USER SIGNAL TRANSMITTING AND RECEIVING METHOD, APPARATUS AND SYSTEM IN OFDMA SYSTEM - This invention provides a user signal transmitting method in an OFDMA system, where all the time-frequency grids of each timeslot are divided into sub-channels, each sub-channel comprises N | 11-25-2010 |
| 20100311452 | METHOD AND APPARATUS FOR ALLOCATING RADIO RESOURCES IN WIRELESS COMMUNICATION SYSTEM - Disclosed are method and apparatus for allocating radio resources. The method for allocating radio resource includes: determining, by a base station, a group of downlink sub-channels and transmission parameters related to the group of downlink sub-channels according to downlink channel characteristics and downlink interference characteristics of each resource block and a downlink bandwidth requirement of a terminal reported by the terminal, and transmitting the group of downlink sub-channels and the related transmission parameters determined to the terminal. The method and apparatus are able to allocate radio resources and determine transmission parameters based on user service requirement and system channel conditions, which greatly optimizes the system performances and improves efficiency. | 12-09-2010 |
| 20110029466 | SUPERVISED RANK AGGREGATION BASED ON RANKINGS - A method and system for rank aggregation of entities based on supervised learning is provided. A rank aggregation system provides an order-based aggregation of rankings of entities by learning weights within an optimization framework for combining the rankings of the entities using labeled training data and the ordering of the individual rankings. The rank aggregation system is provided with multiple rankings of entities. The rank aggregation system is also provided with training data that indicates the relative ranking of pairs of entities. The rank aggregation system then learns weights for each of the ranking sources by attempting to optimize the difference between the relative rankings of pairs of entities using the weights and the relative rankings of pairs of entities of the training data. | 02-03-2011 |
| 20110078188 | Mining and Conveying Social Relationships - Techniques and tools described herein mine social information from a source and store the social information in a database. Responsive to a search object, the techniques search the stored social information and determine social relationships. The techniques further provide, via a graphical user interface, the social relationships determined from the social information stored in the database. In several embodiments, the techniques enable social relationship feedback. | 03-31-2011 |
| 20110131166 | FUZZY USERS' ATTRIBUTES PREDICTION BASED ON USERS' BEHAVIORS - A method, apparatus, system, article of manufacture, and computer readable storage medium provide the ability to predict and utilize a user's attributes. A sample user behavior and a sample user attribute are collected. A model is trained based on the sample user behavior and sample user attribute. Using the model, a probability of a predicted user attribute based on the sample user behavior is predicted. Using the model and the probability, the predicted user attribute is fuzzily determined based on a real user behavior. The predicted user attribute is used to improve a user's experience. | 06-02-2011 |
| 20110161330 | CALCULATING GLOBAL IMPORTANCE OF DOCUMENTS BASED ON GLOBAL HITTING TIMES - A calculate importance system calculates the global importance of a web page based on a “mean hitting time.” Hitting time of a target web page is a measure of the minimum number of transitions needed to land on the target web page. Mean hitting time of a target web page is an average number of such transitions for all possible starting web pages. The calculate importance system calculates a global importance score for a web page based on the reciprocal of a mean hitting time. A search engine may rank web pages of a search result based on a combination of relevance of the web pages to the search request and global importance of the web pages based on a global hitting time. | 06-30-2011 |
