INFORMATION PROCESSING APPARATUS AND NON-TRANSITORY COMPUTER READABLE MEDIUM
An information processing apparatus includes a receiving unit receiving a query, an acquisition unit acquiring, on each content unit serving as a search target, multiple nodes corresponding to the query from data representing a relationship between the nodes and includes information on each node representing a concept of the content unit serving as a search target, a search unit searching for a path including mutually related nodes from the nodes acquired by the acquisition unit, and a calculating unit calculating a score of the path of at least one of the content units, the path searched and found by the search unit, by using at least one of a hop count representing a number of nodes included between a node representing the concept included in the query and the content unit, degree of importance of the concept of the content unit, and type of the relationship of the concepts.
1 . An information processing apparatus comprising:
a receiving unit that receives a query;
an acquisition unit that acquires, on each content unit serving as a search target, a plurality of nodes corresponding to the query from data that represents a relationship between the nodes and includes information on each node representing a concept of the content unit serving as a search target;
a search unit that searches for a path including nodes mutually related to each other from the nodes acquired by the acquisition unit; and
a calculating unit that calculates a score of the path of at least one of the content units, the path searched and found by the search unit, by using at least one of a hop count representing a number of nodes included between a node representing the concept included in the query and the content unit, a degree of importance of the concept of the content unit, and a type of the relationship of the concepts.
2 . The information processing apparatus according to claim 1 , wherein if a plurality of paths is present, the calculating unit calculates the score of the content unit by calculating the score of each path and by summing the calculated scores.
3 . The information processing apparatus according to claim 2 , wherein the calculating unit calculates the scores of only the content units having an equal number of paths.
4 . The information processing apparatus according to claim 1 , wherein the acquisition unit searches for the content unit, as a search target, related to concepts of a number equal to a number of concepts included in the query.
5 . The information processing apparatus according to claim 2 , wherein the acquisition unit searches for the content unit, as a search target, related to concepts of a number equal to a number of concepts included in the query.
6 . The information processing apparatus according to claim 1 , wherein the calculating unit calculates the score of the path if the content unit is related to a particular concept, and
wherein the calculating unit does not calculate the score of the path if the content unit is not related to the particular concept.
7 . The information processing apparatus according to claim 1 , wherein the type of the relationship of the concepts includes a first type representing a relationship between a generic concept and a specific concept and a second type representing a relationship between the generic concept and a concept other than the specific concept.
8 . The information processing apparatus according to claim 7 , wherein the path has the first type of the relationship and is an abstraction path having a concept on a side of the content unit broader than a concept on a side of the query, and
wherein the search unit sets an upper limit on the hop count of the abstraction path.
9 . The information processing apparatus according to claim 7 , wherein the path has the first type of the relationship and is a concretion path having a concept on a side of the content unit narrower than a concept on a side of the query, and
wherein the search unit does not set an upper limit on the hop count of the concretion path.
10 . The information processing apparatus according to claim 7 , wherein the path has the first type of the relationship and is a mixture path including an abstraction path having a concept on a side of the content unit broader than a concept on a side of the query and a concretion path having a concept on a side of the content unit narrower than a concept on a side of the query, and
wherein the search unit sets an upper limit on only the hop count of the abstraction path of the mixture path.
11 . The information processing apparatus according to claim 7 , wherein the path is a relation path including the two types of relationship, and
wherein the search unit sets an upper limit on the hop count of the relation path.
12 . The information processing apparatus according to claim 1 , wherein the calculating unit calculates the score of the path by using a distance between the concepts determined in accordance with the type of the relationship of the concepts,
wherein the type of the relationship of concepts includes a first type representing a relationship between a generic concept and a specific concept and a second type representing a relationship between the generic concept and a concept other than the specific concept, and
wherein the distance between the concepts in a path including the first type of the relationship is different from the distance between the concepts in a relation path including the second type of the relationship.
13 . The information processing apparatus according to claim 12 , wherein a distance between the concepts in an abstraction path that has the first type of the relationship and has a concept on a side on the content unit broader than a concept on a side of the query is longer than a distance between the concepts in the relation path.
14 . The information processing apparatus according to claim 12 , wherein a distance between the concepts in a concretion path that has the first type of the relationship and has a concept on a side of the content unit narrower than a concept on a side of the query is shorter than a distance between the concepts in the relation path.
15 . The information processing apparatus according to claim 1 , wherein the calculating unit calculates the score by using a method that is different from a path including a branch path in which the concept on a side of the query branches into a plurality of concepts on a side of the content unit to a path including a merging path in which a plurality of concepts on a side of the query merges into the concept on a side of the content unit.
16 . The information processing apparatus according to claim 15 , wherein if the path includes the branch paths, the calculating unit calculates the score of the path by summing scores of the branch paths.
17 . The information processing apparatus according to claim 15 , wherein if the path includes the merging paths, the calculating unit sets a maximum score of the scores of the merging paths to be the score of the path.
18 . The information processing apparatus according to claim 1 , wherein the degree of importance is calculated by using term frequency-inverse document frequency (TF-IDF).
19 . The information processing apparatus according to claim 18 , wherein if the content unit includes a caption, the degree of importance of a concept included in the caption is calculated to be higher than the degree of importance of a concept not included in the caption.
20 . A non-transitory computer readable medium storing a program causing a computer to execute a process for processing information, the process comprising:
receiving a query;
acquiring, on each content unit serving as a search target, a plurality of nodes corresponding to the query from data that represents a relationship between the nodes and includes information on each node representing a concept of the content unit serving as a search target;
searching for a path including the nodes mutually related to each other from the acquired nodes; and
calculating a score of the searched and found path of at least one of the content units by using at least one of a hop count representing a number of nodes included between a node representing the concept included in the query and the content unit, a degree of importance of the concept of the content unit, and a type of the relationship of the concepts.