INFORMATION PROCESSING TECHNIQUE FOR GRAPH INCLUDING NODES

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is based upon and claims the benefit of priority of the prior Japanese Patent Application No. 2013-068967, filed on Mar. 28, 2013, the entire contents of which are incorporated herein by reference.

FIELD

This invention relates to a technique for generating a graph that connects plural nodes with links.

BACKGROUND

There are a lot of techniques in which a position of each node is calculated by an algorithm that conforms with a mechanics model such as a spring model, when a graph that connects plural nodes with links is displayed.

In such a technique, when the number of nodes increases, some nodes are not typically connected with links due to problems such as a calculation amount and display space. When there is no link between nodes, there is few relation between those nodes in almost all cases. However, when the link is not actually provided, information representing that there is few relation between those nodes is not reflected to the position calculation. In other words, the position calculation of the nodes is performed in a form that the relation between those nodes is indifferent, instead of “few”. Therefore, because of other constraint conditions, a case occurs in which nodes that have few relations are disposed in the neighborhood.

Recently, attention is paid to a data mining that is a technique for extracting knowledge from a large volume of data. In the data mining, analysis for deriving the relation of each element included in the large volume of data is often performed. For example, when it is assumed that the transmission source and destination of e-mail have a relation, data representing that the relation among users is extracted by analyzing e-mail that is transmitted and received among certain users. Typically, because e-mail is frequently exchanged between certain users, however, there are users that do not exchange e-mail at all, there are various relations among users.

When such data representing that the relation among users is expressed by a two-dimensional graph, the relation may be represented by the thickness of the link, or the positions of nodes representing users may be optimized by using the mechanics model such as the spring model as described above, and the relation among the users may be expressed by the final positional relation of the nodes.

In case where the latter expression method is employed, the relation between nodes may be misconceived when employing the aforementioned typical conventional method. In other words, regardless of nodes being disposed in the vicinity, those nodes may have less relation. Especially, when the relation is expressed by the two-dimensional graph, nodes and/or links are overlapped due to the problem of the space, and accordingly, it is not possible to identify nodes that are disposed in the vicinity regardless of less relation.

There are a lot of cases where such a graph is handled as being static, however, there is a case where the position of the node can be changed according to the user's instruction. However, the meaning that the position of the node is changed according to the user's instruction is not clear.

Non-Patent Document 1: Fruchterman T. M. J. and Reingold E. M., “Graph drawing by force-directed placement”, Software-Practice and Experience, Vol. 21, Issue 11, pp. 1129-1164, 1991
Non-Patent Document 2: Force-based graph drawing in AS3, [retrieved on Mar. 22,2013] Retrieved from the Internet:
Non-Patent Document 3: Force-Directed graph drawing, [retrieved on Mar. 22,2013] Retrieved from the Internet:

SUMMARY

According to one aspect of embodiments, an information processing method includes: (A) obtaining, for each node of plural nodes in a graph, which are associated each other, a display position at which the node is displayed on a display device; (B) calculating, for each node of the plural nodes, a movement vector according to a total sum of forces in conformity with a mechanics model in which an inertial force does not work, wherein the total sum of the forces is obtained by adding, with respect to all of nodes other than the node, a force that works in association with a distance concerning the display position with another node; (C) moving, for each node of the plural nodes, the display position by the calculated movement vector; and (D) while repeating the obtaining, the calculating and the moving or before performing the obtaining, the calculating and the moving, accepting an instruction corresponding to a user's operation for causing a display position of a certain node among the plural nodes to be changed, and changing the display position of the certain node on the display device according to the instruction.

The object and advantages of the embodiment will be realized and attained by means of the elements and combinations particularly pointed out in the claims.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory and are not restrictive of the embodiment, as claimed.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a functional block diagram of an information processing apparatus relating to this embodiment;

FIG. 2 is a diagram to explain the balance of forces;

FIG. 3 is a diagram depicting a processing flow of a processing relating to this embodiment;

FIG. 4 is a diagram depicting an example of data concerning degrees of association;

FIG. 5 is a diagram depicting an example of data stored in a fourth data storage unit;

FIG. 6 is a diagram depicting an example of a displayed graph;

