Pith. sign in

REVIEW 4 major objections 5 minor 31 references

Analyzing Patient Daily Movement Behavior Dynamics Using Two-Stage Encoding Model

T0 review · 4 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read The paper claims that a five-component PageRank vector computed from text-encoded daily home activity carries clinically relevant dementia signatures, so similar vectors mark clinically similar patients.

desk verdict A promising pipeline undermined by invalid clinical validation: the paper's own tables contradict its central claim. read the letter →

arxiv 2502.09947 v1 pith:KPCW7XSG submitted 2025-02-14 cs.AI cs.LG

Jin Cui , Alexander Capstick , Payam Barnaghi , Gregory Scott This is my paper
classification cs.AIcs.LG
keywords dementiahomeactivitymonitoringtimeseriesrepresentationlearninglanguagemodelencodingPageRankt-SNElatentstateanalysispersonalizedcare
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

Daily activity records from passive home sensors are noisy, high-dimensional, and hard to compare across patients. This paper claims that a two-stage encoding—turning each day's movement into text, embedding that text with a fine-tuned language model, then projecting and clustering the embeddings and ranking the resulting latent states with PageRank—compresses each participant into a five-number vector that still carries clinically meaningful information. On a test set of fifty people with dementia, participants with the most similar vectors were closer in age and in year-over-year change of cognitive-test scores than participants with the least similar vectors. If the claim holds, a purely behavioral signature from sensor data could help identify comparable cases and support personalized dementia care.

What carries the argument

The load-bearing mechanism is a two-stage encoding chain: daily sensor records are downsampled to 20-minute intervals and written as text strings; a fine-tuned all-MiniLM-L12-v2 sentence transformer embeds each day into a 384-dimensional vector; t-SNE projects those vectors to 2D; k-means identifies five latent states; and a transition matrix is built by counting, for each pair of clusters, how many points lie within a Euclidean distance threshold. PageRank is then run on that transition matrix, and the stationary distribution becomes the participant's five-component deep vector. The transition matrix of Eq. (1) is where raw movement dynamics are converted into a Markov-chain structure, and the PageRank vector is what makes different participants comparable.

What would settle it

Recompute each participant's five-dimensional PageRank vector from the same text embeddings but with a different t-SNE random seed, or build the transition graph directly from the original 384-dimensional embeddings, and check whether the most-similar-patient clinical differences remain smaller than the least-similar differences. If the association vanishes under either change, the claimed clinical signal is an artifact of the projection geometry.

Watch

Extended reading notes

Core claim

The paper's central claim is that the five-dimensional PageRank vector derived from a participant's daily home-activity trajectories is a deep behavioral signature, not just a compression artifact. The authors argue that after language-model encoding and t-SNE projection, the cluster-to-cluster transition graph of a participant's movements can be ranked by PageRank, and the resulting $(1,5)$ vector lets them retrieve the three most and least similar patients for any given participant; the retrieved groups differ less in clinical traits such as age and rate of ADAS-Cog change. They further report that clustering these vectors across fifty participants yields groups that separate along MMSE and ADAS-Cog scores, with the expected inverse relationship between the two cognitive measures. In the paper's framing, the method allows quantitative assessment of the deeper semantics represented by the vector clusters, or latent states.

Load-bearing premise

The whole approach depends on treating Euclidean distances between points in a two-dimensional t-SNE projection as meaningful movement transitions between latent states, even though t-SNE distances are non-metric and projection-dependent and the distance threshold used in the transition matrix is not reported.

Editorial extensions

If this is right

  • The five-component PageRank vector gives a compact, comparable summary of a patient's movement dynamics, so clinicians could rank patients by behavioral similarity without reviewing raw sensor streams.
  • If the clinical similarity result survives validation, passive home sensing could function as a remote, low-burden source of information about dementia progression.
  • Clustering these vectors by cognitive scores suggests that activity-state dynamics reflect cognitive state, which could yield early-warning signals for decline.
  • The same two-stage pipeline should transfer to other irregular, discrete time-series domains where text encoders and graph ranking can be applied.
  • The paper notes the pipeline could be extended to a generative model for producing sensitive medical datasets, supporting data augmentation and alignment.

