Pith. sign in

REVIEW 5 major objections 6 minor 96 references

Adaptive Fuzzy Time Series Forecasting via Partially Asymmetric Convolution and Sub-Sliding Window Fusion

T0 review · 5 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper claims that fuzzifying each sliding-window element with global position and tendency information, then processing it with bilateral atrous and partially asymmetric convolutions, yields state-of-the-art time series forecasts on…

desk verdict A promising architecture sketch undermined by an ill-defined core transformation and unverifiable SOTA claims. read the letter →

arxiv 2507.20641 v1 pith:ZA36C4FE submitted 2025-07-28 cs.AI cs.ITmath.IT

Lijian Li This is my paper
classification cs.AIcs.ITmath.IT
keywords adaptivefuzzytimeseriespartiallyasymmetricconvolutionslidingwindowbilateralatrousalgorithmglobalinformationmulti-scalefeaturefusionforecasting
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that time-series forecasting can be made substantially more accurate by enriching each element of a sliding window with global positional and tendency information drawn from the whole series, and then processing that enriched representation with a tailored convolutional stack. The proposed pipeline fuzzifies the differenced series, embeds each element in a fuzzy value range with an assigned interval position and a tendency accumulation, thins the reconstruction with a bilateral atrous algorithm, and applies partially asymmetric convolutions that use different filter lengths horizontally and vertically to mine sub-windows within windows. The payoff claimed is state-of-the-art results: the lowest mean absolute error and root-mean-square error on most of 43 benchmark datasets compared with 18 baselines. If true, the work would show that careful global-context injection plus a lightweight convolutional design can rival or beat transformer-based forecasters.

What carries the argument

The load-bearing mechanism is the fuzzified feature transformation: each difference-series element $\varsigma_i$ in a sliding window is embedded into a vector spanning the universe of discourse $\mathcal{U} = [\varsigma_{\min} - \sigma, \varsigma_{\max} + \sigma]$, with the element placed at its assigned interval position $\varphi$ and augmented by a tendency accumulation $\varrho$, then a padding-crop policy (PCP) is meant to align all reconstructed vectors to a common shortest length $SL$. This aligned tensor is thinned by a bilateral atrous algorithm (BAA) that convolves only the two sides of each reconstructed element, and then processed by partially asymmetric convolutions, i.e., separate vertical $f_V$ and horizontal $f_H$ filters with possibly different lengths, which build sub-windows inside the original sliding window and are fused with a residual-like branch of average pooling and $1 \times 1$ convolution.

What would settle it

Inspect Eq. (6) with $\varphi = N$: the vector's right side starts at $\alpha_r + (N+1)\tau$, beyond the universe of discourse boundary $\alpha_r$, so the padding and cropping described in Eq. (9) cannot be lossless for all elements simultaneously; computing the padded-cropped vectors for boundary elements would settle whether the fuzzified features are well-defined. A complementary statistical check is to replace the PCP with fixed one-sided padding and see whether the reported MAE/RMSE on the 43 datasets changes materially.

Watch

Extended reading notes

Core claim

The paper's central claim is that time-series forecasting can be improved by giving every element inside a sliding window a globally assigned position in a fuzzy universe of discourse plus a tendency accumulation value, and then learning from the resulting reconstructed vectors with a bilateral atrous algorithm followed by partially asymmetric convolutions whose horizontal and vertical filter lengths can differ. On 43 benchmark datasets spanning yearly to hourly frequencies across domains such as energy, traffic, weather, finance, and web traffic, the method is reported to achieve the lowest MAE and RMSE among 18 baselines on most datasets, with error reductions exceeding 75% in some cases. The paper acknowledges weaker results on two natural-law datasets (Sunspot and US Births) and on the multivariate NN5 banking dataset, attributing this to limited long-term memory.

Load-bearing premise

The whole approach depends on the padding-and-cropping step aligning every rebuilt element vector to the same shortest length while keeping each element's assigned fuzzy position and tendency value intact, so the tensors that enter the convolution stages are well-defined.

Editorial extensions

If this is right

  • On most of 43 benchmark datasets the method reports lower MAE and RMSE than all 18 baselines, with error reductions over 75% in some cases.
  • The method performs particularly well on M-series and KDD Cup datasets, while the paper reports weaker results on Sunspot and US Births, which it attributes to limited capture of long-term natural-law patterns.
  • Larger sliding window sizes continue to reduce prediction error on some datasets (e.g., NN5 Daily and KDD Cup), supporting the claim that the global-context allocation improves long-range modeling.
  • The architecture's variable horizontal and vertical filter lengths let the model construct sub-windows within existing sliding windows, giving a fine-grained multi-scale representation that the paper says drives the gains.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the global-position allocation is what delivers the gains, the same fuzzified embedding could be applied to other sequence tasks (e.g., anomaly detection or classification) that currently rely on local convolutions only.
  • The PCP alignment is the testable hinge: a reader could re-run the pipeline with fixed one-sided padding and compare errors; if results change little, the claim rests mainly on the convolution design rather than the alignment.
  • The reported advantage over transformer-based baselines suggests CNN-style models with global context injection may be a competitive lightweight alternative for long-horizon forecasting, but that reading goes beyond the paper's own claims.
  • The parameter study indicates performance saturates around window sizes 10–12 for some datasets and keeps improving to 20 for others, implying the optimal window depends on data frequency and domain.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 6 minor