FIG. 7 is a diagram depicting an example of data stored in a third data storage unit;

FIG. 8 is a diagram depicting a display example;

FIG. 9 is a diagram depicting a display example;

FIG. 10 is a diagram depicting a display example;

FIG. 11 is a diagram depicting a display example;

FIG. 12 is a diagram depicting a display example;

FIG. 13 is a diagram depicting a display example;

FIG. 14 is a diagram depicting a display example;

FIG. 15 is a diagram depicting a display example;

FIG. 16 is a diagram depicting a display example; and

FIG. 17 is a diagram depicting a functional block of a computer.

DESCRIPTION OF EMBODIMENTS

FIG. 1 illustrates a functional block diagram of an information processing apparatus 100 and the like, which relate to this embodiment of this invention. The information processing apparatus 100 includes a first data storage unit 110, a distance calculation unit 120, a second data storage unit 130, a movement processing unit 140, a fourth data storage unit 150, a display data generator 160, a display unit 170, a third data storage unit 190, a position obtaining unit 180 and an input unit 200.

The first data storage unit 110 stores data concerning degrees of association a_ijbetween elements i and j, which is obtained from an analysis apparatus 300 that performs a processing relating to the data mining, for example, to calculate data concerning degrees of association between elements. For example, the degree of association a_ijis expressed by a value from 0.0 to 1.0. In this embodiment, the degrees of association a_ijfor all combinations of elements are set, and reference distances described later are also set.

The distance calculation unit 120 calculates a reference distance between a node i corresponding to an element i and a node j corresponding to an element j from the data concerning the degrees of association, which is stored in the first data storage unit 110, and stores the calculated reference distances into the second data storage unit 130. As described above, the reference distance d_ijis calculated for all combinations of nodes. The third data storage unit 190 stores data concerning a present display position v_i(=(x, y). coordinate values in a two-dimensional space) of the node i.

The movement processing unit 140 calculates, for each node, data concerning a display position v_iof a movement destination by using data stored in the second data storage unit 130 and data stored in the third data storage unit 190, and stores the calculated data into the fourth data storage unit 150. In this embodiment, the spring model is employed as one example of the mechanics model for calculation of the movement destination. However, as described later, the inertial force does NOT work on nodes.

The position obtaining unit 180 obtains data of the present display position from the fourth data storage unit 150 and the input unit 200, and stores the obtained data into the third data storage unit 190.

The display data generator 160 generates display data of a graph by using data of the display positions of nodes, which is stored in the fourth data storage unit 150, and data concerning the degrees of associations a_ijbetween nodes, which is stored in the first data storage unit 110, and outputs the generated display data to the display unit 170. When the user inputs an instruction to move the position of a certain node by operating the input device such as a mouse through the input unit 200, the display data generator 160 performs a processing to move the certain node in response to the instruction. Moreover, the instruction to move the position of the certain node is also outputted from the input unit 200 to the position obtaining unit 180, and the position obtaining unit 180 modifies the display position of the certain node, which is stored in the fourth data storage unit 150, and also stores the modified display position and the display positions of other nodes into the third data storage unit 190.

In principle, by disposing nodes that have strong relation in the neighborhood and by disposing nodes that have few relation far away, this embodiment enables the user who watches the graph to intuitively understand the relations among elements corresponding to nodes. For this purpose, a disposition processing of nodes is performed based on the spring model while assuming that there are links for all combinations of nodes. This is because it is a problem that the node disposition is obtained in which the fact there is few relation is not taken into consideration, when the positions of the nodes are determined while assuming that there is no link because there is few relation. In other words, this is because it is a problem that a processing is performed similarly to a case where the relation is indifferent, and nodes that have few relation are often disposed in vicinity. More specifically, no repulsion between nodes that have few relation works on those nodes.

However, when the number of nodes becomes huge, it becomes difficult to view nodes because the nodes are overlapped in the two-dimensional graph. However, in order to maintain the aforementioned intuition, a method for resolving the overlap of the nodes by other rules is not employed.

Moreover, as schematically illustrated in FIG. 2, even when the node disposition is calculated while assuming that there are links for all combinations of nodes, there is a case where the strong attractive force that work on nodes A and B, which have the strong relation, is balanced with the weak repulsion forces caused by a lot of other nodes, and the nodes, which have the strong relation, are not always disposed adjacently.

In this embodiment, in order to solve the difficulty in viewing the graph due to the overlap of the nodes, and to verify whether the balance of the forces such as the local optimization occurs as a temporary measure or the nodes that have strong relation are originally disposed adjacently, it is possible for the user who refers to the graph to move the node position interactively. In case where the spring model is employed, an intuitive and easily-understandable phenomena can be confirmed in which, when a certain node among nodes that have a strong relation is separated, the certain node immediately returns to the other nodes that have the strong relation with the certain node, in other words, the original position. On the other hand, when a node is moved that is disposed at that position because the balance of the forces occurs as a temporary measure and that have a weak relation with surrounding nodes, another phenomena is confirmed that such a node moves to another position and becomes stable. Thus, by moving the node, it is possible to confirm the strength of the relation with the surrounding nodes, accordingly the importance of the node.

In the following, processing contents of the information processing apparatus 100 will be explained by using FIGS. 3 to 7.

Firstly, the distance calculation unit 120 calculates a reference distance d_ijbetween nodes based on the degree of association a_ijbetween elements, which is stored in the first data storage unit 110, and stores the calculated reference distances into the second data storage unit 130 (FIG. 3: step S1).

For example, data concerning the degrees of association, as illustrated in FIG. 4, is stored in the first data storage unit 110, and the reference distance d_ijis calculated, for example, by a following expression: d_ij=c(1.0−a_ij)²“c” is a coefficient. However, this expression is an example, and other expressions may be employed. However, it is preferable that the distance can be calculated even in case of the degree of association=“0”.

The reference distance d_ijis expressed by a following matrix D.

$D = (\begin{matrix} d_{11} & \dots & d_{1 n} \\ ⋮ & ⋱ & ⋮ \\ d_{n 1} & \dots & d_{n m} \end{matrix}), d_{ii} = 0, d_{ij} = d_{ji}, d_{ij} \geq 0 (1 \leq i, j \leq n)$

Here, it is assumed that there are “n” nodes.

Moreover, the position obtaining unit 180 sets an initial display position v_ifor each node i (1≦i≦n), and stores the initial display positions into the third data storage unit 190 (step S3). For example, the initial display position is set randomly.

After that, the movement processing unit 140 calculates a movement vector f_iaccording to a total sum of relative vectors (v_j−v_i), each of which is weighted according to a difference between a distance d(v_i, v_j) with another node j for the display position v_jand the reference distance d_ij(more specifically, a difference normalized by the distance d(v_i, v_j)), and stores data of the calculated movement vector f_iinto the fourth data storage unit 150 (step S5).

More specifically, the movement vector f_iis calculated by the following expression.

$f_{i} \leftarrow δ \sum_{j = 1}^{n} (d (v_{i}, v_{j}) - d_{ij}) \frac{(v_{j} - v_{i})}{d (v_{i}, v_{j})}$

δ is a sufficiently lesser value. In other words, while repeating the loop, the node is slightly moved. d (v_i, v_j) represents a function for calculating a distance between a display position v_iand a display position v_j(e.g. Euclid distance) . As described above, this expression represents that forces from all other nodes j works on one node i according to the difference with the reference distances d_ij. However, this expression is an example, and other expressions may be employed. For example, in this expression, the spring constant is “1”, however, other values may be employed for the spring constant.

However, in this embodiment, the friction is infinite, and the inertial force does not work. When taking into account the inertial force in this spring model, it takes a long time up to the convergence of the node disposition. As described above, there is a case where the strength of the relation is confirmed by manually changing the node position, however, because it takes a long time up to the beginning of the confirmation in case where it takes a long time up to the convergence, the interactivity is lowered. Moreover, because the node is moved by the user, the kinetic energy increases, however, in case where the inertial force works, the system becomes unstable, and the node disposition may not be settled. Therefore, the spring model without the inertial force is employed in this embodiment. When there is no inertial force, the calculation of the speed and the like become unnecessary to reduce a computation amount. In addition, the interactivity increases.

