Abstract: Method and apparatus for processing electronically stored information (ESI) for electronic discovery are described. In some examples, an electronic analysis of documents in the ESI indicated as being responsive to a search query of the ESI is performed. Results of the electronic analysis are stored in a database to provide a repository of case knowledge. Search parameters for at least one additional search query are generated automatically based on the case knowledge. The search parameters are provided as output.

Abstract: A method is provided for determining a correlation between a reference user and another user on the basis of two sets of ratings, where each rating is associated with a respective user. In response to a trigger, user ratings associated with the reference user and user ratings associated with the other user are collected, and all co-rated items of these two sets are correlated in the basis of an adjusted cosine correlation function which is weighted by a first and a second weighting function. The correlation is then stored and may be repeated for a plurality of users. The stored correlations may be used e.g. for ranking purposes.

Abstract: A method of reciprocally publishing and matching data files by facilitating the creation of Category A and Category B data files having a respective sets of characteristics defined utilizing a common language architecture, associating enhancement objects with each data file, identifying characteristics in each data file which must be met by other data files, weighting characteristics in each data file differently from other characteristics in the same data file, enabling the selection of participation levels for each data file in marketspaces, and matching Category A data files participating in particular marketspaces to Category B data files participating in the same marketspaces using the common language architecture, the enhancement objects, the weights and the required characteristics.

Abstract: A method is provided of retrieving a configuration record from a configuration management database pertaining to an IT-infrastructure including host devices, a configuration record having attributes and assigned attribute values, the IT-infrastructure being managed by an operation management system providing messages indicating events in the IT-infrastructure. The method includes providing a message including a set of unidentified attribute values and an identified host value, retrieving from the configuration management database one or more configuration records containing the identified host value, and selecting from the one or more retrieved configuration records a configuration record depending on the number of matches between the unidentified attribute values and the attribute values of the retrieved configuration records.

Abstract: A system, method, and computer readable medium for applying one or more information retrieval technologies is disclosed for resolving a query. In one embodiment, an exemplary system generates a response using a language analysis module configured to parse a query into elements. This system can also include a rules engine configured to compare a condition of a rule against the elements, where the rule is configured to perform an action to retrieve information. Further, a response generator coupled to said rules engine receives the rule and retrieves the information for presentation to a querier in a portion of a display that adjusts proportionately to the degree of importance of said information.

Abstract: Calendar-based suggestion of travel options involves suggesting a travel option based on events stored in a calendar of a user. For example, a user in San Francisco may be scheduled for a business trip to New York, and the user's calendar may show a dinner reservation in San Francisco on Saturday, September 3 and business meeting in New York on Monday, September 5. A suggestion machine accesses calendar data of the user and travel data for several available travel options (e.g., flights from San Francisco to New York). Based on the accessed calendar data and travel data, the suggestion machine determines that one or more travel options (e.g., a flight on Sunday, September 4) are compatible with the dinner reservation and the business meeting on the user's calendar. The suggestion machine presents these compatible travel options to the user.

Abstract: A retrieving apparatus includes a processor that specifies in each tier of synonym dictionary data, classification codes of a search word in a search character string and those of a comparison word in character strings for comparison; extracts from among the specified classification codes, classification codes in a specific tier; judges for each character string for comparison, whether the extracted classification code of the search word and that of the comparison word match; counts for the specific tier, matching classification codes; determines based on the count, whether a character string is to be excluded whose classification code of the comparison word for the specific tier does not match that of the search word; calculates based on the specified classification code of the search word and that of the comparison word in the character string not to be excluded, similarity between the two character strings; and outputs a calculation result.

Abstract: Systems and methods for identifying which video segment is being displayed on a screen of a television system. The video segment is identified by deriving data from the television signals, the derived data being indicative of the video segment being displayed on the screen. This feature can be used to extract a viewer's reaction (such as changing the channel) to a specific video segment (such as an advertisement) and reporting the extracted information as metrics. The systems and methods may further provide contextually targeted content to the television system. The contextual targeting is based on not only identification of the video segment being displayed, but also a determination concerning the playing time or offset time of the particular portion of the video segment being currently displayed.

Abstract: Techniques for detecting patterns in one or more data streams. A pattern to be detected may be specified using a regular expression. Events received in a data stream are processed during runtime to detect occurrences of the specified pattern in the data stream.