Summary. The paper proposes a fuzzy-time-series-based convolutional forecasting model combining an improved fuzzification scheme, a bilateral atrous algorithm, and a partially asymmetric convolution architecture. The authors claim state-of-the-art performance on most of 43 time series datasets compared with 18 baselines, supported by MAE/RMSE tables, a Nemenyi test figure, and a parameter study. The central derivation in Section 4.3 is the padding-crop policy (PCP) that is supposed to align fuzzified element vectors to a common length while preserving interval-position and tendency information; this construction feeds the subsequent bilateral atrous and convolution stages.

Significance. If the proposed construction were sound and the experimental protocol were fully specified, the paper would offer a reasonably novel combination of fuzzy preprocessing with asymmetric convolutions and a broad empirical comparison, and the claimed improvements on high-error datasets such as KDD, A.E.D, and F-M would be practically interesting. The paper also has some credit-worthy ingredients: the universe of discourse is set automatically from the data standard deviation, the bilateral atrous idea is explicit, and the comparison includes a large set of modern baselines. However, the significance of the central SOTA claim is undermined by a load-bearing internal inconsistency in the feature-construction equations and by an experimental presentation that lacks the protocol details needed to reproduce or statistically support the reported results.

major comments (5)
  1. [§4.3, Eq. (6)] Equation (6) is internally inconsistent. For E(ς_{i+S−1}) = [α_l, ..., α_l + φτ, ς, α_r + (φ+1)τ, ..., α_r]^T with τ = (α_r − α_l)/N and φ ∈ [1,N], the right-hand segment begins at α_r + (φ+1)τ, which is strictly greater than α_r for every φ ≥ 1, so that segment lies outside the universe of discourse U = [α_l, α_r]. The expression "..., α_r" cannot denote a sub-vector of U, and the same issue appears in Eq. (8). Because the fuzzified feature tensor Y_{e,i} is defined from these expanded vectors, the model input to the bilateral atrous and convolution stages is not well-defined as written.
  2. [§4.3, Eqs. (8)–(9), Algorithm 1] The padding-crop policy (PCP) is not a well-defined algorithm. The natural lengths of the two sides of E′(ς_{i+S−1}) depend on φ: the left side has about φ entries and the right side about N − φ entries (if the vector were inside U). After padding the shorter side and cropping to the "total shortest length SL", the retained interval position α_l + φτ and the tendency-accumulation value ϱ are not invariant across elements, since cropping removes different amounts from different sides for different φ. Algorithm 1 never states how SL is computed, how cropping preserves φ and ϱ, or how the output Y_{e,i} is indexed. Consequently the feature tensor entering Eq. (10) is ill-defined, and the numerical results in Tables 2–5 cannot be reproduced from the paper's own specification.
  3. [§5, Tables 2–5 and implementation details] No experimental protocol is reported. The text gives the optimizer, scheduler, loss, and epoch count, but does not specify train/validation/test splits, forecast horizons per dataset, number of repeated runs, seeds, or error bars. The tables appear to contain single-run MAE/RMSE values, which is insufficient to support the abstract's claim that the SOTA results are "fully verified." A statistical comparison would require at least multiple seeds with reported variability and a clear statement of how hyperparameters S, V, H, η, K were selected for each dataset.
  4. [Tables 4 and 5, S10 row; Table 1] The S10 row reports MAE = 0.07 and RMSE = 0.07 for the proposed method. Since RMSE ≥ MAE always, equality can occur only if every absolute error is identical; for a continuous solar irradiance series this is highly implausible and suggests a data-handling or reporting error. Additionally, Table 1 labels M4 Weekly and M4 Hourly with the abbreviation "M1 Y" (the same as M1 Yearly), and the table captions call the datasets "M4 W" and "M4 H" in Tables 2–3; these wrong labels undermine the reliability of the benchmark tabulation.
  5. [§4.2, §4.5, §5.3] The paper claims that the fuzzification process "does not require human involvement" and automatically assigns global information, but the method still relies on manually configured hyperparameters: sliding-window size S, vertical/horizontal filter lengths V and H, channel growth rate η, and repetition count K. Section 5.3 shows that performance varies substantially with S and η, yet no per-dataset selection rule or search protocol is given. The reproducibility advantage claimed in the Introduction is therefore overstated.
