Learnability of Timescale Graphical Event Models

05/25/2020
by   Philipp Behrendt, et al.
0

This technical report tries to fill a gap in current literature on Timescale Graphical Event Models. I propose and evaluate different heuristics to determine hyper-parameters during the structure learning algorithm and refine an existing distance measure. A comprehensive benchmark on synthetic data will be conducted allowing conclusions about the applicability of the different heuristics.

READ FULL TEXT

page 16

page 17

research
04/25/2021

Basic Analysis of Bin-Packing Heuristics

The bin-packing problem continues to remain relevant in numerous applica...
research
08/21/2020

Lyra 2: Designing Interactive Visualizations by Demonstration

Recent graphical interfaces offer direct manipulation mechanisms for aut...
research
11/02/2020

Learning generic feature representation with synthetic data for weakly-supervised sound event detection by inter-frame distance loss

Due to the limitation of strong-labeled sound event detection data set, ...
research
06/15/2020

Evolution of Group-Theoretic Cryptology Attacks using Hyper-heuristics

In previous work, we developed a single Evolutionary Algorithm (EA) to s...
research
10/22/2021

Temporal Point Process Graphical Models

Many real-world objects can be modeled as a stream of events on the node...
research
07/08/2020

Training Sound Event Detection On A Heterogeneous Dataset

Training a sound event detection algorithm on a heterogeneous dataset in...
research
12/12/2018

Enhancing Selection Hyper-heuristics via Feature Transformations

Hyper-heuristics are a novel tool. They deal with complex optimization p...

Please sign up or login with your details

Forgot password? Click here to reset