paper-with-me

홈 › Papers

A genetic algorithm to discover flexible motifs with support

2015-11-16 · Joan Serrà, Aleksandar Matic, Josep Luis Arcos, Alexandros Karatzoglou

Finding repeated patterns or motifs in a time series is an important unsupervised task that has still a number of open issues, starting by the definition of motif. In this paper, we revise the notion of motif support, characterizing it as the number of patterns or repetitions that define a motif. We then propose GENMOTIF, a genetic algorithm to discover motifs with support which, at the same time, is flexible enough to accommodate other motif specifications and task characteristics. GENMOTIF is an anytime algorithm that easily adapts to many situations: searching in a range of segment lengths, applying uniform scaling, dealing with multiple dimensions, using different similarity and grouping criteria, etc. GENMOTIF is also parameter-friendly: it has only two intuitive parameters which, if set within reasonable bounds, do not substantially affect its performance. We demonstrate the value of our approach in a number of synthetic and real-world settings, considering traffic volume measurements, accelerometer signals, and telephone call records.

📄 PDF Abstract BibTeX arXiv:1511.04986

Code (1)

joansj/genmotif 공식 구현

Tasks

Time SeriesTime Series Analysis

Similar Papers 제목 키워드 기반

Genetic Architect: Discovering Genomic Structure with Learned Neural Architectures

2016-05-23 · Laura Deming, Sasha Targ, Nate Sauder, Diogo Almeida 외

Each human genome is a 3 billion base pair set of encoding instructions. Decoding the genome using deep learning fundamentally differs from most tasks, as we do not know the full structure of the data and therefore canno…

Steering the LoCoMotif: Using Domain Knowledge in Time Series Motif Discovery

2025-02-17 · Aras Yurtman, Daan Van Wesenbeeck, Wannes Meert, Hendrik Blockeel

Time Series Motif Discovery (TSMD) identifies repeating patterns in time series data, but its unsupervised nature might result in motifs that are not interesting to the user. To address this, we propose a framework that …

Time Series

Discovering Attention-Based Genetic Algorithms via Meta-Black-Box Optimization

2023-04-08 · Robert Tjarko Lange, Tom Schaul, Yutian Chen, Chris Lu 외

Genetic algorithms constitute a family of black-box optimization algorithms, which take inspiration from the principles of biological evolution. While they provide a general-purpose tool for optimization, their particula…

Learning Functions in Large Networks requires Modularity and produces Multi-Agent Dynamics

2018-07-09 · C. -H. Huck Yang, Rise Ooi, Tom Hiscock, Victor Eguiluz 외

Networks are abundant in biological systems. Small sized over-represented network motifs have been discovered, and it has been suggested that these constitute functional building blocks. We ask whether larger dynamical n…

Efficient Discovery of Variable-length Time Series Motifs with Large Length Range in Million Scale Time Series

2018-02-13 · Gao Yifeng, Lin Jessica

Detecting repeated variable-length patterns, also called variable-length motifs, has received a great amount of attention in recent years. Current state-of-the-art algorithm utilizes fixed-length motif discovery algorith…

Time SeriesTime Series Analysis