WO2014083655A1 - ネットワークグラフ生成方法及び意思決定支援システム - Google Patents
ネットワークグラフ生成方法及び意思決定支援システム Download PDFInfo
- Publication number
- WO2014083655A1 WO2014083655A1 PCT/JP2012/080945 JP2012080945W WO2014083655A1 WO 2014083655 A1 WO2014083655 A1 WO 2014083655A1 JP 2012080945 W JP2012080945 W JP 2012080945W WO 2014083655 A1 WO2014083655 A1 WO 2014083655A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- network graph
- network
- time
- graph
- generation
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
- G06F3/0481—Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/22—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks comprising specially adapted graphical user interfaces [GUI]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/147—Network analysis or design for predicting network behaviour
Definitions
- the present invention relates to a method for generating a network graph composed of vertices and edges or nodes and links, and a decision support system, and more particularly, to create a network graph or scenario map using big data suitable for a decision support system. Concerning the raw method.
- an event sequence that presupposes a certain context is called a scenario
- an important event or situation that triggers the transition of the scenario is regarded as a chance
- decision making is a scenario selection in chance .
- a scenario presentation method a scenario map such as a network graph or a potential map that visualizes the frequency and frequency of co-occurrence of events is used, and KeyGraph and KeyBird are known as such tools.
- Non-Patent Document 1 “Polaris” as an integrated data mining tool for chance discovery presents scenario maps that have occurred from the past to the present.
- Non-Patent Document 2 performs future prediction by scenario history analysis as a chance discovery method, and
- Non-Patent Document 3 visualizes hidden events that cannot be observed by data crystallization.
- Patent Document 1 in a computer-based collaboration, the communication data of participants is visualized on a network graph using a chance discovery method, thereby presenting the theme and composition of communication and supporting the collaboration.
- Patent Document 2 in extracting knowledge from a text database, the association between associative data is not obtained by extracting associative networks having a predetermined co-occurrence relationship from the database and aggregating synonyms. The difference is clarified and useful knowledge is extracted.
- Patent Document 3 in a language processing system such as machine translation, the ambiguity in parsing is eliminated by learning the hierarchical relationship between words and the co-occurrence of words and concepts as a network graph structure called a conceptual hierarchy tree. This makes language processing more efficient.
- the social system is an autopoiesis system based on a communication chain consisting of information, transmission, and understanding.
- chance discovery is the human and computer that make up society. It is a double spiral process consisting of awareness, understanding, idea, and action by interaction.
- the decision support system can be thought of as a double-spiral autopoiesis system based on human-computer collaboration.
- Computers are limited in their rationality for uncertain futures while adapting to changes in humans and the environment. It is necessary to provide services that satisfy the satisfaction principle.
- Non-Patent Document 2 predicts an event occurring in the future by comparing the history of scenario maps from the past to the present, Patent Document 1 visualizes a network graph of communication, and Patent Document 2 discloses an associative co-occurrence network. In Patent Document 3, the concept hierarchy network is learned. However, none of them presents the future scenario itself.
- An object of the present invention is to provide a network graph generation method for creating various scenarios that can occur in the future, and to provide decision support by presenting various network graphs that satisfy the satisfaction principle for an uncertain future. It is to provide a decision support system.
- a network graph generation method using a decision support system includes a condition input reception function, a data collection function, a graph generation function, a simulation function, and a database, and a network graph generation condition Based on the input generation condition, data related to a specific context is collected and accumulated in the database, and based on the collected data related to the specific context, from past to present corresponding to the generation condition
- a first network graph at a first time is generated, and a second time from a past to a current time corresponding to the generation condition is different from the first time based on the collected data regarding the specific context.
- 2 network graphs, and the first network Based on the network graph and the second network graph, and generates a simulation corresponding to the third network graph in a third time in the virtual in the producing conditions.
- a variety of network graphs at a new time that is, scenario maps, are created and presented to a user who is a decision-making body, so that the user can make a satisfactory decision for an uncertain future. There is an effect to support.
- FIG. 1 is a configuration diagram of a decision support system to which a network graph generation method according to a first embodiment of the present invention is applied.
- FIG. 3 is a flowchart illustrating a network graph generation method according to the first embodiment.
- FIG. 3 is a diagram illustrating an example of network graph display according to the first embodiment. It is a flowchart explaining the network graph production
- FIG. It is the figure which showed the production
- the present invention satisfies the satisfaction principle for an uncertain future by using big data and presenting various scenarios that can occur in the future to human beings as decision makers as a bundle of possibilities. It provides decision support services and realizes an autopoiesis decision support system based on cooperation between humans and computers.
- the decision support system generates first and second network graphs composed of vertices and edges or nodes and links at several times from the past to the present. Then, based on this, there is provided means for generating a third network graph at another virtual time and presenting it as a scenario map. More preferably, the future scenario map is presented by setting the virtual time to the future ahead of the present. In the means for presenting the first and second network graphs from the past to the present and the newly generated third network graph of the future, a variety of network graphs are displayed in accordance with the time designation of the time slider and the selection of the generation method. To display.
- the first and second network graphs are developed to the future based on changes (differences) from the past to the present, or by growing, derivation, alternation, or disturbance.
- data collection conditions and simulation conditions are input from a client, and the server generates first and second network graphs from the past to the present based on the data.
- a third network graph of time is newly generated by simulation, and the first to third network graphs are displayed on the client.
- FIG. 1 is a configuration diagram of a decision support system to which a network graph generation method according to a first embodiment of the present invention is applied.
- the decision support system 1 is a client server system including a plurality of servers 10 0 to 10 n , a client 20, a network 30, and a database 40.
- the plurality of servers 10 0 to 10 n are distributed processing systems in which the server 10 0 is a master and the servers 10 1 to 10 n are workers, and each includes a plurality of processors 11 0 to 11 n and a plurality of memories 12 0 to 12. n and a plurality of network interfaces 18 0 to 18 n .
- Each of the memories 12 0 to 12 n carries a plurality of programs 13 0 to 13 n for causing the computer (processor) to realize various functions. That is, on the plurality of distributed processing platforms 17 0 to 17 n , the data collection programs 14 0 to 14 n for causing the computer to realize the data collection function, and the plurality of network graph generation programs 15 for realizing the graph generation function. 0 to 15 n and a plurality of simulation programs 16 0 to 16 n for realizing the simulation function.
- the simulation program to allow the presentation of a variety of network graph in a third time of a plurality of types of simulates virtual based on different prediction methods, different types of simulation program, a plurality of servers 10 0 To 10 n each.
- the client 20 includes a processor 21, a memory 22, a network interface 28, and a display 29.
- the memory 22 carries a plurality of programs 23 for causing a computer (processor) to realize various functions. That is, the data collection condition input unit 24 and the simulation condition input unit 25 for realizing the generation condition input reception function as an interface of the user terminal 50 on the computer, and the network graph display condition input unit for realizing the display condition input reception function 26, a network graph display unit 27 is provided.
- the user terminal 50 and the decision support system 1 are interactively coordinated by causing the user terminal 50 to input data collection conditions, input simulation conditions and methods, and input network graph display conditions. be able to.
- the network graph display unit 27 outputs and displays the generation result of the network graph on the screen of the display 29.
- the network 30 connects a plurality of servers 10 0 to 10 n and a plurality of network interfaces 18 0 to 18 n and 28 of the client 20 to constitute a client server system.
- the database 40 stores data from the past to the present, and supplies data necessary for decision making to the plurality of servers 10 0 to 10 n via the network 30.
- FIG. 2A is a flowchart illustrating the network graph generation method according to the first embodiment of the present invention.
- the flowchart 200 starts from step 201.
- the user first inputs a network graph generation condition from the terminal 50 to the client 20.
- the conditions for generating the network graph include a data collection condition 24 such as “context” and a simulation condition 25 in which a plurality of types of simulations are selected or combined.
- the user can input display conditions of the network graph to the client 20 from the terminal 50 as necessary.
- the client 20 receives an input of production conditions and display conditions of the network graph, and transmits the server (master) to 10 0 via the network.
- step 203 the server (master) 10 0, the data collection condition 24 from the client 20 receives the plurality of simulation conditions 25, to expand the distributed processing foundation 17 0 ⁇ 17 n of the plurality of servers 10 0 ⁇ 10 n.
- a plurality of servers (workers) 10 1 to 10 n execute data collection 14 0 to 14 n that meets the data collection condition 24 from the database 40.
- the data in the database 40 varies according to the decision-making target, such as text, images, moving images, and sensor data. These data are systematized in the form of “context” and “content” included therein.
- Web search engines and social media can be used as data collection methods.
- a plurality of servers (workers) access an external Web search engine via a network and collect data that meets the data collection conditions. In this manner, data from the past to the present is collected for a specific context based on the input collection condition 24.
- a plurality of servers (workers) 10 1 to 10 n generate network graphs (first graph generation) at the past first time t 1 based on the collected data 14 0 to 14 n , and from past to present t. up to 2 (current or current near) the second generation network graph at time t 2 (second graph generation) executes 15 0 ⁇ 15 n.
- Network graph in a first time t 1 of the past the actual history, i.e., past the first time t actually occurring was a scenario map facts 1, i.e., generates a network graph, from the past to the present .
- the network graph in a second time t 2 also, for example, the fact that occurred in the past or at the second time t 2, can be realized by a method for generating a scenario map based on history.
- Non-Patent Document 1 As a means for generating a network graph at the first time t 1 and the second time t 2, the methods described in Non-Patent Document 1 and Non-Patent Document 2 may be used.
- the first time t 1 and the second time t 2 are respectively the first time zone (t 11 to t 1n ) and the second time zone (t 21 to t 2n ) each including one or more time points.
- step 206 the servers (workers) 10 1 to 10 n execute simulations 16 0 to 16 n that meet the simulation condition 25 based on the collected data 14 0 to 14 n .
- step 207 the servers (workers) 10 1 to 10 n third time (arbitrary time in the past or future) network graph generation in t 3 (third graph generation) 15 but the virtual not included from the simulation execution results 16 0 ⁇ 16 n to the collected data 14 0 ⁇ 14 n 0 to 15 n are executed.
- step 208 the server (master) 10 0 aggregates network graph generation result 15 0 ⁇ 15 n in step 205 and step 207 from the server (worker) 10 1 ⁇ 10 n, the server (master) 10 0
- step 209 Network graph generation results (first to third graph generation results) 15 0 to 15 n are transmitted to the client 20.
- Step 210 the client 20 receives the network graph generation results 15 0 to 15 n and senses it.
- Step 211 the user inputs the network graph display condition 26 from the client 50 from the terminal 50.
- step 212 the client 20 executes the network graph display 27 on the display 29 in accordance with the display condition 26, and informs the user 50 of the past first time t 1 , second time t 2, and virtual first time not included therein.
- Network graph generation results (first to third graph generation results) 15 0 to 15 n at time t 3 of 3 are presented as scenario maps.
- step 213 if the user 50 needs to change the network graph display condition 26, the process returns to step 211 again. If not, the process moves to the next step 214.
- step 214 if the user is satisfied with the network graph display result 27 as a decision-making option, that is, the scenario map presentation result, the process proceeds to the next step 215 and ends. If not satisfied, the process returns to step 202 again to return to the network graph. Redo generation (first to third graph generation).
- the first network graph at the first time from the past to the present and the second network graph at the second time different from the first time are obtained.
- a simulation corresponding to the generation condition is executed to generate a third network graph at a virtual third time.
- FIG. 2B An example of the network graph display 27 in step 212 of FIG. 2A is shown in the display screen example 60 of FIG. 2B.
- the display screen 60 includes three screens corresponding to a past first time t 1 , a current or current second time t 2, and a future (or any past) third time t 3.
- Each screen 61 includes a time slider 62 and a network graph display unit 63.
- step 211 when the user designates time (black portion) on the time slider 62 via the terminal 50, in step 212, the network graph generation result (first to third graph generation results) 15 corresponding to the time is displayed. 0 to 15 n are extracted and the network graph display 27 is executed.
- the left screen displays the network graph 71 (first graph generation result) at the past first time t 1 designated by the time slider 62, and the center screen displays the given context.
- second displays network chart 72 at time t 2 (second graph generation result), the network graph 73 of the third time t 3 when specified by the time slider 62 on the right side of the screen time slider 62 is designated (second 3 graph generation result).
- the network graph display unit 27 outputs and displays the network graph generation result on the display screen 60 of the display 29.
- the extracted texts are the vertices
- the magnitude relation of the frequency of the text data is the size of each vertex
- the network graphs 71 to 73 change with time transition from the past t 1 to the present t 2 and to the future t 3 .
- the text data name corresponding to each vertex is also displayed on the display screen 60, this display is abbreviate
- a new network graph 73 at a virtual time (third time t 3 ) as a scenario map to the user terminal 50 a decision-making option for an uncertain future constrained by a rational limit is provided.
- the effect of supporting the user's awareness and understanding can be enhanced. That is, by creating various network graphs, that is, scenario maps in the virtual time (third time) and presenting them to the user, it is possible to support satisfactory decision making for an uncertain future.
- the network graphs 71 to 73 that is, the scenario map, are drawn with the frequency of data appearing as vertices and the co-occurrence degree as sides, but they may be drawn as potential maps or mind maps.
- the distributed processing infrastructures 17 0 to 17 n are configured to use big data.
- the simulation programs 16 0 to 16 n that operate on the distributed processing infrastructures 17 0 to 17 n are network graphs composed of enormous vertices and edges. It is necessary to generate multi-agent simulation and asynchronous parallel computation using actor model.
- the client server system is configured so that the client 20 is responsible for the user interface and the servers 10 0 to 10 n are responsible for network graph generation calculation. However, it is also possible to perform distributed processing including a large number of clients.
- the system configuration is not limited to that shown in the first embodiment.
- time slider 62 as a method of the network graph display condition input 26, it is possible to continuously grasp the transition of the network graphs 71 to 73 from the past to the present and the future and deepen insight into the future.
- the time slider 62 not only the time but also the time width (time zone) is changed to present a scenario map in a bird's-eye view or locally, or the time map is automatically sent to display a scenario map as a new movie in decision making. Awareness is more likely to be induced.
- scenario maps as alternative options using big data, increasing the degree of freedom of decision-making and expanding opportunities to find opportunities, and displaying scenario maps according to time sliders and options It has the effect of helping the awareness and understanding of human beings as decision makers.
- FIG. 3 is a flowchart illustrating a network graph generation method according to the second embodiment.
- 4A to 4H are diagrams showing examples of the display screen of the client 20.
- the configuration of the hardware for realizing the second embodiment, that is, the decision support system may be the same as that of the decision support system 1 of the first embodiment shown in FIG. For simplicity, description of the system configuration is omitted.
- FIG. 4A shows a new search screen 401 on the display 400, in which input boxes 402 to 406 and a search start button 407 are displayed.
- text data collection conditions are entered in the input box 402
- a start date 403, end date 404, number of steps 405, maximum number of sheets 406, etc. are entered and a start button 407 is pressed, data collection, simulation, and network are performed according to default settings.
- Graph generation is performed.
- the search term “big data” is entered in the input box 402 as a text data collection condition.
- the number of steps 405 represents the unit period of search processing and simulation as in June
- the maximum number 406 represents the maximum number of screens to be output.
- step 302 in FIG. 3 text data is collected by the search engine based on the set search word, and in step 303, the frequency and co-occurrence of words constituting the text data are calculated by morphological analysis.
- network graph generation data first and second graph generation data
- step 303 branches to four simulations of growth, derivation, substitution, and disturbance according to the conditions of the future scenario set by the user.
- step 304 growth of the future scenario
- the simulation prediction method may be selected from regression analysis method, moving average method, exponential smoothing method, and the like, and the influence of periodicity and causal may be considered.
- step 320 a re-search is performed with the word-word co-occurrence pair (step 324), and the two words constituting the co-occurrence pair are replaced with one other highly co-occurrence word (step 325).
- the process returns to step 324 to repeat the search.
- step 330 disurbance
- the frequency of words is randomly or probabilistically increased (step 334), and when the frequency of words exceeds a threshold according to a predetermined rule, the word co-occurs.
- the frequency of occurrence is distributed according to the degree of co-occurrence (step 335), and the process returns to step 334 according to the simulation conditions to repeat the stacking.
- This method follows a complex sandstone avalanche model, but other earthquake models may be used.
- FIG. Shows the situation.
- the thickness of the line between characters represents the co-occurrence with the search term “BIC data”, and the thickness of the character itself represents the frequency of occurrence.
- the display of lines is omitted for those with a low degree of co-occurrence.
- the interval between the target periods of the first and second graphs only needs to be suitable for the next simulation.
- FIGS. 4B and 4C will be described as first graph generation data
- FIGS. 4D and 4E will be described as second graph generation data.
- the network graph 450 in the step of FIG. 4F (October 2012 to March 2013)
- the vendors 451 and platforms 452 for “big data” are beginning to spread.
- social media 462 in the step of FIG. 4G (October 2013 to March 2014)
- social media 462 appears in addition to sensors and Google (registered trademark) 461.
- the use of social media 471 also progresses.
- the second embodiment it is possible to make a satisfactory decision for an uncertain future by creating various network graphs, that is, scenario maps, at a new time.
- various scenario maps as alternative options, the degree of freedom of decision-making is increased and opportunities for finding opportunities are expanded.
- scenario maps according to time sliders and options, it is a decision-making entity. It has the effect of supporting human awareness and understanding.
- steps 304 to 308 are historically developed along the trend and periodicity
- steps 310 to 318 are systematically differentiated
- steps 320 to 328 are genetically altered
- steps 330 to 338 are caused by natural selection and can occur in the future.
- Simple scenario maps can be presented as network graphs (growth, derivation, alternation, disturbance), and are useful for decision support services and context-aware services.
- the network graph is generated based on the ecosystem analogy, but an approach such as pattern language or game theory may be introduced to the network graph generation.
- text data was taken as an example of “context”, but time series data such as stock prices, distribution, traffic, and earthquakes, design pattern data such as cities, buildings, and software, social media, communities, and companies
- the graph generation method by simulation similar to the second embodiment or the like can be extended to network data such as an organization.
- Example 3 shows another example of the display screen of the network graph 500 that is generated by the processing of Example 1 or Example 2 and displayed on the display 29.
- FIG. 5 is a time series transition diagram of the network graph of the third embodiment, and is a schematic diagram in which display screens of the network graph 500 are arranged in time series along the time axis 501 from the past to the present and the future.
- the network graph 510 is a plurality of first graphs generated based on historical data from the past to the present
- the network graph 511 is a plurality of second graphs generated based on historical data from the past to the present.
- the network graphs 521 to 524 are graphs of a plurality of future scenarios (third graphs) generated based on the history data, that is, the network graphs 510 and 511, and variously according to the possibility of occurring in the future. Branched.
- the plurality of network graphs 512 and 513 are possible past graphs (third graphs) generated based on a plurality of historical data 510 and 511 from the past to the present or retroactively from the current situation,
- Network graphs 531 to 533 are graphs (third graphs) generated based on the third graphs 512 and 513 from the possible past to the future that can occur.
- the time axis 501 of the third embodiment shows the flow of time from the past to the future, and the network graphs 510 and 511 are displayed along the time axis 501 of absolute time, but the network graphs 512, 513, and 521 to 524 are displayed. 531 to 533 are displayed along the time axis 501 of absolute time or relative time according to the graph generation method.
- network graphs 510 to 513, 521 to 524, and 531 to 533 are generated according to data collection conditions and simulation conditions, and displayed on the screen of the display 29 according to the graph display conditions. Visualize various future scenarios and contribute to opportunity discovery and decision making.
- the fourth embodiment according to the present invention shows another example of the display screen of the network graph displayed on the display 29 of the client of the first embodiment.
- 6A and 6B are display screen diagrams illustrating the network graph generation method according to the fourth embodiment, and show screen examples displayed on the display 601 of the client terminal 600 using text data as an example.
- a system name 610 is displayed.
- Kairos of the name 610 is the name of the Greek god governing the chance, and the chance is a turning point of an important event sequence (scenario) in decision making, so it is suitable for a system that presents a future scenario.
- a search word is input as a text data collection condition in the input box 611 and a start button 612 is pressed, data collection, simulation, and network graph generation are executed according to default settings.
- the search condition pull-up menu 621 is used to input a start date (year / month / day), an end date (year / month / day), and an interval date (year / month / day).
- a processing condition pull-up menu 622 is used to process the searched text data. Unification of character types, unification of synonyms, unnecessary word filters, and user-specified check boxes are selected. In the future scenario pull-up menu 623, growth, derivation, alternation, disturbance, and user-specified check boxes are selected as simulation conditions.
- a network graph (third graph) 631 is displayed in accordance with the graph display conditions of the time slider 640, the operation setting button 641, and the future scenario selection unit 642 in the network graph display unit 630 of the display 601 in FIG.
- the network graph 631 represents text (abbreviated as A to J for the sake of simplicity) as vertices, its frequency of appearance as the size of the vertices, the co-occurrence relationship between the texts as edges, and the co-occurrence as the thickness of the edges This is a scenario map.
- the network graph 631 is used to specify the playback, step forward, fast forward, reverse playback, step return, rewind, stop, pause, and the operation setting button 641 according to the time slider 640 specifying the time from the past to the present and the future. Accordingly, the future scenario selection unit 642 is displayed according to the growth, derivation, substitution, disturbance, or user-specified check box selection.
- the fourth embodiment also has the same effect as the first to third embodiments.
- data collection conditions, simulation conditions, and graph display conditions are interactively input from the client terminal 600 shown in the fourth embodiment via the display 601, and the scenario map search and decision making are linked while the client, that is, the human and the computer cooperate. By doing so, it is possible to realize an autopoiesis system that will develop into the future.
- the client terminal 600 shown in the fourth embodiment is assumed to be a graphic user interface such as a tablet terminal or a portable terminal.
- a non-verbal interface by voice or gesture a multi-user interface for collaborative work, a virtual reality interface, etc. Human computer interaction may be used.
Abstract
Description
過去から現在までの第1、第2のネットワークグラフと新たに生成した未来の第3のネットワークグラフを提示する手段では、タイムスライダの時間指定や生成方法の選択に応じて多様なネットワークグラフをグラフィックに表示する。
未来のネットワークグラフを生成する手段では、例えば、過去から現在までの変化(差分)に基いて第1、第2のネットワークグラフを未来へ発展させ、或いは成長、派生、交代、または撹乱させることにより、多様な未来の第3のネットワークグラフを生成する。
ネットワークグラフを生成するためのクライアントサーバシステムでは、クライアントからデータ収集条件やシミュレーション条件を入力し、サーバがデータに基いて過去から現在までの第1、第2のネットワークグラフを生成すると共に、仮想の時間の第3のネットワークグラフをシミュレーションにより新たに生成し、それら第1乃至第3のネットワークグラフをクライアントに表示する。
特に、実施例3によれば、ネットワークグラフ510~513、521~524、531~533をデータ収集条件やシミュレーション条件に応じて生成し、グラフ表示条件に応じてディスプレイ29の画面に表示することにより、多様な未来シナリオを可視化し、チャンス発見や意思決定に資することができる。
特に、実施例4に示すクライアント端末600からディスプレイ601を介してデータ収集条件、シミュレーション条件、グラフ表示条件をインタラクティブに入力し、クライアントすなわち人間とコンピュータが協調しながらシナリオマップの探索と意思決定を連鎖させてゆくことにより、未来へ発展するオートポイエーシスシステムを実現することができる。
100~10n サーバ
110~11n プロセッサ
120~12n メモリ
130~13n プログラム
140~14n データ収集プログラム
150~15n ネットワークグラフ生成プログラム
160~16n シミュレーションプログラム
170~17n 分散処理基盤
180~18n ネットワークインタフェース
20 クライアント
21 プロセッサ
22 メモリ
23 プログラム
24 データ収集条件入力
25 シミュレーション条件入力
26 ネットワークグラフ表示条件入力
27 ネットワークグラフ表示
28 ネットワークインタフェース
29 ディスプレイ
30 ネットワーク
40 データベース
50 ユーザ端末
60 ディスプレイ画面例
61 画面
62 タイムスライダ
63 ネットワークグラフ表示部
71~73 ネットワークグラフ
200 フローチャート
S201~S215 ステップ
300 フローチャート
S301~S338 ステップ
500 ネットワークグラフ
501 時間軸
510 過去から現在までのネットワークグラフ(第1のグラフ)
511 過去から現在までのネットワークグラフ(第2のグラフ)
512、513 起こり得た過去のネットワークグラフ
521~524 過去から現在の履歴に基く未来のネットワークグラフ(第3のグラフ)
531~533 起こり得た過去に基く未来のネットワークグラフ(第3のグラフ)
600 クライアント端末
601 ディスプレイ
610 システム呼称
611 入力ボックス
620 メニューバー
621~623 プルアップメニュー
630 ネットワークグラフ表示部
631 ネットワークグラフ
640 タイムスライダ
641 動作設定ボタン
642 未来シナリオ選択部。
Claims (15)
- 意思決定支援システムを用いたネットワークグラフ生成方法であって、
前記意思決定支援システムは、条件入力受け付け機能、データ収集機能、グラフ生成機能、シミュレーション機能、及び、データベースを備えており、
ネットワークグラフ生成条件の入力を受け付け、
入力された前記生成条件に基づき、特定のコンテキストに関するデータを収集して前記データベースに蓄積し、
前記特定のコンテキストに関する収集データに基づき、前記生成条件に対応する過去から現在までの第1の時間における第1のネットワークグラフを生成し、
前記特定のコンテキストに関する収集データに基づき、前記生成条件に対応する、前記第1の時間とは異なる過去から現在までの第2の時間における第2のネットワークグラフを生成し、
前記第1のネットワークグラフと前記第2のネットワークグラフとに基き、仮想の第3の時間における第3のネットワークグラフを前記生成条件に対応するシミュレーションにより生成する
ことを特徴とするネットワークグラフ生成方法。 - 前記第1のネットワークグラフ及び前記第2のネットワークグラフを、前記シミュレーションにより、成長、派生、交代、または撹乱させることにより、前記第3のネットワークグラフを生成する
ことを特徴とする請求項1記載のネットワークグラフ生成方法。 - 前記意思決定支援システムは、異なる予測法に基づく複数種類のシミュレーション機能を備えており、
前記第3の時間が未来であり、
前記シミュレーションにより生成される前記第3のネットワークグラフの1つが、前記第1のネットワークグラフ及び前記第2のネットワークグラフを未来へ発展させたネットワークグラフである
ことを特徴とする請求項1記載のネットワークグラフ生成方法。 - 前記意思決定支援システムは、異なる予測法に基づく複数種類のシミュレーション機能を備えており、
前記シミュレーションにより生成される前記第3のネットワークグラフの1つが、前記第1のネットワークグラフと前記第2のネットワークグラフの差分に基づき生成されたネットワークグラフである
ことを特徴とする請求項1記載のネットワークグラフ生成方法。 - 前記第1のネットワークグラフ、前記第2のネットワークグラフ及び前記第3のネットワークグラフが、各々、頻出度を頂点、共起度を辺とするシナリオマップである
ことを特徴とする請求項1記載のネットワークグラフ生成方法。 - 前記意思決定支援システムはディスプレイ画面を備えており、
前記各ネットワークグラフの表示条件の入力を受け付け、
該表示条件に基づき、前記第1、前記第2、または前記第3のネットワークグラフを前記ディスプレイ画面に表示する
ことを特徴とする請求項1記載のネットワークグラフ生成方法。 - 意思決定支援システムを用いたネットワークグラフ生成方法であって、
前記意思決定支援システムは、条件入力受け付け機能、データ収集機能、グラフ生成機能、異なる予測法に基づく複数種類のシミュレーション機能、及び、データベースを備えており、
ネットワークグラフ生成の条件の入力を受け付ける第1のステップと、、
入力された前記生成条件に基づき、特定のコンテキストに関して、過去から現在までのデータを収集する第2のステップと、
前記収集データ及び前記生成条件に基き、過去から現在までの第1の時間における第1のネットワークグラフと、該第1の時間とは異なる第2の時間における第2のネットワークグラフとを生成する第3のステップと、
前記第1のネットワークグラフと前記第2のネットワークグラフに基き、前記生成条件に対応する何れかの前記シミュレーション機能によりシミュレーションを行い、前記第1の時間及び前記第2の時間とは異なる仮想の第3の時間における第3のネットワークグラフを生成する第4のステップとを実行する
ことを特徴するネットワークグラフ生成方法。 - 前記第4のステップにおいて、
前記第1のネットワークグラフ及び前記第2のネットワークグラフを、前記シミュレーションにより、成長、派生、交代、または撹乱させることにより、前記第3のネットワークグラフを生成する
ことを特徴とする請求項7記載のネットワークグラフ生成方法。 - 前記意思決定支援システムはディスプレイ画面を備えており、
前記第3の時間が未来であり、
前記第1のステップにおいて、前記各ネットワークグラフの表示条件の入力を受け付け、
前記第4のステップにおいて、
前記第1のネットワークグラフ及び前記第2のネットワークグラフを前記シミュレーションにより未来へ発展させて前記第3のネットワークグラフを生成し、
前記表示条件に基づき、前記第1、前記第2、または前記第3のネットワークグラフを、タイムスライダの指定時間に応じて前記ディスプレイ画面に表示する第5のステップを実行する
ことを特徴とする請求項7記載のネットワークグラフ生成方法。 - 前記第3のネットワークグラフを、前記シミュレーション機能の選択に応じて表示する
ことを特徴とする請求項7記載のネットワークグラフ生成方法。 - 前記意思決定支援システムが、サーバ、クライアント、及び、ネットワークを備えたクライアントサーバシステムであり、
前記サーバは、データ収集機能、グラフ生成機能、及びシミュレーション機能を備えており、
前記クライアントからデータ収集条件及びシミュレーション条件を含むネットワークグラフ生成の条件を入力する第1のステップと、
前記サーバが、過去から現在までのデータを収集する第2のステップと、
前記サーバが、前記収集データに基いて過去から現在までの第1の時間における第1のネットワークグラフと第2の時間における第2のネットワークグラフを生成する第3のステップと、
前記サーバが、前記収集データに基きシミュレーションにより仮想の第3の時間における第3のネットワークグラフを生成する第4のステップと、
前記クライアントに、前記第1乃至第3のネットワークグラフを表示する第5のステップとを含む
ことを特徴する請求項7記載のネットワークグラフ生成方法。 - 前記クライアントからインタラクティブに前記ネットワークグラフ生成の条件及びネットワークグラフ表示条件を入力する
ことを特徴する請求項11記載のネットワークグラフ生成方法。 - サーバ、クライアント、ネットワーク及び、データベースを備えたクライアントサーバシステムにより構成される意思決定支援システムであって、
前記クライアントが、
ネットワークグラフの生成条件を受け付ける条件入力受け付け機能と、
ディスプレイ画面とを備え、
前記サーバが、
入力された前記生成条件に基づき、特定のコンテキストに関するデータを収集して前記データベースに蓄積するデータ収集機能と、
ネットワークグラフを生成するグラフ生成機能と、
異なる予測法に基づく複数種類のシミュレーション機能とを備え、
前記特定のコンテキストに関する収集データに基づき、前記生成条件に対応する過去から現在までの第1の時間における第1のネットワークグラフを生成し、
前記特定のコンテキストに関する収集データに基づき、前記生成条件に対応する、与えられた前記第1の時間とは異なる過去から現在までの第2の時間における第2のネットワークグラフを生成し、
前記第1のネットワークグラフと前記第2のネットワークグラフとに基き、前記生成条件に対応するシミュレーション機能を実行して仮想の第3の時間における第3のネットワークグラフを生成し、
前記ディスプレイ画面に、前記第1、前記第2、または前記第3のネットワークグラフを表示する
ことを特徴とする意思決定支援システム。 - 前記サーバが、
前記生成条件に対応する複数種類のシミュレーションにより、前記第1のネットワークグラフ及び前記第2のネットワークグラフを、成長、派生、交代、または撹乱させることにより、前記第3のネットワークグラフを複数枚生成する
ことを特徴とする請求項13記載の意思決定支援システム。 - 前記クライアントからインタラクティブに前記ネットワークグラフ生成の条件及びネットワークグラフ表示条件を入力する
ことを特徴とする請求項13記載の意思決定支援システム。
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/646,119 US20150324482A1 (en) | 2012-11-29 | 2012-11-29 | Network graph generation method and decision-making assistance system |
PCT/JP2012/080945 WO2014083655A1 (ja) | 2012-11-29 | 2012-11-29 | ネットワークグラフ生成方法及び意思決定支援システム |
JP2014549704A JP5964450B2 (ja) | 2012-11-29 | 2012-11-29 | ネットワークグラフ生成方法及び意思決定支援システム |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2012/080945 WO2014083655A1 (ja) | 2012-11-29 | 2012-11-29 | ネットワークグラフ生成方法及び意思決定支援システム |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2014083655A1 true WO2014083655A1 (ja) | 2014-06-05 |
Family
ID=50827328
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2012/080945 WO2014083655A1 (ja) | 2012-11-29 | 2012-11-29 | ネットワークグラフ生成方法及び意思決定支援システム |
Country Status (3)
Country | Link |
---|---|
US (1) | US20150324482A1 (ja) |
JP (1) | JP5964450B2 (ja) |
WO (1) | WO2014083655A1 (ja) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2016206914A (ja) * | 2015-04-22 | 2016-12-08 | 株式会社日立製作所 | 意思決定支援システム、及び意志決定支援方法 |
JP2019200737A (ja) * | 2018-05-18 | 2019-11-21 | ヤフー株式会社 | 情報処理装置、情報処理方法、および情報処理プログラム |
JP2020060981A (ja) * | 2018-10-10 | 2020-04-16 | 富士通株式会社 | ノード探索方法及びノード探索プログラム |
JP2020077390A (ja) * | 2019-10-03 | 2020-05-21 | 株式会社ナビタイムジャパン | 情報処理システム、情報処理プログラム、情報処理装置、情報処理方法、相関関係情報データ、記憶媒体、相関関係情報の生成方法 |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2975562A1 (en) * | 2014-07-17 | 2016-01-20 | Fujitsu Limited | System, method, and program for supporting intervention action decisions in hazard scenarios |
US11244013B2 (en) * | 2018-06-01 | 2022-02-08 | International Business Machines Corporation | Tracking the evolution of topic rankings from contextual data |
US11374824B2 (en) * | 2020-11-27 | 2022-06-28 | At&T Intellectual Property I, L.P. | Time-based visualization for network virtualization platform |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2009128949A (ja) * | 2007-11-19 | 2009-06-11 | Fuji Xerox Co Ltd | グラフ表示装置およびプログラム |
JP2009199325A (ja) * | 2008-02-21 | 2009-09-03 | Toshiba Corp | 表示データ生成装置及び方法 |
JP2009205269A (ja) * | 2008-02-26 | 2009-09-10 | Osaka Univ | 頻出変化パターン抽出装置 |
JP2011154576A (ja) * | 2010-01-28 | 2011-08-11 | Nippon Telegr & Teleph Corp <Ntt> | 評判分析装置、評判分析方法及び評判分析プログラム |
Family Cites Families (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5347452A (en) * | 1991-07-12 | 1994-09-13 | Bay Jr William P | Method for providing a visual display of current trading volume and cumulative average trading volume for preselected time intervals |
EP0770967A3 (en) * | 1995-10-26 | 1998-12-30 | Koninklijke Philips Electronics N.V. | Decision support system for the management of an agile supply chain |
US8768800B2 (en) * | 2001-04-26 | 2014-07-01 | Charles Schwab & Co., Inc. | System and method for income planner |
WO2007002829A2 (en) * | 2005-06-29 | 2007-01-04 | Itg Software Solutions, Inc. | System and method for generating real-time indicators in a trading list or portfolio |
US20100153107A1 (en) * | 2005-09-30 | 2010-06-17 | Nec Corporation | Trend evaluation device, its method, and program |
US8396884B2 (en) * | 2006-02-27 | 2013-03-12 | The Regents Of The University Of California | Graph querying, graph motif mining and the discovery of clusters |
US8775230B2 (en) * | 2008-11-03 | 2014-07-08 | Oracle International Corporation | Hybrid prediction model for a sales prospector |
US20100306249A1 (en) * | 2009-05-27 | 2010-12-02 | James Hill | Social network systems and methods |
US9323234B2 (en) * | 2009-06-10 | 2016-04-26 | Fisher-Rosemount Systems, Inc. | Predicted fault analysis |
US8412796B2 (en) * | 2009-07-31 | 2013-04-02 | University College Dublin—National University of Ireland, Dublin | Real time information feed processing |
JP5363927B2 (ja) * | 2009-09-07 | 2013-12-11 | 株式会社日立製作所 | 異常検知・診断方法、異常検知・診断システム、及び異常検知・診断プログラム |
US8607153B2 (en) * | 2009-12-30 | 2013-12-10 | Cerner Innovation, Inc. | Graphic for displaying multiple assessments of critical care performance |
CN102208989A (zh) * | 2010-03-30 | 2011-10-05 | 国际商业机器公司 | 网络可视化处理方法及设备 |
US8370283B2 (en) * | 2010-12-15 | 2013-02-05 | Scienergy, Inc. | Predicting energy consumption |
US20130031130A1 (en) * | 2010-12-30 | 2013-01-31 | Charles Wilbur Hahm | System and method for interactive querying and analysis of data |
CN102681771B (zh) * | 2011-03-03 | 2016-09-14 | 株式会社堀场制作所 | 测量装置 |
US9600825B2 (en) * | 2013-01-04 | 2017-03-21 | International Business Machines Corporation | Estimating probability of spreading information by users on micro-weblogs |
US9256670B2 (en) * | 2013-10-10 | 2016-02-09 | International Business Machines Corporation | Visualizing conflicts in online messages |
-
2012
- 2012-11-29 WO PCT/JP2012/080945 patent/WO2014083655A1/ja active Application Filing
- 2012-11-29 US US14/646,119 patent/US20150324482A1/en not_active Abandoned
- 2012-11-29 JP JP2014549704A patent/JP5964450B2/ja not_active Expired - Fee Related
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2009128949A (ja) * | 2007-11-19 | 2009-06-11 | Fuji Xerox Co Ltd | グラフ表示装置およびプログラム |
JP2009199325A (ja) * | 2008-02-21 | 2009-09-03 | Toshiba Corp | 表示データ生成装置及び方法 |
JP2009205269A (ja) * | 2008-02-26 | 2009-09-10 | Osaka Univ | 頻出変化パターン抽出装置 |
JP2011154576A (ja) * | 2010-01-28 | 2011-08-11 | Nippon Telegr & Teleph Corp <Ntt> | 評判分析装置、評判分析方法及び評判分析プログラム |
Non-Patent Citations (1)
Title |
---|
SAKIKO MORIYASU: "Link Prediction for Question Answering Bulletin Boards", INFORMATION PROCESSING SOCIETY OF JAPAN . TRANSACTIONS ON MATHEMATICAL MODELING AND ITS APPLICATIONS, vol. 2, no. 1, 15 April 2009 (2009-04-15), pages 10 - 21 * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2016206914A (ja) * | 2015-04-22 | 2016-12-08 | 株式会社日立製作所 | 意思決定支援システム、及び意志決定支援方法 |
JP2019200737A (ja) * | 2018-05-18 | 2019-11-21 | ヤフー株式会社 | 情報処理装置、情報処理方法、および情報処理プログラム |
JP7032233B2 (ja) | 2018-05-18 | 2022-03-08 | ヤフー株式会社 | 情報処理装置、情報処理方法、および情報処理プログラム |
JP2020060981A (ja) * | 2018-10-10 | 2020-04-16 | 富士通株式会社 | ノード探索方法及びノード探索プログラム |
JP7087904B2 (ja) | 2018-10-10 | 2022-06-21 | 富士通株式会社 | ノード探索方法及びノード探索プログラム |
JP2020077390A (ja) * | 2019-10-03 | 2020-05-21 | 株式会社ナビタイムジャパン | 情報処理システム、情報処理プログラム、情報処理装置、情報処理方法、相関関係情報データ、記憶媒体、相関関係情報の生成方法 |
Also Published As
Publication number | Publication date |
---|---|
JPWO2014083655A1 (ja) | 2017-01-05 |
US20150324482A1 (en) | 2015-11-12 |
JP5964450B2 (ja) | 2016-08-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP5964450B2 (ja) | ネットワークグラフ生成方法及び意思決定支援システム | |
Beck et al. | The State of the Art in Visualizing Dynamic Graphs. | |
Akhtar | Social network analysis tools | |
CN110489459A (zh) | 一种基于大数据平台的企业级业数融合数据分析系统 | |
Kobayashi et al. | SArF map: Visualizing software architecture from feature and layer viewpoints | |
Shi et al. | Dynamic network visualization in 1.5 D | |
Ribičić et al. | Visual analysis and steering of flooding simulations | |
Xu et al. | Modeling and representation for earthquake emergency response knowledge: perspective for working with geo-ontology | |
Fei et al. | makeTwin: A reference architecture for digital twin software platform | |
Anikin et al. | Ontology visualization: Approaches and software tools for visual representation of large ontologies in learning | |
Pigné et al. | Graphstream: A tool for bridging the gap between complex systems and dynamic graphs | |
Belghache et al. | Towards an adaptive multi-agent system for dynamic big data analytics | |
Rafiq et al. | Building information modeling steered by evolutionary computing | |
You et al. | Tracing the evolution of physics with a keyword co-occurrence network | |
Wang et al. | Developing a holistic modeling approach for search-based system architecting | |
CN105787072B (zh) | 一种面向流程的领域知识抽取与推送方法 | |
Lytchev et al. | Integration and Development of Professionally-Oriented Social Network in the Context of the Evolution of the Information Landscape | |
Djouad et al. | A new approach based on modelled traces to compute collaborative and individual indicators human interaction | |
Yan et al. | Development of Zaozhuang tourism information system based on WebGIS | |
Hu et al. | Two-stage framework for big spatial data analytics to support disaster response | |
Michalos et al. | Visualization Techniques for Large Datasets. | |
Mahesh et al. | Visualizing technology mining results on life cycle axes: A study of server virtualization | |
Qiu et al. | A task-driven disaster data link approach | |
Linyao et al. | A task-oriented disaster information correlation method | |
Bychkov et al. | Infrastructural approach and geospatial data processing services in the tasks of territorial development management |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 12889225 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2014549704 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 14646119 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 12889225 Country of ref document: EP Kind code of ref document: A1 |