Reading between the lines

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

  • The paper does not test whether the result survives a change of projection; recomputing the transition graph directly from the original 384-dimensional embeddings would separate a real behavioral signal from a t-SNE artifact.
  • The unreported distance threshold and the seed-dependence of t-SNE mean the five-number vector's run-to-run stability is unknown, and measuring that variance would tell whether the similarity ranking is reproducible.
  • Because most clinical-feature comparisons did not reach statistical significance, the practical promise depends on effect size and replication in a larger cohort rather than on the current p-values.
  • The five latent states could be given behavioral names, such as 'highly mobile', 'room-bound', or 'nocturnal wandering', by linking cluster centroids back to the original room sequences, giving clinicians directly interpretable state semantics.
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

4 major / 5 minor

Summary. The paper proposes a two-stage self-supervised learning framework for analyzing daily movement data from 134 people living with dementia. In the first stage, raw sensor data are downsampled to 20-minute intervals, converted into text strings, and encoded with a fine-tuned all-MiniLM-L12-v2 language model to produce 384-dimensional embeddings. The second stage projects these embeddings with t-SNE, clusters them with K-means to identify latent states, constructs a transition matrix between clusters, and applies PageRank to obtain a per-participant low-dimensional vector. The authors use these PageRank vectors to identify the three most and least similar participants to each participant and compare clinical characteristics (MMSE, ADAS-Cog, HADS, age, etc.) between the groups. The central claim is that the PageRank vectors quantitatively assess deeper latent-state semantics and that the resulting participant similarity reflects clinically meaningful differences.

Significance. If the method worked as claimed, it would offer a novel, interpretable approach to summarizing high-resolution home-sensor data and linking daily behavior patterns to clinical outcomes in dementia. The paper addresses a relevant problem, uses a substantial real-world dataset, and combines text-encoder representation learning with PageRank in a way that is interesting and potentially applicable. However, the current manuscript does not establish the central claim. The mathematical definition of the transition matrix in Eq. (1) is degenerate, the clinical validation in Appendix A.7 is internally inconsistent, and key model parameters are selected on the test set via silhouette scores without held-out validation. The paper's only quantitative support for its central claim is the flawed Appendix A.7, so the significance of the proposed approach remains unsubstantiated.

major comments (4)
  1. [A.4.2, Eq. (1)] The transition matrix defined in Eq. (1) is mathematically degenerate: the numerator and denominator are identical sums with dummy indices renamed, so T_{ij} = 1 whenever at least one pair of points between clusters i and j is within the threshold, and is undefined (0/0) otherwise. Consequently, the transition matrix carries no information about relative transition frequencies, and the PageRank computation in Eq. (2) operates on a matrix that is effectively uniform or undefined. This invalidates the central methodological step of the paper, as the PageRank vectors are derived entirely from this matrix. The threshold parameter is also never reported, and no sensitivity analysis is provided.
  2. [Appendix A.7, Tables 2-5] The clinical validation is internally inconsistent. The text states that in the least-similar comparison the significant features are HADS-Anxiety, Age, and change in ADAS-Cog, but Table 3 reports p = 0.4426 for ΔADAS-Cog and p = 0.0224 for ΔMMSE. The effect sizes in Table 5 are implausible for n = 50 (e.g., Age d = -24.86, ΔMMSE d = -23.02), and Table 4 shows large effect sizes for the most-similar group (ADAS-Cog d = 2.34, HADS-Anxiety d = 2.72), directly contradicting the claim that clinical differences between similar groups are smaller. No test statistic, sample-size calculation, or multiple-comparison correction is reported, so nonsignificant p-values cannot be interpreted as evidence of similarity. Since Appendix A.7 is the only quantitative support for the central claim, that claim is unsupported.
  3. [Section 3 and Appendices A.3, A.5, A.8] The number of daily latent states (K = 5), the 30-day positive-sampling window for triplet selection, the t-SNE hyperparameters, and the patient-level cluster count (K = 6) are all selected using silhouette scores computed on the same test set that is later used for the similarity analysis and clinical comparison. This circular selection procedure means the reported latent-state structure and the PageRank vectors are partly artifacts of fitting choices made on the test data. The manuscript provides no held-out validation, no baseline comparison (e.g., against random embeddings or non-embedding features), and no sensitivity analysis showing that the conclusions are robust to the chosen parameters.
  4. [Section 3] The statement that from the deep vector 'we can easily identify the disease type, age, MMSE, ADAS-Cog scores ... for the three patients most and least similar to any given participant' is an overclaim. The reported analysis only compares group means between most/least similar participants; it does not perform any predictive task, does not report cross-validated performance, and does not provide confidence intervals for the similarity-based assignments. The paper's own characterization as 'preliminary results' and 'initial results' is inconsistent with the strength of this claim.
