Class / Patent application number | Description | Number of patent applications / Date published |
706055000 | Semantic network (e.g., conceptual dependency, fact based structure) | 88 |
20080281771 | Data Partitioning and Critical Section Reduction for Bayesian Network Structure Learning - In a parallel system, multiple threads operate in parallel to perform network structure learning. A global score cache is partitioned into multiple split score caches, which may in one embodiment include associating a score cache with a node of the structure to be learned. With a split score cache, the learning may be performed in split neighbor scoring loops, with the first loop operating on separate score cache partitions, and warming the score cache partitions for the second loop. | 11-13-2008 |
20080294589 | SYSTEM AND METHODS FOR EVALUATING INFERENCES OF UNKNOWN ATTRIBUTES IN A SOCIAL NETWORK - A method and system for determining a probability of inferring an unknown attribute value for an attribute of interest for a target node in a social network. The method comprises the steps of receiving as an input attribute values and link relationships for a plurality of additional nodes in the social network, creating a simplified network using the input values and relationships, and calculating the probability of inferring the unknown attribute value for the target node. | 11-27-2008 |
20090024556 | SEMANTIC CRAWLER - A method and an apparatus for extraction of information from a plurality of electronic text documents. The method comprises defining and generating a reference graph. The reference graph represents a specific theme of a reference text document. The method further comprises comparing the reference graph with a second graph using an extraction criterion. The second graph represents a specific theme of a second text document. Further, the result of the comparison is checked if the result falls within the extraction criterion boundary value. Then, the checked result of the comparison is extracted if the result falls at least within the extraction criterion boundary value. The method continues the comparison and the checking of the result of the comparison of the defined and generated reference graph with a further graph. | 01-22-2009 |
20090099998 | KNOWLEDGE-BASED MATCHING - A knowledge-based system and methods to matchmaking and social network extension are disclosed. The system is configured to allow users to specify knowledge profiles, which are collections of concepts that indicate a certain topic or area of interest selected from an. The system utilizes the knowledge model as the semantic space within which to compare similarities in user interests. The knowledge model is hierarchical so that indications of interest in specific concepts automatically imply interest in more general concept. Similarity measures between profiles may then be calculated based on suitable distance formulas within this space. | 04-16-2009 |
20090125474 | USER PREFERENCE-BASED DATA ADAPTATION SERVICE SYSTEM AND METHOD - The present invention relates to a user preference-based data adaptation service system and method. More particularly, the present invention relates to a user preference-based data adaptation service system and method capable of providing a data adaptation service that appropriately converts a file in consideration of a difference between the platforms of different kinds of devices in order to share the file, and reflecting an exact user preference in consideration of the surrounding environments, such as, the performance of the device and a network. | 05-14-2009 |
20090192976 | METHODS AND SYSTEMS FOR CREATING A SEMANTIC OBJECT - Among other disclosure, a knowledge network and semcards enabling intelligent matching of offers and requests, involving all types of information and knowledge, including information such as classified ads, data about products and services, or knowledge, expertise, ideas, suggestions, opinions, and other forms of tacit knowledge is described. | 07-30-2009 |
20090204564 | System for managing outcome information based on uri, and method for same - A system for managing outcome information based on URI comprises an outcome information managing unit that registers and manages outcome information; a URI managing unit that is connected to the outcome information managing unit and imparts a URI to the outcome information through a URI server so as to manage the outcome information; and a knowledge extending unit that is connected to the outcome information managing unit and the URI managing unit and extends knowledge by using an inference rule for an inference service based on the Semantic Web. | 08-13-2009 |
20090248608 | METHOD FOR SEGMENTING WEBPAGES - A method of segmenting a webpage into visually and semantically cohesive pieces uses an optimization problem on a weighted graph, where the weights reflect whether two nodes in the webpage's DOM tree should be placed together or apart in the segmentation; the weights are informed by manually labeled data. | 10-01-2009 |
20090248609 | OPTIMUM ROUTE SEARCHING APPARATUS, METHOD AND PROGRAM - An optimum route searching apparatus, method and program is provided, which make it possible to obtain the optimum cable laying route in a short period of time regardless of the quantity of search data. The optimum route searching apparatus embodied by a computer for searching for an optimum cable laying route, comprising: an external storage device for storing search data comprising information related to a route that has a node as a connection point; simplification means for creating simplified data by extracting, from among the information related to the route, information related to a node constituting a branching point, a bending point and a terminal point; connection information creation means for creating a connection information file of cable laying route based on the simplified data; and searching means for searching for an optimum cable laying route candidate based on the connection information file. | 10-01-2009 |
20090254510 | INFORMATION NERVOUS SYSTEM - A semantically integrated knowledge retrieval, management, delivery and presentation system. | 10-08-2009 |
20090265299 | COMPUTING SOLUTIONS TO PROBLEMS USING DYNAMIC ASSOCIATION BETWEEN ABSTRACT GRAPHS - A device, system, and method for solving a plurality of sub-problems representing a main problem pertaining to an environment. An abstract graph corresponding to each of the sub-problems may be constructed in a computing system for each of the sub-problems. At least a first abstract graph of the abstract graphs may be resolved, for example, by decomposing one or more nodes of the first abstract graph. At least one of the one or more nodes of the first abstract graph may be associated with one or more nodes of others of the abstract graphs. At least one of the abstract graphs may be resolved using information obtained by the association. Other embodiments are described and claimed. | 10-22-2009 |
20090287632 | SYSTEM AND METHOD FOR SELECTING A PACKAGE STRUCTURAL DESIGN - A system and method of selecting a package model may include maintaining a data structure of a plurality of package models. Each package model may have a plurality of package model attributes including at least a size and a style. A user input may be received that is descriptive of a desired package capability. The user input may be analyzed using a semantic reasoner to determine one or more desired attributes. One or more package models may be automatically selected by accessing the data structure wherein, for each selected package model, each desired attribute satisfies the corresponding package model attribute. The one or more selected package models may be presented. | 11-19-2009 |
20090287633 | Semantic to non-semantic routing for locating a live expert - A system and method of semantic to non-semantic routing for locating an expert. An inquiry-type database has a first layer of inquiry types organized from underlying criteria groupings, (humanly understandable descriptors). Additional layers are associated in a one-to-one correspondence with the first layer of inquiry types. Experts, having individualized knowledge, are listed in a skill-set database associated with the inquiry types. The skill-set database entries are linked to the associated inquiry-type by a numerical routing identifier. An expert is selected from the skill-set database entry linked by the numerical routing identifier. In another embodiment, multiple enterprises are mapped to separate layers of inquiry types having a one-to-one correspondence with the underlying groupings. A skill-set database entry is related to the inquiry type through a numerical routing identifier, the identifier being selected from a respective range of identifiers associated with the respective multiple enterprises. | 11-19-2009 |
20100005051 | SYSTEM AND METHOD FOR INFERRING A NETWORK OF ASSOCIATIONS - A network association mining algorithm and associated methods are presented which accepts data from biological and other experiments and automatically produces a network and attempts to explain the behavior of the biological or other system underlying the data using evolutionary techniques. The model and associated methods aim to identify the inter-relationships consistent with data and other prior knowledge supplied to the system. The network is represented in terms of coupled dynamical system. These dynamical systems are represented by differential or difference equations to educe these dynamical systems and coupling between them, an evolutionary algorithm is used. The output of the linkage finder could assist scientists to better understand the systems underlying and to guess at surrogate data. | 01-07-2010 |
20100030723 | SEMANTIC NETWORK METHODS TO DISAMBIGUATE NATURAL LANGUAGE MEANING - A computer implemented data processor system automatically disambiguates a contextual meaning of natural language symbols to enable precise meanings to be stored for later retrieval from a natural language database, so that natural language database design is automatic, to enable flexible and efficient natural language interfaces to computers, household appliances and hand-held devices. | 02-04-2010 |
20100030724 | SEMANTIC NETWORK METHODS TO DISAMBIGUATE NATURAL LANGUAGE MEANING - A computer implemented data processor system automatically disambiguates a contextual meaning of natural language symbols to enable precise meanings to be stored for later retrieval from a natural language database, so that natural language database design is automatic, to enable flexible and efficient natural language interfaces to computers, household appliances and hand-held devices. | 02-04-2010 |
20100036797 | SEMANTIC SEARCH ENGINE - Systems and methods for populating a database. An ontology is parsed to determine a plurality of keywords. A string-based search engine is utilized to perform a search of documents on a network based on the determined keywords, and at least one document is retrieved. A relation is established between the retrieved document and the ontology, and it is determined if the at least one document is to be stored in the database based on the established relation. If so, the document is stored in the database. The database can be used as part of a standalone or plug-in search engine for retrieving online documents. | 02-11-2010 |
20100042576 | AUTOMATED COMPUTATION OF SEMANTIC SIMILARITY OF PAIRS OF NAMED ENTITY PHRASES USING ELECTRONIC DOCUMENT CORPORA AS BACKGROUND KNOWLEDGE - An overall semantic similarity score value between pairs of named entities in a text corpus is obtained by calculating for at least one pair of named entities a plurality of corresponding pair similarity score values according to a first and at least a second classifier using electronic information sources. Each pair similarity score value of the pair of named entities per classifier is normalized by calculating a rank list per classifier, for example, for each named entity. The rank list holds each pair of named entities of the text corpus, wherein a rank of each pair of named entities within the rank list reflects the respective pair similarity score value. Further an arithmetic mean of the normalized pair similarity score value of each pair of named entities is calculated to provide the overall semantic similarity score value. | 02-18-2010 |
20100057664 | SYSTEMS AND METHODS FOR SEMANTIC CONCEPT DEFINITION AND SEMANTIC CONCEPT RELATIONSHIP SYNTHESIS UTILIZING EXISTING DOMAIN DEFINITIONS - Computer-implemented systems and methods for synthesis of concept definitions and concept relationships from a domain of data, utilizing different semantic processing protocols such as formal concept analysis and faceted classification synthesis from existing domain concepts that have a confidence gradient built into them. A cognitive or an input agent provides an input of an active concept which is matched against existing domain concepts. The resultant pool of relevant domain concepts is then used to derive virtual concept definitions using a semantic processing protocol. The derivation is then overlaid with a concept of relative proximity of an attribute from another within an attribute set. An additional layer of coherence is given by the relative proximity measure. The end result is a pool of related virtual concept definitions in a tree structure. | 03-04-2010 |
20100094800 | Evaluating Decision Trees on a GPU - Methods and apparatus for evaluating decision trees on a GPU are described. In an embodiment, the structure of a decision tree is converted into a 2D “tree” array with each row representing a node in the tree. Each row comprises details of any child nodes and the parameters which are required to perform the binary test at the node. A pixel shader can then be used to evaluate the decision tree in parallel for each input data point in an input array by navigating through rows in the 2D tree array. For each row, data is read from the input array dependent upon the parameters in the row and the shader moves to another row dependent upon the result of the binary test. On reaching a row which represents a leaf node, the pixel shader outputs evaluation results, such as a leaf node index or a probability distribution over classes. | 04-15-2010 |
20100094801 | DATA PROCESSING APPARATUS AND METHOD FOR CONSTRUCTING INTERACTIVE CONTENTS AND RECORDING MEDIA - Disclosed are an apparatus and method of constructing interactive contents. The data processing apparatus may transit a branching graph into a planning domain, wherein information on nodes and arcs of the branching graph may be classified to generate property and class information, and the classified properties may be used as pre-conditions of a plan operator on the planning domain. | 04-15-2010 |
20100223226 | SYSTEM FOR MONITORING GLOBAL ONLINE OPINIONS VIA SEMANTIC EXTRACTION - A system for transforming domain specific unstructured data into structured data including an intake platform controlled by feed back from a control platform. The intake platform includes an intake acquisition module for acquiring data building baseline data related to a domain and problem of interest, an intake pre-processing module, an intake language module, an intake application descriptors module, and an intake adjudication module. The control platform includes a control data acquisition module, a control data consistency collator, a control auditor, a control event definition and policy repository, an error resolver, and an output that outputs results of the workflow into structured data enabled to be used in data analytics. | 09-02-2010 |
20100262576 | METHODS FOR DETERMINING A PATH THROUGH CONCEPT NODES - A method for determining a path through concept nodes. The method includes calculating a spatial cost function between adjacent concept nodes in a lower dimensional layout representation of a network of concepts in a n-dimensional space and determining a path that follows a minimum spatial cost function through the concept nodes. The spatial cost function may be used to predict a next node in the path. The method may also include receiving an origin concept node or a goal concept node. | 10-14-2010 |
20100293134 | System for Inductive Determination of Pattern Probabilities of Logical Connectors - The invention relates to a system for the inductive determination of pattern probabilities of 16 dyadic logical convectors. Said system is especially useful for technically predicting human behavior, e.g. inclusion fallacies, and is therefore useful for controlling of technical systems and for data mining, search engines or human-machine interfaces. | 11-18-2010 |
20100306166 | AUTOMATIC FACT VALIDATION - The disclosed embodiments fulfill searches and determine the validity of a large set of noisy facts and rank the set of facts according to a validity score. Embodiments construct a fact graph by linking together facts that share a common relation structure and entity or instance of an argument. Facts are re-ranked and validated using link analysis processes which propagate weight (validity/authority) through the fact graph. The resulting weights for each fact are potentially combined with other scores (such as from fact extraction algorithms) in order to come up with a final ranking of the facts. | 12-02-2010 |
20100325083 | SKIP LIST GENERATION - A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of: inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria. | 12-23-2010 |
20110004581 | Depth-First Search For Target Value Problems - A method for determining a target path for a model-based control system. The model-based control system includes a directed acyclic graph, where the directed acyclic graph includes a plurality of vertices interconnected by a plurality of edges. The method includes the steps of performing a depth-first search of the directed acyclic graph for the target path. The depth-first search is operative to return an explicit solution or an implicit solution, wherein the implicit solution is determined using a heuristic. The method further includes determining if the depth-first search returned an explicit solution or an implicit solution, and if the depth-first search returned an implicit solution, constructing the target path from the implicit solution. The method may further include constructing a pattern database. | 01-06-2011 |
20110047122 | ELECTRONIC DOCUMENT CALLBACK TRIGGER CREATION - Systems and methods relating to callback triggers for mobile or electronic documents are provided. In general, a callback trigger defines a triggering event and a callback action to be performed in response to an occurrence of the triggering event during consumption of the electronic document by an end user. As such, when the triggering event defined by a callback trigger is detected during consumption of the electronic document by an end user, a corresponding callback action is performed. In some embodiments, the callback triggers for the electronic document are created at a user device of a user other than the end user or a central system via a manual or automatic process. In another embodiment, one or more callback triggers for the electronic document are created at a user device of an end user via an automatic process. | 02-24-2011 |
20110082829 | HYBRID APPROACH FOR EQUIVALENCE REASONING - Systems, methods, and other embodiments associated with equivalence reasoning are described. One example method includes constructing a clique map that maps groups of equivalent resources to a representative canonical resource. The clique map is constructed by iteratively inputting batches of equivalence pairs from a semantic model to operating memory and building, in operating memory, one or more cliques for the input batch. Cliques for various input batches of equivalence pairs are merged in memory to produce the clique map for use by the semantic model. Triples associated with the semantic model may be consolidated by replacing resources that are in a clique with their corresponding representative canonical resource. | 04-07-2011 |
20110093430 | MASSIVELY SCALABLE REASONING ARCHITECTURE - Techniques for reasoning data are disclosed. The techniques may include storing data in a data store which may be a semantic data store. A plurality of reasoning modules are used to reason the data in order to detect violations of one or more business policies. The reasoning modules may include semantic reasoning modules and/or pattern-based reasoning modules. Results of reasoning the data may be displayed to one or more users. | 04-21-2011 |
20110289045 | Inference over semantic network with some links omitted from indexes - An inference system responsive to omitting links from indexes in semantic network elements is described. The inference system prioritizes strategies that avoid trying to follow links from an index from which they may have been omitted. | 11-24-2011 |
20110295790 | SYSTEM AND METHOD FOR PROVIDING INSTANCE INFORMATION DATA OF AN INSTANCE - A method and system for providing instance information data of at least one instance. The method has the steps of generating a semantic representation of the instance on the basis of at least one instance data source, providing a semantic representation of a domain on the basis of at least one structured domain data source, performing an integration of the semantic instance and domain representations to provide an integrated semantic representation and deriving automatically instance information data from the provided integrated semantic representation. The method and system allow to provide efficiently instance information data of a wide range of instances with technical entities and persons, in a particular patients in different domains such as radiology or anatomy. | 12-01-2011 |
20120059790 | METHOD FOR PROVIDING WITH A SCORE AN OBJECT, AND DECISION-SUPPORT SYSTEM - The present invention is related to a method for providing with a score an object represented by a target item from a multidimensional space, said score being representative of the probability that the object satisfies a given binary property, said method being performed in a computer environment comprising processing means connected to memory means. | 03-08-2012 |
20120095955 | FACILITATING RELATIONSHIPS AND INFORMATION TRANSACTIONS - A network includes at least one relational grid with nodes with each node in the relational grid having an opinion about all other nodes in the grid, including the datum and associated interpretation held by each other node, with the opinions of nodes about a given node in the relational grid being independent. | 04-19-2012 |
20120101975 | SEMANTIC ANALYSIS OF INFORMATION - Semantic information that describes data sets is inferred based upon a semantic analysis performed on data sets retained within a data repository. The semantic analysis can include a determination of formats associated with fields of the data sets and a comparison of values of the fields against reference data sets having predetermined semantic types. Correlations are inferred between data sets based upon respective semantic information. The correlations are incorporated into visualizations displayed in connection with a graphical user interface. | 04-26-2012 |
20120158639 | METHOD, SYSTEM, AND COMPUTER PROGRAM FOR INFORMATION RETRIEVAL IN SEMANTIC NETWORKS - A method, system, and computer software for information retrieval in semantic networks, has the steps of: acquiring a graph of interest, assuming a novel metric regarding the acquired graph, specifying a query node of interest on the obtained graph, calculating a shortest-path distance from the query node of interest to a plurality of other nodes on the acquired graph, obtaining a ranked list of nodes based on the calculated shortest-path distance, and displaying for a user the retrieved information. | 06-21-2012 |
20120179642 | SYSTEM AND METHOD FOR USING A KNOWLEDGE REPRESENTATION TO PROVIDE INFORMATION BASED ON ENVIRONMENTAL INPUTS - There is disclosed a system and method for using a knowledge representation to provide relevant information based on environmental inputs. In an embodiment, the system and method considers environmental information from members in a crowd to generate a pool of interests based on the semantic relevance concepts associated with those interests. The most prominent concepts of interest may then be the basis for presenting content to the crowd as a whole. In another embodiment, environmental inputs and other surrounding inputs are considered as a user context. The concepts may be identified as relevant from the environmental context and used to present information relevant to the user given his or her surroundings. | 07-12-2012 |
20120239606 | BUSINESS SEMANTIC NETWORK BUILD - Pre-existing business objects (e.g., component parts of large business applications) may already define a hierarchy of related terms and include a search index created by a pre-existing search function. A semantic network including a plurality of semantic knowledge domains may be constructed automatically, based on the objects' initial terms structure and search index, and further modified by search results and related terms returned by the search function. This way, a customer specific semantic network may be constructed automatically from pre-existing software components and terms. | 09-20-2012 |
20120265724 | METHODS AND SYSTEMS FOR CONSTRUCTING INTELLIGENT GLOSSARIES FROM DISTINCTION-BASED REASONING - A computer implemented method of constructing formal definitions in intelligent glossaries for interpreting text, comprising the steps of: providing at least one Distinction having a Boundary, an Indication, a Counter-indication and a Frame; modeling each Distinction as a diagram to provide a Distinction Model; verifying each distinction model as being an instantiation of a generic Distinction Pattern; providing at least one Arrangement made of nonintersecting Marks of Distinction containing Indications from the verified Distinction Model; writing at least one Formulation for each Indication appearing in verified Distinction model and Arrangement, providing well-founded Indications; calculating precise Formulations in Natural Language from well-founded Indications by substituting Variables symbols and/or replacing Constants symbols to transform imprecise Formulations into precise Formulations; selecting a Definition type and embedding at least one precise Formulation and Definition type as a formal Definition in an Intelligent Glossary to provide computerized Semantic Systems of Intelligent Glossaries. | 10-18-2012 |
20120278273 | PERFORMING QUERIES USING SEMANTICALLY RESTRICTED RELATIONS - Techniques for searching large data sets. A semantically restricted relation graph is generated for an ontology. Queries to the ontology are resolved using the semantically restricted relation graph. | 11-01-2012 |
20130046728 | METHOD AND APPARATUS FOR CALCULATING YIELD - A disclosed method includes: converting, for each sample point, a set of performance item values for a sample point into coordinate values of a mesh element containing the set among plural mesh elements obtained by dividing a space mapped by the performance items; generating a binary decision graph representing a group of the coordinate values of the sample points; calculating the number of sample points including second sample points that dominates a first sample point and the first sample point, by counting the number of paths in the binary decision graph from a root node to a leaf node representing “1” through at least one of certain nodes corresponding to coordinate values that are equal to or less than coordinate values of the first sample point; and calculating a yield of the first sample point by dividing the calculated number by the number of the plural sample points. | 02-21-2013 |
20130054509 | EXTENDED COLLABORATION EVENT MONITORING SYSTEM - An extended collaboration event monitoring system monitors users' interactions with computer software applications and detects and extracts events. The system intelligently determines whether the extracted events trigger undetected events or other action items. The system provides the extracted events to a social networking client that translates the extracted events and returns the translated data to the system. The system publishes the translated data to a social networking/collaboration interface embedded into the interface of the computer software application being utilized by one of the users. The system not only publishes the translated data corresponding to a user's interactions with the computer software application to that user's interface, but also publishes the user's interactions with the computer software application to interfaces corresponding to other project team members as well. | 02-28-2013 |
20130066824 | SEMANTICS UPDATE AND ADAPTIVE INTERFACES IN CONNECTION WITH INFORMATION AS A SERVICE - Additional semantic information that describes data sets is inferred in response to a request for data from the data sets, e.g., in response to a query over the data sets, including analyzing a subset of results extracted based on the request for data to determine the additional semantic information. The additional semantic information can be verified by the publisher as correct, or satisfy correctness probabilistically. Mapping information based on the additional semantic information can be maintained and updated as the system learns additional semantic information (e.g., information about what a given column represents and data types represented), and the form of future data requests (e.g., URL based queries) can be updated to more closely correspond to the updated additional semantic information. | 03-14-2013 |
20130073510 | Method for automatically retrieving and analyzing multiple groups of documents by mining many-to-many relationships - A method for automatically retrieving and analyzing multiple groups of documents by mining many-to-many relationships: ( | 03-21-2013 |
20130080379 | Annotating Medical Binary Decision Diagrams with Health State Information - In particular embodiments, a method includes accessing a first binary decision diagram (BDD) representing data streams from sensors, accessing a second BDD representing health states associated with specified data ranges, and constructing a third BDD by performing an AND operation between the first and second BDDs. | 03-28-2013 |
20130110763 | PROGRAMMATIC ACCESS TO TERMINOLOGIES EXPRESSED IN HIERARCHICAL FORM | 05-02-2013 |
20130117215 | Constraint satisfaction problem solving using constraint semantics - A computer-implemented method, apparatus and product for solving a Constraint Satisfaction Problem (CSP). The computer-implemented method, performed by a computerized device, comprising: obtaining the CSP comprising a set of variables, a set of corresponding domains, and a set of constraints; and solving the CSP by iteratively: limiting the domains to exclude values that cannot satisfy one or more constraints of the set of constraints; heuristically selecting a variable out of the set of variables, wherein said heuristically selecting is based on constraint semantics of a constraint of the set of constraints; and limiting a corresponding domain of the selected variable. | 05-09-2013 |
20130151463 | Information Validation - A computer implemented method for knowledge validation includes identifying a fact for validation. A semantic model representing the fact for validation can be created. A context associated with the fact can be identified, and an automaton can be created based at least in part on the identified context. The fact can be validated using the automaton. | 06-13-2013 |
20130179392 | METHOD AND A PROGRAMMABLE DEVICE FOR CALCULATING AT LEAST ONE RELATIONSHIP METRIC OF A RELATIONSHIP BETWEEN OBJECTS - A method for calculating at least one relationship metric of a relationship between objects has the steps of providing a multi-layered relationship network with a first relationship layer derived from potential relations between objects, a second relationship layer derived from interactions between objects, a third relationship layer derived from explicit relations between objects, and an aggregated relationship layer derived from at least two layers of the relationship layers, and wherein each layer has a graph with one vertex for every object represented in the network and at least one unidirectional and/or bidirectional edge between at least two of the objects, and calculating the edge weights based on the edge weights of at least two relationship layers, selecting at least the relationship with a highest edge weight between an object and other objects, and finally outputting the weights of the selected relationships as the calculated relationship metrics. | 07-11-2013 |
20130262369 | FORECASTING A FUTURE EVENT IN AN EVENT STREAM - Methods and systems for forecasting a future event in an event stream are provided herein. The event stream includes a number of events, wherein each of the events includes an event label and an associated time stamp. The system includes a processor that is adapted to execute stored instructions and a system memory. The system memory includes code configured to generate one or more decision graphs for predicting events with event labels chosen from a number of event labels based on the events within the event stream, wherein the decision graph includes decision nodes and leaf nodes, and wherein each of the decision nodes includes a question. The system memory also includes code configured to analyze event stream data using the decision graph and forecast a future event in the event stream based on the analysis of the event stream data. | 10-03-2013 |
20130275359 | SYSTEM, METHOD, AND COMPUTER PROGRAM FOR A CONSUMER DEFINED INFORMATION ARCHITECTURE - Techniques are described for performing synthesis of relationships between a plurality of concept definitions automatically derived from a faceted domain of information. Some embodiments involve identifying at least one facet attribute in an active concept definition specified by user input. In response to determining that at least one explicit relationship and/or at least one implicit relationship exist(s) between the active concept definition and a first concept definition of the plurality of concept definitions, a relationship is synthesized between the active concept definition and the first concept definition. | 10-17-2013 |
20130282647 | SYSTEMS AND METHODS FOR SEMANTIC CONCEPT DEFINITION AND SEMANTIC CONCEPT RELATIONSHIP SYNTHESIS UTILIZING EXISTING DOMAIN DEFINITIONS - Computer-implemented systems and methods for synthesis of concept definitions and concept relationships from a domain of data, utilizing different semantic processing protocols such as formal concept analysis and faceted classification synthesis from existing domain concepts that have a confidence gradient built into them. A cognitive of an input agent provides an input of an active concept which is matched against existing domain concepts. The resultant pool of relevant domain concepts is then used to derive virtual concept definitions using a semantic processing protocol. The derivation is then overlaid with a concept of relative proximity of an attribute from another within an attribute set. An additional layer of coherence is given by the relative proximity measure. The end result is a pool of related virtual concept definitions in a tree structure. | 10-24-2013 |
20130290241 | Ontology-Driven Complex Event Processing - Described embodiments relate generally to ontology-driven complex event processing (CEP). When implemented as a computer ( | 10-31-2013 |
20130311419 | Incremental Reasoning Under Data Source Availability Constraints - A method executed by a computer system for generating a high level inferred conclusion from raw data collected from a plurality of data sources by application of an ontology reasoning system, the method comprising the steps of determining availability of intermediate results received from a plurality of shallow reasoners, the intermediate results generated by the plurality of shallow reasoners based on the plurality of data sources; propagating the intermediate results to nodes of an ontology graph; executing incremental ontology reasoning over the ontology graph to generate inferred conclusions; and persisting inferred conclusions in an ontology database. | 11-21-2013 |
20130339290 | METHOD FOR UPDATING BETWEENNESS CENTRALITY OF GRAPH - The present invention provides a method for updating betweenness centrality of a graph, which obtains the betweenness centrality of an unweighted graph, which is updated when edges are updated, the method comprising the steps of: obtaining a minimum union cycle (an MUC, a subset of edges of the graph in which every vertex of the graph is incident to an even number of edges) of the updated graph; extracting an MUC (i.e., an MUC | 12-19-2013 |
20140006337 | MASSIVELY SCALABLE REASONING ARCHITECTURE | 01-02-2014 |
20140012798 | PROCESS OF DIALOGUE AND DISCUSSION - A method for effecting a dialogue with an emulated brain. The method includes the step of receiving a query in the form of a semantic string. The semantic string is then parsed into basic concepts of the query. The basic concepts are then clumped into a clump concept. If the clump concept constitutes part of a dialogue, then the dialogue thread is activated by determining the context of the clump concept and assessing a potential reply from a group of weighted replies, which expected replies are weighted based on the parsed concepts produced in the step of parsing. The heaviest weighted one of the expected replies is selected and the weight of the selected reply after it is selected is downgraded. The selected reply is then generated for output in a sentence structure. | 01-09-2014 |
20140040181 | AUTOMATIC FAQ GENERATION - Generally described is auto generation of an FAQ based on partly textual content. A network service can receive at least partly textual content. A FAQ can be generated based on the content. Questions within the FAQ can be ranked based on popularity, usefulness, etc. When a question in the FAQ is selected, a link can be generated to the portions of the content where the question and answer were derived from. | 02-06-2014 |
20140081900 | SYSTEM AND METHOD FOR INFORMATION SHARING ACROSS SECURITY BOUNDARIES - A system and method for sharing information across security boundaries including a server for sharing information between networks. The method for includes receiving data structured as semantic statements, retrieving a set of rules and ontology, processing a semantic statement from data with rules and ontology, determining whether the semantic statement is consistent with rules and ontology, and determining a fact that gives rise to an inconsistency if the semantic statement is inconsistent. The method further includes removing the fact that gives rise to the inconsistency and releasing data when the semantic statement is consistent with rules and ontology. | 03-20-2014 |
20140136468 | QUANTITATIVE ASSESSMENT OF SIMILARITY OF CATEGORIZED DATA - A system having a processor is programmed to realize practical quantitative assessment of similarity of categorized data. The category data may be stored in a memory as a category graph comprising a graphical data structure having plural parent and child category nodes connected by directed edges, such that sequences of connected category nodes represent hierarchical relations between categories of objects. A similarity metric of a selected pair of categories may be derived, in one embodiment, by analysis of ancestors of the selected pair of categories, including consideration of closest common ancestors in the category graph. Efficiency improvements may include transforming a directed cyclic graph to a directed acyclic graph, and optionally deriving a subgraph to reduce the number of categories under consideration. The software methods may further comprise computing a similarity metric for a pair of objects based on the similarity score for the corresponding pair of categories. | 05-15-2014 |
20140180999 | METHOD AND APPARATUS FOR PROVIDING SOFTWARE PROBLEM SOLUTIONS - In one embodiment, a method for providing software problem solutions includes: obtaining a software problem of a questioning user; obtaining from other users multiple solutions for solving the software problem, each of the multiple solutions being provided as a recording script, and each of the recording scripts includes a user operation sequence and a corresponding semantic node sequence, wherein one or more semantic nodes in each of the semantic node sequences describes meanings of user operations; analyzing, by a computer processor, semantic node sequences in the recording scripts of the multiple solutions to determine recommendation degree information for the multiple solutions; and outputting the multiple solutions and the associated recommendation degree information. | 06-26-2014 |
20140279820 | GMTI Ground Activity Sematic Reasoning Engine - The present invention is directed to a system that includes a semantic reasoning engine that is configured to convert radar track data into a directed graph representation (DGR) of the predetermined surveillance region and iteratively combine the DGRs to create a weighted directed graph (WDG) aligned and superimposed with the digital map data. The WDG includes first WDG elements corresponding to moving objects detected by a radar system. The WDG is compared to historical data to obtain a surveillance detection parameter. An alarm message is generated if the surveillance detection parameter deviates from the historical data by a predetermined amount. An output device is coupled to the semantic reasoning engine and is configured to provide a representation of the digital map data, the WDG and the at least one alarm message. | 09-18-2014 |
20140304214 | NAVIGABLE SEMANTIC NETWORK DEFINITION, MODELING, AND USE - A computer environment includes an editor application enabling generation of a specification (e.g. a graphic description) defining attributes of a navigable semantic network. An example navigable semantic network as defined by the specification can include multiple resource nodes and corresponding links defining relationships amongst the resource nodes. In addition to defining nodes and relationships, the specification can define display rules, navigation rules, etc. associated with the navigable semantic network. The computer environment can further include a compiler, a view instantiation engine, and a presentation engine. The compiler compiles the specification into a semantic network model. The view instantiation engine instantiates different portions of a semantic network as defined by the semantic network model. The presentation engine initiates display of the instantiated portion of the semantic network. Based on navigation input, the view instantiation engine updates an instantiated portion of the semantic network for presentation by the presentation engine. | 10-09-2014 |
20140324765 | METHOD, SYSTEM, AND COMPUTER PROGRAM FOR USER-DRIVEN DYNAMIC GENERATION OF SEMANTIC NETWORKS AND MEDIA SYNTHESIS - This invention relates generally to classification systems. More particularly this invention relates to a system, method, and computer program to dynamically generate a domain of information synthesized by a classification system or semantic network. The invention discloses a method, system, and computer program providing a means by which an information store comprised of knowledge representations, such as a web site comprised of a plurality of web pages or a database comprised of a plurality of data instances, may be optimally organized and accessed based on relational links between ideas defined by one or more thoughts identified by an agent and one or more ideas embodied by the data instances. Such means is hereinafter referred to as a “thought network”. | 10-30-2014 |
20140372364 | UTILITY-BASED ONTOLOGY EVOLUTION - Exemplary embodiments of the present invention disclose a method, computer program product, and system for updating an ontology when a set of evidences and a set of constraints are given as inputs. Exemplary embodiments categorize concepts into three sets, a definitely relevant set, a possibly relevant set, and an irrelevant set. Exemplary embodiments store the concepts from the definitely relevant set in the ontology and the concepts from the possibly relevant set in a residual ontology. Exemplary embodiments match concepts in the set of evidences to the concepts in the ontology or the concepts in the residual ontology. Exemplary embodiments determine to enhance the strength of the existing concepts in the ontology or the existing concepts in the residual ontology. Exemplary embodiments determine to expand the ontology or the residual ontology. Exemplary embodiments remove the concepts from the ontology or the residual ontology utilizing the set of constraints. | 12-18-2014 |
20150012475 | DETERMINATION METHOD, SYSTEM AND RECORDING MEDIUM - A determination method includes: generating, when a logical formula is received, another statement group that shares either one of individual statements and one or plural statements of statement groups with each of the individual statements and statement groups that are included in the logical formula or a changed logical formula acquired with the performance of logically equivalent conversion with regard to the logical formula, the logical formula or the changed logical formula including a logical disjunction of the individual statements or the statement groups that are logical conjunctions of the one or plural statements; and performing a determination process of the logical formula, wherein the logical formula is determined as not satisfied when a determination result indicating that the statements that are included in the other statement group are not satisfied is obtained in the determination process. | 01-08-2015 |
20150046388 | SEMANTIC PERCEPTION - Machine semantic perception is discussed. One example system can comprise an environmental knowledgebase (KB) associating features with properties, and an interface component receiving sensor data associated with observed properties. The KB and sensor observations can be encoded in bit-matrix and bit-vector representations, respectively, for efficient storage and computation. A perception component can perform semantic perception on observed properties based on the KB. The perception component can determine explanatory features associated with the observed properties through abductive reasoning, and determine discriminatory properties associated with the explanatory features through deductive reasoning. These can be executed in an iterative and interleaved Perception Cycle for efficient computation of minimum actionable explanations of observations. The bit-matrix and bit-vector representations are presented for efficient computation of minimum actionable explanation using perception cycle, the iterative and interleaved application of hybrid abductive and deductive reasoning to seek contextually relevant discriminatory observations to systematically narrow explanatory features. | 02-12-2015 |
20150066835 | Computational Tools For Genomic Sequencing and Macromolecular Analysis - A four valued parallelized simulation with the ability to implement computer systems with the ability to combine a mixture of computer intensive techniques in DNA analysis and molecular crystallography. Disclosed systems and methods aid in the design of drugs, pharmaceutical research, genetically modified organisms and the detection of genetic sequences for gene therapy. | 03-05-2015 |
20150100540 | SYSTEMS AND METHODS FOR SEMANTIC CONCEPT DEFINITION AND SEMANTIC CONCEPT RELATIONSHIP SYNTHESIS UTILIZING EXISTING DOMAIN DEFINITIONS - Computer-implemented systems and methods for synthesis of concept definitions and concept relationships from a domain of data, utilizing different semantic processing protocols such as formal concept analysis and faceted classification synthesis from existing domain concepts that have a confidence gradient built into them. A cognitive or an input agent provides an input of an active concept which is matched against existing domain concepts. The resultant pool of relevant domain concepts is then used to derive virtual concept definitions using a semantic processing protocol. The derivation is then overlaid with a concept of relative proximity of an attribute from another within an attribute set. An additional layer of coherence is given by the relative proximity measure. The end result is a pool of related virtual concept definitions in a tree structure. | 04-09-2015 |
20150332148 | FAILURE OCCURRENCE CAUSE EXTRACTION DEVICE, FAILURE OCCURRENCE CAUSE EXTRACTION METHOD, AND FAILURE OCCURRENCE CAUSE EXTRACTION PROGRAM - The present invention is capable of accurately and easily extracting a failure and a cause of occurrence of the failure on the basis of past cases. The present invention is provided with: a document storage unit ( | 11-19-2015 |
20150356426 | Method for Performing Dataset Operations Within a Cognitive Environment - A method for performing dataset operations within a cognitive information processing system comprising: receiving data from a plurality of data sources; and, processing the data from the plurality of data sources, the processing the data establishing and maintaining a dynamic data ingestion and enrichment pipeline. | 12-10-2015 |
20150356427 | Method for Performing Graph Query Operations within a Cognitive Environment - A method for providing cognitive insights via a cognitive information processing system comprising: receiving data from a plurality of data sources; receiving and processing queries; and, bridging the queries into a cognitive graph. | 12-10-2015 |
20150356437 | Composite Cognitive Insights - A system comprising: a processor; a data bus coupled to the processor; and a non-transitory, computer-readable storage medium embodying computer program code, the non-transitory, computer-readable storage medium being coupled to the data bus. The computer program code interacting with a plurality of computer operations and comprising instructions executable by the processor and configured for: receiving streams of data from a plurality of data sources; processing the streams of data from the plurality of data sources, the processing the streams of data from the plurality of data sources performing data enriching and generating a sub-graph for incorporation into a cognitive graph; processing the cognitive graph, the processing the cognitive graph providing a plurality of individual cognitive insights; and, generating a composite cognitive insight, the composite cognitive insight being composed of the plurality of individual cognitive insights. | 12-10-2015 |
20150356439 | Travel-Related Cognitive Personas - A method, system and computer-usable medium for performing cognitive computing operations comprising receiving streams of data from a plurality of data sources; processing the streams of data from the plurality of data sources, the processing the streams of data from the plurality of data sources performing data enriching for incorporation into a cognitive graph; defining a travel-related cognitive persona within the cognitive graph, the travel-related cognitive persona corresponding to an archetype user model, the travel-related cognitive persona comprising a set of nodes in the cognitive graph; associating a user with the travel-related cognitive persona; and, performing a cognitive computing operation based upon the travel-related cognitive persona associated with the user. | 12-10-2015 |
20150356440 | Travel-Related Weighted Cognitive Personas and Profiles - A method, system and computer-usable medium for performing cognitive computing operations comprising receiving streams of data from a plurality of data sources; processing the streams of data from the plurality of data sources, the processing the streams of data from the plurality of data sources performing data enriching for incorporation into a cognitive graph; defining a travel-related cognitive persona within the cognitive graph, the travel-related cognitive persona corresponding to an archetype user model, the travel-related cognitive persona comprising a set of nodes in the cognitive graph, links among the set of nodes being weighted to provide a weighted cognitive graph; associating a user with the travel-related cognitive persona; and, performing a cognitive computing operation based upon the travel-related cognitive persona associated with the user. | 12-10-2015 |
20150356441 | Travel-Related Weighted Cognitive Personas and Profiles - A method, system and computer-usable medium for performing cognitive computing operations comprising receiving streams of data from a plurality of data sources; processing the streams of data from the plurality of data sources, the processing the streams of data from the plurality of data sources performing data enriching for incorporation into a cognitive graph; defining a travel-related cognitive persona within the cognitive graph, the travel-related cognitive persona corresponding to an archetype user model, the travel-related cognitive persona comprising a set of nodes in the cognitive graph, links among the set of nodes being weighted to provide a weighted cognitive graph; associating a user with the travel-related cognitive persona; and, performing a cognitive computing operation based upon the travel-related cognitive persona associated with the user. | 12-10-2015 |
20150356442 | Cognitive Media Content - A method, system and computer-usable medium for providing composite cognitive insights comprising receiving streams of data from a plurality of data sources; processing the streams of data from the plurality of data sources, the processing the streams of data from the plurality of data sources performing data enriching and generating a sub-graph for incorporation into a cognitive graph; processing the cognitive graph, the processing the cognitive graph providing a plurality of individual cognitive insights; generating a composite cognitive insight, the composite cognitive insight being composed of the plurality of individual cognitive insights; and, providing the composite cognitive insight to a user via a set of cognitive media content. | 12-10-2015 |
20150356443 | Cognitive Media Commerce - A method, system and computer-usable medium for providing composite cognitive insights comprising receiving streams of data from a plurality of data sources; processing the streams of data from the plurality of data sources, the processing the streams of data from the plurality of data sources performing data enriching and generating a sub-graph for incorporation into a cognitive graph; processing the cognitive graph, the processing the cognitive graph providing a plurality of individual cognitive insights; generating a composite cognitive insight, the composite cognitive insight being composed of the plurality of individual cognitive insights; and, providing the composite cognitive insight to a user via a set of cognitive media content, the set of cognitive media content comprising a commercial offer content element. | 12-10-2015 |
20150356444 | METHOD AND SYSTEM OF DISCOVERING AND ANALYZING STRUCTURES OF USER GROUPS IN MICROBLOG - A method and system of discovering and analyzing structures of user groups in a microblog is provided in this invention. The method of discovering and analyzing structures of the user groups in a microblog comprises: acquiring information on behavior data of microblog users of a target group; constructing a microblog user association network based on the information on behavior data of the microblog users of the target group; acquiring at least one maximal clique from the microblog user association network; acquiring at least one core clique based on the maximal clique; and conducting behavior analysis on the user groups in the microblog based on the acquired maximal clique and/or the acquired core clique. Using the method and system of discovering and analyzing structures of user groups in a microblog provided in this invention, complicated relationships among microblog users may be sufficiently identified and the speed of discovering and analyzing structures of user groups in a microblog may be improved to meet the demand for large scaled data processing. | 12-10-2015 |
20150379409 | COMPUTING APPARATUS AND METHOD FOR MANAGING A GRAPH DATABASE - Embodiments include an apparatus to automate integration of non-conceptual data items into a data graph, the graph including graph nodes and graph edges, the computing apparatus comprising: a data storage system configured to store, as a node, a behavior handler to update the data graph in response to an occurrence of a specified trigger event, the node representing the behavior handler being stored in association with the non-conceptual data item; an execution module configured to execute the procedure defined by a behavior handler in response to the event; a modification identification module to identify modified graph elements, and to record the graph elements as modifications attributed to the behavior handler; an inference module configured to infer relationships between behavior handlers by, analyzing the modifications attributed to the behavior handlers to identify relationships between the modifications, and adding the relationships to the data graph as edges between the graph nodes. | 12-31-2015 |
20160012336 | AUTOMATICALLY LINKING TEXT TO CONCEPTS IN A KNOWLEDGE BASE | 01-14-2016 |
20160055413 | METHODS AND SYSTEMS THAT CLASSIFY AND STRUCTURE DOCUMENTS - The current document is directed to methods and systems that classify electronic documents. In one implementation, multiple hypotheses for the type and structure of the document are automatically generated or identified. A page hypothesis is selected for each page of the document, using one or more page hypotheses already selected for one or more neighboring pages when such already selected page hypotheses are available. The selected page hypotheses are then used to automatically select one of the multiple document hypotheses and a corresponding document type, following which various document-processing and document-refinement operations can be applied to the document according to the selected document hypothesis and document type. | 02-25-2016 |
20160148096 | EXTRACTION OF SEMANTIC RELATIONS USING DISTRIBUTIONAL RELATION DETECTION - According to an aspect, a pair of related entities that includes a first entity and a second entity is received. Distributional relations are detected between the first entity and the second entity. The detecting includes identifying two sets of entities in a corpus, the first set including the first entity and at least one other entity that is semantically similar to the first entity, and the second set including the second entity and at least one other entity that is semantically similar to the second entity. Semantic relations are detected between entities in the first set and entities in the second set. A relation classifier is trained using the pair of related entities and detected semantic relations. The relation classifier model is applied to a new pair of entities to determine a likelihood of a semantic relation between the entities in the new pair of entities. | 05-26-2016 |
20160180221 | SYSTEMS AND METHODS FOR SEMANTIC CONCEPT DEFINITION AND SEMANTIC CONCEPT RELATIONSHIP SYNTHESIS UTILIZING EXISTING DOMAIN DEFINITIONS | 06-23-2016 |
20160180227 | DEGREE OF CLOSENESS BASED ON COMMUNICATION CONTENTS | 06-23-2016 |
20160188595 | Semantic Network Establishing System and Establishing Method Thereof - A semantic network establishing system includes an editing center, a translating center and a node detection center. The editing center generates at least a knowledge node and edits at least a semantic link for encoding a semantic relationship between the knowledge node and the related knowledge node. The translating center communicatively connects the editing center. The translating center acquires an editing content from the knowledge system and sends the editing content to the editing center for editing. The node detection center communicatively connects with the knowledge node, wherein the node detection center detects a state of said knowledge node for informing the user the state of the knowledge node, so that the user is encouraged to continuously edit. | 06-30-2016 |
20160189038 | TECHNIQUES FOR MOBILE PREDICTION - An apparatus and method for mobile prediction is disclosed. In an embodiment, a predictive component creates graphs of user behaviors and receives subgraphs derived from a global graph. By combining a subset of the user behavior graph and the subgraph, a user behavior is predicted. Other embodiments are described and claimed. | 06-30-2016 |
20220138599 | SYSTEMS, METHODS, AND COMPUTER READABLE MEDIA FOR VISUALIZATION OF SEMANTIC INFORMATION AND INFERENCE OF TEMPORAL SIGNALS INDICATING SALIENT ASSOCIATIONS BETWEEN LIFE SCIENCE ENTITIES - Disclosed systems, methods, and computer readable media can detect an association between semantic entities and generate semantic information between entities. For example, semantic entities and associated semantic collections present in knowledge bases can be identified. A time period can be determined and divided into time slices. For each time slice, word embeddings for the identified semantic entities can be generated; a first semantic association strength between a first semantic entity input and a second semantic entity input can be determined; and a second semantic association strength between the first semantic entity input and semantic entities associated with a semantic collection that is associated with the second semantic entity can be determined. An output can be provided based on the first and second semantic association strengths. | 05-05-2022 |