Abstract: This disclosure describes a portable recording device that is configured to capture real-time multimedia data from a surrounding environment. The portable recording device may comprise one or more sensors to capture the real-time multimedia data, a category selector to selectively toggle between preset positions that designate a category classification to the real-time data, and an activation button to trigger one or more actions relating to the capture of the real-time multimedia data.

Abstract: An Artificial Intelligence (AI)-based data processing system employs a trained AI model for extracting features of products from various product classes and building a product ontology from the features. The product ontology is used to respond to user queries with product recommendations and customizations. Training data for the generation of the AI model for feature extraction is initially accessed and verified to determine of the training data meets a data density requirement. If the training data does not meet the data density requirement, data from one of a historic source or external sources is added to the training data. One of the plurality of AI models is selected for training based on the degree of overlap and the inter-class distance between the datasets of the various product classes within the training data.

Abstract: A processor may receive a plurality of text samples generated by a user and identify at least one variable text element in at least one of the plurality of text samples. The processor may tokenize the at least one variable text element, thereby producing a plurality of tokenized text samples including at least one token. The processor may build a longest common substring from the plurality of tokenized text samples and add the longest common substring and the at least one token to a set of selectable user interface options specific to the user. The processor may generate a user interface comprising the set of selectable user interface options. This can include detecting a user interface context and automatically replacing the at least one token with information specific to the user interface context within the set of selectable user interface options.

Abstract: A query processing system generates and employs a hybrid inverted index of predicates for predicate statement evaluation. The query processing system converts a collection of predicate statements to two parts, a matrix and a set of reduced predicate statements. The query processing system then generates a hybrid inverted index that maps values for variables to predicates from the matrix and the reduced predicate statements that evaluate to true for corresponding values. When querying data, the query processing system performs a lookup on the hybrid inverted index to identify predicates from the matrix and reduced predicate statements that evaluate to true for values of variables for the data. The query processing system identifies predicate statements that evaluate to true by evaluating the matrix and reduced predicate statements using treating predicates identified from the hybrid inverted index as true.

Abstract: Systems and methods for a machine learning query handling platform are described, whereby each computing node in a computer network is configured to implement a respective local prediction model that calculates an output based on input attributes passed through trained parameters of the local prediction model, whereby at least two of the computing nodes calculate different predicted outputs to the same input attributes. In an embodiment, the trained parameters of each local prediction model include a first set of parameters received from a remote server, a second set of parameters received from another interconnected computing node, and a third set of parameters based on data in a local memory. Other embodiments are also described and claimed.

Abstract: A system includes a memory and a node. The memory stores first and second log string correlithm objects. The node receives first and second real-world numerical values, and identifies a first sub-string correlithm object from the first log string correlithm object representing the first real-world numerical value and a second sub-string correlithm object from the second log string correlithm object representing the second real-world numerical value. The node aligns the first and second log string correlithm objects such that the first sub-string correlithm object aligns with the second sub-string correlithm object. The node identifies a sub-string correlithm object from the second log string correlithm object representing the logarithmic value of one. The node determines which sub-string correlithm object from the first log string correlithm object aligns with the identified sub-string correlithm object from the second log string correlithm object. The node outputs the determined sub-string correlithm object.

Abstract: Example data processing systems and methods are described. In one implementation, a system accesses a corpus of data and analyzes the data contained in the corpus of data to identify multiple documents. The system generates vector indexes for the multiple documents such that the vector indexes allow a computing system to quickly access the plurality of documents and identify an answer to a question associated with the corpus of data.

Abstract: Automatic processing of documents often generates results far different from those obtained by manual human processing. For a given document processing task, many different techniques can be tried but it is often not known which will best emulate manual, human processing. This application discloses data processing equipment and methods specially adapted for a specific application: analysis of the breadth of documents. The processing may include context-dependent pre-processing of documents and sub-portions of the documents. The sub-portions may be analyzed based on word count and commonality of words in the respective sub-portions. The equipment and methods disclosed herein improve upon other automated techniques to provide document processing by achieving a result that is quantitatively closer to manual, human processing.

Abstract: A computer-based method of reducing or limiting data transmissions from a computer to a remote network destination includes receiving an indication, at an agent on a computer, that a recent user activity has occurred at the computer. The indication typically includes data relevant to user context when the user activity occurred. The method further includes determining, with the agent, whether the data relevant to the user's context when the user activity occurred indicates that a change in user context relative to a user activity at the computer immediately prior to the recent user activity and conditioning a transmission of data relevant to the recent user activity from the computer to a remote network destination based on an outcome of the determination.