minor comments (5)
  1. [Table 1] The silhouette scores for the 30-day window are identical (0.554) for K = 4, 5, and 6, so the choice of K = 5 as 'optimal' is not uniquely justified by the reported table.
  2. [Appendix A.2] The procedure for selecting the 50-participant test set from the 134 available participants is not described in terms of inclusion/exclusion criteria; potential selection bias and its effect on generalizability should be discussed.
  3. [Appendix A.1] The code availability statement says notebooks 'will be released after review,' which is not sufficient for reproducibility, and the Sentence-Transformers library is incorrectly attributed to Pedregosa et al. (2011) rather than Reimers and Gurevych.
  4. [Throughout] There are several typos and stylistic inconsistencies, including 'Viualizing data using t-SNE' in the van der Maaten and Hinton reference, 'pariticipants' in the Appendix A.7 heading, inconsistent capitalization of 'Adas-Cog', and the abstract's 'bi-dimensionalized' phrasing.
  5. [Appendix A.3] The fine-tuning procedure is underspecified: the number of epochs, convergence criteria, and which layers of the language model are updated are not stated.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the two-stage encoding and PageRank pipeline is a deterministic transformation of activity data with clinical variables used only in external validation; the main defect is an internally inconsistent clinical appendix, which is a correctness issue, not circularity.

full rationale

The claimed derivation chain (daily activity strings -> MiniLM embeddings -> t-SNE -> K-means clusters -> transition matrix of Eq. (1) -> PageRank vector -> participant similarity -> clinical comparisons in Appendix A.7) is a sequence of deterministic transformations of the activity data; no stage is defined in terms of the clinical variables (MMSE, ADAS-Cog, HADS, age) that are later compared. The clinical variables are not inputs to the contrastive training, clustering, or PageRank construction, so the observation that similar PageRank vectors have certain clinical differences is not equivalent to the inputs by construction. I therefore find no self-definitional or fitted-input-called-prediction circularity. The main weakness is statistical rather than circular: the 30-day window, daily cluster count K=5, patient cluster count K=6, model choice, and t-SNE settings were selected on the same test-period data using silhouette scores (Table 1, Appendices A.3, A.5, A.8), which can inflate the apparent structure but does not make the downstream clinical comparison reduce to a fitted parameter. The citation to Capstick et al. (2024), which shares authors, is for the text-encoding idea and is not load-bearing; the PageRank and clinical analysis are implemented and evaluated in this paper. Per the review rule, I flag an explicit missing support: Section 3 claims 'the clinical differences between similar groups were indeed smaller in features like age, change in ADAS-Cog score (Appendix A.7),' but Appendix A.7's text says the exceptional features in the least-similar group are 'HADS - Anxiety score Age and change in Adas-cog scores,' while Table 3 reports p=0.4426 for delta-ADAS-Cog; and Table 4 shows large effect sizes for the most-similar group (ADAS-Cog d=2.34, HADS-Anxiety d=2.72). This internal inconsistency makes the central clinical claim unsupported, but it is a validity/correctness failure, not a circular derivation.

Assumptions & free parameters 8 free parameters · 6 assumptions · 0 invented entities

The central claim rests on several tunable choices and domain assumptions. The transition threshold, cluster counts, downsampling window, and t-SNE settings are free parameters fitted or chosen on the same data, and the semantic meaning of the latent states is assumed rather than externally validated. No new physical or ontological entities are introduced.