minor comments (6)
  1. [§2] The survey paragraph beginning "Fine-grained advances in FTS (2022–2025).." contains inconsistent citation formatting (e.g., "PhamToan, Dinh and VoThiHang" without initials), duplicated reference entries ([16] and [17] are identical), and a long chain of references on evidential reasoning and medical image segmentation ([34]–[56]) that is only tenuously connected to fuzzy time series forecasting.
  2. [Eq. (6) and surrounding text] The symbol φ is used both as the length of each interval in the text and as the interval index in Eq. (6), while τ is introduced as the interval length; this notational clash obscures the intended construction and should be resolved.
  3. [Figure 2 and Eq. (16)] The spelling "BlinearLayer" in Figure 2 differs from "BLINEAR" in Eq. (16); please unify the notation.
  4. [Algorithm 1] The last comment in Algorithm 1 ("avoid information leak") describes an important design detail but is never explained in the body text; its mechanism and effect on the difference-series restoration should be described.
  5. [Figure 4 and §5.2] The caption of Figure 4 calls the test a "Friedman Test" while the text describes a Nemenyi post-hoc test; no critical difference (CD) values or significance levels are reported in the figure, so the visual claim of "absolute leading performance" is not quantitatively supported.
  6. [Eq. (11)] The operator ◦ in Eq. (11) is not defined; the atrous operation was defined with summation in Eq. (2), and the relationship between the two notations should be clarified.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the SOTA claim rests on external benchmark comparisons and no equation reduces to its own input; self-citations are survey context only.

full rationale

The derivation chain is self-contained against external benchmarks. The pipeline (difference module Eq. 3, division Eq. 4, fuzzified transformation Eqs. 5-9, bilateral atrous Eq. 11, partially asymmetric convolution Eq. 13, fusion Eq. 15, bilinear output Eq. 16) defines each stage from raw input data and learned network weights; no parameter is fitted to the evaluation target and then renamed a prediction. The only fitted quantities are standard neural-network weights, and the reported MAE/RMSE are computed on held-out test portions of 43 external datasets, so the SOTA claim is empirically falsifiable outside the paper's own construction. Self-citations to He/Li works in Section 2 (refs. 40-56) are background survey entries for evidential fusion, clustering, and segmentation; none of them is invoked to justify the proposed forecasting equations or to forbid alternative architectures, so they are not load-bearing. The padding-crop policy ambiguity in Eqs. 6-9 (the undefined SL and the segment starting beyond alpha_r) is an internal consistency/reproducibility concern, not a circularity: no equation in that passage is equivalent to the paper's own input by construction. Likewise, unreported per-dataset hyperparameter selection would be selection bias, not circular derivation. Accordingly no circular step is exhibited under the required quote-and-reduction standard.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The central claim depends on four unreported architectural hyperparameters (S, V, H, K, eta) and on three unproved design properties of the fuzzified preprocessing and convolution. No code or data artifacts are shipped, so these assumptions cannot be checked. The paper introduces no new physical or mathematical entities.

free parameters (4)
  • Sliding window size S = not reported
    The sub-window length in Eq. (4); Figure 5 shows prediction error changes with S, but the per-dataset values used for Tables 2-5 are never listed.
  • Vertical and horizontal filter lengths (V, H) = not reported
    Central to the partially asymmetric convolution in Eq. (13); the paper says V and H vary for different datasets but does not give values.
  • Channel growth rate eta = not reported
    Sets the output channel count in Eq. (13); examined in Figure 5 but the final setting per dataset is not reported.
  • Repetition count K = not reported
    Number of vertical/horizontal filter pairs in Eq. (13); only described as depending on feature map size.
assumptions (4)
  • ad hoc to paper Padding-crop policy (PCP) can align all reconstructed vectors to the same length without losing interval-position information
    Section 4.3, Eq. (9): the paper assumes cropping the shorter side of each E'(zeta) to a common shortest length SL is lossless, but no algorithm or proof is provided, and Eq. (6) is inconsistent at phi=N.
  • ad hoc to paper Bilateral Atrous Algorithm preserves allocated global information and reduces computation
    Section 4.4, Eq. (11): asserted without a complexity analysis or error bound; the 'preserve original information' property is not derived.
  • ad hoc to paper Variable horizontal and vertical filter lengths create meaningful sub-windows within sliding windows
    Section 4.5: this is the stated novelty of the architecture; no ablation isolates its effect from the other components.
  • domain assumption The experimental comparison is fair and standard; hyperparameters were not tuned on test sets
    Section 5: no train/validation/test split, forecast horizon, or per-dataset hyperparameter table is supplied, so comparability with the copied PFSD baseline numbers is assumed without evidence.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Adaptive Fuzzy Time Series Forecasting via Partially Asymmetric Convolution and Sub-Sliding Window Fusion." pith.science (2026). https://pith.science/paper/ZA36C4FE

@misc{pith2026250720641,
  author       = {Pith},
  title        = {Pith review of: Adaptive Fuzzy Time Series Forecasting via Partially Asymmetric Convolution and Sub-Sliding Window Fusion},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZA36C4FE}},
  note         = {Machine review of arXiv:2507.20641}
}
read the original abstract