Abstract: A correlithm object processing system that includes a trainer configured to receive a real world input value and a real world output value. The trainer is further configured to send the real world input value to a sensor engine and to receive a source correlithm object in response to sending the real world value to the sensor engine. A source correlithm object is a point in an n-dimensional space represented by a binary string. The trainer is further configured to send a real world output value to an actor engine and to receive a target correlithm object in response to sending the real world output value to the actor engine. A target correlithm object is a point in the n-dimensional space represented by a binary string. The trainer is further configured to generate an entry in a node table linking the source correlithm object with the target correlithm object.

Abstract: A method comprising receiving an image of an electronic document comprising data fields and corresponding textual regions; processing said image to obtain (i) a collection of said data fields comprising an indication of a location and a field type, and (ii) an array of said textual regions comprising an indication of a location and a content; creating a mapping comprising associations of data fields in said collection with textual regions in said array based, at least in part, on analyzing a geometric relationship between each of said data fields and each of said textual regions; deriving at least one context rule for evaluating said associations, based, at least in part, on identifying a structure of said electronic document; and determining a correctness of at least one of said associations in said mapping, based, at least in part, on said at least one context rule.

Abstract: The disclosed computer-implemented method for determining topics of data artifacts may include (1) extracting at least one initial keyword from a data artifact with an unknown topic, (2) creating a set of keywords by generating a plurality of contextually relevant keywords related to the initial keyword and combining the initial keyword with the contextually relevant keywords to form the set of keywords, (3) retrieving, from a topic processor, at least one list of topics associated with each keyword within the set of keywords, and (4) generating, based on the retrieved topic lists, an ordered list of probable topics of the data artifact. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Providing query suggestions using a query log including a number of user sessions that comprise training data including a sequence of a plurality of sets of queries. Some of the sets of queries include query transitions followed by a purchase related event. The query log is cleaned and normalized. Query log stationary scores and transition scores of at least some of the plurality of sets is generated. A set of query suggestions is built and similarity scores are computed for at least some of the set of query suggestions to determine whether individual ones of the at least some of the set of query suggestions meet a predetermined assurance level. Those that meet the level are included as elements of the set of query suggestions that meet the predetermined assurance level. That set of query suggestions are mixed and ranked in accordance with a user behavior sought to be optimized.

Abstract: The present invention relates to a method for providing a virtual job market on a network comprising an application server and clients and/or electronic message systems allowing to input and output information, wherein the method comprises the following steps: providing primary dimensions information on industries, career levels and functional areas; providing secondary dimensions information on salary ranges and/or geo-data and/or educational information and/or languages and/or special expertises, entering the primary and secondary dimensions information in a three dimensional data base on the application server; collecting information chunks of open jobs and candidate profiles, and placing the information chunks in a distinct cell or number of cells in the three dimensional database.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a search query that includes a query term from a client device; obtaining first search results for the search query; identifying a candidate expansion of the query term in text associated with the first search results; revising the search query to include the candidate expansion of the query term; and obtaining second search results for the revised search query.

Abstract: Some embodiments of the present disclosure provide a graphical user interface as a means of inputting search parameters to database search engines. In some embodiments, two or three dimensional projections spatially represent relationships between search parameters, located along the periphery of the projections and search hits whose significance are represented by position relative to the center of the projection and comparative distance from each of the search parameters. As the user manipulates the overall shape of the search projection, the weighting of search parameters adjusts, reconfiguring the search. The present disclosure also provides, in some embodiments, an intuitive means of assimilating search parameter weightings based on peer or social network preferences with global search results.

Abstract: Methods, systems, and computer programs are presented for providing internet content, such as related news articles. One method includes an operation for defining a plurality of candidates based on a seed. For each candidate, scores are calculated for relevance, novelty, connection clarity, and transition smoothness. The score for connection clarity is based on a relevance score of the intersection between the words in the seed and the words in each of the candidates. Further, the score for transition smoothness measures the interest in reading each candidate when transitioning from the seed to the candidate. For each candidate, a relatedness score is calculated based on the calculated scores for relevance, novelty, connection clarity, and transition smoothness. In addition, at least one of the candidates is selected based on their relatedness scores for presentation to the user.

Abstract: Some embodiments of the present disclosure provide a graphical user interface as a means of inputting search parameters to database search engines. In some embodiments, two or three dimensional projections spatially represent relationships between search parameters, located along the periphery of the projections and search hits whose significance are represented by position relative to the center of the projection and comparative distance from each of the search parameters. As the user manipulates the overall shape of the search projection, the weighting of search parameters adjusts, reconfiguring the search. The present disclosure also provides, in some embodiments, an intuitive means of assimilating search parameter weightings based on peer or social network preferences with global search results.