free parameters (8)
  • Downsampling interval = 20 minutes
    Raw second-level data reduced to 72 discrete values per day to fit the 256-token limit; no sensitivity analysis reported.
  • Positive sample window = 30 days
    Selected because K-means clustering of encoded vectors yielded the best silhouette with a 30-day window (Table 1, Appendix A.3).
  • Number of daily latent clusters = 5
    Optimal silhouette score on test-set embeddings (Appendix A.5); no external validation.
  • Distance threshold for PageRank transition matrix = unspecified
    Eq. (1) defines transitions by d(k,l) <= threshold, but the threshold value is not reported; it directly shapes the transition graph.
  • PageRank damping factor alpha = 0.85
    Standard default from PageRank literature, not tuned to this dataset.
  • Participant-level cluster count = 6
    Best silhouette for K-means clustering of PageRank vectors (Appendix A.8).
  • t-SNE hyperparameters = defaults, unspecified
    Perplexity and random state affect the 2D coordinates used to build the transition matrix; no fixed seed is reported.
  • Triplet training hyperparameters = lr 2e-5, batch 256, 50k triplets/epoch
    Training choices reported without ablation; only the window and cluster count are ablated.
assumptions (6)
  • domain assumption 20-minute most-frequent-location summaries preserve clinically meaningful daily activity patterns.
    Raw second-level data is downsampled; if important behavior happens at sub-20-minute timescales it is lost (Appendix A.2, A.3).
  • domain assumption Fine-tuning MiniLM with one-hot K-means pseudo-labels and triplet loss teaches the model behavior similarity.
    No external label is used; pseudo-labels are derived from the same data via K-means on one-hot daily strings (Appendix A.3).
  • domain assumption Euclidean distances in t-SNE 2D space are meaningful for defining state transitions.
    Eq. (1) applies a threshold over t-SNE coordinates; t-SNE distances are non-metric and seed-dependent.
  • domain assumption K-means clusters in embedding space correspond to genuine latent behavioral states.
    Cluster count is chosen by silhouette only; semantic labels are assigned later with clinicians.
  • domain assumption PageRank stationary distribution over latent states captures behavioral importance.
    PageRank is a standard algorithm, but treating its scores as deep behavioral semantics is an interpretive assumption (Appendix A.4).
  • domain assumption The 50-participant test set is representative of the target population.
    Participants with incomplete data after July 2023 were excluded, which may bias results (Appendix A.2).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Analyzing Patient Daily Movement Behavior Dynamics Using Two-Stage Encoding Model." pith.science (2026). https://pith.science/paper/KPCW7XSG

@misc{pith2026250209947,
  author       = {Pith},
  title        = {Pith review of: Analyzing Patient Daily Movement Behavior Dynamics Using Two-Stage Encoding Model},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KPCW7XSG}},
  note         = {Machine review of arXiv:2502.09947}
}
read the original abstract

In the analysis of remote healthcare monitoring data, time series representation learning offers substantial value in uncovering deeper patterns of patient behavior, especially given the fine temporal granularity of the data. In this study, we focus on a dataset of home activity records from people living with Dementia. We propose a two-stage self-supervised learning approach. The first stage involves converting time-series activities into text strings, which are then encoded by a fine-tuned language model. In the second stage, these time-series vectors are bi-dimensionalized for applying PageRank method, to analyze latent state transitions to quantitatively assess participants behavioral patterns and identify activity biases. These insights, combined with diagnostic data, aim to support personalized care interventions.

Figures

Figures reproduced from arXiv: 2502.09947 by the authors.

