Nothing Special   »   [go: up one dir, main page]

Forero et al., 2014 - Google Patents

Prediction of partially observed dynamical processes over networks via dictionary learning

Forero et al., 2014

View PDF
Document ID
14065820421600181670
Author
Forero P
Rajawat K
Giannakis G
Publication year
Publication venue
IEEE transactions on signal processing

External Links

Snippet

Prediction of dynamical processes evolving over network graphs is a basic task encountered in various areas of science and engineering. The prediction challenge is exacerbated when only partial network observations are available, that is when only measurements from a …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
    • H04L41/142—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning using statistical or mathematical methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing packet switching networks
    • H04L43/08—Monitoring based on specific metrics
    • H04L43/0852—Delays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
    • H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
    • H04L63/1425—Traffic logging, e.g. anomaly detection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6296—Graphical models, e.g. Bayesian networks

Similar Documents

Publication Publication Date Title
Forero et al. Prediction of partially observed dynamical processes over networks via dictionary learning
Dall'Anese et al. Optimization and learning with information streams: Time-varying algorithms and applications
Kasai et al. Network volume anomaly detection and identification in large-scale networks based on online time-structured traffic tensor tracking
Tune et al. Internet traffic matrices: A primer
Mardani et al. Recovery of low-rank plus compressed sparse matrices with application to unveiling traffic anomalies
Mardani et al. Dynamic anomalography: Tracking network anomalies via sparsity and low rank
Huang et al. Stochastic consensus over noisy networks with Markovian and arbitrary switches
Vaswani et al. Model-independent online learning for influence maximization
Wang et al. Demystifying why local aggregation helps: Convergence analysis of hierarchical SGD
CN102724078A (en) End-to-end network flow reconstruction method based on compression sensing in dynamic network
US20100306290A1 (en) Method and apparatus for spatio-temporal compressive sensing
Rusek et al. Message-passing neural networks learn little’s law
Xie et al. Accurate recovery of internet traffic data under dynamic measurements
Coluccia et al. Distribution-based anomaly detection via generalized likelihood ratio test: A general maximum entropy approach
Peluchetti Diffusion bridge mixture transports, Schrödinger bridge problems and generative modeling
Natali et al. Online time-varying topology identification via prediction-correction algorithms
Tripathi et al. Adaptive network latency prediction from noisy measurements
Memon et al. Design and Implementation of a Robust Convolutional Neural Network‐Based Traffic Matrix Estimator for Cloud Networks
Chawla et al. Multiagent low-dimensional linear bandits
Deng et al. Graph-Tensor Neural Networks for Network Traffic Data Imputation
Khatua et al. Sparse Laplacian component analysis for internet traffic anomalies detection
Mortazavi et al. Efficient mobile cellular traffic forecasting using spatial-temporal graph attention networks
Tripathi et al. Dynamic network latency prediction with adaptive matrix completion
Huang et al. Dynamic bayesian network based security analysis for physical layer key extraction
Wang et al. Prediction of network traffic through light-weight machine learning