IP Library › Granted Patent US 12,267,337
Granted Patent B2
US 12,267,337 · App. 17/593,626 · Granted Apr 1, 2025

Feature detection with neural network classification of images representations of temporal graphs

Inventor: Robert Hercock (London, GB)
Assignee: British Telecommunications Public Limited Company United
H04L63/1416G06F16/9024G06F18/29G06V10/457G06V10/82H04L41/16H04L63/1425H04L63/1441
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,267,337
App. No.
17/593,626
Granted
Apr 1, 2025
Kind
B2
Abstract

A computer implemented method of feature detection in temporal graph data structures of events, the method including receiving a temporal series of graph data structures of events each including a plurality of nodes corresponding to events and edges connecting nodes corresponding to relationships between events; rendering each graph data structure in the series as an image representation of the graph data structure including a representation of nodes and edges in the graph being rendered reproducibly in a cartesian space based on attributes of the nodes and edges, so as to generate a temporal series of image representations ordered according to the temporal graph data structures; processing the series of image representations by a convolutional neural network to classify the image series so as to identify a feature in the image series, the convolutional neural network being trained by a supervised training method including a plurality of training example image series in which a subset of the training examples are classified as including the feature.

Claims (17)

1. A computer implemented method of feature detection in temporal graph data structures of events, the method comprising:

receiving a temporal series of graph data structures of events each including a plurality of nodes corresponding to events and edges connecting the nodes corresponding to relationships between events;

rendering each graph data structure in the temporal series as an image representation of the graph data structure including a representation of the nodes and the edges in the graph data structure being rendered reproducibly in a cartesian space based on attributes of the nodes and the edges, so as to generate a temporal series of image representations ordered according to the temporal graph data structures; and

processing the temporal series of image representations by a convolutional neural network to classify the temporal series of image representations so as to identify a feature in the temporal series of image representations, the convolutional neural network being trained by a supervised training method including a plurality of training example image series in which a subset of the plurality of training example image series are classified as including the feature.

2. The method of claim 1 , wherein rendering a graph data structure reproducible in the cartesian space includes determining, for each of the nodes and the edges in the graph data structure: a size of an indication of the node and the edge; a location in the cartesian space of the node and the edge; and visible attributes of the indication of the node and the edge in the cartesian space, so as to render the indication having the size, at the location and with the visible attributes.

3. The method of claim 2 , wherein the visible attributes include one or more of: a greyscale; a color; and a brightness.

4. The method of claim 1 , wherein the feature is an indication of a subgraph in the temporal series of image representations.

5. The method of claim 1 , wherein the feature includes a particular change or a series of changes to a subgraph over images in the temporal series of image representations.

6. The method of claim 1 , wherein the events include network communication events for communication across a computer network, and wherein the feature is associated with malicious communication in the computer network.

7. The method of claim 6 , wherein identification of the feature in the temporal series of image representations indicates existence of the malicious communication in the computer network, and the method further comprises, responsive to the identification of the feature in the temporal series of image representations, deploying one or more of network security protective measures or network intrusion remediative measures in the computer network.

8. The method of claim 7 , wherein the network security protective measures include one or more of: a network proxy; a firewall; an anti-malware facility; or a virus detection facility.

9. A computer system comprising:

a processor and memory to carry out feature detection in temporal graph data structures of events by:

receiving a temporal series of graph data structures of events each including a plurality of nodes corresponding to events and edges connecting the nodes corresponding to relationships between events;

rendering each graph data structure in the temporal series as an image representation of the graph data structure including a representation of the nodes and the edges in the graph data structure being rendered reproducibly in a cartesian space based on attributes of the nodes and the edges, so as to generate a temporal series of image representations ordered according to the temporal graph data structures; and

processing the temporal series of image representations by a convolutional neural network to classify the temporal series of image representations so as to identify a feature in the temporal series of image representations, the convolutional neural network being trained by a supervised training method including a plurality of training example image series in which a subset of the plurality of training example image series are classified as including the feature.

