Similar concept extraction system and similar concept extraction method utilizing graphic structure
OwnerAsako Koike, Yoshiki Niwainventors
Life of this patent
Estimating the term…
Abstract
Similar concepts are deduced in consideration of relationships among concepts belonging to a plurality of categories. Concepts belonging to a plurality of categories are shown in the form of a graph in which concepts are represented by nodes and relationships between pairs of concepts are represented by edges. The number of crossings of edges linking pairs of concepts belonging to categories is reduced. Similar concepts are deduced multilaterally in consideration of the relationships between the pairs of concepts belonging to the categories.
Claims16
A similar concept extraction system, comprising:
- a data reception unit that receives, from a first input, information on concepts to be included in a plurality of layers, and, from a second input, information on databases to be used for at least two adjacent layers, and that receives information on relationships between concepts in and between adjacent layers;
- a graph creation unit that creates at least one graph in which nodes represent the concepts acquired by the data reception unit, edges represent the relationships between concepts, and wherein the nodes included in the adjacent layers are linked by the edges;
- a number-of-edge crossings reduction unit that modifies arrays of the nodes in and across the adjacent layers to reduce a number of edge crossings in the graph;
- and
- a display device on which the graph is displayed.
A similar concept extraction method comprising the steps of:
- creating a graph in which a first set of concepts is regarded as a layer, the concepts included in one of the layers are represented by nodes and arrayed one-dimensionally, relationships between pairs of the concepts are represented by edges, and the nodes included in adjacent ones of the layers are linked by respective ones of the edges;
- modifying the arrays of the nodes in a respective one of the layers so as to minimize a number of edge crossings in the graph;
- and
- displaying the graph having the number of the edge crossings minimized.
Dependencies are inferred from the claim text.