Furthermore, as for the weight of the node, a sufficiently large weight is employed so that the node does not move even by the spring.

This calculation is executed in a problem in which the node position v_iis calculated to minimize an evaluation value of the following evaluation expression.

$\sum_{i = 1}^{n} \langle \sum_{j = 1}^{n} (d (v_{i}, v_{j}) - d_{ij}) \frac{(v_{j} - v_{i})}{d (v_{i}, v_{j})} \rangle$

In this embodiment, instead of the scalar values such as energy that was conventionally used, a point that a direction of the force worked on each node (i.e. relative vector) is considered is different from a typical conventional art.

Then, the movement processing unit 140 moves each node i by the movement vector f_ito calculate the display position of the movement destination by (the movement vector f_i+present display position v_i), and stores the calculated display positions into the fourth data storage unit 150 (step S7).

For example, data as illustrated in FIG. 5 is stored in the fourth data storage unit 150. In an example of FIG. 5, for each identification number of the node, two-dimensional coordinate values are stored as a display position.

Then, the display data generator 160 disposes a node at the display position v_iof each node i, which is stored in the fourth data storage unit 150, and also generates display data of a graph in which a link is set between nodes according to the degrees of association a_i, which is stored in the first data storage unit 110, for example to display the display data on the display unit 170 (step S9). In other words, when the degree of association is equal to or less than a predetermined value, display of the link may be omitted, the link may be thickened when the degree of association exceeds a predetermined value, and the link having the thickness corresponding to the degree of association maybe set. However, as described above, the reference distance d_ijis calculated while assuming links exist for all combinations of nodes, and while taking into account all combinations of nodes, the movement vector f_iis calculated at the step S5.

For example, display as illustrated in FIG. 6 is made. FIG. 6 illustrates a case where four nodes exist, and the degrees of association between elements corresponding to the nodes are as depicted in FIG. 4. Thus, the link between nodes 1 and 2, which have a high degree of association, is thickened, and those nodes are disposed in the vicinity. Similarly, the link between nodes 2 and 4, which have a high degree of association, is thickened, and those nodes are disposed in the vicinity. Furthermore, the link between nodes 3 and 4, which have a relatively high degree of association, is slightly thickened, and those nodes are disposed relatively in the vicinity. Other links are thin, and nodes at both ends are disposed far away.

When an instruction to end this processing here from the user or the like is received or when a condition as a preset end condition is satisfied that a total sum of the movement vectors f_i, which are calculated at the step S5, is less than a predetermined value (step S11: Yes route), the processing ends. On the other hand, when the processing does not end (step S11: No route), the input unit 200 determines whether or not a movement instruction of a node is inputted from the user (step S12). When the movement instruction of the node is not inputted (step S12: No route), the processing shifts to step S15.

On the other hand, when the user operates the mouse or the like, and inputs the movement instruction by changing the display position of the displayed node by drag-and-drop, for example, (step S12: Yes route), the input unit 200 accepts the movement instruction, and outputs the movement data to the display data generator 160. Then, the display data generator 160 changes the display contents according to the movement instruction, and outputs data concerning the changed display contents to the display unit 170 (step S13).

Moreover, when there is no movement instruction from the input unit 200, the position obtaining unit 180 reads out data of the display positions, which is stored in the fourth data storage unit 150 as it is, and stores the read data into the third data storage unit 190. On the other hand, when the input unit 200 accepts the movement instruction, the input unit 200 outputs the movement instruction to the position obtaining unit 180. Then, the position obtaining unit 180 changes the display position for a node relating to the movement instruction according to the movement instruction, and then reads out data of the display positions for other nodes, which is stored in the fourth data storage unit 150, and stores the changed data and read data into the third data storage unit 190 (step S15). For example, data as illustrated in FIG. 7 is stored in the third data storage unit 190. Here, it is assumed that an instruction to move the display position of node 3 by (p, q) is made. Then, the display position of the node 3 is changed to (a₃+p, b₃+q). Then, the processing returns to the step S5.

By repeating such a processing, display as schematically illustrated in the following is made.

For example, when it is assumed that goods ordered together from the same store in a franchise, which handles a lot of goods, have a relation, and orders made on plural days from a lot of stores are analyzed by the analysis apparatus 300, relations among a lot of goods are extracted.

