Feature calculation device, feature calculation method, and feature calculation program

The feature value calculation device addresses the computational burden of graph embedding by selecting and estimating feature amounts for nodes in communication networks, reducing time and space requirements while maintaining accuracy.

JP7586304B2Active Publication Date: 2024-11-19NIPPON TELEGRAPH & TELEPHONE CORP
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
JP2023520712
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2021-05-14
Publication Date
2024-11-19
Estimated Expiration
2041-05-14

AI Technical Summary

Technical Problem

Conventional graph embedding technologies for detecting botnet structures face increased computational time and space requirements due to the number of nodes in the network.

Method used

A feature value calculation device that generates a graph representing network communication, selects nodes based on predetermined conditions, calculates feature amounts for selected nodes using a learning method, and estimates feature amounts for other nodes by combining adjacent nodes' feature amounts.

Benefits of technology

Reduces temporal and spatial calculations, enabling efficient feature amount calculation from communication networks while maintaining accuracy.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007586304000001
    Figure 0007586304000001
  • Figure 0007586304000002
    Figure 0007586304000002
  • Figure 0007586304000003
    Figure 0007586304000003
Patent Text Reader

Abstract

A generation unit (15b) uses the information of communications between network nodes to generate a graph representative of the communications between the nodes. A selection unit (15c) selects any one of the nodes of the generated graph that satisfies a predetermined condition. A calculation unit (15d) uses a predetermined learning method to calculate the feature, in the graph, of the selected node. An estimation unit (15e) estimates the features of the nodes other than the selected node by combining the estimated features of successively adjacent nodes in the graph.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to a feature calculation device, a feature calculation method, and a feature calculation program. [Background technology]

[0002] There is a demand for technology to detect the structure of a network called a botnet, which is made up of computers hijacked by malicious programs. The features of a graph, in which IP hosts are nodes and end-to-end communications between IP hosts are edges, are useful information for detecting the structure of a botnet.

[0003] Therefore, a technique called graph embedding is known that enables high-quality learning of graph features. For example, in graph embedding such as Deep Walk and Node2Vec, it is possible to extract related nodes several hops away on a graph by learning feature vectors so that related nodes are similar in a low-dimensional feature space (see Non-Patent Document 1). [Prior art documents] [Non-patent literature]

[0004] [Non-Patent Document 1] Bryan Perozzi et al., “DeepWalk: Online Learning of Social Representations”, KDD '14, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery, 2014 Summary of the Invention [Problem to be solved by the invention]

[0005] However, the conventional techniques have a problem that the time and space complexity increases depending on the number of nodes.

[0006] The present invention has been made in view of the above, and has an object to calculate features from a graph representing a communication network while reducing the amount of time and space calculations. [Means for solving the problem]

[0007] In order to solve the above-mentioned problems and achieve the object, a feature calculation device according to the present invention is characterized in having a generation unit that generates a graph representing communication between nodes using communication information between nodes of a network; a selection unit that selects nodes in the generated graph that satisfy a predetermined condition; a calculation unit that calculates features in the graph for the selected nodes by a predetermined learning method; and an estimation unit that estimates features for nodes other than the selected node by combining calculated features of successively adjacent nodes in the graph. Effect of the Invention

[0008] According to the present invention, it is possible to calculate features from a graph representing a communication network while reducing the amount of time and space calculations. [Brief description of the drawings]

[0009] [Figure 1] FIG. 1 is a schematic diagram illustrating a schematic configuration of a feature calculation device. [Diagram 2] FIG. 2 is a diagram for explaining the processing of the feature calculation device. [Diagram 3] FIG. 3 is a diagram for explaining the processing of the feature calculation device. [Figure 4] FIG. 4 is a diagram for explaining the processing of the feature calculation device. [Diagram 5] FIG. 5 is a flowchart showing the procedure of the feature amount calculation process. [Figure 6] FIG. 6 is a diagram illustrating a computer that executes a feature amount calculation program. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0010] Hereinafter, an embodiment of the present invention will be described in detail with reference to the drawings. Note that the present invention is not limited to this embodiment. In addition, in the description of the drawings, the same parts are indicated by the same reference numerals.

[0011] [Feature Calculation Device Configuration] Fig. 1 is a schematic diagram illustrating a schematic configuration of a feature calculation device. As illustrated in Fig. 1, a feature calculation device 10 is realized by a general-purpose computer such as a personal computer, and includes an input unit 11, an output unit 12, a communication control unit 13, a storage unit 14, and a control unit 15.

[0012] The input unit 11 is realized by input devices such as a keyboard and a mouse, and inputs various instruction information such as a command to start processing to the control unit 15 in response to an input operation by an operator. The output unit 12 is realized by a display device such as a liquid crystal display, a printing device such as a printer, or the like.

[0013] The communication control unit 13 is realized by a NIC (Network Interface Card) or the like, and controls communication between an external device such as a server via a network and the control unit 15. For example, the communication control unit 13 controls communication between the control unit 15 and a management device or the like that collects and manages communication information of the network.

[0014] The storage unit 14 is realized by a semiconductor memory element such as a RAM (Random Access Memory) or a flash memory, or a storage device such as a hard disk or an optical disk. The storage unit 14 stores in advance a processing program for operating the feature calculation device 10, data used during execution of the processing program, and the like, or temporarily stores the data each time processing is performed. For example, the storage unit 14 stores an estimation model of the processing result of an estimation unit described later, and the like. The storage unit 14 may be configured to communicate with the control unit 15 via the communication control unit 13.

[0015] The control unit 15 is realized using a CPU (Central Processing Unit) or the like, and executes a processing program stored in a memory. As a result, the control unit 15 functions as an acquisition unit 15a, a generation unit 15b, a selection unit 15c, a calculation unit 15d, and an estimation unit 15e, as exemplified in FIG. 1. Note that each or a part of these functional units may be implemented in different hardware. For example, the calculation unit 15d and the estimation unit 15e may be implemented in different hardware. The control unit 15 may also include other functional units.

[0016] The acquisition unit 15a acquires the collected communication information of the network nodes. For example, the acquisition unit 15a acquires flow information of an IP host that is a processing target of a feature amount calculation process described later, via the input unit 11 or the communication control unit 13, from a management device that collects and manages the communication information of the network. The acquisition unit 15a may store the acquired data in the storage unit 14. Alternatively, the acquisition unit 15a may transfer the information to the generation unit 15b described below, without storing it in the storage unit 14.

[0017] The generating unit 15b uses communication information between nodes of the network to generate a graph representing communication between the nodes. Specifically, the generating unit 15b uses the acquired flow information of the IP hosts to create a graph in which the IP hosts are nodes and the communications between the IP hosts are edges. At this time, the generating unit 15b generates the graph by excluding nodes with the number of adjacent nodes smaller than a predetermined threshold.

[0018] The selection unit 15c selects nodes that satisfy a predetermined condition from among the nodes of the generated graph. For example, the selection unit 15c selects a predetermined number of nodes in descending order of the number of adjacent nodes.

[0019] Alternatively, the selection unit 15c selects a node to which a predetermined color has been assigned by a Coloring algorithm that assigns a color different from that of adjacent nodes to all nodes. Here, FIG. 2 is a diagram for explaining the processing of the selection unit. As shown in FIG. 2, the selection unit 15c assigns a color to each node so that the color becomes different from that of adjacent nodes, for example, by using a Greedy Coloring algorithm. In the example shown in FIG. 2, the selection unit 15c assigns a color different from that of adjacent nodes in a predetermined order, for example, by selecting nodes with a large number of adjacent nodes in descending order, such as red for nodes E and A, and blue for nodes B, C, and D. Then, the selection unit 15c selects the nodes to which red has been assigned (nodes A and E in the example of FIG. 2), for example.

[0020] The calculation unit 15d calculates the feature amount in the graph for the selected node by a predetermined learning method. Here, Fig. 3 is a diagram for explaining the processing of the calculation unit. As shown in Fig. 3, the calculation unit 15d generates a path (list) consisting of multiple nodes for each node by, for example, random walk on the graph, and calculates the feature amount only for the selected node on the path by the Word2Vec algorithm that is also used in Deep Walk.

[0021] 3, the feature amounts φ(A) and φ(E) in the feature amount space are calculated for the selected nodes A and E on the path. In this way, the calculation unit 15d calculates the feature amounts of only the selected nodes by a predetermined learning method, without learning the feature amounts of all the nodes as in Deep Walk.

[0022] The estimation unit 15e estimates the feature amount of the node other than the selected node by combining the calculated feature amounts of the successively adjacent nodes in the graph. Note that the successively adjacent nodes include the adjacent nodes of each node and the secondary adjacent nodes adjacent to the adjacent nodes.

[0023] Here, Fig. 4 is a diagram for explaining the processing of the estimation unit. As shown in Fig. 4, the estimation unit 15e estimates the feature amount of a node other than the selected node by, for example, combining the calculated feature amounts of all selected nodes that are the shortest distance from the selected node. The estimation unit 15e also estimates the feature amount of a node other than the selected node by combining the feature amount vectors of a plurality of nodes by averaging or using the Hadamard product.