10. A non-transitory computer-readable storage medium storing a computer program element comprising computer program code to, when loaded into a computer system and executed thereon, cause the computer to perform the method as claimed in claim 1 .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 31, 2022
From: HERCOCK, ROBERT
To: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY
Reel/Frame 061593/0403 →
Priority Claims (1)
EP 19164779 · Mar 23, 2019 · regional
Continuity (1)
Related Publication 20220255953A1 · Aug 11, 2022
References Cited (27)
US 20100277481A1 · Cao et al. · 2010 [cited by applicant]
US 20130326625A1 · Anderson · 2013 [cited by examiner]
US 20170221240A1 · Stetson et al. · 2017 [cited by applicant]
US 20180115567A1 · El-moussa et al. · 2018 [cited by applicant]
US 20190042745A1 · Chen · 2019 [cited by examiner]
US 20190130578A1 · Gulsun · 2019 [cited by examiner]
US 20190147125A1 · Yu · 2019 [cited by examiner]
EP 3255586A1 · 2017 [cited by applicant]
WO WO2016146610A1 · 2016 [cited by examiner]
“Combined Search and Examination Report under Sections 17 and 18(3) for Great Britain Application No. GB1904020.3, mailed on Sep. 12, 2019”. [cited by applicant]
“Extended European Search Report for Application No. 19164779.1, mailed on Sep. 12, 2019”. [cited by applicant]
“International Preliminary Report on Patentability for Application No. PCT/EP2020/057531, mailed on Oct. 7, 2021”. [cited by applicant]
“International Search Report and Written Opinion received for PCT Patent Application No. PCT/EP2020/057531, mailed on May 19, 2020”. [cited by applicant]
Deng L., et al., “Deep Learning: Methods and Applications”, Foundations and Trends R in Signal Processing, vol. 7, No. 3-4 (2013) , 2014 , pp. 197-387. [cited by applicant]
Graves A., et al., “Speech Recognition With Deep Recurrent Neural Networks” , Department of Computer Science, University of Toronto, arXiv:1303.5778v1 , Mar. 22, 2013 , 5 pages. [cited by applicant]
Hohman F., et al., “Visual Analytics in Deep Learning: An Interrogative Survey for the Next Frontiers” , arXiv:1801.06889v3 , May 14, 2018 , 20 pages. [cited by applicant]
Mnih V., et al., “Playing Atari with Deep Reinforcement Learning” , DeepMind Technologies, arXiv:1312.5602v1 , Dec. 19, 2013 , 9 pages. [cited by applicant]
Niepert M., et al., “Learning Convolutional Neural Networks for Graphs”, Proceedings of the 33 rd International Conference on Machine Learning, New York, NY, USA, 2016. JMLR: W&CP vol. 48, arXiv: 1605.05273v4 [cs.LG] , … [cited by applicant]
O'Shea K., et al., “An Introduction to Convolutional Neural Networks” , arXiv:1511.08458v2 , Dec. 2, 2015 , 11 pages. [cited by applicant]
Polson, N. G., “Deep Learning for Short-Term Traffic Flow Prediction”, Systems Engineering and Operations Research, George Mason University, arXiv:1604.04527v3 , Feb. 27, 2017 , 29 pages. [cited by applicant]
Saha S., “A Comprehensive Guide to Convolutional Neural Networks—theELI5 Way”, Retrieved from https://towardsdatascience.com/a-comprehensive-guide-to-convolutional- neural-networks-the-eli5-way-3bd2b1164a53 , Dec. 15, 2… [cited by applicant]
Silver D., et al., “AlphaGo: Mastering the Ancient Game of Go with Machine Learning” , Google AI Blog , Jan. 27, 2016 , 4 pages. [cited by applicant]
Silver D., et al., “Mastering the Game Of Go with Deep Neural Networks and Tree Search” , Nature, vol. 529 , Jan. 28, 2016 , 20 pages. [cited by applicant]
Wikipedia, “Poincare Map” , Retrieved from https://en.wikipedia.org/wiki/Poincar%C3%A9_map , Dec. 7, 2016 , 3 pages. [cited by applicant]
Wistuba M., et al., “Move Prediction in Go—Modelling Feature Interactions Using Latent Factors”, University of Hildesheim Information Systems & Machine Learning Lab , 2013 , 12 pages. [cited by applicant]
Zhou Z., et al , “Convolution on Graph: A High-Order and Adaptive Approach”, Association for the Advancement of Artificial Intelligence, arXiv:1706.09916v2 , Oct. 20, 2017 , 8 pages. [cited by applicant]
“Graph (abstract data type),” Wikipedia, available at https://en.wikipedia.org/wiki/Graph_(abstract_data_type) as of Sep. 26, 2024, 5 pgs. [cited by applicant]
Cited By (1)
US 12,748,874