For example, when the steps S3 to S15 (except step S13) are repeated until the node positions are converged, in other words, the total sum of the vectors f_icalculated at the step S5 is less than the predetermined value, a graph illustrated in FIG. 8 is displayed. Here, attention is paid to a node “milk”. There are node “egg”, node “mayonnaise”, node “noodle” and node “bread” around the node “milk” . Here, as illustrated in FIG. 9, when a movement instruction from the user is made by dragging the node “milk”, the node “milk” is moved, however, other nodes do not move, because the node is so heavy that the node does not move by the force caused by the spring.

When the user drops the node “milk” in the state illustrated in FIG. 9, in other words, a change instruction of the display position of the node is detected at the step S12, the node “milk” begins moving toward the original position as illustrated in FIG. 10, by going through the steps S13 and S15 and repeating the processing of the steps S5 to S15. Then, finally, as illustrated in FIG. 11, the node “milk” almost returns to the original position, in other words the position at which the node “milk” in the graph in FIG. 8 is disposed. Thus, in case of anode that surely has strong relations with surrounding nodes, such a node almost returns to the original position. Therefore, when the user selects anode on the graph and moves it to an arbitrary position, it is possible to confirm whether or not the selected node is a node that has strong relations with surrounding nodes. As for such a node that has strong relations with surrounding nodes, there is few stable position, therefore, the node is likely to return to the original position, when the node is moved.

When the degree of association is high, the movement speed is also high. Because the inertial force does not work, the movement distance obtained for each time when the processing of the steps S5 to S15 is executed is greater compared with a case where the degree of association is low, and the node position is rapidly converged. Therefore, the verification of other nodes can be performed immediately.

As illustrated in FIGS. 8 to 11, in this embodiment, the node that has strong relations with the surrounding nodes is positioned relatively at the center with the surrounding nodes, and a state is often displayed that nodes that have a relatively weak relation are disposed around those nodes. This is because there are links between nodes that have weak relations with other nodes, and a weak repulsion works on those nodes.

Next, as illustrated in FIG. 12, attention is paid to node “corn”. There are node “rice”, node “bean jam” and node “macaroni” around the node “corn”. Then, as illustrated in FIG. 13, this node “corn” is moved by the user who drags it, and after that, the node “corn” is dropped. Then, as illustrated in FIG. 14, the node “corn” moves in direction of the original position, however as illustrated in FIG. 15, the node “corn” does not returns to the original position, and the position of the node “corn” is converged at a different position from the original position. Thus, because there are a lot of positions that are locally stable for the node that has weak relations with surrounding nodes, that node does not return to the original position. In other words, it can be understood that, as a temporary measure, the node positions are converged like the local optimization, the relation with the surrounding nodes is not strong.

As described above, by performing the processing in this embodiment, the user can confirm, in the graph in which plural nodes are disposed in the two-dimensional space, whether this node is a node that is surrounded by other nodes that have a strong relations with this node or a node that has a weak relation with surrounding nodes and is disposed at the current position accidentally.

Moreover, when it is assumed that the transmission source user and destination user have a relation, and the degrees of association are calculated by analyzing a lot of e-mail, the graph as illustrated in FIG. 16 is generated by performing the aforementioned processing. As understood also in FIGS. 16 and 8, nodes that have a strong relation are not always disposed at the center of the graph, however, they are often disposed at positions that are slightly shifted toward the surroundings. In such a case, there is a case where nodes that are relegated to the surroundings because of the weak relations with other nodes cannot be distinguished from nodes that are disposed slightly outside of nodes that have relatively strong relations with these nodes. In an example of FIG. 16, nodes surrounded by an ellipse satisfy such a condition. Therefore, as described above, when the user moves a certain node in which the user is interested in that area, it is possible to confirm whether or not the certain node has strong relations with the inside nodes.

