QBASE, LLC Patent applications |
Patent application number | Title | Published |
20160140235 | REAL-TIME DISTRIBUTED IN MEMORY SEARCH ARCHITECTURE - Disclosed here are distributed computing system connection configurations having multiple connection bandwidth and latency tiers. Also disclosed are connection configurations including a suitable number of network segments, where network segments may be connected to external servers and clusters including search managers, analytics agents, search conductors, dependency managers, supervisors, and partitioners, amongst others. In one or more embodiments, modules may be connected to the network segments using a desired bandwidth and latency tier. Disclosed here are hardware components suitable for running one or more types of modules on one or more suitable nodes. One or more suitable hardware components included in said clusters include CPUs, Memory, and Hard Disk, amongst others. | 05-19-2016 |
20160110446 | METHOD FOR DISAMBIGUATED FEATURES IN UNSTRUCTURED TEXT - A method for disambiguating features in unstructured text is provided. The disclosed method may not require pre-existing links to be present. The method for disambiguating features in unstructured text may use co-occurring features derived from both the source document and a large document corpus. The disclosed method may include multiple modules, including a linking module for linking the derived features from the source document to the co-occurring features of an existing knowledge base. The disclosed method for disambiguating features may allow identifying unique entities from a knowledge base that includes entities with a unique set of co-occurring features, which in turn may allow for increased precision in knowledge discovery and search results, employing advanced analytical methods over a massive corpus, employing a combination of entities, co-occurring entities, topic IDs, and other derived features. | 04-21-2016 |
20160098433 | METHOD FOR FACET SEARCHING AND SEARCH SUGGESTIONS - Methods for faceted searching within clustered in-memory databases are disclosed. Faceted searching may be used to generate search suggestions. The faceted search engine may be able to use non-literal key algorithms for a partial prefix fuzzy matching and may include a feature disambiguation module. The disclosed search engine may be capable of processing large amounts of unstructured data in real time to generate search suggestions. | 04-07-2016 |
20160085760 | METHOD FOR IN-LOOP HUMAN VALIDATION OF DISAMBIGUATED FEATURES - Methods for providing in-loop validation of disambiguated features are disclosed. The disclosed methods may include disambiguating features in unstructured text that may use co-occurring features derived from both the source document and a large document corpus. The disambiguating systems may include multiple modules, including a linking on-the-fly module for linking the derived features from the source document to the co-occurring features of an existing knowledge base. The system for disambiguating features may allow identifying unique entities from a knowledge base that includes entities with a unique set of co-occurring features, which in turn may allow for increased precision in knowledge discovery and search results, employing advanced analytical methods over a massive corpus, employing a combination of entities, co-occurring entities, topic IDs, and other derived features. The disclosed method may use validation to provide input to the system for disambiguating features. | 03-24-2016 |
20160078099 | SEARCH SUGGESTIONS USING FUZZY-SCORE MATCHING AND ENTITY CO-OCCURRENCE - A method for generating search suggestions by using fuzzy-score matching and entity co-occurrence in a knowledge base is disclosed. Embodiments of the method may be employed in any search system that may include an entity extraction computer module that may perform partial entity extractions from provided search queries, a fuzzy-score matching computer module that may generate algorithms based on the type of entity extracted and perform a search against an entity co-occurrence knowledge base. The entity co-occurrence knowledge base, which may include a repository where entities may be indexed as entities to entities, entities to topics, or entities to facts among others, may return fast and accurate suggestions to the user to complete the search query. The suggestions may include alternates to the partial query provided by the user that may enhance and save time when performing searches. | 03-17-2016 |
20160078047 | METHOD FOR OBTAINING SEARCH SUGGESTIONS FROM FUZZY SCORE MATCHING AND POPULATION FREQUENCIES - A method for obtaining and providing search suggestions using entity co-occurrence is disclosed. The method may be employed in any search system that may include at least one search engine, one or more databases including entity co-occurrence knowledge and trends co-occurrence knowledge. The method may extract and disambiguate entities from search queries by using an entity and trends co-occurrence knowledge in one or more database. Subsequently, a list of search suggestion may be provided by each database, then by comparing the score of each search suggestion, a new list of suggestion may be built based on the individual and/or overall score of each search suggestion. Based on the user's selection of the suggestions, the trends co-occurrence knowledgebase can be updated, providing a means of on-the-fly learning, which improves the search relevancy and accuracy. | 03-17-2016 |
20160042276 | METHOD OF AUTOMATED DISCOVERY OF NEW TOPICS - The present disclosure relates to a method for performing automated discovery of new topics from unlimited documents related to any subject domain, employing a multi-component extension of Latent Dirichlet Allocation (MC-LDA) topic models, to discover related topics in a corpus. The resulting data may contain millions of term vectors from any subject domain identifying the most distinguished co-occurring topics that users may be interested in, for periodically building new topic ID models using new content, which may be employed to compare one by one with existing model to measure the significance of changes, using term vectors differences with no correlation with a Periodic New Model, for periodic updates of automated discovery of new topics, which may be used to build a new topic ID model in-memory database to allow query-time linking on massive data-set for automated discovery of new topics. | 02-11-2016 |
20160042001 | SEARCH SUGGESTIONS OF RELATED ENTITIES BASED ON CO-OCCURRENCE AND/OR FUZZY-SCORE MATCHING - A method for generating search suggestions of related entities based on co-occurrence and/or fuzzy score matching is disclosed. The method may be employed in a search system that may include a client/server type architecture. The search system may include a user interface for a search engine in communication with one or more server devices over a network connection. The server device may include an entity extraction module, a fuzzy-score matching module, and an entity co-occurrence knowledge base database. In one embodiment, the search system may process a partial search query from a user and present search suggestions to complete the partial query. In another embodiment, the complete search query may be used as a new search query. The search system may process the new search query, run an entity extraction, find related entities from the entity co-occurrence knowledge base, and present said related entities in a drop down list. | 02-11-2016 |
20160019470 | EVENT DETECTION THROUGH TEXT ANALYSIS USING TRAINED EVENT TEMPLATE MODELS - A system and method for detecting events based on input data from a plurality of sources. The system may receive input from a plurality of sources containing information about possible events. A method for event detection involves pre-processing and normalizing a data input from a plurality of sources, extracting and disambiguating events and entities, associate event and entities, correlate events and entities associated from a data input to results from a different data sources to determine if an event has occurred, and store the detected events in a data storage. | 01-21-2016 |
20160019466 | EVENT DETECTION THROUGH TEXT ANALYSIS USING TRAINED EVENT TEMPLATE MODELS - A system and method for detecting events based on input data from a plurality of sources. The system may receive input from a plurality of sources containing information about possible events. A method for event detection involves pre-processing and normalizing a data input from a plurality of sources, extracting and disambiguating events and entities, associate event and entities, correlate events and entities associated from a data input to results from a different data sources to determine if an event has occurred, and store the detected events in a data storage. | 01-21-2016 |
20150254350 | METHOD FOR ENTITY ENRICHMENT OF DIGITAL CONTENT TO ENABLE ADVANCED SEARCH FUNCTIONALITY IN CONTENT MANAGEMENT SYSTEMS - Disclosed is a system and method for extending search capabilities of contentment management systems, such as SharePoint 2013®, to enable geographic and name entity based searches. Geographic and named entity searches are enabled by a content enrichment web service. The content enrichment web service calls a geotagging or a named entity tagger web service application to tag crawled managed properties as input and return geographically or entity modified managed properties as output. The system associates one or more geographically and named entity modified managed properties with content and stores this information as metadata in a SharePoint 2013® search index. Thus, the search system allows users to identify a particular geographic entity the user is interested in finding, and to receive search results directly related to that geographic entity on SharePoint 2013®. | 09-10-2015 |
20150234899 | DATA RECORD COMPRESSION WITH PROGRESSIVE AND/OR SELECTIVE DECOMPOSITION - Disclosed herein are systems and methods for compressing structured or semi-structured data in a horizontal manner achieving compression ratios similar to vertical compression. Collections include structured or semi-structured data include a number of fields and are described using a schema. Fields include information having semantic similarity and are compressed using methods suitable for compressing the type of data. Data of a collection is compressed after fragmentation or may be normalized prior to compression. Data with semantic similarity is compressed using token tables and/or n-gram tables, where higher weighted, consisting of the product of frequency and length, occurring values may be stored in the lower numbered indices of the data table. Records include record descriptor bytes, field descriptor bytes, zero or more array descriptor bytes, zero or more object descriptor bytes, or bytes representing the data associated with the record. Data is indexed or compressed by a suitable module. | 08-20-2015 |
20150154509 | FEATURED CO-OCCURRENCE KNOWLEDGE BASE FROM A CORPUS OF DOCUMENTS - A system for building a knowledge base of co-occurring features extracted from a document corpus is disclosed. The method includes a plurality of feature extraction software modules that may extract different features from each document in the corpus. The system may include a knowledge base aggregator module that may keep count of the co-occurrences of features in the different documents of a corpus and determine appropriate co-occurrences to store in a knowledge base. | 06-04-2015 |
20150154501 | EVENT DETECTION THROUGH TEXT ANALYSIS USING DYNAMIC SELF EVOLVING/LEARNING MODULE - A system and method for detecting events based on input data from a plurality of sources. The system may receive input from a plurality of sources containing information about possible events. A method for event detection involves pre-processing and normalizing a data input from a plurality of sources, extracting and disambiguating events and entities, associate event and entities, correlate events and entities associated from a data input to results from a different data source to determine if an event has occurred, and store the detected events in a data storage. | 06-04-2015 |
20150154316 | SEARCH SUGGESTIONS OF RELATED ENTITIES BASED ON CO-OCCURRENCE AND/OR FUZZY-SCORE MATCHING - A method for generating search suggestions of related entities based on co-occurrence and/or fuzzy score matching is disclosed. The method may be employed in a search system that may include a client/server type architecture. The search system may include a user interface for a search engine in communication with one or more server devices over a network connection. The server device may include an entity extraction module, a fuzzy-score matching module, and an entity co-occurrence knowledge base database. In one embodiment, the search system may process a partial search query from a user and present search suggestions to complete the partial query. In another embodiment, the complete search query may be used as a new search query. The search system may process the new search query, run an entity extraction, find related entities from the entity co-occurrence knowledge base, and present said related entities in a drop down list. | 06-04-2015 |
20150154306 | METHOD FOR SEARCHING RELATED ENTITIES THROUGH ENTITY CO-OCCURRENCE - A method for searching for related entities using entity co-occurrence is disclosed. Embodiments of the method may be employed in any search system that may include at least one search engine, at least one entity co-occurrence knowledge base, an entity extraction module, and at least an entity indexed corpus. The method may extract and disambiguate entities from search queries by using an entity co-occurrence knowledge base, find extracted entities in an entity indexed corpus and finally present search results as related entities of interest. | 06-04-2015 |
20150154305 | METHOD OF AUTOMATED DISCOVERY OF TOPICS RELATEDNESS - A computer system and method for automated discovery of topic relatedness are disclosed. According to an embodiment, topics within documents from a corpus may be discovered by applying multiple topic identification (ID) models, such as multi-component latent Dirichlet allocation (MC-LDA) or similar methods. Each topic model may differ in a number of topics. Discovered topics may be linked to the associated document. Relatedness between discovered topics may be determined by analyzing co-occurring topic IDs from the different models, assigning topic relatedness scores, where related topics may be used for matching/linking a feature of interest. The disclosed method may have an increased disambiguation precision, and may allow the matching and linking of documents using the discovered relationships. | 06-04-2015 |
20150154297 | REAL-TIME DISTRIBUTED IN MEMORY SEARCH ARCHITECTURE - Disclosed here are distributed computing system connection configurations having multiple connection bandwidth and latency tiers. Also disclosed are connection configurations including a suitable number of network segments, where network segments may be connected to external servers and clusters including search managers, analytics agents, search conductors, dependency managers, supervisors, and partitioners, amongst others. In one or more embodiments, modules may be connected to the network segments using a desired bandwidth and latency tier. Disclosed here are hardware components suitable for running one or more types of modules on one or more suitable nodes. One or more suitable hardware components included in said clusters include CPUs, Memory, and Hard Disk, amongst others. | 06-04-2015 |
20150154286 | METHOD FOR DISAMBIGUATED FEATURES IN UNSTRUCTURED TEXT - A method for disambiguating features in unstructured text is provided. The disclosed method may not require pre-existing links to be present. The method for disambiguating features in unstructured text may use co-occurring features derived from both the source document and a large document corpus. The disclosed method may include multiple modules, including a linking module for linking the derived features from the source document to the co-occurring features of an existing knowledge base. The disclosed method for disambiguating features may allow identifying unique entities from a knowledge base that includes entities with a unique set of co-occurring features, which in turn may allow for increased precision in knowledge discovery and search results, employing advanced analytical methods over a massive corpus, employing a combination of entities, co-occurring entities, topic IDs, and other derived features. | 06-04-2015 |
20150154283 | PLUGGABLE ARCHITECTURE FOR EMBEDDING ANALYTICS IN CLUSTERED IN-MEMORY DATABASES - Disclosed are pluggable, distributed computing-system architectures allowing for embedding analytics to be added or removed from nodes of a system hosting an in-memory database. The disclosed system includes an API that may be used to create customized, application specific analytics modules. The newly created analytics modules may be easily plugged into the in-memory database. Each user query submitted to the in-memory database may specify different analytics be applied with differing parameters. All analytics modules operate on the in-memory image of the data, inside the in-memory database platform. All the analytics modules, may be capable of performing on-the-fly analytics, which may allow a dynamic and comprehensive processing of search results. | 06-04-2015 |
20150154268 | METHOD OF DISCOVERING AND EXPLORING FEATURE KNOWLEDGE - Methods and systems for discovering and exploring feature knowledge included in large corpora are disclosed. The described systems and methods may include the application of in-memory analytics to records, where the analytic methods applied to the records and the level of precision of the methods may be dynamically selected by a user. | 06-04-2015 |
20150154265 | SEARCH SUGGESTIONS USING FUZZY-SCORE MATCHING AND ENTITY CO-OCCURRENCE - A method for generating search suggestions by using fuzzy-score matching and entity co-occurrence in a knowledge base is disclosed. Embodiments of the method may be employed in any search system that may include an entity extraction computer module that may perform partial entity extractions from provided search queries, a fuzzy-score matching computer module that may generate algorithms based on the type of entity extracted and perform a search against an entity co-occurrence knowledge base. The entity co-occurrence knowledge base, which may include a repository where entities may be indexed as entities to entities, entities to topics, or entities to facts among others, may return fast and accurate suggestions to the user to complete the search query. The suggestions may include alternates to the partial query provided by the user that may enhance and save time when performing searches. | 06-04-2015 |
20150154264 | METHOD FOR FACET SEARCHING AND SEARCH SUGGESTIONS - Methods for faceted searching within clustered in-memory databases are disclosed. Faceted searching may be used to generate search suggestions. The faceted search engine may be able to use non-literal key algorithms for a partial prefix fuzzy matching and may include a feature disambiguation module. The disclosed search engine may be capable of processing large amounts of unstructured data in real time to generate search suggestions. | 06-04-2015 |
20150154263 | EVENT DETECTION THROUGH TEXT ANALYSIS USING TRAINED EVENT TEMPLATE MODELS - A system and method for detecting events based on input data from a plurality of sources. The system may receive input from a plurality of sources containing information about possible events. A method for event detection involves pre-processing and normalizing a data input from a plurality of sources, extracting and disambiguating events and entities, associate event and entities, correlate events and entities associated from a data input to results from a different data sources to determine if an event has occurred, and store the detected events in a data storage. | 06-04-2015 |
20150154249 | DATA INGESTION MODULE FOR EVENT DETECTION AND INCREASED SITUATIONAL AWARENESS - A system and method for detecting and summarizing events based on data feeds from a plurality of sources. Such sources may include social media networks, text messages, news feeds among others. The system may receive raw information from such sources containing data related with possible events. Method for event detection may include pre-processing and normalizing data input from any source registered, this may also include; extracting and disambiguating events and entities, associate event and entities, correlate events and entities associated from a data input which results from a different data source, for validating/verifying an event. Subsequently, the validated/verified event may be stored in a local data storage and/or in a web-server. | 06-04-2015 |
20150154233 | DEPENDENCY MANAGER FOR DATABASES - The present disclosure relates to in-memory databases or search engines using a dependency manager or configuration manager for maintaining configuration in the database system. The system may include a supervisor that may request and receive data from dependency manager, where the supervisor may be linked to other components in the system. The dependency manager may be used as a container for data metadata, and software components, which may be used in the system configuration. The configuration may be developed through a dependency system, where the dependency manager may keep an entire dependency tree for all software and data in the system. Similarly, dependency manager may create a deployable package to guarantee deployment integrity and to ensure a successful execution of any suitable software and data in the system. | 06-04-2015 |
20150154200 | DESIGN AND IMPLEMENTATION OF CLUSTERED IN-MEMORY DATABASE - An in-memory database system and method for administrating a distributed in-memory database, comprising one or more nodes having modules configured to store and distribute database partitions of collections partitioned by a partitioner associated with a search conductor. Database collections are partitioned according to a schema. Partitions, collections, and records, are updated and removed when requested by a system interface, according to the schema. Supervisors determine a node status based on a heartbeat signal received from each node. Users can send queries through a system interface to search managers. Search managers apply a field processing technique, forward the search query to search conductors, and return a set of result records to the analytics agents. Analytics agents perform analytics processing on a candidate results records from a search manager. The search conductors comprising partitioners associated with a collection, search and score the records in a partition, then return a set of candidate result records after receiving a search query from a search manager. | 06-04-2015 |
20150154198 | METHOD FOR IN-LOOP HUMAN VALIDATION OF DISAMBIGUATED FEATURES - Methods for providing in-loop validation of disambiguated features are disclosed. The disclosed methods may include disambiguating features in unstructured text that may use co-occurring features derived from both the source document and a large document corpus. The disambiguating systems may include multiple modules, including a linking on-the-fly module for linking the derived features from the source document to the co-occurring features of an existing knowledge base. The system for disambiguating features may allow identifying unique entities from a knowledge base that includes entities with a unique set of co-occurring features, which in turn may allow for increased precision in knowledge discovery and search results, employing advanced analytical methods over a massive corpus, employing a combination of entities, co-occurring entities, topic IDs, and other derived features. The disclosed method may use validation to provide input to the system for disambiguating features. | 06-04-2015 |
20150154197 | METHOD FOR OBTAINING SEARCH SUGGESTIONS FROM FUZZY SCORE MATCHING AND POPULATION FREQUENCIES - A method for obtaining and providing search suggestions using entity co-occurrence is disclosed. The method may be employed in any search system that may include at least one search engine, one or more databases including entity co-occurrence knowledge and trends co-occurrence knowledge. The method may extract and disambiguate entities from search queries by using an entity and trends co-occurrence knowledge in one or more database. Subsequently, a list of search suggestion may be provided by each database, then by comparing the score of each search suggestion, a new list of suggestion may be built based on the individual and/or overall score of each search suggestion. Based on the user's selection of the suggestions, the trends co-occurrence knowledgebase can be updated, providing a means of on-the-fly learning, which improves the search relevancy and accuracy. | 06-04-2015 |
20150154196 | ALERTING SYSTEM BASED ON NEWLY DISAMBIGUATED FEATURES - The present disclosure relates to a method of alerting users regarding newly disambiguated features. More specifically, a newly disambiguated feature may pass through different filters/restrictions, such as, the known knowledge base. The disclosed known knowledge base may filter the newly disambiguated feature, comparing the newly disambiguated features to the existing features to discover a new feature of interest. Particularly, the disclosed new feature of interest may include a new person, a new phone number, a new place, a new company, among others. Finally, if there is a new feature that did not match with the existing disambiguated features in the known knowledge base, then an alert may be emitted to a user. | 06-04-2015 |
20150154195 | METHOD FOR ENTITY-DRIVEN ALERTS BASED ON DISAMBIGUATED FEATURES - A method for entity-driven alerts based on disambiguated features, is disclosed. According to an embodiment, disclosed method may refer to entity-driven alerts based on trending or new knowledge of a disambiguated feature. The alerts may be sent to a user when new knowledge is discovered about the disambiguated feature, a new association (such as new features, facts, quotations, or topic IDs related, among others) with the feature of interest, and/or new trending changes are emerging about the feature of interest. According to various embodiments, method for entity-driven alerts based on disambiguated features may reduce the number of false positives resulting in a normal search query. Which in turn, may increase the efficiency of monitoring, allowing for broadened universe of alerts. | 06-04-2015 |
20150154194 | NON-EXCLUSIONARY SEARCH WITHIN IN-MEMORY DATABASES - Methods for non-exclusionary searching within clustered in-memory databases are disclosed. The non-exclusionary search methods may allow the execution of searches where the results may include records where fields specified in the query are not populated or defined. The disclosed methods include the application of fuzzy matching and scoring algorithms, which enables the system to search, score and compare records with different schemata. This may significantly improve the recall of relevant records. | 06-04-2015 |
20150154193 | SYSTEM AND METHOD FOR EXTRACTING FACTS FROM UNSTRUCTURED TEXT - A system and method for extracting facts from unstructured text files are disclosed. Embodiments of the disclosed system and method may receive a text file as input and perform extraction and disambiguation of entities, as well as extract topics and facts. The facts are extracted by comparing against a fact template store and associating facts with events or topics. The extracted facts are stored in a data store. | 06-04-2015 |
20150154148 | METHOD OF AUTOMATED DISCOVERY OF NEW TOPICS - The present disclosure relates to a method for performing automated discovery of new topics from unlimited documents related to any subject domain, employing a multi-component extension of Latent Dirichlet Allocation (MC-LDA) topic models, to discover related topics in a corpus. The resulting data may contain millions of term vectors from any subject domain identifying the most distinguished co-occurring topics that users may be interested in, for periodically building new topic ID models using new content, which may be employed to compare one by one with existing model to measure the significance of changes, using term vectors differences with no correlation with a Periodic New Model, for periodic updates of automated discovery of new topics, which may be used to build a new topic ID model in-memory database to allow query-time linking on massive data-set for automated discovery of new topics. | 06-04-2015 |
20150154079 | FAULT TOLERANT ARCHITECTURE FOR DISTRIBUTED COMPUTING SYSTEMS - Disclosed here is a fault tolerant architecture suitable for use with any distributed computing system. A fault tolerant architecture may include any suitable number of supervisors, dependency managers, node managers, and other modules distributed across any suitable number of nodes. In one or more embodiments, supervisors may monitor the system using any suitable number of heartbeats from any suitable number of node managers and other modules. In one or more embodiments, supervisors may automatically recover failed modules in a distributed system by moving the modules and their dependencies to other nodes in the system. In one or more embodiments, supervisors may request a configuration package from one or more dependency managers installing one or more modules on a node. In one or more embodiments, one or more modules may have any suitable number of redundant copies in the system, where redundant copies of modules in the system may be stored in separate nodes. | 06-04-2015 |