Abstract: A content search system includes multiple pipelined search engines that implement different portions of a regular expression search operation. For some embodiments, the search pipeline includes a DFA engine, an NFA engine, and a token stitcher that combines partial match results generated by the DFA and NFA engines. The token stitcher can be configured to implement unbounded sub-expressions without utilizing resources of the DFA or NFA engines. A token stitcher may comprise an input line for receiving tokens that indicate a partial match between an input string and a regular expression, a flag bank that stores flags which, when activated, identify one or more of the sub-expressions that match the input string, a program memory that stores programs that each comprises instructions for processing tokens, and an engine configured to identify programs that are associated with a newly received token.

Abstract: A route searching apparatus includes a travel route accumulation unit, an algorithm selection unit to select route searching algorithms to meet the preference of a user based on the accumulated travel routes, and a route searching unit to perform a route search up to a destination by using the selected algorithms. Preferably, the algorithm searching unit searches for each of the travel routes accumulated in the accumulation unit by means of several algorithms, calculates, for each algorithm, a match rate between the searched route and the actual travel route, and selects an algorithm of the highest match rate. Also, it is preferable that a condition common to roads avoided by the user is extracted from the accumulated travel routes, and a route search is performed by adjusting search costs so as to make such roads less prone to be selected.

Abstract: As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes.

Abstract: A method executed by a computer includes searching a design subject having similar attribute information from attribute information on a design subject designed in the past and histories of descriptions of improvements based on input information on a design subject; obtaining a description of an improvement on the searched design subject having similar attribute information from the histories, obtaining a design subject the description of an improvement of which has an effect of the improvement, and outputting improved input information, wherein the attribute information contributing to the improvement of the design subject is obtained and reflected in the input information, and the history of the improved input information is stored.

Abstract: In one embodiment, a method of generating annotation tags (28) for a digital image (22) includes maintaining a library (16) of human-meaningful words or phrases organized as category entries (72) according to a number of defined image description categories (70), and receiving context metadata (20) associated with the capture of a given digital image (22). The method further includes selecting particular category entries (72-1, 72-2) as vocabulary metadata (24) for the digital image (22) by mapping the context metadata (20) into the library (16), and generating annotation tags (28) for the digital image (22) by logically combining the vocabulary metadata (24) according to a defined set of deductive logic rules (30) that are predicated on the defined image description categories (70). In another embodiment, a processing apparatus (12), such as a digital processor (18, 26) and supporting memory (14), etc., is configured to carry out the above method, or to carry out variations of the above method.

Abstract: A content search system includes multiple pipelined search engines that implement different portions of a regular expression search operation. For some embodiments, the search pipeline includes a DFA engine, an NFA engine, and a token stitcher that combines partial match results generated by the DFA and NFA engines. The token stitcher can be configured to implement unbounded sub-expressions without utilizing resources of the DFA or NFA engines. The token stitcher may comprise a flag bank for storing a number of flags. Each flag may identify a sub-expression that matches the input string. The flag bank may be configured to discard one or more flags upon satisfaction of a predetermined condition for purposes of recapturing hardware resources to provide a certain level of performance.

Abstract: Devices, systems, and methods of performing feature detection on a set of multimedia files are disclosed. One method of organization includes identifying a feature from each multimedia file within the set of multimedia files wherein each file has one feature, organizing the features based on their similarities wherein similar features are grouped based upon a proximity in a feature space and a representative feature is identified for each group, receiving a detection model having one or more detection criteria the detection model having previously been trained for detection using the organized features, and using the representative features to apply the detection model in a decreasing order of detection probability in order to detect the files satisfying the detection criteria within the set of multimedia files.

Abstract: A method of sampling data in a database includes designating permanent read locations in a database. The database is populated with randomly loaded data. The permanent read locations in the database are sampled to form sampled repeatable results attributable to the permanent read locations and the randomly loaded data.

Abstract: To provide a technique for accurately and efficiently generating Boolean search formulas that serve as a basis of similarity search. A Boolean search formula generation apparatus according to the present invention establishes Boolean search formulas expressed in a standard sum of products form connecting products of search terms by a sum and evaluates the Boolean search formulas based on a recall and a precision. The Boolean search formula generation apparatus repeats connecting the products of the search terms with maximum evaluation values by a sum to establish a Boolean search formula.

Abstract: A method and an apparatus for training a handwritten document categorizer are disclosed. For each category in a set into which handwritten documents are to be categorized, discriminative words are identified from the OCR output of a training set of typed documents labeled by category. A group of keywords is established including some of the discriminative words identified for each category. Samples of each of the keywords in the group are synthesized using a plurality of different type fonts. A keyword model is then generated for each keyword, parameters of the model being estimated, at least initially, based on features extracted from the synthesized samples. Keyword statistics for each of a set of scanned handwritten documents labeled by category are generated by applying the generated keyword models to word images extracted from the scanned handwritten documents. The categorizer is trained with the keyword statistics and respective handwritten document labels.

