Particle swarm optimization for time series motif discovery

@article{Serr2016ParticleSO,
  title={Particle swarm optimization for time series motif discovery},
  author={Joan Serr{\`a} and Josep Llu{\'i}s Arcos},
  journal={ArXiv},
  year={2016},
  volume={abs/1501.07399}
}
View PDF on arXiv
25 Citations
Background Citations
3
Methods Citations
3

Figures and Tables from this paper

25 Citations

Citation Type

Citation Type

A Genetic Algorithm to Discover Flexible Motifs with Support
TLDR
This paper revise the notion of motif support, characterizing it as the number of patterns or repetitions that define a motif, and proposes GENMOTIF, a genetic algorithm to discover motifs with support which is flexible enough to accommodate other motif specifications and task characteristics.
Spatial-time motifs discovery
TLDR
CSA outperforms traditional methods designed only for time series and was able to prioritize motifs that were meaningful both in the context of synthetic data and also according to seismic specialists.
Ranking and significance of variable-length similarity-based time series motifs
Survey on time series motif discovery
TLDR
This contribution provides a review of the existing publications in time series motif discovery along with advantages and disadvantages of existing approaches and serves as a glossary for researchers in this field.
Discovery of DNA Motif Utilising an Integrated Strategy Based on Random Projection and Particle Swarm Optimization
TLDR
A particle swarm optimization and random projection-based algorithm (PSORPS) is proposed for recognizing DNA motifs and the two operators of associated drift and independent drift are performed on the optimization results obtained by PSO.
NSAMD: A new approach to discover structured contiguous substrings in sequence datasets using Next-Symbol-Array
A new binary hybrid particle swarm optimization with wavelet mutation
Localizing Periodicity in Time Series and Videos
TLDR
This work proposes a method that, given a time series representing a periodic signal that has a non-periodic prefix and tail, estimates the start, the end and the period of the periodic part of the signal.
An event detection method for social networks based on hybrid link prediction and quantum swarm intelligent
TLDR
A novel hybrid quantum swarm intelligence indexing method (HQSII) from the perspective of link prediction is proposed for the first time, which includes an optimal weight algorithm (OWA) and a fluctuation detection algorithm (FDA) and the otherness of micro node evolutions is considered into link prediction.
Empowering particle swarm optimization algorithm using multi agents' capability: A holonic approach
...
1
2
3
...

References

SHOWING 1-10 OF 65 REFERENCES
Constrained Motif Discovery in Time Series
TLDR
The Constrained Motif Discovery problem is defined which enables utilization of domain knowledge into the motif discovery process and two algorithms called MCFull and MCInc are provided for efficiently solving the constrained motif discovery problem.
Exact Discovery of Time Series Motifs
TLDR
For the first time, a tractable exact algorithm to find time series motifs is shown and it is shown that this algorithm is fast enough to be used as a subroutine in higher level data mining algorithms for anytime classification, near-duplicate detection and summarization.
Efficient Proper Length Time Series Motif Discovery
TLDR
This work proposes a novel algorithm using compression ratio as a heuristic to discover meaningful motifs in proper lengths using time series motifs as a hypothesis and demonstrates that the proposed method outperforms existing works in various domains both in terms of speed and accuracy.
Finding Motifs in Time Series
TLDR
An efficient motif discovery algorithm for time series would be useful as a tool for summarizing and visualizing massive time series databases and could be used as a subroutine in various other data mining tasks, including the discovery of association rules, clustering and classification.
Multiresolution Motif Discovery in Time Series
TLDR
This work fully exploit state of the art iSAX representation multiresolution capability to obtain motifs at different resolutions and yields interactivity, allowing the user to navigate along the Top-K motifs structure, allowing a deeper understanding of the time series database.
Probabilistic discovery of time series motifs
TLDR
This work introduces a novel algorithm inspired by recent advances in the problem of pattern discovery in biosequences, which is probabilistic in nature, but can find time series motifs with very high probability even in the presence of noise or "don't care" symbols.
Detecting time series motifs under uniform scaling
TLDR
This work introduces a new algorithm that allows discovery of time series motifs with invariance to uniform scaling, and shows that it produces objectively superior results in several important domains.
Approximate variable-length time series motif discovery using grammar inference
TLDR
A novel approach, based on grammar induction, is proposed for approximate variable-length time series motif discovery, which offers the advantage of discovering hierarchical structure, regularity and grammar from the data.
Exact Discovery of Length-Range Motifs
TLDR
This paper argues that it is not trivial to extend this MK algorithm to handle multiple motifs of variable lengths when constraints of maximum overlap are to be satisfied which is the case in many real world applications and proposes an extension of the MK algorithm called MK++ to handle these conditions.
Enumeration of Time Series Motifs of All Lengths
TLDR
An exact algorithm, called MOEN, to enumerate motifs, which is an order of magnitude faster than the naive algorithm and frees us from re-discovering the same motif at different lengths and tuning multiple data-dependent parameters.
...
1
2
3
4
5
...