Figure 1
Figure 1. Flowchart of the framework [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Flowchart of data preprocessing. The figure illustrates the monitoring data for a single [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Daily histogram [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figures from the paper (8 more)
Figure 4
Figure 4. Figure 4: Location Histogram [PITH_FULL_IMAGE:figures/full_fig_p008_4.png]
Figure 5
Figure 5. Figure 5: Three month distribution. In addition to activity data, we had access to diagnostic information for the 134 participants, including birthdate, gender, living situation (whether they lived alone), ethnicity, and dementia diagnosis. 8 [PITH_FULL_IMAGE:figures/full_fig_p…
Figure 6
Figure 6. Figure 6: Timeseries of cognitive test of the test set participants [PITH_FULL_IMAGE:figures/full_fig_p009_6.png]
Figure 7
Figure 7. Figure 7: Visualization of the generation of Pagerank value, left graph is single participant 2D t-SNE [PITH_FULL_IMAGE:figures/full_fig_p013_7.png]
Figure 8
Figure 8. Figure 8: T-SNE for embedded datapoints in the test set [PITH_FULL_IMAGE:figures/full_fig_p014_8.png]
Figure 9
Figure 9. Figure 9: T-SNE for individuals in test set 15 [PITH_FULL_IMAGE:figures/full_fig_p015_9.png]
Figure 10
Figure 10. Figure 10: T-SNE for individuals in test set 16 [PITH_FULL_IMAGE:figures/full_fig_p016_10.png]
Figure 11
Figure 11. Figure 11: MMSE vs ADAS-Cog Scores by Cluster 17 [PITH_FULL_IMAGE:figures/full_fig_p017_11.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

31 extracted references · 16 canonical work pages

  1. [1]

    PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation , April 2024

    Jason Ansel, Edward Yang, Horace He, Natalia Gimelshein, Animesh Jain, Michael Voznesensky, Bin Bao, Peter Bell, David Berard, Evgeni Burovski, Geeta Chauhan, Anjali Chourdia, Will Constable, Alban Desmaison, Zachary DeVito, Elias Ellison, Will Feng, Jiong Gong, Michael Gschwind, Brian Hirsh, Sherlock Huang, Kshiteej Kalambarkar, Laurent Kirsch, Michael L...

    work page 2024

  2. [2]

    Multi- Patch Prediction : Adapting LLMs for Time Series Representation Learning , February 2024

    Yuxuan Bian, Xuan Ju, Jiangtong Li, Zhijian Xu, Dawei Cheng, and Qiang Xu. Multi- Patch Prediction : Adapting LLMs for Time Series Representation Learning , February 2024. URL https://arxiv.org/abs/2402.04852v2

    arXiv 2024

  3. [3]

    Tom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal, Ariel Herbert-Voss, Gretchen Krueger, Tom Henighan, Rewon Child, Aditya Ramesh, Daniel M. Ziegler, Jeffrey Wu, Clemens Winter, Christopher Hesse, Mark Chen, Eric Sigler, Mateusz Litwin...

    arXiv 2020

  4. [4]

    Equal Opportunity for Low - Degree Network Nodes : A PageRank - Based Method for Protein Target Identification in Metabolic Graphs

    Dániel Bánky, Gábor Iván, and Vince Grolmusz. Equal Opportunity for Low - Degree Network Nodes : A PageRank - Based Method for Protein Target Identification in Metabolic Graphs . PLOS ONE, 8 0 (1): 0 e54204, January 2013. ISSN 1932-6203. doi:10.1371/journal.pone.0054204. URL https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0054204. Publis...

    work page doi:10.1371/journal.pone.0054204 2013

  5. [5]

    Representation Learning of Daily Movement Data Using Text Encoders

    Alexander Capstick, Tianyu Cui, Yu Chen, and Payam Barnaghi. Representation learning of daily movement data using text encoders. ICLR 2024 Workshop Time Series for Health, 2024. URL https://arxiv.org/abs/2405.04494

    work page Pith review arXiv 2024

  6. [6]

    Semi- Supervised Time Series Classification by Temporal Relation Prediction

    Haoyi Fan, Fengbin Zhang, Ruidong Wang, Xunhua Huang, and Zuoyong Li. Semi- Supervised Time Series Classification by Temporal Relation Prediction . In ICASSP 2021 - 2021 IEEE International Conference on Acoustics , Speech and Signal Processing ( ICASSP ) , pages 3545--3549, June 2021. doi:10.1109/ICASSP39728.2021.9413883. URL https://ieeexplore.ieee.org/d...

    arXiv 2021

  7. [7]

    Unsupervised Scalable Representation Learning for Multivariate Time Series

    Jean-Yves Franceschi, Aymeric Dieuleveut, and Martin Jaggi. Unsupervised Scalable Representation Learning for Multivariate Time Series . ArXiv, January 2019. URL https://www.semanticscholar.org/paper/Unsupervised-Scalable-Representation-Learning-for-Franceschi-Dieuleveut/1d514906fcc522aa08bc05156fdca68401173edf

    work page 2019

  8. [8]

    Harris, K

    Charles R. Harris, K. Jarrod Millman, Stéfan J van der Walt, Ralf Gommers, Pauli Virtanen, David Cournapeau, Eric Wieser, Julian Taylor, Sebastian Berg, Nathaniel J. Smith, Robert Kern, Matti Picus, Stephan Hoyer, Marten H. van Kerkwijk, Matthew Brett, Allan Haldane, Jaime Fernández del Río, Mark Wiebe, Pearu Peterson, Pierre Gérard-Marchant, Kevin Sheppa...

    2020

Show all 31 references
  1. [9]

    Semi-supervised Embedding for Scalable and Accurate Time Series Clustering

    Andrew Hill, Russell Bowler, Katerina Kechris, and Farnoush Banaei-Kashani. Semi-supervised Embedding for Scalable and Accurate Time Series Clustering . In 2022 IEEE International Conference on Big Data ( Big Data ) , pages 942--951, December 2022. doi:10.1109/BigData55660.202...

    2022

  2. [10]

    When the Web meets the cell: using personalized PageRank for analyzing protein interaction networks

    Gábor Iván and Vince Grolmusz. When the Web meets the cell: using personalized PageRank for analyzing protein interaction networks. Bioinformatics, 27 0 (3): 0 405--407, February 2011. ISSN 1367-4811, 1367-4803. doi:10.1093/bioinformatics/btq680. URL https://academic.oup.com/b...

    2011 doi

  3. [11]

    Semi-supervised contrastive learning with decomposition-based data augmentation for time series classification

    Dokyun Kim, Sukhyun Cho, Heewoong Chae, Jonghun Park, and Jaeseok Huh. Semi-supervised contrastive learning with decomposition-based data augmentation for time series classification. Intelligent Data Analysis, Preprint 0 (Preprint): 0 1--25, January 2024. ISSN 1088-467X. doi:1...

    2024 doi

  4. [12]

    Kontopoulou, Athanasios D

    Vaia I. Kontopoulou, Athanasios D. Panagopoulos, Ioannis Kakkos, and George K. Matsopoulos. A Review of ARIMA vs. Machine Learning Approaches for Time Series Forecasting in Data Driven Networks . Future Internet, 15 0 (8): 0 255, August 2023. ISSN 1999-5903. doi:10.3390/fi1508...

    2023 doi

  5. [13]

    Kueper, Mark Speechley, and Manuel Montero-Odasso

    Jacqueline K. Kueper, Mark Speechley, and Manuel Montero-Odasso. The Alzheimer ’s Disease Assessment Scale – Cognitive Subscale ( ADAS - Cog ): Modifications and Responsiveness in Pre - Dementia Populations . A Narrative Review . Journal of Alzheimer's Disease, 63 0 (2): 0 423...

    doi

  6. [14]

    The Mini - Mental State Examination ( MMSE )

    Lenore Kurlowicz and Meredith Wallace. The Mini - Mental State Examination ( MMSE ). Journal of Gerontological Nursing, 25 0 (5): 0 8--9, May 1999. ISSN 0098-9134, 1938-243X. doi:10.3928/0098-9134-19990501-08. URL https://journals.healio.com/doi/10.3928/0098-9134-19990501-08

    1999 doi

  7. [15]

    Spatio- Temporal Consistency for Multivariate Time - Series Representation Learning

    Sangho Lee, Wonjoon Kim, and Youngdoo Son. Spatio- Temporal Consistency for Multivariate Time - Series Representation Learning . IEEE Access, 12: 0 30962--30975, 2024. ISSN 2169-3536. doi:10.1109/ACCESS.2024.3369679. URL https://ieeexplore.ieee.org/document/10445124. Conferenc...

    2024

  8. [16]

    Synthetic Data Generation with Large Language Models for Text Classification : Potential and Limitations , October 2023

    Zhuoyan Li, Hangxiao Zhu, Zhuoran Lu, and Ming Yin. Synthetic Data Generation with Large Language Models for Text Classification : Potential and Limitations , October 2023. URL http://arxiv.org/abs/2310.07849. arXiv:2310.07849 [cs]

    2023 arXiv

  9. [17]

    AutoTimes : Autoregressive Time Series Forecasters via Large Language Models , February 2024

    Yong Liu, Guo Qin, Xiangdong Huang, Jianmin Wang, and Mingsheng Long. AutoTimes : Autoregressive Time Series Forecasters via Large Language Models , February 2024. URL https://arxiv.org/abs/2402.02370v2

    2024 arXiv

  10. [18]

    Decoupled Weight Decay Regularization , January 2019

    Ilya Loshchilov and Frank Hutter. Decoupled Weight Decay Regularization , January 2019. URL http://arxiv.org/abs/1711.05101. arXiv:1711.05101 [cs, math]

    2019 arXiv

  11. [19]

    Hyland, George Zerveas, and Gunnar Raetsch

    Xinrui Lyu, Matthias Hueser, Stephanie L. Hyland, George Zerveas, and Gunnar Raetsch. Improving Clinical Predictions through Unsupervised Time Series Representation Learning , December 2018. URL http://arxiv.org/abs/1812.00490. arXiv:1812.00490 [cs, stat]

    2018 arXiv

  12. [20]

    Masini, Marcelo C

    Ricardo P. Masini, Marcelo C. Medeiros, and Eduardo F. Mendes. Machine learning advances for time series forecasting. Journal of Economic Surveys, 37 0 (1): 0 76--111, 2023. ISSN 1467-6419. doi:10.1111/joes.12429. URL https://onlinelibrary.wiley.com/doi/abs/10.1111/joes.12429....

    2023 doi

  13. [21]

    Data structures for statistical computing in python

    Wes McKinney and others . Data structures for statistical computing in python. In Proceedings of the 9th Python in Science Conference , volume 445, pages 51--56. Austin, TX, 2010

    2010

  14. [22]

    MTEB : Massive Text Embedding Benchmark , March 2023

    Niklas Muennighoff, Nouamane Tazi, Loïc Magne, and Nils Reimers. MTEB : Massive Text Embedding Benchmark , March 2023. URL http://arxiv.org/abs/2210.07316. arXiv:2210.07316 [cs]

    2023 arXiv

  15. [23]

    Motwani, and T

    Lawrence Page, Sergey Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking : Bringing Order to the Web . November 1999. URL https://www.semanticscholar.org/paper/The-PageRank-Citation-Ranking-

    1999

  16. [24]

    Scikit-learn: Machine learning in Python

    Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, and others . Scikit-learn: Machine learning in Python . Journal of machine learning research, 12 0 (Oct): 0 ...

    2011

  17. [25]

    Forecasting financial budget time series: ARIMA random walk vs LSTM neural network

    Maryem Rhanoui, Siham Yousfi, Mounia Mikram, and Hajar Merizak. Forecasting financial budget time series: ARIMA random walk vs LSTM neural network. IAES International Journal of Artificial Intelligence (IJ-AI), 8 0 (4): 0 317--327, December 2019. ISSN 2252-8938. doi:10.11591/i...

    2019 doi

  18. [26]

    ARIMA Model Time Series Forecasting

    Mohd Faizan Rizvi. ARIMA Model Time Series Forecasting . International Journal for Research in Applied Science and Engineering Technology, 12 0 (5): 0 3782--3785, May 2024. ISSN 23219653. doi:10.22214/ijraset.2024.62416. URL https://www.ijraset.com/best-journal/arima-model-tim...

    2024

  19. [27]

    Viualizing data using t- SNE

    Laurens van der Maaten and Geoffrey Hinton. Viualizing data using t- SNE . Journal of Machine Learning Research, 9: 0 2579--2605, November 2008

    2008

  20. [28]

    Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, Stéfan J

    Pauli Virtanen, Ralf Gommers, Travis E. Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, Stéfan J. van der Walt, Matthew Brett, Joshua Wilson, K. Jarrod Millman, Nikolay Mayorov, Andrew R. J. Nelson, E...

    2020

  21. [29]

    Thomas Wolf, Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi, Perric Cistac, Clara Ma, Yacine Jernite, Julien Plu, Canwen Xu, Teven Le Scao, Sylvain Gugger, Mariama Drame, Quentin Lhoest, and Alexander M. Rush. Transformers: State -of-the- Art Natur...

    2020

  22. [30]

    C- Pack : Packaged Resources To Advance General Chinese Embedding , 2023

    Shitao Xiao, Zheng Liu, Peitian Zhang, and Niklas Muennighoff. C- Pack : Packaged Resources To Advance General Chinese Embedding , 2023. \_eprint: 2309.07597

    2023 arXiv

  23. [31]

    LBP4MTS : Local Binary Pattern - Based Unsupervised Representation Learning of Multivariate Time Series

    Chengyang Ye and Qiang Ma. LBP4MTS : Local Binary Pattern - Based Unsupervised Representation Learning of Multivariate Time Series . IEEE Access, 11: 0 118595--118605, 2023. ISSN 2169-3536. doi:10.1109/ACCESS.2023.3327015. URL https://ieeexplore.ieee.org/document/10292642/?arn...

    2023

Pith tools

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