Although the embodiment of this invention was explained, this invention is not limited that embodiment. For example, as for the processing flow, as long as the processing result does not change, the turns of steps may be exchanged, and plural steps maybe executed in parallel. For example, until the node positions are converged to a certain degree, in order words, when the total sum of the vectors f_icalculated at the step S5 in FIG. 3 is greater than a predetermined value, the movement instruction of the node may not be accepted, and after the node positions are converged to a certain degree, in other words, when the total sum of the vectors f_icalculated at the step S5 in FIG. 3 is less than the predetermined value, the movement instruction of the node may be accepted, and after that, a situation that the node position is converged may be displayed.

Moreover, the functional block diagram is a mere example, and does not correspond to the program module configuration and file configuration.

Moreover, an application range of this embodiment is not limited to the relation of goods or users, and the embodiment can be applied to various field.

Furthermore, the information processing apparatus 100 may be configured by plural computers instead of a single computer.

In addition, the aforementioned information processing apparatus 100 is a computer device as illustrated in FIG. 17. That is, a memory 2501 (storage device), a CPU 2503 (processor), a hard disk drive (HDD) 2505, a display controller 2507 connected to a display device 2509, a drive device 2513 for a removable disk 2511, an input unit 2515, and a communication controller 2517 for connection with a network are connected through a bus 2519 as illustrated in FIG. 17. An operating system (OS) and an application program for carrying out the foregoing processing in the embodiment, are stored in the HDD 2505, and when executed by the CPU 2503, they are read out from the HDD 2505 to the memory 2501. As the need arises, the CPU 2503 controls the display controller 2507, the communication controller 2517, and the drive device 2513, and causes them to perform predetermined operations. Moreover, intermediate processing data is stored in the memory 2501, and if necessary, it is stored in the HDD 2505. In this embodiment of this technique, the application program to realize the aforementioned functions is stored in the computer-readable, non-transitory removable disk 2511 and distributed, and then it is installed into the HDD 2505 from the drive device 2513. It may be installed into the HDD 2505 via the network such as the Internet and the communication controller 2517. In the computer as stated above, the hardware such as the CPU 2503 and the memory 2501, the OS and the application programs systematically cooperate with each other, so that various functions as described above in details are realized.

The aforementioned embodiments are outlined as follows:

An information processing method relating to this embodiment includes (A) obtaining, for each node of plural nodes in a graph, which are associated each other, a display position at which the node is displayed on a display device; (B) calculating, for each node of the plural nodes, a movement vector according to a total sum of forces in conformity with a mechanics model in which an inertial force does not work, wherein the total sum of the forces is obtained by adding, with respect to all of nodes other than the node, a force that works in association with a distance concerning the display position with another node; (C) moving, for each node of the plural nodes, the display position by the calculated movement vector; and (D) while repeating the obtaining, the calculating and the moving or before performing the obtaining, the calculating and the moving, accepting an instruction corresponding to a user's operation for causing a display position of a certain node among the plural nodes to be changed, and changing the display position of the certain node on the display device according to the instruction.

For example, when the display position of a certain node is forcibly moved after the display positions are temporarily converged, the movement vector is recalculated according to the display position after the movement. Therefore, when the certain node is a node that has strong relations with surrounding nodes, the certain node returns to almost the original position, when the certain node is not a node that has the strong relation, a phenomenon that the display position of the certain node is converged to another display position is observed. Nodes that have the strong relation are disposed originally in the vicinity, however, there is a node that is disposed in the vicinity due to the curvature caused by displaying the graph in the two-dimensional space. According to the aforementioned processing, it is possible to easily confirm whether or not the node selected by the user is such a node. Because the movement vector is calculated while assuming that there are links for all combinations of nodes, the weak repulsions work each other even when the relation between nodes is weak, and an appropriate node disposition are obtained.

The aforementioned calculating method may include calculating, for each node of the plural nodes, a movement vector according to a total sum of relative vectors, wherein the total sum of relative vectors is obtained by adding, with respect to all of nodes other than the node, a relative vector with another node, which is weighted according to a difference between a first distance concerning the display position with the another node and a second distance with the another node, which is preset according to a degree of association between the node and the another node. Because the inertial force does not work, the convergence of the node position can be stably and rapidly realized.

In addition, a link between nodes of the plural nodes may be selected as a display target according to a degree of association between the nodes. Although the links are set for all combinations of nodes, it is separately determined whether or not the link is displayed or how to display the like.