[0024] 4, the estimation unit 15e calculates the feature amount φ(B) of an unlearned node B other than the selected nodes A and E by averaging Agg(φ(A),φ(E)) the feature amount φ(A) of node A and the feature amount φ(E) of node E. The estimation unit 15e also estimates the feature amount φ(G) of an unlearned node G by averaging Agg(φ(F)) of the feature amount φ(F) of node F, which is all nodes at the shortest distance, that is, the average Agg(Agg(φ(E))) of the feature amount φ(E) of the selected learned node E at the shortest distance from node F.

[0025] Furthermore, the estimation unit 15e outputs the calculated feature amount and the estimated feature amount via the output unit 12.

[0026] [Feature calculation process] Next, the feature calculation process by the feature calculation device 10 according to this embodiment will be described with reference to Fig. 5. Fig. 5 is a flowchart showing the procedure of the feature calculation process. The flowchart in Fig. 5 starts, for example, when an operation input is made to instruct the start of the feature calculation process.

[0027] First, the generation unit 15b generates a graph representing communication between nodes using communication information of the nodes of the network acquired by the acquisition unit 15a (step S1).

[0028] Next, the selection unit 15c selects nodes that satisfy a predetermined condition from among the nodes of the generated graph (step S2). For example, the selection unit 15c selects a predetermined number of nodes in descending order of the number of adjacent nodes. Alternatively, the selection unit 15c selects nodes that have been given a predetermined color by a coloring algorithm.

[0029] Furthermore, the calculation unit 15d calculates the feature amount in the graph for the selected node by a predetermined learning method (step S3).

[0030] Then, the estimation unit 15e estimates the feature amount for each unlearned node other than the selected node by combining the calculated feature amounts of the adjacent selected nodes in the graph (step S4).

[0031] For example, the estimation unit 15e estimates the feature of an unlearned node other than the selected node by combining the calculated feature of all selected nodes that are the shortest distance from the unlearned node. At this time, the estimation unit 15e estimates the feature of the unlearned node other than the selected node by combining the feature vectors of multiple nodes by averaging or using the Hadamard product.

[0032] Furthermore, the estimation unit 15e outputs the calculated feature amount and the estimated feature amount via the output unit 12 (step S5), thereby completing a series of feature amount calculation processes.

[0033] As described above, in the feature calculation device 10, the generation unit 15b generates a graph representing communication between nodes using communication information between nodes of a network. The selection unit 15c selects nodes that satisfy a predetermined condition from among the nodes of the generated graph. The calculation unit 15d calculates the feature of the selected node in the graph by a predetermined learning method. The estimation unit 15e estimates the feature of nodes other than the selected node by combining the calculated feature of adjacent nodes in the graph in sequence.

[0034] In this way, the feature calculation device 10 reduces the amount of calculation by limiting the calculation during learning to the selected node, thereby making it possible to calculate features from a graph representing a communication network while reducing the amount of time and space calculation.

[0035] Furthermore, the generating unit 15b generates a graph by excluding nodes whose number of adjacent nodes is less than a predetermined threshold, which enables the feature calculation device 10 to efficiently calculate the feature.

[0036] Moreover, the selection unit 15c selects a predetermined number of nodes in descending order of the number of adjacent nodes, which enables the feature calculation device 10 to calculate the feature efficiently.

[0037] Moreover, the selection unit 15c selects nodes to which a predetermined color has been assigned by a coloring algorithm that assigns a color different from that of adjacent nodes to all nodes, thereby enabling the feature calculation device 10 to efficiently calculate features.

[0038] Furthermore, the estimation unit 15e estimates the feature amounts of the nodes other than the selected node by combining the calculated feature amounts of all selected nodes that are the shortest distance from the selected node. This enables the feature amount calculation device 10 to calculate the feature amounts with high accuracy.

[0039] In addition, the estimation unit 15e estimates the features of the nodes other than the selected node by combining the feature vectors of the multiple nodes by averaging or using the Hadamard product, which enables the feature calculation device 10 to efficiently calculate the features.

[0040] [program] A program in which the process executed by the feature amount calculation device 10 according to the above embodiment is written in a language executable by a computer can also be created. As an embodiment, the feature amount calculation device 10 can be implemented by installing a feature amount calculation program for executing the feature amount calculation process as package software or online software on a desired computer. For example, the feature amount calculation program can be executed by an information processing device, so that the information processing device can function as the feature amount calculation device 10. In addition, the information processing device includes mobile communication terminals such as smartphones, mobile phones, and PHS (Personal Handyphone System), and further slate terminals such as PDA (Personal Digital Assistant), etc. in its category. The function of the feature amount calculation device 10 may be implemented in a cloud server.

[0041] 6 is a diagram showing an example of a computer that executes a feature calculation program. The computer 1000 includes, for example, a memory 1010, a CPU 1020, a hard disk drive interface 1030, a disk drive interface 1040, a serial port interface 1050, a video adapter 1060, and a network interface 1070. These components are connected by a bus 1080.

