International Business Machines Corporation

Robert Kern

Martin Oberhofer

Yannick Saillet

Mike W Grasselt

Hemanth Kumar Babu

Thuany Karoline Stuart

Basem Elasioty

Sushain Pandit

Ivan Matthew Milman

Dan Jeffrey Mandelstein

Claudio Andrea Fanconi

Albert Maier

Oliver Suhre

Peter Gerstl

Thomas Schwarz

Lars Bremer

Gerald Johann Wilmot

Jason Allen Woods

Jonathan Roesner

Ingo Hotz

Mathias Rueck

The present disclosure relates to a method for a weighting graph comprising nodes representing entities and edges representing relationships between entities in accordance with one or more domains. The method comprises: pre-processing the graph comprising assigning weights to the nodes and/or the edges of the graph in accordance with a specific domain of the domains, wherein the weight indicates a domain specific data quality problem of attribute values representing an edge of the edges and/or an entity involved in that edge. The weighted graph may be provided for enabling a processing of the graph in accordance with the specific domain.

Method for weighting a graph

Methods, computer program products and/or systems are provided that perform the following operations: obtaining a first graph comprising first nodes representing first entities and first edges representing relationships between first entities, the first nodes being associated with first entity attributes descriptive of the first entities represented by the first nodes, the first edges being associated with first edge attributes descriptive of the relationships represented by the first edges; determining a first subgraph for a certain node of the first nodes of the first graph, the first subgraph including the certain node and at least one neighboring node of the certain node; and determining a data quality issue regarding the certain node based, at least in part, on applying one or more applicable rules of a set of data quality rules to first entity attribute values and first edge attribute values of the first subgraph.

Measuring data quality of data in a graph database

Embodiments of the present invention determines duplicates in a graph. The graph comprises nodes representing entities and edges representing relationships between the entities. The method comprises: identifying at least two nodes in the graph. A neighborhood subgraph may be determined for each of the two nodes. The neighborhood subgraph includes the respective node. The method further comprises determining whether the two nodes are duplicates with respect to each other, based on a result of a comparison between the two subgraphs.

Method for duplicate determination in a graph

A method, system and computer program product for classifying a data collection of data of a predefined domain. A hierarchical representation scheme describing terms of the domain and one or more relationships between the terms is provided. At least one classifier may be applied on the data collection, resulting in a set of term assignments. Each term assignment of the term assignments associates a term candidate with a respective confidence value to the collection or to one or more data items of the collection. At least one of the term assignments may be refined based on the representation scheme and the set of term assignments.

Refining classification results based on glossary relationships

A method, computer program product, and system for information governance crowd sourcing by, responsive to receiving a data quality exception identifying one or more data quality errors in a data store, identifying a performance level required to correct the data quality errors, selecting, from a crowd hierarchy, a first one or more crowds meeting the defined performance level, wherein the crowd hierarchy ranks the performance of one or more crowds, and routing, by operation of one or more computer processors, the one or more data quality errors to the selected crowds for correction.

Information governance crowd sourcing

Embodiments relate to cache handling in a database system. An aspect includes controlling operations of a set of caches in the database system and determining whether a value of a cache quality parameter of a first cache out of the set of caches meets a cache image creation criterion relating to the first cache. Moreover, an aspect includes selecting at least one cache entry from the first cache, if a value of a related cache entry parameter meets a cache entry criterion, and if the value of the cache quality parameter of the first cache exceeds the predefined value of the cache image creation criterion, and creating a cache image based on the selected at least one cache entry and storing the cache image for further use.

Cache handling in a database system

A system and method for searching recorded speech is disclosed. The system and method comprises converting the recorded speech into text using a voice recognition system. As the speech is being converted, naturally occurring breaks in the languages will be used to take time indexes from the recording. The system and method includes creating a full text index of the recorded speech utilizing an information extender. The full text index contains a plurality of time stamps that point to the occurrence of words in the recorded speech. Finally, the text is searched by a full text search server that has linguistic search capabilities using the full text index. Finally, the searched text, the text index and the recorded speech are stored in the database. The recorded speech is searched by locating relevant phrases or words, and then mapping the time stamps associated with the relevant phrases words back to the recorded speech in the database.

Method and system for searching recorded speech and retrieving relevant segments

Growing community of inventors

Boeblingen, Germany

Robert Kern