Abstract: One embodiment provides a system for facilitating sanitizing a modified version of a document relative to one or more sensitive topics. During operation, the system determines a privacy risk for a term in the modified version relative to the sensitive topics, wherein the privacy risk measures the extent to which the sensitive topic(s) can be inferred based on the term. Next, the system determines an information utility and privacy loss or gain for the modified version, where the information utility reflects the extent to which the modified version has changed and the privacy loss or gain reflects the extent to which the modified version is reduced in sensitivity.

Abstract: A logical table definition is received as part of a database query within a distributed database system. A determination is made as to whether the received logical table definition matches a local logical table definition. The query is processed in response to determining that the received logical table definition matches the local logical table definition. The query is forwarded to at least one other distributed database node.

Abstract: A content based load balancing system receives a request for data provided by a resource. The content based load balancing system searches a content history cache for a content history cache entry corresponding to the requested data. The content based history cache then selects a resource node to service the request based on the content history cache entry corresponding to the data.

Abstract: Methods, systems and apparatus, including computer program products, for generating respective random weights for identified audience members matching an audience specification in order to mask the behavior of individuals. The mean value of the random weights for large audience results approaches one so that a sum of the weights approximates a count of the matching records.

Abstract: Method, system, and programs for information search and retrieval. A query is received and is processed to generate a feature-based vector that characterizes the query. A unified representation is then created based on the feature-based vector, that integrates semantic and feature based characterizations of the query. Information relevant to the query is then retrieved from an information archive based on the unified representation of the query. A query response is generated based on the retrieved information relevant to the query and is then transmitted to respond to the query.

Abstract: Embodiments of the inventive concept reduce the burden of creating litigant sources of evidence or other evidentiary materials in connection with litigation in a court of law. Designation of at least one document file included in digital document information is accepted and designation of a language into which the designated document file is translated is accepted. The document file, the designation of which is accepted, is translated into the language the designation of which is accepted. A common document file representing the same content as that of the designated document file is extracted from digital document information recorded in a recording unit. Translation-related information representing that the extracted common document file is translated by invoking a translated content of the translated document file is generated, and, based on the translation-related information, a litigant-related document file is output.

Abstract: Systems and approaches for searching a content collection corresponding to query content are provided. In particular, false positive match rates between the query content and the content collection may be reduced with a minimum content region test and/or a minimum features per scale test. For example, by correlating content descriptors of a content piece in the content collection with query descriptors of the query content, the content piece can be determined to match the query content when a particular region of the content piece and/or a particular region of a query descriptor have a proportionate size meeting or exceeding a specified minimum. Alternatively, or in addition, the false positive match rate between query content and a content piece can be reduced by comparing content descriptors and query descriptors of features at a plurality of scales. A content piece can be determined to match the query content according to descriptor proportion quotas for the plurality of scales.

Abstract: Semantic object characterization and its use in indexing and searching a database directory is presented. In general, a first binary hash code is generated to represent a first representation or view of a semantic object which when compared to a characterized version of a second representation or view of the same semantic object in the form of a second binary hash code, the first and second binary hash codes exhibit a degree of similarity indicative of the objects being the same object. In one implementation the semantic objects correspond to peoples' names and the first and second representations or views correspond to two different languages. Thus, a user can search a database of information in one language with a search query in another language.

Abstract: Methods, systems, and apparatus, including computer program products, for assigning weights to parts of a document. In one aspect, document object is generated for a collection of documents. Weights for the respective portions of the document object model are generated, and a document is ranked in a search engine index, the ranking being based at least in part on the generated weights.

Abstract: Methods and systems are provided for matching expressions to data items. One exemplary method involves identifying a subset of expressions that match data items collectively and then identifying individual data items that match expressions of the subset. In one embodiment, the data items are partitioned into data item subsets, and further subsets of expressions collectively matching the data item subsets are identified. Data items of a respective data item subset are then individually matched to expressions of the respective expression subset that collectively matched that respective data item subset.

Abstract: An input feature vector is computed from an input text record, the input feature vector comprising one or more features, each feature including a subsequence of characters and a frequency of occurrence of the associated subsequence. A input fingerprint is generated out of the input feature vector by choosing one or more features with non-zero frequencies and alphabetizing the features chosen. One or more input indices are generated by alphabetizing features in the input fingerprint and concatenating features occurring in subsequent locations of the input fingerprint. The input text record is matched against a target text record if (1) one or more of the input indices match a target index corresponding to the target text record and (2) the corresponding input fingerprint matches a target fingerprint corresponding to the target text record. The target text record is outputted as a search result if it matches the input text record.

Abstract: Methods and systems for interacting with multiple three-dimensional (3D) object data models are provided. An example method may involve receiving an annotated template of a first three-dimensional (3D) object data model. The annotated template may be associated with a given category of objects and may include one or more annotations to one or more aspects of an object described by the first 3D object data model. The method may also include determining matching correspondences between the first 3D object data model and a second 3D object data model that is a given object in the given category. For the one or more matching correspondences, an annotation that is associated with a correspondence point of the first 3D object data model may be applied as a call-out to a matching correspondence point of the second 3D object data model.

Abstract: Some implementations disclosed herein provide techniques and arrangements to train a blocking scheme using both labeled data and unlabeled data. For example, training the blocking scheme may include iteratively: learning a conjunction, identifying first matches in the labeled data and the unlabeled data that are uncovered by the conjunction, and identifying second matches in the labeled data and the unlabeled data that are covered by the conjunction. The conjunction learned in each iteration may be combined using a disjunction. A search engine may use the search engine when searching for records that match an entity.

Abstract: An example method includes identifying instances of a search term in a source text, and identifying prefix strings and suffix strings comprising tokens preceding and subsequent to the search term in the source text. The method further includes displaying a visualization interface that includes the search term within a combined tree diagram that includes a prefix tree and a suffix tree extending to either side of the search term. The prefix tree displays the prefix strings and the suffix tree displays the suffix strings, and both have user-selectable branches. The method further includes providing, in response to a user input selecting a branch in the prefix tree or in the suffix tree, a visual indication of a prefix string and a suffix string in the visualization interface that form a matching sequence that originate together in the source text, for matching sequences that are connected through the selected branch.

Abstract: There is provided a method that includes (a) receiving an inquiry to initiate a search for data for a specific individual, (b) determining, based on the inquiry, a strategy and flexible predictiveness equations to search a reference database, (c) searching the reference database, in accordance with the strategy, for a match to the inquiry; and (d) outputting the match. The method may also output flexible feedback related to the match that reflects inferred quality of the match experience which can be used by an end-user to determine the degree to which the matched entity meets that end-user's quality-based criteria. There is also provided a system that performs the method, and a storage medium that contains instructions that control a processor to perform the method.

Abstract: The text search apparatus has an information storage that stores plural transposed indexes associating characters or character strings appearing in a document to be searched with the appearance positions of the characters or character strings. The transposed indexes were generated for a document in which beginning marks are added in front of texts to be subject to forward matching search. The incremental searcher of the text search apparatus adds a beginning mark in front of a search keyword and executes a forward matching search using a set of transposed indexes. The main searcher executes a partial match search using the same set of transposed indexes.

Abstract: A method and system for monitoring and analyzing at least one signal are disclosed. An abstract of at least one reference signal is generated and stored in a reference database. An abstract of a query signal to be analyzed is then generated so that the abstract of the query signal can be compared to the abstracts stored in the reference database for a match. The method and system may optionally be used to record information about the query signals, the number of matches recorded, and other useful information about the query signals. Moreover, the method by which abstracts are generated can be programmable based upon selectable criteria. The system can also be programmed with error control software so as to avoid the re-occurrence of a query signal that matches more than one signal stored in the reference database.

Abstract: MicroRNA profiles transition from normal breast to ductal carcinoma in situ and transition to invasive ductal carcinoma (IDC) and methods of use thereof are described. Methods of diagnosis and prognosis using microRNA signatures to differentiate invasive from in situ carcinoma are described. Also described is the use of microRNA expression for predicting overall survival and time to metastasis.

Abstract: An information processing method for defining a data structure for pattern matching, the method executed by an information processing apparatus, comprises generating, by the apparatus, an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint patterns each including plural constraints; searching, by the apparatus, for a second substructure similar to a first substructure from a root node by determining a set relation between transition conditions of respective transition edges; and defining, by the apparatus, an additional transition link from a tail node of the second substructure to a child node at a tail end of the first substructure, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation.

Abstract: A decision tree for classifying computer files is constructed. Computational complexities of a set of candidate attributes are determined. A set of attribute vectors are created for a set of training files with known classification. A node is created to represent the set. A weighted impurity reduction score is calculated for each candidate attribute based on the computational complexity of the attribute. If a stopping criterion is satisfied then the node is set as a leaf node. Otherwise the node is set as a branch node and the attribute with the highest weighted impurity reduction score is selected as the splitting attribute for the branch node. The set of attribute vectors are split into subsets based on their attribute values of the splitting attribute. The above process is repeated for each subset. The tree is then pruned based on the computational complexities of the splitting attributes.

Abstract: Techniques for information retrieval include receiving a plurality of data records, each data record including data fields associated with a business enterprise, the data fields including a name of the business enterprise; updating a plurality of database records associated with the received plurality of data records stored in a database, each database record including attributes including the name of the business enterprise and an alias associated with the name of the business enterprise; receiving a query for a particular database record, the query including at least one of the name of the business enterprise or the alias associated with the name of the business enterprise; and preparing for display, in response to the query, one or more of the database records based on at least one of the name of the business enterprise or the alias associated with the name of the business enterprise.

Abstract: A method for clustering data elements stored in a data storage system includes reading data elements from the data storage system. Clusters of data elements are formed with each data element being a member of at least one cluster. At least one data element is associated with two or more clusters. Membership of the data element belonging to respective ones of the two or more clusters is represented by a measure of ambiguity. Information is stored in the data storage system to represent the formed clusters.

Abstract: Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for identifying matching elements between a source model and a target model comprising receiving a source model and a target model, the source model and the target model each being stored in computer-readable memory; processing the source model and the target model to generate a plurality of similarity values, each similarity value being associated with an element of the source model and an element of the target model; generating a similarity value construct based on the plurality of similarity values and elements of the source model and the target model; and identifying matching elements between the source model and the target model based on the similarity value construct.

Abstract: The present invention relates to an information processing apparatus, an information processing method and an information processing program that are capable of assigning an optimum keyword to a content. The information processing apparatus includes a content characteristic quantity extraction unit 52, a label information extraction unit 54, a associating information computation unit 56, a content characteristic quantity—latent space associating information storage unit 57 and a label information—latent space associating information storage unit 58. The content characteristic quantity extraction unit 52 extracts characteristic quantities related to a content whereas the label information extraction unit 54 extracts label information showing attributes of a content.

Abstract: A system and method for generating tag glossaries and use thereof is provided. A set of tags is accessed. Each tag is associated with a glossary that includes one or more terms and definitions for the terms. A new tag is generated and a new glossary is generated for the new tag based on the glossaries associated with the set of tags. The tag glossaries can be used to provide context for documents associated with the tags, to determine appropriate tags for untagged documents, to help in search for other documents, and to build indices for documents or collections of documents.

Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document lists for the tokens are stored at leaf nodes. When performing a fuzzy full text search, the system uses an edit distance greater than zero. After receiving search tokens, the system traverses the NVC tree to generate document error lists. The system then compares the error lists to identify relevant document identifiers and provides a result set.

Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document sets for the tokens are stored at leaf nodes. After receiving search tokens, the system traverses the NVC tree in a lazy manner by exploring paths through nodes associated with the smallest edit distance. The system provides a result set per edit distance. For example, the system provides a result set of document identifiers associated with documents having the least amount of error first, followed by result sets of document identifiers associated with documents that have progressively more error.

Abstract: The use of the known feature amounts results in a low level of accuracy in finding similar files. To deal with this problem, the similar file determination process of this invention involves dividing a file, while at the same time changing a file dividing condition, and repeating this dividing operation until the total number of divided pieces of data exceeds a predetermined number. For each of the divided pieces of data thus obtained a hash value is calculated and all the hash values are output.

Abstract: A centralized enterprise security and provisioning policy framework is described. Enterprise wide security and provisioning is stored in a hierarchical fashion in a centralized LDAP based Directory server. Each policy and user maps directly to a unique entry in the directory. Policy entries can be created at specific administrative points in the Directory Information Tree instead of having to duplicate these policies as attributes of every user entry in the directory. The policies can be classified into provisioning, authentication, and authorization policies.

Abstract: Mapping product identification data to product information. Generating classifiers operative to classify products referred to in product identification data. Receiving client product identification data. Applying at least one generated classifier on the received product identification data. Using at least one classification determined by the applied classifier(s) and a subset of the client product identification data to query the product database. Qualifying the results of the query using at least one classification.

Abstract: In a data visualization system, a method of analysing and representing spatial data sets to optimize the arrangement of spatial elements, the method including the steps of: retrieving data from a data storage module that is in communication with the data visualization system, determining lift values for a plurality of predefined spatial areas from the retrieved data based on a set of fuzzy association rules applied to the predefined spatial areas, determining spatial performance values for the predefined spatial areas, and calculating a weighted spatial relationship between the determined lift values and spatial performance values.