Evidence map›Paper›PMID 30828258›Full record

ArticleData mining and knowledge discovery2019

Domain agnostic online semantic segmentation for multi-dimensional time series.

Shaghayegh Gharghabi, Chin-Chia Michael Yeh, Yifei Ding, Wei Ding, Paul Hibbing, Samuel LaMunion, Andrew Kaplan, Scott E Crouter, Eamonn Keogh

Abstract read
In one paragraph

Article in Data mining and knowledge discovery, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

7 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Review
  5. Article
  6. Article
  7. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

9 authors.

Shaghayegh Gharghabi1Department of Computer Science and Engineering, University of California, Riverside, USA.ORCID 0000-0003-0258-7557
Chin-Chia Michael Yeh1Department of Computer Science and Engineering, University of California, Riverside, USA.
Yifei Ding1Department of Computer Science and Engineering, University of California, Riverside, USA.
Wei Ding2Department of Computer Science, University of Massachusetts Boston, Boston, USA.
Paul Hibbing3Department of Kinesiology, Recreation, and Sport Studies, The University of Tennessee Knoxville, Knoxville, USA.
Samuel LaMunion3Department of Kinesiology, Recreation, and Sport Studies, The University of Tennessee Knoxville, Knoxville, USA.
Andrew Kaplan3Department of Kinesiology, Recreation, and Sport Studies, The University of Tennessee Knoxville, Knoxville, USA.
Scott E Crouter3Department of Kinesiology, Recreation, and Sport Studies, The University of Tennessee Knoxville, Knoxville, USA.
Eamonn Keogh1Department of Computer Science and Engineering, University of California, Riverside, USA.

Funding

Novel Approaches for Predicting Unstructured Short Periods of Physical Activities in YouthR01HD083431 · NICHD · UNIVERSITY OF TENNESSEE KNOXVILLE · PI CROUTER, SCOTT E, DING, WEI · 2016 to 2019
$1.9M
NICHD NIH HHS R01 HD083431
6 · The paper itself

Abstract

Unsupervised semantic segmentation in the time series domain is a much studied problem due to its potential to detect unexpected regularities and regimes in poorly understood data. However, the current techniques have several shortcomings, which have limited the adoption of time series semantic segmentation beyond academic settings for four primary reasons. First, most methods require setting/learning many parameters and thus may have problems generalizing to novel situations. Second, most methods implicitly assume that all the data is segmentable and have difficulty when that assumption is unwarranted. Thirdly, many algorithms are only defined for the single dimensional case, despite the ubiquity of multi-dimensional data. Finally, most research efforts have been confined to the batch case, but online segmentation is clearly more useful and actionable. To address these issues, we present a multi-dimensional algorithm, which is domain agnostic, has only one, easily-determined parameter, and can handle data streaming at a high rate. In this context, we test the algorithm on the largest and most diverse collection of time series datasets ever considered for this task and demonstrate the algorithm's superiority over current solutions.

Indexed as

Online algorithmsSemantic segmentationTime series

Identifiers

PMID30828258
PMCPMC6373324

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.