Abstract: A method of location-based data organization is provided. The method includes obtaining a graph that includes nodes, each node connected to at least one other node with an arc. The nodes include a geography nodes associated with geographical locations, and activity nodes. The method also includes dynamically assigning weights to the nodes, and finding, for a first activity node, a suggested set of one or more activity nodes.

Abstract: Embodiment described herein are directed to an enhanced search engine with multiple feedback loops for providing optimal search results that are responsive a user's search query. The user's search query is parsed, and based on the underlying terms, different linguistic models and refinement techniques generate alternative candidate search queries that may yield better results. Searches are performed for the original search query and the candidate search queries, and different scores are used to select the best search results to present to the user. Results making it onto the list, as well as the underlying candidate search query, linguistic model, or refinement technique for generating that search query, will have their corresponding scores updated to reflect their success of generating a search result. Scores are stored and used by future searches to come up with better results.

Abstract: Data elements from data sources and having a data value set are linked by using hash functions to determine a dimensionally reduced instance signature for each data element based on all data values associated with that data element to yield a plurality of dimensionally reduced instance signatures of equivalent fixed size such that similarities among the data values in the data value sets across all data elements is maintained among the plurality of instance signatures. Candidate pairs of data elements to link are identified using the plurality of instance signatures in locality sensitive hash functions, and a similarity index is generated for each candidate pair using a pre-determined measure of similarity. Candidate pairs of data elements having a similarity index above a given threshold are linked.

Abstract: A query is received to search data, where the query includes a search term. A search of the data is performed in response to the query, wherein the search produces result data based on the search term and an identifier of a searcher submitting the query.

Abstract: Techniques for providing semantic search of a data store are disclosed. A similarity metric of a document comprising the data store to a concept represented in a semantic model derived at least in part from a reference source that includes content not included in the data store is determined. A relevance metric of a search query to the concept is computed. The similarity metric and the relevance metric are used to determine, at least in part, a ranking of the document with respect to the search query.

Abstract: Processing methods and systems are provided for representing documents relative to importance of words in the document. A processor comprising a weighting model of word importance in a document in a collection relative to an importance of the word in other documents in the collection computes a deviation of distribution of the word from a probability distribution of the word in other documents in the collection, where the deviation distribution is weighted in accordance with a concavity control function. A concavity control parameter is adjustable relative to word frequency.

Abstract: A node a data grid receives a prepare request identifying data to lock for a first transaction. The prepare request indicates a locking order that is different from a locking order indicated by a prior prepare request of a second transaction using the same data. The node identifies keys that correspond to the data. The keys are co-located on the node. The node ranks the keys to define an order for acquiring locks for the data based on key identifiers that correspond to the keys. The defined order matches a locking order used by the second transaction. The node acquires locks for the data using the defined order.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting keywords for resources. In one aspect, a method includes identifying a particular online resource that includes non-text content. Co-visitation data are obtained for the particular resource. The co-visitation data specify one or more co-requested online resources for the particular online resource. Each of the co-requested online resources were requested by a user device within a threshold period of the request for the particular online resource by the user device. Keywords are identified for each of the co-requested online resources, and can include keywords that were selected based on text content of the co-requested online resource. One or more of the identified keywords are selected as keywords for the particular resource.

Abstract: A computer-implemented method for performing a semantically enriched search of services includes: receiving a search string that a user inputs for searching services in a repository; generating queries from the search string; searching a multi-document index using the generated queries, the multi-document index including, for each of the services, an index entry comprising documents interlinked with each other, each of the documents reflecting at least one aspect regarding the service; and presenting an outcome of the search to the user in response to receiving the search string.

Abstract: A computer-implemented method for selecting an article from an input set of articles stored on a database of a source device, comprises generating a subset of the articles relevant to a query article using a relevance metric representing a measure of dissimilarity between the query article and selected articles in the set, computing distance measures for respective ones of the articles in the subset using article attributes and article commentary objects, using the distance measures to determine measures of the diversity of respective ones of articles in the subset from one another, and using the diversity measures to select a diverse article in the subset.

Abstract: Various embodiments promote the discoverability of data that can be contained within a database. In one or more embodiments, data within a database is organized in a structure having a schema. The structure and data can be processed in a manner that renders one or more pseudo-documents each of which constitutes a sub-structure that can be indexed. Once produced and indexed, the pseudo-documents constitute a set of searchable objects each of which relationally points back to its associated structure within the database. Searches can now be performed against the pseudo-documents which, in turn, returns a set of search results. The set of search results can include multiple sub-sets of pseudo-documents, each sub-set of which is associated with a different structure.

Abstract: A social networking system provides relevant third-party content objects to users by matching user location, interests, and other social information with the content, location, and timing associated with the content objects. Content objects are provided based on relevance scores specific to a user. Relevance scores may be calculated based on the user's previous interactions with content object notifications, or based on interests that are common between the user and his or her connections in the social network. Context search is also provided for a user, wherein a list of search of results is ranked according to the relevance score of content object associated with the search results. Notifications may also be priced and distributed to users based on their relevance. In this way, the system can provide notifications that are relevant to user's interests and current circumstances, increasing the likelihood that they will find content objects of interest.

Abstract: Ranking search results using result repetition is described. In an embodiment, a set of results generated by a search engine is ranked or re-ranked based on whether any of the results were included in previous sets of results generated in response to earlier queries by the same user in one or more searching sessions. User behavior data, such as whether a user clicks on a result, skips a result or misses a result, is stored in real-time and the stored data is used in performing the ranking. In various examples, the ranking is performed using a machine-learning algorithm and various parameters, such as whether a result in a current set of results has previously been clicked, skipped or missed in the same session, are generated based on the user behavior data for the current session and input to the machine-learning algorithm.

Abstract: The subject disclosure is directed towards providing data for augmenting an entity-attribute-related task. Pre-processing is preformed on entity-attribute tables extracted from the web, e.g., to provide indexes that are accessible to find data that completes augmentation tasks. The indexes are based on both direct mappings and indirect mappings between tables. Example augmentation tasks include queries for augmented data based on an attribute name or examples, or finding synonyms for augmentation. An online query is efficiently processed by accessing the indexes to return augmented data related to the task.

Abstract: Embodiments of the invention provide methods and apparatus for recommending items from a catalog of items to users in a population of users by generating trait vectors that represent items in the catalog responsive to explicit and/or implicit preference data for a group of less than all the users and using the trait vectors to recommend items to users in the population that are not in the group.

Abstract: Methods and apparatus for bot detection using profile based filtration are disclosed. A statistical profile describing attributes of automated-origin content request activity for a network content provider is built. A plurality of content requests of unknown origin in terms of similarity to the attributes is scored. A likelihood of automated-origin content request activity based on the scoring is indicated.

Abstract: Systems, methods, and apparatuses are disclosed for presenting applications to a user, via a mobile wireless communication device (user equipment), that are selected and ranked based on context information describing a location and type of motion of the user equipment, and/or a time that the ranking request was made, compared to context information describing the applications.

Abstract: Methods, systems, and subsystems for identifying and accessing multimedia content are provided. In one embodiment, a system is disclosed for identifying and accessing video files from a network based on information about contents of the video files. The system includes instructions stored on computer readable media, and the instructions perform the following steps when executed by a processor: (a) automatically entering subject matter data from the network into an encyclopedic database; (b) automatically distilling data from the encyclopedic database to create a user library content file; (c) allowing multiple clients to search data in the user library content file to identify at least one video file on the network and to access the at least one video file on the network using at least one reference file; (d) restricting the clients from accessing the encyclopedic database; and (e) restricting search results based on profile settings for each of the clients.

Abstract: Methods, systems, and computer-storage media having computer-usable instructions embodied thereon for identifying related entities are provided. One or more entities may be identified from a search query. The one or more entities may include any identifiable term having related information associated therewith. An entity store may be referenced to identify one or more related entities related to the entity. The one or more related entities, along with their relationship(s) to the entity (and one another, perhaps) may then be ranked and displayed to a user.

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: An embodiment of the invention, directed to assessing quality of recorded service data, comprises the step of receiving a record containing service data at a service record evaluator. The method further comprises selecting at least one information field of a plurality of information fields contained in the received record, and determining a numerical quality score for each selected information field. Each of the quality scores is used to compute a cumulative quality score for the record, and it is determined whether the cumulative quality score is no less than a minimum quality threshold.

Abstract: Some embodiments of the invention provide a graphical user interface as a means of inputing search parameters to database search engines. In some embodiments two or three dimensional projections spatially represent relationships between search parameters, located along the periphery of the projections and search hits whose significance are represented by position relative to the center of the projection and comparative distance from each of the search parameters. As the user manipulates the overall shape of the search projection, the weighting of search parameters adjusts, reconfiguring the search. The invention also provides, in some embodiments, an intuitive means of assimilating search parameter weightings based on peer or social network preferences with global search results.

Abstract: An embodiment of the invention, directed to assessing quality of recorded service data, comprises the step of receiving a record containing service data at a service record evaluator. The method further comprises selecting at least one information field of a plurality of information fields contained in the received record, and determining a numerical quality score for each selected information field. Each of the quality scores is used to compute a cumulative quality score for the record, and it is determined whether the cumulative quality score is no less than a minimum quality threshold.

