The DOI matches its Crossref record; 142 of the 149 references it cites were found in a registry or an index; none of the 84 sources its claims cite is checked for support yet.
Deep learning for time series classification: a review
Open accessOverview
AI snapshot
Written from the paper’s full text.
TL;DR
This review empirically compares nine end-to-end deep learning architectures for time series classification across 97 univariate and multivariate datasets, training 8,730 models. It finds that a deep residual network (ResNet) is the strongest DNN, significantly outperforming most other deep models and reaching performance not significantly different from COTE/HIVE-COTE on the UCR/UEA archive.
Key findings
- ResNet significantly outperformed the other deep learning approaches on the 85 univariate UCR/UEA datasets, with an average rank of almost 2, winning on 50 out of 85 problems; FCN and Encoder followed as second and third.
- ResNet was not significantly different from COTE/HIVE-COTE in pairwise statistical tests, while NN-DTW-WW and EE showed the lowest average ranks among compared state-of-the-art methods.
- MCNN and t-LeNet, which use window slicing/subsequence extraction, yielded very low accuracies with only one win (Earthquakes); MCDCNN and Time-CNN performed similarly to MLP.
- ResNet was more stable across random initializations than FCN, with average standard deviation 1.48 versus 1.70; on DiatomSizeReduction, ResNet and FCN reached only 30% accuracy while Time-CNN reached 95%.
Methods
- The authors reimplemented nine discriminative end-to-end deep learning models (MLP, FCN, ResNet, Encoder, MCNN, t-LeNet, MCDCNN, Time-CNN, TWIESN) in a common Keras/TensorFlow framework and trained each with 10 random initializations on 97 datasets: 85 univariate UCR/UEA datasets and 12 multivariate datasets.
- In total, 8,730 experiments were run on a cluster of 60 GPUs; accuracy was averaged over the 10 runs, and comparisons with published state-of-the-art results used median test error.
- Statistical comparison used the Friedman test followed by pairwise Wilcoxon signed-rank tests with Holm’s alpha correction (5%), visualized with critical difference diagrams.
Limitations
- The paper states that generative models and models using hand-engineered features were excluded, and that transfer learning, data augmentation, training/testing time, and normalization effects were not thoroughly studied.
- The paper acknowledges that non-deep state-of-the-art algorithms were not trained or tuned by the authors, so the comparison may favor DNNs; it also notes that the compared architectures may have been overfitted or empirically designed for the UCR/UEA archive.
- Evident from the text: the multivariate archive contains only 12 datasets, and the statistical test failed to find significant differences among the nine classifiers on that archive; ResNet’s hyperparameters were not tuned per dataset, and random initialization can significantly affect DNN accuracy.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
64 Not checked yet · 47 Own interpretation · 44 Own result · 22 No basis given · 6 Own method
None of the sources cited for this claim have been checked yet.
In the paper
“our experiments showed that not only DNNs are able to significantly outperform the NN-DTW, but are also able to achieve results that are not significantly different than COTE and HIVE-COTE using a deep residual network architecture (He et al., 2016; Wang et al., 2017b).”
What the sources say
- Not checked yetcites He et al., 2016
- Not checked yetcites Wang et al., 2017b
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption: The UCR/UEA archive datasets are representative of TSC problems.
- Rests on an assumption: The deep learning implementations in the framework faithfully represent the original methods.
None of the sources cited for this claim have been checked yet.
In the paper
“our experiments showed that not only DNNs are able to significantly outperform the NN-DTW, but are also able to achieve results that are not significantly different than COTE and HIVE-COTE using a deep residual network architecture (He et al., 2016; Wang et al., 2017b).”
What the sources say
- Not checked yetcites He et al., 2016
- Not checked yetcites Wang et al., 2017b
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption: The UCR/UEA archive datasets are representative of TSC problems.
- Rests on an assumption: The deep learning implementations in the framework faithfully represent the original methods.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In addition, one of the advantages of FCNs is the invariance (denoted by # invar in Table 1) in the number of parameters for 4 layers (out of 5) across time series of different lengths.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We should note that twenty datasets contains a relatively small training set (50 or fewer instances) which surprisingly was not an impediment for obtaining high accuracy when applying a very deep architecture such as ResNet.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“During our study, we found that CNN is the most widely applied architecture for the TSC problem”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In our experiments, when comparing to state-of-the-art algorithms, we have encountered this problem with (ResNet > COTE > HIVE- COTE).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“where the statistical test failed to find any significant difference between the nine classifiers”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“and significantly outperforms the FCN architecture.”
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“One exception is the electrocardiography (ECG) datasets (7 in total) where ResNet was drastically beaten by the FCN model in 71.4% of ECG datasets.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“we can clearly see the dominance of ResNet as the best performing approach across different domains.”
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 47
- It may state two separate claims as one. 52
- The quote only partly states this claim. 2
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Finally, we analyze how poor random initializations can have a significant effect on a DNN's performance.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We can see that FCN does not hold any pooling nor a regularization operation.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Similarly to the FCN model, the layers (except the final one) in the ResNet architecture have an invariant number of parameters across different datasets.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The ResNet significantly outperforms the other approaches with an average rank of almost 2.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This suggestion is also supported by the fact that Time-CNN is the smallest model: it contains a very small number of parameters by design with only 18 filters compared to the 512 filters of FCN.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Again, ResNet and FCN still dominate with not much of a difference.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“our empirical study strongly suggests to use ResNet instead of any other deep learning algorithm - it is the most accurate one with similar runtime to FCN (the second most accurate DNN).”
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Although the datasets used in our experiments are relatively small compared to the billions of labeled images (such as ImageNet (Russakovsky et al., 2015) and OpenImages (Krasin et al., 2017) challenges), the deepest networks did reach competitive accuracies on the UCR/UEA archive benchmark.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The MCNN and t-LeNet architectures yielded very low accuracies with only one win for the Earthquakes dataset.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“FCN wins on 36 datasets whereases Encoder wins only on 17”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“ResNet and FCN achieved the worst accuracy (30%) on this dataset while Time-CNN reached the best accuracy (95%).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, TWIESN did reach competitive accuracies on several long time series datasets such as reaching a 96.8% accuracy on Meat whose time series length is equal to 448.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Overall, our results show that, on average, ResNet is the best architecture with FCN and Encoder following as second and third respectively.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In other words, FCN's learned representation has too many data points close to the decision boundary whereas ResNet's hidden features enables projecting data points further away from the decision boundary.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Rests on an assumption: MDS plots with Euclidean distance on GAP vectors preserve class separability sufficiently to interpret model performance.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“which is evident by the relatively low accuracy of both models FCN and ResNet which is equal respectively to 58.7% and 74.4%.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In other words, FCN's CAM contains much more smoother regions with cyan, green and yellow regions, whereas ResNet's CAM contains more dark red and blue subsequences”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“ResNet performed very well in general except for the ECG datasets where it was outperformed by FCN.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In other words, the weight's initial value can easily decrease the accuracy of FCN whereas ResNet maintained a relatively high accuracy when taking the worst initial weight values.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We found small variance between the approaches that replace the GAP layer with an FC dense layer (MCDCNN, CNN) which also showed similar performance to TWIESN and MLP.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We note that both deep learning models (FCN and ResNet) managed to project the data from GunPoint into a linearly separable space”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Rests on an assumption: MDS plots with Euclidean distance on GAP vectors preserve class separability sufficiently to interpret model performance.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“we observed in our experiments, that DNNs for TSC suffer from a significant decrease (increase) in accuracy when initialized with bad (good) random weights.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“DNNs have indeed revolutionized the field of computer vision especially with the advent of novel deeper architectures such as Residual and Convolutional Neural Networks.”
- Also stated in: § 1 Introduction · p. 2 · plain
“Deep Convolutional Neural Networks (CNNs) have revolutionized the field of computer vision (Krizhevsky et al., 2012).”
What the sources say
- Not checked yetcites Krizhevsky et al., 2012
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Also stated in: § 1 Introduction · p. 2 · plain
None of the sources cited for this claim have been checked yet.
In the paper
“To achieve its high accuracy, HIVE-COTE becomes hugely computationally intensive and impractical to run on a real big data mining problem (Bagnall et al., 2017).”
- Also stated in: § 1 Introduction · p. 2 · hedged
“The approach requires training 37 classifiers as well as cross-validating each hyperparameter of these algorithms, which makes the approach infeasible to train in some situations (Lucas et al., 2018).”
What the sources say
- Not checked yetcites Bagnall et al., 2017 source
- Not checked yetcites Lucas et al., 2018
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § 1 Introduction · p. 2 · hedged
None of the sources cited for this claim have been checked yet.
In the paper
“Apart from images, sequential data such as text and audio can also be processed with DNNs to reach state-of-the-art performance for document classification and speech recognition.”
- Also stated in: § 1 Introduction · p. 2 · plain
“Following the success of deep neural networks (DNNs) in computer vision, a huge amount of research proposed several DNN architectures to solve natural language processing (NLP) tasks such as machine translation (Sutskever et al., 2014; Bahdanau et al., 2015), learning word embeddings (Mikolov et al., 2013; Mikolov et al., 2013) and document classification (Le and Mikolov, 2014; Goldberg, 2016). DN”
What the sources say
- Not checked yetcites Sutskever et al., 2014
- Not checked yetcites Hinton et al., 2012 source
- Not checked yetcites Le and Mikolov, 2014
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Also stated in: § 1 Introduction · p. 2 · plain
None of the sources cited for this claim have been checked yet.
In the paper
“Once we have established that a statistical difference exists within the classifiers' performance, we followed the pairwise post-hoc analysis recommended by Benavoli et al. (2016) where the average rank comparison is replaced by a Wilcoxon signed-rank test (Wilcoxon, 1945) with Holm's alpha correction (Holm, 1979; Garcia and Herrera, 2008).”
What the sources say
- Not checked yetcites Benavoli et al., 2016
- Not checked yetcites Wilcoxon, 1945 source
- Not checked yetcites Holm, 1979
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“The multivariate evaluation shows another benefit of deep learning models, which is the ability to handle the curse of dimensionality (Bellman, 2010; Keogh and Mueen, 2017) by leveraging different degrees of smoothness in compositional function (Poggio et al., 2017) as well as the parallel computations of the GPUs (Lu et al., 2015).”
What the sources say
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Rests on an assumption: The UCR/UEA archive datasets are representative of TSC problems.
In the paper
“Apart from time series forecasting, we found that these neural networks were rarely applied for time series classification which is mainly due to three factors: (1) the type of this architecture is designed mainly to predict an output for each element (time stamp) in the time series (L¨ angkvist et al., 2014);”
What the sources say
- Not checked yetcites L¨ angkvist et al., 2014
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“(3) RNNs are considered hard to train and parallelize which led the researchers to avoid using them for computational reasons (Pascanu et al., 2013).”
What the sources say
- Not checked yetcites Pascanu et al., 2013
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“They were designed to mitigate the challenges of RNNs by eliminating the need to compute the gradient for the hidden layers which reduces the training time of these neural networks thus avoiding the vanishing gradient problem.”
What the sources say
- Not checked yetcites Gallicchio and Micheli, 2017
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“This is surprising as deep learning has seen very successful applications in the last years.”
- Also stated in: § 1 Introduction · p. 2 · plain
“After having established the current state-of-the-art of non deep classifiers for TSC (Bagnall et al., 2017), we discuss the success of Deep Learning (LeCun et al., 2015) in various classification tasks which motivated the recent utilization of deep learning models for TSC (Wang et al., 2017b).”
What the sources say
- Not checked yetcites LeCun et al., 2015 source
- Not checked yetcites Wang et al., 2017b
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
- Also stated in: § 1 Introduction · p. 2 · plain
In the paper
“Deep learning approaches for TSC can be separated into two main categories: the generative and the discriminative models (as proposed in L¨ angkvist et al. (2014)).”
What the sources say
- Not checked yetcites L¨ angkvist et al., 2014
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“As for comparing the classifiers over multiple datasets, we followed the recommendations in Demˇ sar (2006) and used the Friedman test (Friedman, 1940) to reject the null hypothesis.”
What the sources say
- Not checked yetcites Demˇ sar, 2006
- Not checked yetcites Friedman, 1940 source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
In the paper
“Generative models usually exhibit an unsupervised training step that precedes the learning phase of the classifier (L¨ angkvist et al., 2014).”
What the sources say
- Not checked yetcites L¨ angkvist et al., 2014
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Finally, adding to the huge runtime of HIVE-COTE, the decision taken by 37 classifiers cannot be interpreted easily by domain experts, since researchers already struggle with understanding the decisions taken by an individual classifier.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“MLP does not have any layer whose number of parameters is invariant across time series of different lengths (denoted by # invar in Table 1) which means that the transferability of the network is not trivial: the number of parameters (weights) of the network depends directly on the length of the input time series.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“One final note is that the careful design of Encoder's attention mechanism enabled the invariance across all layers which encouraged the authors to implement a transfer learning approach.”
What the sources say
- Not checked yetcites Serr` a et al., 2018
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“Residual Networks (ResNets) (Wang et al., 2017b; Geng and Luo, 2018) which add linear shortcut connections for the convolutional layers potentially enhancing the model's accuracy (He et al., 2016).”
What the sources say
- Not checked yetcites He et al., 2016
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“To measure the performance of the model on the test data (generalization), we adopted the accuracy measure (similarly to Bagnall et al. (2017)).”
What the sources say
- Not checked yetcites Bagnall et al., 2017 source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Although ESNs were originally proposed for time series forecasting, Tanisaro and Heidemann (2016) proposed a variant of ESNs that uses directly the raw input time series and predicts a probability distribution over the class variables.”
What the sources say
- Not checked yetcites Tanisaro and Heidemann, 2016
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“In addition, one of the main characteristics of this architecture is the replacement of the traditional final FC layer with a Global Average Pooling (GAP) layer which reduces drastically the number of parameters in a neural network while enabling the use of the CAM (Zhou et al., 2016) that highlights which parts of the input time series contributed the most to a certain classification.”
What the sources say
- Not checked yetcites Zhou et al., 2016
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“The latter approach reached higher accuracy thus benefiting from the transfer learning technique.”
What the sources say
- Not checked yetcites Serr` a et al., 2018
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“In contrast to feature engineering, end-to-end deep learning aims to incorporate the feature learning process while fine-tuning the discriminative classifier (Nweke et al., 2018).”
What the sources say
- Not checked yetcites Nweke et al., 2018 source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“which is probably due to their robustness and the relatively small amount of training time compared to complex architectures such as RNNs or MLPs.”
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“For memory usage limitations over a single GPU, we left the MTS dataset Performance Measurement System (PeMS) out of our experimentations.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Unlike ResNet and FCN, this approach does not have much invariant layers (2 out of 4) due to the use of an FC layer instead of a GAP layer, thus increasing drastically the number of parameters needed to be trained which also depends on the length of the input time series.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“This has also been the consensus in the human activity recognition literature, where the accuracy of deep learning methods depends highly on the quality of the extracted features (Nweke et al., 2018).”
What the sources say
- Not checked yetcites Nweke et al., 2018 source
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
In the paper
“We also evaluated all deep learning models on Baydogan's archive (Baydogan, 2015) that contains 13 MTS classification datasets.”
What the sources say
- Not checked yetcites Baydogan, 2015
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, any deep learning algorithm can benefit from this type of modification.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“That being said, we can easily pre-train a model on a source dataset, then transfer and fine-tune it on a target dataset without having to modify the hidden layers of the network.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“This archive also exhibits datasets with different characteristics such as the length of the time series which, unlike the UCR/UEA archive, varies among the same dataset. This is due to the fact that the datasets in the UCR/UEA archive are already re-scaled to have an equal length among one dataset (Bagnall et al., 2017).”
What the sources say
- Not checked yetcites Bagnall et al., 2017 source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“FCNs are mainly convolutional networks that do not contain any local pooling layers which means that the length of a time series is kept unchanged throughout the convolutions.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“Cui et al. (2016) were the first to introduce the Window Slicing (WS) method as a data augmentation technique.”
What the sources say
- Not checked yetcites Cui et al., 2016
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Actually, the difference with the usual convolutions (such as in FCNs) is that a linear shortcut is added to link the output of a residual block to its input thus enabling the flow of the gradient directly through these connections, which makes training a DNN much easier by reducing the vanishing gradient effect (He et al., 2016).”
What the sources say
- Not checked yetcites He et al., 2016
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The problem with an MLP approach is that temporal information is lost and the features learned are no longer time-invariant.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“We made this choice because we believe that the main goal of deep learning approaches is to remove the bias due to manually designed features (Ord´ o¨ nez and Roggen, 2016), thus enabling the network to learn the most discriminant useful features for the classification task.”
What the sources say
- Not checked yetcites Ord´ o¨ nez and Roggen, 2016
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“This form of pre-processing has also been used by Ratanamahatana and Keogh (2005) to show that the length of a time series is not an issue for TSC problems.”
What the sources say
- Not checked yetcites Ratanamahatana and Keogh (2005)
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“By using an FC layer before the softmax classifier, the transferability of this network is limited to the first and second convolutional layers.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The first characteristic of Time-CNN is the use of the mean squared error (MSE) instead of the traditional categorical cross-entropy loss function, which has been used by all the deep learning approaches we have mentioned so far. Hence, instead of a softmax classifier, the final layer is a traditional FC layer with sigmoid as the activation function, which does not guarantee a sum of probabilities”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Unlike GAP, local pooling introduces invariance to small perturbations in the activation map (the result of a convolution) by taking the maximum value in a local pooling window.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“Since we did not train nor test any of the state-of-the-art non deep learning algorithms, it is possible that we allowed much more training time for the described DNNs.”
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“our findings are in agreement with the deep learning for computer vision literature where deeper neural networks are much more successful than shallower architectures (He et al., 2016).”
What the sources say
- Not checked yetcites He et al., 2016
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Interestingly, DiatomSizeReduction is the smallest datasets in the UCR/UEA archive (with 16 training instances), which suggests that ResNet and FCN are easily overfitting this dataset.”
hedgedconditionalSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This step is very important for deep learning models whose architecture depends on the length of the input time series (such as a MLP) and for parallel computation over the GPUs.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may state two separate claims as one.
- Rests on an assumption: The MTS archive contains time series of unequal length.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In addition to the huge training time, HIVE-COTE's classification time is bounded by a linear scan of the training set due to employing a nearest neighbor classifier, whereas the trivial GPU parallelization of DNNs provides instant classification.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“since increasing the number of convolutional layers will increase the path length viewed by the CNN model (Vaswani et al., 2017), ResNet and FCN managed to outperform other approaches whose filter length is longer (21) such as Encoder.”
What the sources say
- Not checked yetcites Vaswani et al., 2017
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This FC layer reduces the effect of learning time invariant features which explains why MLP, Time-CNN and MCDCNN exhibit very similar performance.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Therefore, we believe that allowing a much more thorough search of DTW's warping window would lead to a fairer comparison between deep learning approaches and other state-of-the-art TSC algorithms.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“unlike HIVE-COTE, ResNet's hyperparameters were not tuned for each dataset but rather the same architecture was used for the whole benchmark”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“One final observation that is in agreement with the deep learning literature is that in order to achieve high accuracies while training a DNN, a large training set is needed.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“suggesting that these methods are no longer competitive with current state-of-the-art algorithms for TSC.”
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“suggesting further investigation of these hyperparameters should improve DNNs' accuracy for TSC.”
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“it is only natural to think that discovering patterns in a one dimensional space (time) should be an easier task for CNNs thus requiring less data to learn from.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“which enables us to take the mean accuracy over the 10 runs in order to reduce the bias due to the weights' initial values.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
In the paper
“for a lazy machine learning algorithm such as NN-DTW, training time is zero when allowing maximum warping whereas it has been shown that judicially setting the warping window Dau et al. (2017) can lead to a significant increase in accuracy.”
What the sources say
- Not checked yetcites Dau et al., 2017
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“These observations reinforces the need to have an equally large MTS classification archive in order to evaluate hybrid univariate/multivariate time series classifiers.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence.
In the paper
“but the fact that ResNet is not significantly different than COTE suggests that more datasets would give a better insight into these performances (Demˇ sar, 2006).”
What the sources say
- Not checked yetcites Demˇ sar, 2006
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it.
In the paper
“It is worthwhile noting that cliques formed by the Wilcoxon Signed Rank Test with Holm's alpha correction do not necessary reflect the rank order (Lines et al., 2018).”
What the sources say
- Not checked yetcites Lines et al., 2018 source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Although Time-CNN and MCDCNN are the only architectures originally proposed for MTS data”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We believe that the success of ResNet is highly due to its deep flexible architecture.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence.
In the paper
“especially since normalization is known to have a huge effect on DNNs' learning capabilities (Zhang et al., 2017).”
What the sources say
- Not checked yetcites Zhang et al., 2017
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“which probably explains why FCN is less accurate than ResNet on this dataset.”
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
- Rests on an assumption: CAM visualizations faithfully indicate which time series regions contribute to class identification.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In fact, most DNNs architectures, with the categorical cross-entropy as their cost function, employ mainly the same classifier: softmax which is basically designed for multi-class classification.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“we stress that the shapelet transformation classifier (Hills et al., 2014) is an ensemble approach, which makes unclear how the shapelets affect the decision taken by the individual classifiers whereas for an end-to-end deep learning model we can directly explain the classification by using the Class Activation Map.”
What the sources say
- Not checked yetcites Hills et al., 2014 source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“On the other hand, the part where the actor raises his/her arm seems to be also a discriminative part of the data which suggests that the deep learning algorithms are identifying more 'shapelets'.”
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Finally, another interesting observation is the ability of CNNs to localize a given discriminative shape regardless where it appears in the time series, which is evidence for CNNs' capability of learning time-invariant warped features.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We should note that this observation cannot confirm which classifier extracted the most discriminative subsequences especially because all algorithms achieved similar accuracy on GunPoint dataset.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper relies on this without support.
The UCR/UEA archive datasets are representative of TSC problems.
“we tested the approaches on 12 Multivariate Time Series (MTS) datasets (Baydogan, 2015).”
The paper relies on this without support.
The 97 time series datasets used are sufficient to generalize about DNN performance for TSC.
“By training 8,730 deep learning models on 97 time series datasets, we propose the most exhaustive study of DNNs for TSC to date.”
The paper relies on this without support.
The deep learning implementations in the framework faithfully represent the original methods.
“We also provide an open source deep learning framework to the TSC community where we implemented each of the compared approaches and evaluated them on a univariate TSC benchmark (the UCR/UEA archive) and 12 multivariate time series datasets.”
The paper relies on this without support.
The MTS archive contains time series of unequal length.
“In order to solve the problem of unequal length time series in the MTS archive”
The paper relies on this without support.
CAM visualizations faithfully indicate which time series regions contribute to class identification.
“Highlighting with the Class Activation Map the contribution of each time series region for the three classes in Meat when using the FCN and ResNet classifiers.”
The paper relies on this without support.
MDS plots with Euclidean distance on GAP vectors preserve class separability sufficiently to interpret model performance.
“Figure 15 shows three MDS plots for the GunPoint dataset using: (1) the raw input time series (Figure 15a); (2) the learned latent features from the GAP layer for FCN (Figure 15b); and (3)”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These approaches, categorized as temporal representation[105,106], divide the entire framework into two stages: “temporal representation” and “temporal prediction.””
From Advancements in the estimation of the state of charge of lithium-ion battery: a comprehensive review of traditional and deep learning approaches (2025) · cites this paper as [105]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“These include the high computational cost incurred by running multiple instances [18,19]”
From TVGeAN: Tensor Visibility Graph-Enhanced Attention Network for Versatile Multivariant Time Series Learning Tasks (2024) · cites this paper as [19]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 4.1.1 Univariate archive · p. 21
“| WalkVsRun | 128-1918 | 1919 | 2 | 62 | 28 | 16 |”
§ 4.1.2 Multivariate archive · p. 21
“thus each time series will have a length equal to the longest time series' length.”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 3.2.1 Multi Layer Perceptron · p. 14
“MLP does not have any layer whose number of parameters is invariant across time series of different lengths”
§ 3.2.1 Multi Layer Perceptron · p. 14
“All three hidden FC layers are composed of 500 neurons with ReLU as the activation function.”
Citations
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474 · cited 12×
“First of all, our findings are in agreement with the deep learning for computer vision literature where deeper 1 The implementations are available on https://github.com/hfawaz/dl-4-tsc neural networks are much more successful than shallower architectures (He et al., 2016).”
BackgroundResultInfluentialVaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404 · cited 4×
“The MLP, which is the most traditional form of DNNs, was proposed in Wang et al. (2017b) as a baseline architecture for TSC.”
BackgroundMethodInfluentialImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155 · cited 7×
“Since AlexNet (Krizhevsky et al. 2012) won the ImageNet competition in 2012, deep CNNs have seen a lot of successful applications in many different domains (LeCun et al.”
BackgroundInfluentialAdam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946 · cited 1×
“All models were optimized using a variant of Stochastic Gradient Descent (SGD) such as Adam (Kingma and Ba, 2015) and AdaDelta (Zeiler, 2012).”
MethodLeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Going deeper with convolutions
Szegedy, C., Liu, W., Jia, Y., Sermanet, P., Reed, S., Anguelov, D., Erhan, D., Vanhoucke, V., & Rabinovich, A. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298594 · Cited by 48,562
ImageNet Large Scale Visual Recognition Challenge
Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al. (2015) · International Journal of Computer Vision · doi:10.1007/s11263-015-0816-y · Cited by 39,380
(2014) · Cited by 33,419
Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
Ioffe, S., & Szegedy, C. (2015) · arXiv · doi:10.48550/arxiv.1502.03167 · Cited by 27,818
Research works printed but not linked: 2
- Che Z, He X, Xu K, Liu Y (2017b) DECADE: a deep metric learning model for multivariate time series. In: KDD workshop on mining and learning from time series
- Ismail Fawaz H, Forestier G, Weber J, Idoumghar L, Muller PA (2018c) Transfer learning for time series classification. In: IEEE international conference on big data, pp 1367–1376 · DOI · Paper page
Cited by
Sorted by citations
Items 701–800 of 1,007
Vargas, V. M., Rosati, R., Hervás‐Martínez, C., Mancini, A., Romeo, L., & Gutiérrez, P. A. (2023) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2023.106463 · Cited by 21
Metaheuristic-based time series clustering for anomaly detection in manufacturing industry
Suh, W. H., Oh, S., & Ahn, C. W. (2023) · Applied Intelligence · doi:10.1007/s10489-023-04594-5 · Cited by 21
“Fawaz divided deep learning methodologies for time series clustering into generative models and discriminative models; and conducted comprehensive comparison tests of deep learningmodels on time series data [13].”
ViT-Based Multi-Scale Classification Using Digital Signal Processing and Image Transformation
Kim, G.-I., & Chung, K. (2024) · IEEE Access · doi:10.1109/access.2024.3389808 · Cited by 20
“For example, Fawaz et al. [15] revealed that ensembling various deep learning models can improve the performance of time-series classification.”
BackgroundWang, S., Lin, Y., Jia, Y., Sun, J., & Yang, Z. (2024) · IEEE Access · doi:10.1109/access.2024.3444788 · Cited by 21
“This utility extends beyond traditional applications, allowing for the extraction of complex features from temporal data [11], [28], [29], [30].”
BackgroundDEDPUL: Difference-of-Estimated-Densities-based Positive-Unlabeled Learning
Ivanov, D. (2020) · International Conference on Machine Learning and Applications · doi:10.1109/icmla51294.2020.00128 · Cited by 20
“3), the code for which is taken from [ Ismail Fawaz et al. , 2019 ] .”
BackgroundMSSTN: Multi-Scale Spatial Temporal Network for Air Pollution Prediction
Wu, Z., Wang, Y., & Zhang, L. (2019) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata47090.2019.9005574 · Cited by 20
Hanif, M. A., & Shafique, M. (2020) · IEEE International On-Line Testing Symposium (IOLTS) · doi:10.1109/iolts50870.2020.9159734 · Cited by 21
“…(Deep Neural Networks - DNNs) offer state-of-the-art accuracy in many Artificial Intelligence (AI) applications, such as image classification, image segmentation, object detection and speech recognition [2] [3] [4], which in some scenarios have been claimed to surpass human-level precision [5].”
BackgroundXing, T., García, L. A. R., Vilamala, M. R., Cerutti, F., Kaplan, L., Preece, A. D., & Srivastava, M. B. (2020) · ACM Conference on Embedded Networked Sensor Systems (SenSys) · doi:10.1145/3384419.3431158 · Cited by 23
Reconstruction of time series with missing value using 2D representation-based denoising autoencoder
Huamin, T., Deng, Q., & Shanzhu, X. (2020) · Journal of Systems Engineering and Electronics · doi:10.23919/jsee.2020.000081 · Cited by 20
Exploring Semi-Supervised Learning for Predicting Listener Backchannels
Jain, V., Leekha, M., Shah, R. R., & Shukla, J. (2021) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/3411764.3445449 · Cited by 21
Cheng, C., Ho, Y., & Chiu, T.-C. (2021) · Processes · doi:10.3390/pr9091484 · Cited by 20
Ofner, A. B., Kefalas, A., Posch, S., & Geiger, B. C. (2022) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2022.3144832 · Cited by 20
CNN‐LSTM‐Based Late Sensor Fusion for Human Activity Recognition in Big Data Networks
Baloch, Z., Shaikh, F. K., & Unar, M. A. (2022) · Wireless Communications and Mobile Computing · doi:10.1155/2022/3434100 · Cited by 21
Wu, Y., Bai, D., Zhang, K., Li, Y., & Yang, F. (2025) · Journal of Materials Informatics · doi:10.20517/jmi.2024.84 · Cited by 20
Glacier: guided locally constrained counterfactual explanations for time series classification
Wang, Z., Samsten, I., Miliou, I., Mochaourab, R., & Papapetrou, P. (2024) · Machine Learning · doi:10.1007/s10994-023-06502-x · Cited by 24
Geng, M., Ma, H., Wang, J., Liu, S., Li, J., Ai, Y., & Zhang, W. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.125413 · Cited by 19
Joint-Label Learning by Dual Augmentation for Time Series Classification
Ma, Q., Zheng, Z., Zheng, J., Li, S., Zhuang, W., & Cottrell, G. W. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i10.17071 · Cited by 19
“The results of MLP, FCN, and ResNet are collected from (Ismail Fawaz et al. 2019).”
BackgroundMethodAttentive neural controlled differential equations for time-series classification and forecasting
Jhin, S. Y., Shin, H., Kim, S., Hong, S., Jo, M., Park, S., Park, N., Lee, S., Maeng, H., & Jeon, S. (2023) · Knowledge and Information Systems · doi:10.1007/s10115-023-01977-5 · Cited by 28
A high spatiotemporal resolution framework for urban temperature prediction using IoT data
Yang, J., Yu, M., Liu, Q., Li, Y., Duffy, D. Q., & Yang, C. P. (2021) · Computers & Geosciences · doi:10.1016/j.cageo.2021.104991 · Cited by 19
Senjoba, L., Sasaki, J., Kosugi, Y., Toriya, H., Hisada, M., & Kawamura, Y. (2021) · Mining · doi:10.3390/mining1030019 · Cited by 19
“Finally, to train and learn the parameters of a deep CNN: a feed-forward pass followed by backpropagation is done [19].”
BackgroundMethodInfluentialData Augmentation for 12-Lead ECG Beat Classification
Do, E., Boynton, J., Lee, B. S., & Lustgarten, D. L. (2021) · SN Computer Science · doi:10.1007/s42979-021-00924-x · Cited by 19
“[14], ResNet is one of the best performers for time series data and ResNet has demonstrated outstanding classification performance for a variety of tasks (He et al.”
BackgroundPredicting severely imbalanced data disk drive failures with machine learning models
Ahmed, J., & Green, R. (2022) · Machine Learning with Applications · doi:10.1016/j.mlwa.2022.100361 · Cited by 20
Amalyan, S., Tamboli, S., Lazarevich, I. A., Topolnik, D., Bouman, L. H., & Topolnik, L. (2022) · Cell Reports · doi:10.1016/j.celrep.2022.111043 · Cited by 19
Explainable Predictive Quality Inspection using Deep Learning in Electronics Manufacturing
Saadallah, A., Büscher, J., Abdulaaty, O., Panusch, T., Deuse, J., & Morik, K. J. (2022) · Procedia CIRP · doi:10.1016/j.procir.2022.05.031 · Cited by 21
Lomio, F., Moreschini, S., & Lenarduzzi, V. (2022) · Empirical Software Engineering · doi:10.1007/s10664-022-10164-z · Cited by 19
A mild cognitive impairment diagnostic model based on IAAFT and BiLSTM
Li, X., Zhou, H., Su, R., Kang, J., Sun, Y., Yuan, Y., Han, Y., Chen, X., Xie, P., Wang, Y., et al. (2022) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2022.104349 · Cited by 20
Fuzzy granular recurrence plot and quantification analysis: A novel method for classification
He, Q., Yu, F., Chang, J., & Ouyang, C. (2023) · Pattern Recognition · doi:10.1016/j.patcog.2023.109456 · Cited by 19
Time Series Dataset Survey for Forecasting with Deep Learning
Hahn, Y., Langer, T., Meyes, R., & Meisen, T. (2023) · Forecasting · doi:10.3390/forecast5010017 · Cited by 28
Continuous ordinal patterns: Creating a bridge between ordinal analysis and deep learning
Zanin, M. (2023) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0136492 · Cited by 22
Prediction of acute hypertensive episodes in critically ill patients
Itzhak, N., Pessach, I. M., & Moskovitch, R. (2023) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2023.102525 · Cited by 19
A Ranking-Based Cross-Entropy Loss for Early Classification of Time Series
Sun, C., Li, H., Song, M., & Hong, S. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3250203 · Cited by 19
“For example, in the sepsis prediction task, a rapid drop in blood pressure (the major symptom of sepsis) always occurs just before sepsis occurs, but such evidence is hard to recognize in the early stages of time series [3].”
BackgroundInfluentialFast Time Series Classification with Random Symbolic Subsequences
Nguyen, T. L., & Ifrim, G. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-24378-3_4 · Cited by 19
Forecasting the abundance of disease vectors with deep learning
Ceia‐Hasse, A., Sousa, C. A., de Gouveia, B. R. F. O., & Capinha, C. (2023) · Ecological Informatics · doi:10.1016/j.ecoinf.2023.102272 · Cited by 23
Rahman, M. M., Farahani, M. A., & Wuest, T. (2023) · Journal of Manufacturing and Materials Processing · doi:10.3390/jmmp7050164 · Cited by 18
“We followed the approach proposed in [22] and, in the final experiment, 10 runs were conducted for each deep learning and machine learning algorithm. conducted for each deep learning and machine learning algorithm.”
BackgroundMethodInfluentialUnderstanding Any Time Series Classifier with a Subsequence-based Explainer
Spinnato, F., Guidotti, R., Monreale, A., Nanni, M., Pedreschi, D., & Giannotti, F. (2023) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3624480 · Cited by 19
Hwang, T.-H., Shi, J., & Lee, K. Y. (2023) · IEEE Access · doi:10.1109/access.2023.3328641 · Cited by 21
“An LSTM model includes a cell, input gate, output gate, and forget gate, which help adjust the input loss and prevent the vanishing gradient problem that often arises during backpropagation through time (BPTT) in RNNs [33], [34], [35].”
MethodMiles, G., Smith, M. L., Zook, N., & Zhang, W. (2024) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2024.03.014 · Cited by 19
Deep Neural Network Sleep Scoring Using Combined Motion and Heart Rate Variability Data
Haghayegh, S., Khoshnevis, S., Smolensky, M. H., Diller, K. R., & Castriotta, R. J. (2020) · Sensors · doi:10.3390/s21010025 · Cited by 19
“wake by the classic deep learning (Residual Network [29,30], Fully Convolutional Neural Networks [29,30], Encoder [29,31], and Time Le-Net [29,32]) Architectures applied to activity count data only and also activity count plus heart rate variability (HRV) data of periods (windows) of different durations.”
MethodInfluentialElectromechanical Wave Imaging With Machine Learning for Automated Isochrone Generation
Melki, L., Tourni, M., & Konofagou, E. E. (2021) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2021.3074808 · Cited by 20
“We will exploit the capability of convolutional layers to extract useful knowledge and learn the internal representation of time-series data [60].”
MethodBac, B. H., Nguyen, H., Thảo, N. T., Hạnh, V. T., Duyên, L. T., Dũng, N. T., Du, N. K., & Hiệp, N. H. (2021) · Engineering With Computers · doi:10.1007/s00366-021-01459-8 · Cited by 19
Withington, L., de Vera, D. D. P., Guest, C., Mancini, C., & Piwek, P. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115564 · Cited by 21
Learning Saliency Maps to Explain Deep Time Series Classifiers
Parvatharaju, P. S., Doddaiah, R., Hartvigsen, T., & Rundensteiner, E. A. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482446 · Cited by 25
Human Activity Recognition from Knee Angle Using Machine Learning Techniques
Nazari, F., Nahavandi, D., Mohajer, N., & Khosravi, A. (2021) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc52423.2021.9658988 · Cited by 19
“The first one is to directly feed the window of preprocessed data to the algorithm as the input [32].”
BackgroundAutomatic Driver Identification from In-Vehicle Network Logs
Remeli, M., Lestyán, S., Ács, G., & Biczók, G. (2019) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2019.8917354 · Cited by 20
“Using neural networks is a novel direction in TSC [11], [25], [26], [27].”
BackgroundTime series classification for varying length seriesPreprint
Tan, C. W., Petitjean, F., Keogh, E., & Webb, G. I. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.04341 · Cited by 19
“Numerous time series classification (TSC) algorithms have been proposed (Bagnall et al., 2017; Fawaz et al., 2018), from the classic distance-based nearest neighbour (NN) approaches (Chen and Ng, 2004; Keogh and Ratanamahatana, 2005; Tan et al.”
BackgroundInfluentialCross-Database Evaluation of Deep Learning Methods for Intrapartum Cardiotocography Classification
Mendis, L., Karmakar, D., Palaniswami, M. S., Brownfoot, F., & Keenan, E. (2025) · IEEE Journal of Translational Engineering in Health and Medicine · doi:10.1109/jtehm.2025.3548401 · Cited by 22
“In addition to the models used in existing works for fetal compromise detection, we evaluated three widely used deep learning models for time series classification validated on multiple time series datasets of different domains from the UCR time series archive [34], [35], [36].”
Goodarzi, P., Schütze, A., & Schneider, T. (2025) · Journal of sensors and sensor systems · doi:10.5194/jsss-14-119-2025 · Cited by 22
“As demonstrated by Fawaz et al. (2019), this approach improves performance on challenging tasks.”
InfluentialShim, J., Lee, S., Park, S., Moon, J., Lee, C., & Cho, K. H. (2025) · Desalination · doi:10.1016/j.desal.2025.119193 · Cited by 18
A Review of Time Series Prediction Models Based on Deep Learning
Ao, X., Gong, Y., & He, A. (2025) · IEEE Access · doi:10.1109/access.2025.3602791 · Cited by 24
“In recent years, with the explosive growth of deep learning models in the field of time series forecasting, a substantial body of related survey literature has emerged [3], [8], [10].”
Wang, G., Wang, Y., & Sun, X. (2021) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2021.3068180 · Cited by 23
“How to classify such nonfixed-length time-series data is an important and challenging problem in data mining-time series classification [21]–[23].”
BackgroundNeural Network Techniques for Detecting Intra-Domestic Water Leaks of Different Magnitude
Zese, R., Bellodi, E., Luciani, C., & Alvisi, S. (2021) · IEEE Access · doi:10.1109/access.2021.3111113 · Cited by 21
“Hence, they are specialized for processing data that have a known, grid-like topology, such as time series [30] and images [31].”
BackgroundDeep Crash Detection From Vehicular Sensor Data With Multimodal Self-Supervision
Kubin, L., Bianconcini, T., de Andrade, D. C., Simoncini, M., Taccari, L., & Sambo, F. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3114816 · Cited by 19
Towards Deeper Neural Networks for Neonatal Seizure Detection
Daly, A., O'Shea, A., Lightbody, G., & Temko, A. (2021) · Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC) · doi:10.1109/embc46164.2021.9629485 · Cited by 18
“More recently deep learning based seizure detection algorithms have improved the algorithmic performance [5-9].”
BackgroundAlwadei, S., Farahat, A. M., Ahmed, M., & Kambezidis, H. D. (2022) · Applied Sciences · doi:10.3390/app12020717 · Cited by 18
Imbalanced Heart Sound Signal Classification Based on Two-Stage Trained DsaNet
Tian, G., Lian, C., Zeng, Z., Xu, B., Su, Y., Zang, J., Zhang, Z., & Xue, C. (2022) · Cognitive Computation · doi:10.1007/s12559-022-10009-3 · Cited by 20
Supervised machine learning aided behavior classification in pigeons
Wittek, N., Wittek, K., Keibel, C., & Güntürkün, O. (2022) · Behavior Research Methods · doi:10.3758/s13428-022-01881-w · Cited by 18
Post Hoc Explainability for Time Series Classification: Toward a signal processing perspective
Mochaourab, R., Venkitaraman, A., Samsten, I., Papapetrou, P., & Rojas, C. R. (2022) · IEEE Signal Processing Magazine · doi:10.1109/msp.2022.3155955 · Cited by 20
Hall, S., Newman, S. T., Loukaides, E. G., & Shokrani, A. (2022) · Procedia CIRP · doi:10.1016/j.procir.2022.05.110 · Cited by 19
“However, RNNs do run into a problem with exploding or vanishing gradients, where if the gradient is too small, the weight parameter updates tend towards zero, and if it is too large, the model weights will become too large and eventually become ‘Not a Number (NaN)’ [3].”
BackgroundDecision Mining with Time Series Data Based on Automatic Feature Generation
Scheibel, B., & Rinderle‐Ma, S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07472-1_1 · Cited by 18
“In addition, several deep learning methods [8] have been proposed.”
MethodRel-CNN: Learning Relationship Features in Time Series for Classification
He, F., Fu, T.-Y., & Lee, W.-C. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3186963 · Cited by 18
“DEVICE 6 [200, 750] [76, 720] [2, 10] ECG 7 [200, 5000] [82, 750] [2, 42] IMAGE 29 [40, 3300] [80, 1024] [2, 60] MOTION 14 [166, 4478] [150, 1882] [2, 12] SENSOR 15 [120, 7164] [84, 1024] [2, 11] SIMULATED 6 [200, 5000] [60, 1024] [2, 8] SOUND 1 [2110, 2110] [1024, 1024] [39, 39] SPECTRO 7 [56, 983] [234, 570] [2, 5]…”
BackgroundIdentification of robust deep neural network models of longitudinal clinical measurements
Javidi, H., Mariam, A., Khademi, G., Zabor, E. C., Zhao, R., Radivoyevitch, T., & Rotroff, D. M. (2022) · npj Digital Medicine · doi:10.1038/s41746-022-00651-4 · Cited by 23
How Is the Stroke? Inferring Shot Influence in Badminton Matches via Long Short-term Dependencies
Wang, W., Chan, T.-F., Peng, W.-C., Yang, H.-K., Wang, C.-C., & Fan, Y.-C. (2022) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3551391 · Cited by 22
“Employing CNN can effectively capture local patterns in time-series tasks [14].”
Mahamune, R., & Laskar, S. H. (2022) · International Journal of Imaging Systems and Technology · doi:10.1002/ima.22821 · Cited by 18
“71 Generally, the values of the kappa score range between 1 and (cid:4) 1, where positive 1 indicates perfect classification.”
BackgroundCycleSense: Detecting near miss incidents in bicycle traffic from mobile motion sensors
Karakaya, A.-S., Ritter, T., Bießmann, F., & Bermbach, D. (2023) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2023.101779 · Cited by 21
“We can see this in the example of the rather simple CNN-LSTM model which exhibits a relatively close performance to Figure 5: Comparison of the baselines and common model architectures used in the context of DL for TSC [26] with the CycleSense model.”
MethodInfluentialAppliance Detection Using Very Low-Frequency Smart Meter Time Series
Petralia, A., Charpentier, P., Boniol, P., & Palpanas, T. (2023) · ACM International Conference on Future Energy Systems (e-Energy) · doi:10.1145/3575813.3595198 · Cited by 18
“The interest in deep learning methods for time series classification has risen significantly in the past few years [24, 56].”
BackgroundInfluentialShehhi, A. A., & Welsch, R. E. (2023) · Journal Of Big Data · doi:10.1186/s40537-023-00754-z · Cited by 18
“…was predicted using several state-of-the-art deep learning models for time series and sequences, namely: MINImally RandOm Convolutional KErnel Transform (MiniRocket) [18, 30], Residual Network (ResNet) for time series [19], XceptionTime [20], InceptionTime [21] and Transformer for time series [22].”
MethodWu, J., Su, Y., Yang, A., Ren, J., & Xiang, Y. (2023) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2023.107452 · Cited by 18
Jin, Z., Xing, Z., Wang, Y., Fang, S., Gao, X., & Dong, X. (2023) · Sensors · doi:10.3390/s23208643 · Cited by 18
“It was first proposed by Vaswani in 2017 [34].”
BackgroundMethodInfluentialPan, J.-S., Ting, Y.-S., & Yu, J. (2024) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stae068 · Cited by 27
Yousuff, A. R. M., Hasan, M. Z., Anand, R., & Babu, M. R. (2024) · International Journal of Systems Assurance Engineering and Management · doi:10.1007/s13198-023-02200-y · Cited by 18
“While CGM systems offer great potential, their true power lies in the ability to predict glucose levels in advance, allowing for proactive measures to prevent adverse events such as hypoglycemia and hyperglycemia (Fawaz et al. 2019; Fox et al. 2018).”
Mobile Near-infrared Sensing—A Systematic Review on Devices, Data, Modeling, and Applications
Jiang, W., Gonçalves, J., & Kostakos, V. (2024) · ACM Computing Surveys · doi:10.1145/3652596 · Cited by 21
“For example, recent studies in artificial intelligence (AI) show that deep learning models can achieve significantly better performances on image processing [132] and time-series data processing tasks [78].”
BackgroundHeterogeneous Contrastive Learning for Foundation Models and Beyond
Zheng, L., Jing, B., Li, Z., Tong, H., & He, J. (2024) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3637528.3671454 · Cited by 27
Representation learning in intraoperative vital signs for heart failure risk prediction
Chen, Y., & Qi, B. (2019) · BMC Medical Informatics and Decision Making · doi:10.1186/s12911-019-0978-6 · Cited by 18
“The methods used in this paper are the decision tree algorithm [17, 18], gradient boosting machine algorithm [19, 20], logistic regression algorithm [21], Bayesian algorithm [22], SVM [23], random forest [24] and popular deep learning methods [25, 26].”
MethodA Deep Learning‐Based Approach for Modeling the Dynamics of AMPERE Birkeland Currents
Kunduri, B. S. R., Maimaiti, M., Baker, J. B. H., Ruohoniemi, J. M., Anderson, B. J., & Vines, S. K. (2020) · Journal of Geophysical Research Space Physics · doi:10.1029/2020ja027908 · Cited by 19
“Both these tasks require a model that is suitable for capturing complex features in a temporal data set, and a ResNet CNN is one such model (Fawaz et al., 2019; He, Zhang, et al., 2016; Maimaiti et al., 2019).”
MethodLi, Y., Wang, J., Gao, T. Y., Sun, Q., Zhang, L., & Tang, M. (2020) · Computational Intelligence and Neuroscience · doi:10.1155/2020/8886932 · Cited by 18
“,e classification time of a model is affected by many factors, such as the tools that are used in the calculation, the complexity of the model, and the quality of the data [30].”
Tripathi, A. M., & Baruah, R. D. (2020) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn48605.2020.9206725 · Cited by 18
“A well structured review of the various deep learning-based methods proposed to perform the classification of univariate and multivariate time series can be found in [23].”
BackgroundFeature learning using convolutional denoising autoencoder for activity recognition
Noor, M. H. M. (2021) · Neural Computing and Applications · doi:10.1007/s00521-020-05638-4 · Cited by 21
Predictive Analytics of COVID-19 Pandemic: Statistical Modelling Perspective
Kumar, S., M, V. R. S., & Anbarasi, L. J. (2021) · Walailak Journal of Science and Technology (WJST) · doi:10.48048/wjst.2021.15583 · Cited by 18
“Deep learning argues that in classification or regression tasks a hierarchical model is more effective than the surface models [23].”
BackgroundDynamic Barycenter Averaging Kernel in RBF Networks for Time Series Classification
Shi, K., Qin, H., Sima, C., Li, S., Shen, L., & Ma, Q. (2019) · IEEE Access · doi:10.1109/access.2019.2910017 · Cited by 19
“The results of MLP, FCN and ResNet are collected from [17], and the rest of the results come from [47].”
BackgroundMethodTime Series Clustering and Classification
Chen, M. (2020) · Journal of the American Statistical Association · doi:10.1080/01621459.2020.1801281 · Cited by 18
Adjusting for Autocorrelated Errors in Neural Networks for Time SeriesPreprint
Sun, F.-K., Lang, C. I., & Boning, D. S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.12578 · Cited by 20
“On the other hand, NNs for time-series-related tasks (Gamboa, 2017; Chalapathy & Chawla, 2019; Fawaz et al., 2019; Benidis et al., 2020) have become a popular research direction due to NNs’ effectiveness of approximating unknown, nonlinear systems.”
BackgroundRWKV: Reinventing RNNs for the Transformer Era
Peng, B., Alcaide, E., Anthony, Q., Albalak, A., Arcadinho, S., Biderman, S., Cao, H., Cheng, X., Chung, M., Grella, M., et al. (2023) · arXiv · doi:10.48550/arxiv.2305.13048 · Cited by 17
“These applications often involve complex sequential data processing tasks that include nat-ural language understanding, conversational AI, time-series analysis, and even indirect modalities that can be reframed as sequences, such as images and graphs (Brown et al., 2020; Ismail Fawaz et al., 2019; Wu et al., 2020; Alb…”
BackgroundAyena, J. C., Bouayed, A., Arous, M. B., Ouakrim, Y., Loulou, K., Ameyed, D., Savard, I., Kamel, L. E., & Mezghani, N. (2025) · Frontiers in Digital Health · doi:10.3389/fdgth.2025.1581285 · Cited by 27
Adversarial Attacks on Deep Learning-Based False Data Injection Detection in Differential Relays
Saber, A. M., Maheshwari, A., Youssef, A., & Kundur, D. (2025) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2025.3579316 · Cited by 19
“The use of DL models for detecting FDIAs against LCDRs builds on the ability of such models to classify multivariate time-series data with high accuracy [45], [46].”
Šimić, I., Veas, E. E., & Sabol, V. (2025) · Scientific Reports · doi:10.1038/s41598-025-09538-2 · Cited by 23
“Two of the model architectures that were also present in our previous paper are based on the best-performing state-of-the-art DL architectures for time series classification according to Fawaz et al. 7,8 , namely ResNet and InceptionTime.”
Hamzah, H., Mu’arifin, M., Heynoek, F. P., Kurniawan, R., & Kurniawan, A. (2022) · Sport Science and Health · doi:10.17977/um062v2i82020p384-394 · Cited by 19
West, N., Schlegl, T., & Deuse, J. (2021) · International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering (ICBAIE) · doi:10.1109/icbaie52039.2021.9389954 · Cited by 17
“Since a detailed description would go beyond the intended scope of this paper, we again refer to the relevant literature for further explanations [3, 4, 22].”
BackgroundMethodInfluentialLiu, J., Yan, J., Wang, L., Huang, L., He, H., & Liu, H. (2021) · Remote Sensing · doi:10.3390/rs13091804 · Cited by 17
“[6] summarized the current deep learning models, and implemented nine different deep learning models at the same time on the 85 univariable datasets of UCR/UEA and the 12 multivariable datasets of MTS.”
MethodInfluentialiFidgetCube: Tangible Fidgeting Interfaces (TFIs) to Monitor and Improve Mental Wellbeing
Woodward, K., & Kanjo, E. (2020) · IEEE Sensors Journal · doi:10.1109/jsen.2020.3031163 · Cited by 18
“Four of the tested networks (ResNet, TWIESN, Encoder and MCDCNN) have been previously explored using time series data [38] however, their effectiveness for affective modeling has not been explored.”
BackgroundAnalysis and forecasting of rivers pH level using deep learning
Srivastava, A. K., & Cano, A. (2021) · Progress in Artificial Intelligence · doi:10.1007/s13748-021-00270-2 · Cited by 17
“Machine learning models and deep learning algorithms have been conventionally used to predict time series data sets [2,3].”
MethodAnalysis of Customer Loyalty Using Artificial Neural Networks
Chaudhary, A., Bodala, D., Sindhwani, N., & Kumar, A. (2022) · International Mobile and Embedded Technology Conference (MECON) · doi:10.1109/mecon53876.2022.9751904 · Cited by 17
A study of Knowledge Distillation in Fully Convolutional Network for Time Series Classification
Ay, E., Devanne, M., Weber, J., & Forestier, G. (2022) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn55064.2022.9892915 · Cited by 17
“As shown in [10], deep models performing better for TSC are the one using convolutional layers computing 1D temporal convolutions on time series.”
BackgroundMethodInfluentialSelf-citationDeep semi-supervised clustering for multi-variate time-series
Ienco, D., & Interdonato, R. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.10.033 · Cited by 17
A survey on deep learning applications in wheat phenotyping
Zaji, A., Liu, Z., Xiao, G. G., Sangha, J. S., & Ruan, Y. (2022) · Applied Soft Computing · doi:10.1016/j.asoc.2022.109761 · Cited by 20
SG-CF: Shapelet-Guided Counterfactual Explanation for Time Series Classification
Li, P., Bahri, O., Boubrahimi, S. F., & Hamdi, S. M. (2022) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata55660.2022.10020866 · Cited by 17
“However, most of the time series models, especially deep learning models, consider accuracy as their foremost priority without necessarily providing a tracing mechanism of the model’s decision-making process which limits their interpretability [9].”
BackgroundMethodGao, Z., Tang, J., Xia, J., Zheng, C.-H., & Wei, P.-J. (2023) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2023.3282212 · Cited by 17
“CNN shines in the field of time series classification [44] due to its convolution operation and local receptive field.”
BackgroundHnoohom, N., Mekruksavanich, S., & Jitpattanakul, A. (2023) · Intelligent Automation & Soft Computing · doi:10.32604/iasc.2023.038584 · Cited by 17
Training LSTMS with circular-shift epochs for accurate event forecasting in imbalanced time series
Chen, X., & Gupta, L. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.121701 · Cited by 18
A Deep Dive into Perturbations as Evaluation Technique for Time Series XAI
Schlegel, U., & Keim, D. A. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-44070-0_9 · Cited by 19
Yousef, I., Tulsyan, A., Shah, S. L., & Gopaluni, R. B. (2023) · Journal of Process Control · doi:10.1016/j.jprocont.2023.103127 · Cited by 17
Metadata
- Authors
- Ismail Fawaz, H., Forestier, G., Weber, J., Idoumghar, L., & Muller, P.-A.
- Affiliations
- Université de Haute-Alsace (FR)
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2019-03-02
- Volume
- 33
- Issue
- 4
- Pages
- 917-963
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2892035503
- Cited by
- 3,342
- References
- 149
- Citations by year
- 2026: 385 · 2025: 493 · 2024: 507 · 2023: 517 · 2022: 527 · 2021: 494 · 2020: 328 · 2019: 85
- FWCI
- 227.10
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Data Mining and Knowledge Discovery (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- HAL Portal Artxiker (Hindustan Aeronautics Limited (India)) (submittedVersion, other-oa)
- HAL (submittedVersion, other-oa)
- arXiv (Cornell University)
- Funders
- Agence Nationale de la Recherche (ANR-17-CE23-0015)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Time Series Analysis and Forecasting
- Physical Sciences › Computer Science › Signal Processing › Music and Audio Processing
- Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
- Keywords
- time series classification, deep neural network, deep learning architectures, convolutional neural networks, ResNet, multivariate time series, univariate time series
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-09, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-09 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review