At present, state-of-the-art forecasting models are short of the ability to capture spatio-temporal dependency and synthesize global information at the stage of learning. To address this issue, in this paper, through the adaptive fuzzified construction of temporal data, we propose a novel convolutional architecture with partially asymmetric design based on the scheme of sliding window to realize accurate time series forecasting. First, the construction strategy of traditional fuzzy time series is improved to further extract short and long term temporal interrelation, which enables every time node to automatically possess corresponding global information and inner relationships among them in a restricted sliding window and the process does not require human involvement. Second, a bilateral Atrous algorithm is devised to reduce calculation demand of the proposed model without sacrificing global characteristics of elements. And it also allows the model to avoid processing redundant information. Third, after the transformation of time series, a partially asymmetric convolutional architecture is designed to more flexibly mine data features by filters in different directions on feature maps, which gives the convolutional neural network (CNN) the ability to construct sub-windows within existing sliding windows to model at a more fine-grained level. And after obtaining the time series information at different levels, the multi-scale features from different sub-windows will be sent to the corresponding network layer for time series information fusion. Compared with other competitive modern models, the proposed method achieves state-of-the-art results on most of popular time series datasets, which is fully verified by the experimental results.

Figures

Figures reproduced from arXiv: 2507.20641 by the authors.

Figure 1
Figure 1. Details of the v1b version of Res2Net BotteleNeck [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Details of the Proposed Model 7 [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Details of the Partially Asymmetric Convolutional Architecture [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Friedman Test Figure: MAE and RMSE Comparison Among Models From the View of Nemenyi Test. [PITH_FULL_IMAGE:figures/full_fig_p017_4.png]
Figure 5
Figure 5. Figure 5: MAE Variations When Parameter η and Window Size Vary 17 [PITH_FULL_IMAGE:figures/full_fig_p017_5.png]
Figure 6
Figure 6. Figure 6: Comparison of Prediction MAE and RMSE on Various Datasets [PITH_FULL_IMAGE:figures/full_fig_p018_6.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

96 extracted references · 72 canonical work pages

  1. [1]

    Y. Pang, X. Zhou, J. Zhang, Q. Sun, J. Zheng, Hierarchical electricity time series prediction with cluster analysis and sparse penalty, Pattern Recognit. 126 (2022) 108555. doi:10.1016/j.patcog.2022.108555

    arXiv 2022

  2. [2]

    Goliatt, Z

    L. Goliatt, Z. M. Yaseen, Development of a hybrid computational intelligent model for daily global solar radiation prediction, Expert Syst. Appl. 212 (2023) 118295. doi:10.1016/j.eswa.2022.118295

    work page arXiv 2023

  3. [3]

    C. Lu, C. K. Reddy, Y. Ning, Self-supervised graph learning with hyperbolic embedding for temporal health event prediction, IEEE Trans. Cybern. 53 (4) (2023) 2124–2136. doi:10.1109/TCYB.2021.3109881. 20

    work page arXiv 2023

  4. [4]

    R. Lou, Z. Lv, M. Guizani, Wave height prediction suitable for maritime transportation based on green ocean of things, IEEE Trans. Artif. Intell. 4 (2) (2023) 328–337. doi:10.1109/TAI.2022.3168246

    work page arXiv 2023

  5. [5]

    Hatemi-J, R

    A. Hatemi-J, R. S. Hacker, A test for multivariate arch effects, Applied Economics Letters 12 (2005) 411–417. doi:10.1080/13504850500092129

    work page doi:10.1080/13504850500092129 2005

  6. [6]

    D. Chen, L. Chen, Y. Zhang, B. Wen, C. Yang, A multiscale interactive recurrent network for time-series forecasting, IEEE Trans. Cybern. 52 (9) (2022) 8793–8803. doi:10.1109/TCYB.2021.3055951

    work page arXiv 2022

  7. [7]

    Goodfellow, Y

    I. Goodfellow, Y. Bengio, A. Courville, Deep Learning, 2016

    2016

  8. [8]

    Fabbri, G

    M. Fabbri, G. Moro, Dow jones trading with deep learning: The unreasonable effectiveness of recurrent neural networks, in: Proceedings of the 7th International Conference on Data Science, Technology and Applications, 2018, pp. 142–153. doi:10.5220/0006922101420153

    work page doi:10.5220/0006922101420153 2018

Show all 96 references
  1. [9]

    Ilhan, O

    F. Ilhan, O. Karaahmetoglu, I. Balaban, S. S. Kozat, Markovian RNN: an adaptive time series prediction network with hmm-based switching for nonstationary environments, IEEE Trans. Neural Networks Learn. Syst. 34 (2) (2023) 715–728

    2023

  2. [10]

    Vaswani, N

    A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, I. Polosukhin, Attention is all you need, in: Annual Conference on Neural Information Processing Systems, 2017, pp. 5998–6008

    2017

  3. [11]

    Y. Nie, N. H. Nguyen, P . Sinthong, J. Kalagnanam, A time series is worth 64 words: Long-term forecasting with transformers, in: The Eleventh International Conference on Learning Representations, 2023

    2023

  4. [12]

    LeCun, B

    Y. LeCun, B. E. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. E. Hubbard, L. D. Jackel, Handwritten digit recognition with a back-propagation network, in: D. S. Touretzky (Ed.), Advances in Neural Information Processing Systems 2, [NIPS Conference, Denver, Colorado, USA,...

    1989

  5. [13]

    K. He, X. Zhang, S. Ren, J. Sun, Deep residual learning for image recognition, in: 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV , USA, June 27-30, 2016, IEEE Computer Society, 2016, pp. 770–778

    2016

  6. [14]

    C. Ma, Y. Zhao, G. Dai, X. Xu, S. Wong, A novel STFSA-CNN-GRU hybrid model for short-term traffic speed prediction, IEEE Trans. Intell. Transp. Syst. 24 (4) (2023) 3728–3737

    2023

  7. [15]

    S. Bai, J. Z. Kolter, V . Koltun, An empirical evaluation of generic convolutional and recurrent networks for sequence modeling, CoRR abs/1803.01271 (2018). arXiv:1803.01271

    2018 arXiv

  8. [16]

    H. Wu, T. Hu, Y. Liu, H. Zhou, J. Wang, M. Long, Timesnet: Temporal 2d-variation modeling for general time series analysis, in: International Conference on Learning Representations, 2023

    2023

  9. [17]

    H. Wu, T. Hu, Y. Liu, H. Zhou, J. Wang, M. Long, Timesnet: Temporal 2d-variation modeling for general time series analysis, in: The Eleventh International Conference on Learning Representations, 2023

    2023

  10. [18]

    F. Yao, W. Zhao, M. Forshaw, Y. Song, A self-organizing interval type-2 fuzzy neural network for multi-step time series prediction, arXiv preprint arXiv:2407.08010 (2024). 21

    2024 arXiv

  11. [19]

    Shafi, S

    L. Shafi, S. Jain, P . Agarwal, P . Iqbal, A. R. Sheergojri, An improved fuzzy time series forecasting model based on hesitant fuzzy sets, Journal of Fuzzy Extension and Applications 5 (2) (2024) 173–189

    2024

  12. [20]

    PhamToan, N

    D. PhamToan, N. VoThiHang, B. PhamThi, Improving forecasting model for fuzzy time series using the self- updating clustering and bi-directional long short term memory algorithm, Expert Systems with Applications 241 (2024) 122767

    2024

  13. [21]

    T. Zhan, Y. He, Y. Deng, Z. Li, Differential convolutional fuzzy time series forecasting, IEEE Transactions on Fuzzy Systems 32 (3) (2023) 831–845

    2023

  14. [22]

    Q. Liu, R. Zhang, Interval type-2 fuzzy c-means forecasting model for fuzzy time series, Applied Soft Comput- ing 123 (2022) 108865

    2022

  15. [23]

    A. C. V . Pinto, T. E. Fernandes, P . C. Silva, F. G. Guimar˜aes, C. Wagner, E. Pestana de Aguiar, Interval type-2 fuzzy set based time series forecasting using a data-driven partitioning approach, Evolving Systems 13 (5) (2022) 703–721

    2022

  16. [24]

    Ashraf, M

    S. Ashraf, M. S. Chohan, S. Askar, N. Jabbar, q-rung orthopair fuzzy time series forecasting technique: Prediction based decision making, AIMS Mathematics 9 (3) (2024) 5633–5660

    2024

  17. [25]

    H. Chen, X. Gao, Q. Wu, An enhanced fuzzy time series forecasting model integrating fuzzy C-means clustering, the principle of justifiable granularity, and particle swarm optimization, Symmetry 17 (5) (2025) 753. doi:10.3390/sym17050753

    2025 doi

  18. [26]

    Didugu, M

    G. Didugu, M. Gandhudi, P . Alphonse, G. Gangadharan, Vwfts-pso: a novel method for time series forecasting using variational weighted fuzzy time series and particle swarm optimization, International Journal of General Systems 54 (4) (2025) 540–559

    2025

  19. [27]

    Wang, C.-J

    S. Wang, C.-J. Lin, A novel fuzzy time series model based on improved sparrow search and ceemd, Applied Soft Computing 127 (2023) 109383

    2023

  20. [28]

    A. K. Singh, E. Prasetyo, Monthly rainfall forecasting using high order singh’s fuzzy time series, Asian Journal of Probability and Statistics 24 (2024) 12–28

    2024

  21. [29]

    X. Chen, M. Wu, Real-time covid-19 forecasting via a fuzzy–grey–markov model, Computational and Applied Mathematics 43 (2024) 25

    2024

  22. [30]

    Ahmed, J

    B. Ahmed, J. Khan, Forecasting covid-19 active cases with a hybrid logistic growth and fuzzy time series model, Scientific Reports 15 (2025) 67161

    2025

  23. [31]

    Kocak, A

    F. Kocak, A. Ozkan, Higher-order circular intuitionistic fuzzy time series forecasting for stock index prediction, Decision Analytics Journal 10 (2024) 100028

    2024

  24. [32]

    N. B. Alam, H. Wahid, Stock price forecasting using fuzzy c-means and type-2 fuzzy time series, Barekeng: Journal of Mathematics and Its Applications 18 (2) (2024) 233–250

    2024

  25. [33]

    Liu, Forecasting stock prices based on multivariable fuzzy time series, AIMS Mathematics 8 (6) (2023) 643–662

    Z. Liu, Forecasting stock prices based on multivariable fuzzy time series, AIMS Mathematics 8 (6) (2023) 643–662. 22

    2023

  26. [34]

    Y. He, F. Xiao, A new base function in basic probability assignment for conflict management, Applied Intelli- gence 52 (4) (2022) 4473–4487

    2022

  27. [35]

    Y. He, F. Xiao, Conflicting management of evidence combination from the point of improvement of basic probability assignment, International Journal of Intelligent Systems 36 (5) (2021) 1914–1942

    2021

  28. [36]

    Y. He, Y. Deng, Mmget: a markov model for generalized evidence theory, Computational and Applied Mathematics 41 (2022) 1–41

    2022

  29. [37]

    Y. He, Y. Deng, Tdqmf: Two-dimensional quantum mass function, Information Sciences 621 (2023) 749–765

    2023

  30. [38]

    Y. He, Y. Deng, Ordinal belief entropy, Soft Computing 27 (11) (2023) 6973–6981

    2023

  31. [39]

    Y. He, Y. Deng, Ordinal fuzzy entropy, Iranian Journal of Fuzzy Systems 19 (3) (2022) 171–186

    2022

  32. [40]

    Y. He, Y. Bi, L. Li, C.-M. Pun, W. Jiao, Z. Jin, Mutual evidential deep learning for semi-supervised medical image segmentation, in: 2024 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), IEEE, 2024, pp. 2010–2017

    2024

  33. [41]

    Y. He, L. Li, Uncertainty-aware evidential fusion-based learning for semi-supervised medical image segmenta- tion, arXiv preprint arXiv:2404.06177 (2024)

    2024 arXiv

  34. [42]

    Y. He, L. Li, T. Zhan, C.-M. Pun, W. Jiao, Z. Jin, Co-evidential fusion with information volume for semi- supervised medical image segmentation, Pattern Recognition 166 (2025) 111639

    2025

  35. [43]

    He, Epl: Evidential prototype learning for semi-supervised medical image segmentation, arXiv preprint arXiv:2404.06181 (2024)

    Y. He, Epl: Evidential prototype learning for semi-supervised medical image segmentation, arXiv preprint arXiv:2404.06181 (2024)

    2024 arXiv

  36. [44]

    Y. He, L. Li, T. Zhan, W. Jiao, C.-M. Pun, Generalized uncertainty-based evidential fusion with hybrid multi- head attention for weak-supervised temporal action localization, in: ICASSP 2024-2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)...

    2024

  37. [45]

    L. Li, Y. He, C.-M. Pun, An adaptive framework for multi-view clustering leveraging conditional entropy optimization, in: ICASSP 2025-2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2025

    2025

  38. [46]

    L. Li, Y. He, L. Li, Nndf: A new neural detection network for aspect-category sentiment analysis, in: Interna- tional Conference on Knowledge Science, Engineering and Management, Springer International Publishing Cham, 2022, pp. 339–355

    2022

  39. [47]

    T. Xu, K. Yan, Y. He, S. Gao, K. Yang, J. Wang, J. Liu, Z. Liu, Spatio-temporal variability analysis of vegetation dynamics in china from 2000 to 2022 based on leaf area index: A multi-temporal image classification perspective, Remote Sensing 15 (12) (2023) 2975

    2023

  40. [48]

    Y. He, L. Li, T. Zhan, A matrix-based distance of pythagorean fuzzy set and its application in medical diagnosis, arXiv preprint arXiv:2102.01538 (2021)

    2021 arXiv

  41. [49]

    Huang, Y

    C.-j. Huang, Y. He, X. Han, W. Jiao, Z. Jin, L. Wang, Unitrans: A unified vertical federated knowledge transfer framework for enhancing cross-hospital collaboration, arXiv preprint arXiv:2501.11388 (2025). 23

    2025 arXiv

  42. [50]

    Y. Bi, E. Che, Y. Chen, Y. He, J. Qu, Multi-prototype-based embedding refinement for medical image seg- mentation, in: ICASSP 2025-2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2025, pp. 1–5

    2025

  43. [51]

    L. Li, Y. He, C.-M. Pun, Efficient prototype consistency learning in semi-supervised medical image segmentation via joint uncertainty and data augmentation, in: 2024 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), IEEE, 2024, pp. 2114–2121

    2024

  44. [52]

    X. Chen, Z. Tao, K. Zhang, C. Zhou, W. Gu, Y. He, M. Zhang, X. Cai, H. Zhao, Z. Jin, Revisit self-debugging with self-generated tests for code generation, arXiv preprint arXiv:2501.12793 (2025)

    2025 arXiv

  45. [53]

    Y. He, W. Song, L. Li, T. Zhan, W. Jiao, Residual feature-reutilization inception network, Pattern Recognition 152 (2024) 110439

    2024

  46. [54]

    L. Li, Z. Jin, Y. He, D. Jin, H. Duan, Z. Tao, X. Zhang, J. Li, Rethinking regularization methods for knowledge graph completion, arXiv preprint arXiv:2505.23442 (2025)

    2025 arXiv

  47. [55]

    L. Li, Z. Jin, Y. Zhang, D. Jin, C. Dou, Y. He, X. Zhang, H. Zhao, Towards structure-aware model for multi-modal knowledge graph completion, arXiv preprint arXiv:2505.21973 (2025)

    2025 arXiv

  48. [56]

    L. Li, Z. Jin, X. Zhang, H. Duan, J. Wang, Z. Tao, H. Zhao, X. Zhu, Multi-view riemannian manifolds fusion enhancement for knowledge graph completion, IEEE Transactions on Knowledge and Data Engineering (2025)

    2025

  49. [57]

    J. Liu, Q. Hou, Z. Liu, M. Cheng, Poolnet+: Exploring the potential of pooling for salient object detection, IEEE Trans. Pattern Anal. Mach. Intell. 45 (1) (2023) 887–904

    2023

  50. [58]

    van den Oord, S

    A. van den Oord, S. Dieleman, H. Zen, K. Simonyan, O. Vinyals, A. Graves, N. Kalchbrenner, A. W. Senior, K. Kavukcuoglu, Wavenet: A generative model for raw audio (2016) 125

    2016

  51. [59]

    Liu, Time series forecasting via learning convolutionally low-rank models, IEEE Trans

    G. Liu, Time series forecasting via learning convolutionally low-rank models, IEEE Trans. Inf. Theory 68 (5) (2022) 3362–3380

    2022

  52. [60]

    X. Ding, Y. Guo, G. Ding, J. Han, Acnet: Strengthening the kernel skeletons for powerful CNN via asymmetric convolution blocks, in: 2019 IEEE/CVF International Conference on Computer Vision, 2019, pp. 1911–1920

    2019

  53. [61]

    L. Chen, G. Papandreou, I. Kokkinos, K. Murphy, A. L. Yuille, Semantic image segmentation with deep convolutional nets and fully connected crfs, in: 3rd International Conference on Learning Representations, ICLR 2015, 2015

    2015

  54. [62]

    L. Chen, G. Papandreou, I. Kokkinos, K. Murphy, A. L. Yuille, Deeplab: Semantic image segmentation with deep convolutional nets, atrous convolution, and fully connected crfs, IEEE Trans. Pattern Anal. Mach. Intell. 40 (4) (2018) 834–848

    2018

  55. [63]

    M. Liu, A. Zeng, Q. Lai, R. Gao, M. Li, J. Qin, Q. Xu, T-wavenet: A tree-structured wavelet neural network for time series signal analysis, in: The Tenth International Conference on Learning Representations, ICLR 2022, Virtual Event, April 25-29, 2022, OpenReview.net, 2022

    2022

  56. [64]

    L. A. Zadeh, Fuzzy sets, Inf. Control. 8 (3) (1965) 338–353. 24

    1965

  57. [65]

    H. Guo, L. Wang, X. Liu, W. Pedrycz, Information granulation-based fuzzy clustering of time series, IEEE Trans. Cybern. 51 (12) (2021) 6253–6261

    2021

  58. [66]

    Chen, Forecasting enrollments based on fuzzy time series, Fuzzy Sets Syst

    S. Chen, Forecasting enrollments based on fuzzy time series, Fuzzy Sets Syst. 81 (3) (1996) 311–319

    1996

  59. [67]

    Chen, Forecasting enrollments based on high-order fuzzy time series, Cybern

    S. Chen, Forecasting enrollments based on high-order fuzzy time series, Cybern. Syst. 33 (1) (2002) 1–16

    2002

  60. [68]

    J. Hu, M. Wu, L. Chen, K. Zhou, P . Zhang, W. Pedrycz, Weighted kernel fuzzy c-means-based broad learning model for time-series prediction of carbon efficiency in iron ore sintering process, IEEE Trans. Cybern. 52 (6) (2022) 4751–4763

    2022

  61. [69]

    Zhang, Y

    D. Zhang, Y. Xu, Y. Peng, C. Du, N. Wang, M. Tang, L. Lu, J. Liu, An interpretable station delay prediction model based on graph community neural network and time-series fuzzy decision tree, IEEE Trans. Fuzzy Syst. 31 (2) (2023) 421–433

    2023

  62. [70]

    M. Han, S. Zhang, M. Xu, T. Qiu, N. Wang, Multivariate chaotic time series online prediction based on improved kernel recursive least squares algorithm, IEEE Trans. Cybern. 49 (4) (2019) 1160–1172

    2019

  63. [71]

    Krizhevsky, I

    A. Krizhevsky, I. Sutskever, G. E. Hinton, Imagenet classification with deep convolutional neural networks, Commun. ACM 60 (6) (2017) 84–90

    2017

  64. [72]

    Szegedy, V

    C. Szegedy, V . Vanhoucke, S. Ioffe, J. Shlens, Z. Wojna, Rethinking the inception architecture for computer vision, in: 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV , USA, June 27-30, 2016, 2016, pp. 2818–2826

    2016

  65. [73]

    Szegedy, S

    C. Szegedy, S. Ioffe, V . Vanhoucke, A. A. Alemi, Inception-v4, inception-resnet and the impact of residual connections on learning, in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017, pp. 4278–4284

    2017

  66. [74]

    S. Xie, R. B. Girshick, P . Doll´ar, Z. Tu, K. He, Aggregated residual transformations for deep neural networks, in: 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017, pp. 5987–5995

    2017

  67. [75]

    X. Ding, X. Zhang, N. Ma, J. Han, G. Ding, J. Sun, Repvgg: Making vgg-style convnets great again, in: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2021, virtual, June 19-25, 2021, Computer Vision Foundation / IEEE, 2021, pp. 13733–13742

    2021

  68. [76]

    S. Gao, M. Cheng, K. Zhao, X. Zhang, M. Yang, P . H. S. Torr, Res2net: A new multi-scale backbone architecture, IEEE Trans. Pattern Anal. Mach. Intell. 43 (2) (2021) 652–662

    2021

  69. [77]

    C. J. Chu, Time series segmentation: A sliding window approach, Inf. Sci. 85 (1-3) (1995) 147–173. doi: 10.1016/0020-0255(95)00021-G. URL https://doi.org/10.1016/0020-0255(95)00021-G

    1995 doi

  70. [78]

    Godahewa, C

    R. Godahewa, C. Bergmeir, G. I. Webb, R. J. Hyndman, P . Montero-Manso, Monash time series forecasting archive, in: Neural Information Processing Systems Track on Datasets and Benchmarks, 2021

    2021

  71. [79]

    B. Box, G. Jenkins, G. Reinsel, G. Ljung, Time Series Analysis: Forecasting and Control, Vol. 68, 2016

    2016

  72. [80]

    R. J. Hyndman, G. Athanasopoulos, Forecasting: principles and practice, OTexts, 2018. 25

    2018

  73. [81]

    De Livera, R

    A. De Livera, R. Hyndman, R. Snyder, Forecasting time series with complex seasonal patterns using exponential smoothing, Journal of the American Statistical Association 106 (2010) 1513–1527

    2010

  74. [82]

    Holt, Forecasting trends and seasonal by exponentially weighted averages, Office of Naval Research Memorandum 20 (01 1957)

    C. Holt, Forecasting trends and seasonal by exponentially weighted averages, Office of Naval Research Memorandum 20 (01 1957)

    1957

  75. [83]

    Assimakopoulos, K

    V . Assimakopoulos, K. Nikolopoulos, The theta model: A decomposition approach to forecasting, International Journal of Forecasting 16 (2000) 521–530

    2000

  76. [84]

    Hyndman, A

    R. Hyndman, A. Koehler, K. Ord, R. Snyder, Forecasting with exponential smoothing. the state space approach (01 2008)

    2008

  77. [85]

    J. R. Trapero, N. Kourentzes, R. Fildes, On the identification of sales forecasting models in the presence of promotions, J. Oper. Res. Soc. 66 (2) (2015) 299–307

    2015

  78. [86]

    L. O. Prokhorenkova, G. Gusev, A. Vorobev, A. V . Dorogush, A. Gulin, Catboost: unbiased boosting with categorical features, in: Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2...

    2018

  79. [87]

    Flunkert, D

    V . Flunkert, D. Salinas, J. Gasthaus, Deepar: Probabilistic forecasting with autoregressive recurrent networks, International Journal of Forecasting 36 (04 2017)

    2017

  80. [88]

    H. Zhou, S. Zhang, J. Peng, S. Zhang, J. Li, H. Xiong, W. Zhang, Informer: Beyond efficient transformer for long sequence time-series forecasting, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35, 2021, pp. 11106–11115

    2021

  81. [89]

    T. Zhou, Z. Ma, Q. Wen, X. Wang, L. Sun, R. Jin, Fedformer: Frequency enhanced decomposed transformer for long-term series forecasting, arXiv preprint arXiv:2201.12740 (2022)

    2022 arXiv

  82. [90]

    S. Liu, H. Yu, C. Liao, J. Li, W. Lin, A. X. Liu, S. Dustdar, Pyraformer: Low-complexity pyramidal attention for long-range time series modeling and forecasting, in: The Tenth International Conference on Learning Representations, ICLR 2022, 2022

    2022

  83. [91]

    B. N. Oreshkin, D. Carpov, N. Chapados, Y. Bengio, N-BEATS: neural basis expansion analysis for interpretable time series forecasting, in: 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020, 2020

    2020

  84. [92]

    Borovykh, S

    A. Borovykh, S. Bohte, C. W. Oosterlee, Conditional time series forecasting with convolutional neural networks, arXiv preprint arXiv:1703.04691 (2017)

    2017 arXiv

  85. [93]

    Y. Hu, F. Xiao, Network self attention for forecasting time series, Appl. Soft Comput. 124 (2022) 109092

    2022

  86. [94]

    Y. Hu, F. Xiao, An efficient forecasting method for time series based on visibility graph and multi-subgraph similarity, Chaos, Solitons & Fractals 160 (2022) 112243

    2022

  87. [95]

    Y. Hu, F. Xiao, Time series forecasting based on fuzzy cognitive visibility graph and weighted multi-subgraph similarity, IEEE Transactions on Fuzzy Systems (2022). 26

    2022

  88. [96]

    Paszke, S

    A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. K¨opf, E. Z. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, L. Fang, J. Bai, S. Chintala, Pytorch: An imperative style, high-per...

    2019

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.