Abstract: A search engine that resides on a local computer to enable query intent analysis, results ranking, and relevance processing over data of both local and remote data sources. The architecture also employs a global access component, which is a unified interface to disparate data discovery paradigms. The global access component provides access to corresponding disparate datasets of the paradigms for creating aggregation of information. A local search engine creates the aggregations of information from the disparate datasets via the global access component and processes a query against the aggregations of information to return search results.

Abstract: Methods and systems are disclosed for assessing an identifier. The method comprises receiving, via an interface, a string of characters making up the identifier and determining a keyboard type for a keyboard. The method further comprises calculating, by a calculator module, a typeability score for the identifier based on the string of characters and the keyboard type, wherein the typeability score signifies a difficulty of typing the identifier on the determined keyboard type. In certain embodiments, the method further comprises determining a finger positioning corresponding to a position of a typer's fingers on the keyboard, and the typeability score is further based on the finger positioning. In some embodiments, the finger positioning is based on the typer's typing habits.

Abstract: A document processing system and method are disclosed. In the method local scores are incrementally computed for document samples, based on local features extracted from the respective sample. A global score is estimated for the document based on the local scores currently computed, i.e., on fewer than all document samples. A confidence in a decision for the estimated global score is computed. The computed confidence is based on the local scores currently computed and, optionally, the number of samples used in computing the estimated global score. A classification decision, such as a categorization or retrieval decision for the document is output, based on the estimated score when the computed confidence in the decision reaches a threshold value.

Abstract: A set expansion system is described herein that improves precision, recall, and performance of prior set expansion methods for large sets of data. The system maintains high precision and recall by 1) identifying the qualify of particular lists and applying that quality through a weight, 2) allowing for the specification or negative examples in a set of seeds to reduce the introduction of bad entities into the set, and 3) applying a cutoff to eliminate lists that include a low number of positive matches. The system may perform multiple passes to first generate a good candidate result set and then refine the set to find a set with highest quality. The system may also apply Map Reduce or other distributed processing techniques to allow calculation in parallel. Thus, the system efficiently expands large concept sets from a potentially small set of initial seeds from readily available web data.

Abstract: Identifiers of items generated in response to a query are each ranked in a way that considers the other identified items. Topologies are generated that correspond to features of the identified items. Each topology may be a Markov chain that includes a node for each identified item and directed edges between the nodes. Each directed edge between a node pair has an associated transition probability that represents the likelihood that a hypothetical user would change their preference from a first node in the pair to the second node in the pair when considering the feature associated with the topology. The topologies are weighted according to the relative importance of the features that correspond to the topologies. The weighted topologies are used to generate a stationary distribution of the identified items, and the identified items are ranked using the stationary distribution.

Abstract: A method, an apparatus and an article of manufacture for processing a random-walk based vertex-proximity query on a graph. The method includes computing at least one vertex cluster and corresponding meta-information from a graph, dynamically updating the clustering and corresponding meta-information upon modification of the graph, and identifying a vertex cluster relevant to at least one query vertex and aggregating corresponding meta-information of the cluster to process the query.

Abstract: Search model updates are described. In one or more implementations, a search service uses a model to rank items in a search result, the model formed using an initial set of data. An update is generated using a subsequent set of data, which is formed after the initial set of data, that provides feedback describing user interaction with one or more items in the search result formed using the model, the generating of the update performed without use of at least a portion of the initial set of data. The model and the update are employed to rank items in a search result for a subsequent search.

Abstract: Methods, systems, and computer programs are presented for providing internet content, such as related news articles. One method includes an operation for defining a plurality of candidates based on a seed. For each candidate, scores are calculated for relevance, novelty, connection clarity, and transition smoothness. The score for connection clarity is based on a relevance score of the intersection between the words in the seed and the words in each of the candidates. Further, the score for transition smoothness measures the interest in reading each candidate when transitioning from the seed to the candidate. For each candidate, a relatedness score is calculated based on the calculated scores for relevance, novelty, connection clarity, and transition smoothness. In addition, at least one of the candidates is selected based on their relatedness scores for presentation to the user.

Abstract: Various embodiments of methods and apparatus for fitting a surface to a data set are disclosed. A frequency distribution of an input data set is determined. Determining the frequency distribution includes assigning each data point of the input data set to a category representing a value of a variable for the respective data point. Responsive to identifying one or more discontinuities of the frequency distribution, a continuous section of the frequency distribution is identified as a first data set. A first equation is fit to the first data set.