[0042] The memory 1010 includes a ROM (Read Only Memory) 1011 and a RAM 1012. The ROM 1011 stores a boot program such as a BIOS (Basic Input Output System). The hard disk drive interface 1030 is connected to a hard disk drive 1031. The disk drive interface 1040 is connected to a disk drive 1041. A removable storage medium such as a magnetic disk or an optical disk is inserted into the disk drive 1041. The serial port interface 1050 is connected to a mouse 1051 and a keyboard 1052, for example. The video adapter 1060 is connected to a display 1061, for example.

[0043] Here, the hard disk drive 1031 stores, for example, an OS 1091, an application program 1092, a program module 1093, and program data 1094. Each piece of information described in the above embodiments is stored in the hard disk drive 1031 or memory 1010, for example.

[0044] The feature calculation program is stored in the hard disk drive 1031, for example, as a program module 1093 in which instructions to be executed by the computer 1000 are written. Specifically, the hard disk drive 1031 stores the program module 1093 in which each process executed by the feature calculation device 10 described in the above embodiment is written.

[0045] Furthermore, data used in information processing by the feature calculation program is stored as program data 1094, for example, in the hard disk drive 1031. Then, the CPU 1020 reads out the program module 1093 and the program data 1094 stored in the hard disk drive 1031 into the RAM 1012 as necessary, and executes each of the above-mentioned procedures.

[0046] Note that the program module 1093 and program data 1094 related to the feature calculation program are not limited to being stored in the hard disk drive 1031, and may be stored in, for example, a removable storage medium and read by the CPU 1020 via the disk drive 1041 or the like. Alternatively, the program module 1093 and program data 1094 related to the feature calculation program may be stored in another computer connected via a network such as a LAN (Local Area Network) or a WAN (Wide Area Network), and read by the CPU 1020 via the network interface 1070.

[0047] Although the embodiment to which the invention made by the present inventor is applied has been described above, the present invention is not limited by the description and drawings which form a part of the disclosure of the present invention according to the present embodiment. In other words, other embodiments, examples, operation techniques, etc. made by those skilled in the art based on the present embodiment are all included in the scope of the present invention. [Explanation of symbols]

[0048] 10. Feature Calculation Device 11 Input section 12 Output section 13 Communication control section 14 Storage section 15 Control section 15a Acquisition part 15b Generator 15c Selection section 15d Calculation section 15e Estimation part

Claims

1. a generation unit that generates a graph representing communications between the nodes using communication information between the nodes of the network; a selection unit that selects nodes that satisfy a predetermined condition from among the nodes of the generated graph; a calculation unit that calculates a feature amount in the graph for the selected node by a predetermined learning method; an estimation unit that estimates a feature amount for a node other than the selected node by combining the calculated feature amounts of adjacent nodes in the graph; A feature calculation device comprising:

2. The feature calculation device according to claim 1 , wherein the generation unit generates a graph by excluding nodes having a number of adjacent nodes smaller than a predetermined threshold.

3. The feature calculation device according to claim 1 , wherein the selection unit selects a predetermined number of nodes in descending order of the number of adjacent nodes.

4. 2. The feature calculation device according to claim 1, wherein the selection unit selects a node to which a predetermined color has been assigned by a coloring algorithm that assigns a color different from adjacent nodes to all nodes.

5. 2. The feature calculation device according to claim 1, wherein the estimation unit estimates the feature of a node other than the selected node by combining calculated feature amounts of all selected nodes that are shortest distances from the selected node.

6. 2. The feature calculation device according to claim 1, wherein the estimation unit estimates the features of the nodes other than the selected node by combining feature vectors of a plurality of nodes using an average or a Hadamard product.

7. A feature calculation method executed by a feature calculation device, comprising: A generation step of generating a graph representing communications between the nodes using communication information between the nodes of the network; a selection step of selecting nodes that satisfy a predetermined condition from among the nodes of the generated graph; a calculation step of calculating a feature amount in the graph for the selected node by a predetermined learning method; an estimation step of estimating a feature of a node other than the selected node by combining features calculated for adjacent nodes in the graph; A feature calculation method comprising:

8. On the computer, A generation step of generating a graph representing communications between the nodes using communication information between the nodes of the network; a selection step of selecting a node that satisfies a predetermined condition from among the nodes of the generated graph; a calculation step of calculating a feature amount in the graph for the selected node by a predetermined learning method; an estimation step of estimating a feature value for a node other than the selected node by combining the features calculated for nodes adjacent to each other in the graph; A feature calculation program that causes a user to execute the above steps.

Citation Information

Patent Citations

  • Feature-value display system, feature-value display method, and feature-value display program

    WO2016002132A1