Incidentally, it is possible to create a program causing a computer to execute the aforementioned processing, and such a program is stored in a computer readable storage medium or storage device such as a flexible disk, CD-ROM, DVD-ROM, magneto-optic disk, a semiconductor memory, and hard disk. In addition, the intermediate processing result is temporarily stored in a storage device such as a main memory or the like.

All examples and conditional language recited herein are intended for pedagogical purposes to aid the reader in understanding the invention and the concepts contributed by the inventor to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions, nor does the organization of such examples in the specification relate to a showing of the superiority and inferiority of the invention. Although the embodiments of the present inventions have been described in detail, it should be understood that the various changes, substitutions, and alterations could be made hereto without departing from the spirit and scope of the invention.

Claims

1. An information processing method, comprising: obtaining, by using a computer and for each node of a plurality of nodes in a graph, which are associated each other, a display position at which the node is displayed on a display device;calculating, by using the computer and for each node of the plurality of nodes, a movement vector according to a total sum of forces in conformity with a mechanics model in which an inertial force does not work, wherein the total sum of the forces is obtained by adding, with respect to all of nodes other than the node, a force that works in association with a distance concerning the display position with another node;moving, by using the computer and for each node of the plurality of nodes, the display position by the calculated movement vector; andwhile repeating the obtaining, the calculating and the moving or before performing the obtaining, the calculating and the moving, accepting, by using the computer, an instruction corresponding to a user's operation for causing a display position of a certain node among the plurality of nodes to be changed, and changing, by using the computer, the display position of the certain node on the display device according to the instruction.
2. The information processing method as set forth in claim 1, wherein the calculating comprises: calculating, for each node of the plurality of nodes, a movement vector according to a total sum of relative vectors, wherein the total sum of relative vectors is obtained by adding, with respect to all of nodes other than the node, a relative vector with another node, which is weighted according to a difference between a first distance concerning the display position with the another node and a second distance with the another node, which is preset according to a degree of association between the node and the another node.
3. The information processing method as set forth in claim 1, wherein a link between nodes of the plurality of nodes is selected as a display target according to a degree of association between the nodes.
4. A computer-readable, non-transitory storage medium storing a program for causing a computer to execute a process, comprising: obtaining, for each node of a plurality of nodes in a graph, which are associated each other, a display position at which the node is displayed on a display device;calculating, for each node of the plurality of nodes, a movement vector according to a total sum of forces in conformity with a mechanics model in which an inertial force does not work, wherein the total sum of the forces is obtained by adding, with respect to all of nodes other than the node, a force that works in association with a distance concerning the display position with another node;moving, for each node of the plurality of nodes, the display position by the calculated movement vector; andwhile repeating the obtaining, the calculating and the moving or before performing the obtaining, the calculating and the moving, accepting an instruction corresponding to a user's operation for causing a display position of a certain node among the plurality of nodes to be changed, and changing the display position of the certain node on the display device according to the instruction.
5. An information processing apparatus, comprising: a memory; anda processor configured to use the memory and execute a process, comprising: obtaining, for each node of a plurality of nodes in a graph, which are associated each other, a display position at which the node is displayed on a display device;calculating, for each node of the plurality of nodes, a movement vector according to a total sum of forces in conformity with a mechanics model in which an inertial force does not work, wherein the total sum of the forces is obtained by adding, with respect to all of nodes other than the node, a force that works in association with a distance concerning the display position with another node;moving, for each node of the plurality of nodes, the display position by the calculated movement vector; andwhile repeating the obtaining, the calculating and the moving or before performing the obtaining, the calculating and the moving, accepting an instruction corresponding to a user's operation for causing a display position of a certain node among the plurality of nodes to be changed, and changing the display position of the certain node on the display device according to the instruction.

Priority Claims (1)

Number	Date	Country	Kind
2013-068967	Mar 2013	JP	national

INFORMATION PROCESSING TECHNIQUE FOR GRAPH INCLUDING NODES

Information

Publication Number

Date Filed

Date Published

Inventors

Original Assignees

CPC

US Classifications

International Classifications

Abstract

Description

Claims

Priority Claims (1)