Finding Events in Temporal Networks: Segmentation Meets Densest Subgraph Discovery

Knowledge and Information Systems - United Kingdom
doi 10.1007/s10115-019-01403-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

PTAS for Densest K-Subgraph in Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Analysis of Temporal Complex Events in Sensor Networks

Journal of Information and Telecommunication
2017English

Seismic Events Prediction Using Deep Temporal Convolution Networks

Journal of Electrical and Computer Engineering
Electronic EngineeringSignal ProcessingElectricalComputer Science
2019English

Performance Evaluation of Frequent Subgraph Discovery Techniques

Mathematical Problems in Engineering
MathematicsEngineering
2014English

Finding Media Illustrating Events

2011English

On the Distributions of Subgraph Centralities in Complex Networks

Discrete Dynamics in Nature and Society
ModelingSimulation
2013English

Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking

English

Fragment-Based Ligand Discovery Meets Phage Display

ACS Chemical Biology
BiochemistryMedicineMolecular Medicine
2007English

Subgraph Covers: An Information-Theoretic Approach to Motif Analysis in Networks

Physical Review X
AstronomyPhysics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy