IP Library › Granted Patent US 12,332,917
Granted Patent B2
US 12,332,917 · App. 18/189,933 · Granted Jun 17, 2025

Univariate time series segmentation using proxy variables and sparse graph recovery algorithms

Inventors: Harsh Shrivastava (Redmond, WA); Shima Imani (Sammamish, WA)
Assignee: Microsoft Technology Licensing, LLC
G06F16/285G06F16/26G06F18/2323
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,332,917
App. No.
18/189,933
Granted
Jun 17, 2025
Kind
B2
Abstract

This disclosure relates to a time series segmentation system that efficiently and accurately segments univariate time series data. For example, the time series segmentation system utilizes proxy variable time series to identify distinct segments in a univariate time series. To illustrate, the time series segmentation system generates proxy variables that approximate a univariate time series and combine with the time series to generate a supplemented multivariate time series. The time series segmentation system then divides the supplemented multivariate time series into portions using time-based windows, converts the windowed subsequences into graph objects using a sparse graph recovery model, utilizes a conditional similarity model to determine segmentation timestamps from the graph objects, and generates a segmented univariate time series from the segmentation timestamps.

Claims (56)

1. A computer-implemented method for segmenting univariate time series data comprising:

generating multiple proxy variable time series for a univariate time series, wherein a first proxy variable time series of the multiple proxy variable time series is based on the univariate time series;

generating a supplemented multivariate time series by supplementing the univariate time series with the multiple proxy variable time series;

grouping portions of the supplemented multivariate time series by a window size to generate windowed subsequences of the supplemented multivariate time series;

generating graph objects from the windowed subsequences utilizing a sparse graph recovery model, wherein the graph objects indicate correlation values between nodes; and

determining one or more segmentation timestamps indicating one or more segment changes in the supplemented multivariate time series utilizing a conditional similarity model conditioned on the univariate time series that determines when changes between correlation values in graph objects meet or exceed a difference threshold.

2. The computer-implemented method of claim 1 , further comprising generating the first proxy variable time series by interpolating the univariate time series at a first sampling rate.

3. The computer-implemented method of claim 1 , further comprising generating a segmented univariate time series by segmenting the supplemented multivariate time series based on the one or more segmentation timestamps.

4. The computer-implemented method of claim 1 , further comprising:

determining a data type of the univariate time series; and

determining the multiple proxy variable time series based on the data type.

5. The computer-implemented method of claim 1 , further comprising:

determining a constant correlation between two proxy variable time series of the multiple proxy variable time series across the univariate time series; and

removing one of the two proxy variable time series.

6. The computer-implemented method of claim 1 , further comprising:

generating additional graph objects from the windowed subsequences utilizing an additional sparse graph recovery model that is different from the sparse graph recovery model; and

determining that the graph objects and the additional graph objects are within a threshold similarity.

7. The computer-implemented method of claim 1 , wherein generating the graph objects from the windowed subsequences includes generating a visual graph of nodes and edges, where the edges indicate a positive or negative partial correlation between connected nodes.

8. The computer-implemented method of claim 1 , further comprising generating multiple graph objects from the windowed subsequences at a same time as part of a batch operation that utilizes one instance of the sparse graph recovery model and shared parameters.

9. The computer-implemented method of claim 1 , wherein the sparse graph recovery model generates conditional independence graph objects that exhibit partial correlation between variables.

10. The computer-implemented method of claim 1 , further comprising:

comparing a first graph object to a second graph object utilizing the conditional similarity model to determine that a difference between the first graph object and the second graph object satisfies a difference threshold; and

determining a first segmentation timestamp based on a segmentation timestamp of the first graph object.

11. The computer-implemented method of claim 1 , wherein the conditional similarity model conditioned on the univariate time series ignores graph object connections between two of the multiple proxy variable time series.

12. A system comprising:

a univariate time series;

a first sparse graph recovery model that generates graph objects from multiple portions of time series data;

a first conditional similarity model that determines differences between two or more graph objects;

a processor; and

a computer memory comprising instructions that, when executed by the processor, cause the system to carry out operations comprising:

generating multiple proxy variable time series for the univariate time series;

generating a first supplemented multivariate time series by supplementing the univariate time series with the multiple proxy variable time series;

grouping portions of the first supplemented multivariate time series by a first window size to generate windowed subsequences of the first supplemented multivariate time series;

generating graph objects from the windowed subsequences utilizing the first sparse graph recovery model, wherein the graph objects indicate correlation values between nodes; and

determining one or more segmentation timestamps indicating one or more segment changes in the first supplemented multivariate time series utilizing the first conditional similarity model conditioned on the univariate time series that determines when changes between correlation values in graph objects meet or exceed a difference threshold.

13. The system of claim 12 , further comprising additional instructions that, when executed by the processor, cause the system to carry out an operation comprising:

generating an additional proxy variable time series for the univariate time series based on the one or more segmentation timestamps;

generating a second supplemented multivariate time series by supplementing the univariate time series with the additional proxy variable time series and the multiple proxy variable time series;

generating additional windowed subsequences from the second supplemented multivariate time series;

generating additional graph objects from the additional windowed subsequences utilizing a second sparse graph recovery model; and

determining one or more refined segmentation timestamps from the additional graph objects utilizing a second conditional similarity model conditioned on the univariate time series.

14. The system of claim 13 , wherein the additional windowed subsequences utilize a second window size that has a smaller window size than the first window size.

15. The system of claim 14 , wherein the additional windowed subsequences are fewer in number than the windowed subsequences.

16. The system of claim 13 , wherein the first sparse graph recovery model is a general sparse graph recovery model, and the second sparse graph recovery model is a specialized sparse graph recovery model.

17. A computer-implemented method for segmenting univariate time comprising:

generating a proxy variable time series for a univariate time series;

generating a supplemented multivariate time series by supplementing the univariate time series with the proxy variable time series;

grouping portions of the supplemented multivariate time series by a window size to generate windowed subsequences of the supplemented multivariate time series;

generating graph objects from the windowed subsequences utilizing a sparse graph recovery model, wherein the graph objects indicate correlation values between nodes;

determining one or more segmentation timestamps indicating one or more segment changes in the supplemented multivariate time series utilizing a conditional similarity model conditioned on the univariate time series that determines when changes between correlation values in graph objects meet or exceed a difference threshold; and

generating a segmented univariate time series by segmenting the supplemented multivariate time series based on the one or more segmentation timestamps.

18. The computer-implemented method of claim 17 , further comprising:

generating a first proxy variable time series by interpolating the univariate time series at a first sampling rate; and

generating a second proxy variable time series by interpolating the univariate time series at a second sampling rate that is different from the first sampling rate.

19. The computer-implemented method of claim 17 , further comprising generating an additional proxy variable time series by interpolating the univariate time series.

20. The computer-implemented method of claim 17 , wherein the proxy variable time series is a polynomial proxy variable.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 24, 2023
From: SHRIVASTAVA, HARSH; IMANI, SHIMA
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 063098/0212 →
Continuity (1)
Related Publication 20240411779A1 · Dec 12, 2024
References Cited (64)
US 6611726B1 · Crosswhite · 2003 [cited by examiner]
US 10685283B2 · Li · 2020 [cited by examiner]
US 11037022B2 · Kumar · 2021 [cited by examiner]
US 11263172B1 · Chang · 2022 [cited by examiner]
US 20020010663A1 · Muller · 2002 [cited by examiner]
US 20020099594A1 · Heard · 2002 [cited by examiner]
US 20100211618A1 · Anderson · 2010 [cited by examiner]
US 20130212142A1 · Martinez Heras · 2013 [cited by examiner]
US 20180150547A1 · Pallath · 2018 [cited by examiner]
US 20200125995A1 · Wang · 2020 [cited by examiner]
US 20200241490A1 · Jermann · 2020 [cited by examiner]
US 20200242483A1 · Shashikant Rao · 2020 [cited by examiner]
US 20210357431A1 · Yang · 2021 [cited by examiner]
US 20220245409A1 · Pavuluri · 2022 [cited by examiner]
US 20220382856A1 · Yang · 2022 [cited by examiner]
US 20220383033A1 · Courtney · 2022 [cited by examiner]
US 20230333521A1 · Holtan · 2023 [cited by examiner]
US 20240054041A1 · Nagar · 2024 [cited by examiner]
US 20240168975A1 · Gill · 2024 [cited by examiner]
CN 113657533A · 2021 [cited by examiner]
WO WO2020090770A1 · 2020 [cited by examiner]
Shrivastava et. al; “GLAD: Learning Sparse Graph Recovery” ICLR 2020 (Year: 2020). [cited by examiner]
Guijo-Rubio et al. ; “Time-Series Clustering Based on the Characterization of Segment Typologies”, IEEE Transactions on Cybernetics, vol. 51, No. 11, Nov. 2021 (Year: 2021). [cited by examiner]
Manfred Mudelsee; “Trend analysis of climate time series: A review of methods”; Earth-Science Reviews 190 (2019) 310-322 (Year: 2019). [cited by examiner]
Bradley, Elizabeth, and Holger Kantz. “Nonlinear time-series analysis revisited.” arXiv preprint arXiv:1503.07493 (2015) (Year: 2015). [cited by examiner]
Svensson, et al. “An Evaluation of Methods for Combining Univariate Time Series Forecast”; Lund University, Bachelor's thesis in Statistics, Apr. 2018, 49 pages (Year: 2018). [cited by examiner]
Hima Imani , Harsh Shrivastava “Are uGLAD? Time will tell!”; Microsoft Research, Redmond, USA; License: CC BY-NC-ND 4.0; arXiv:2303.11647v2 [cs.LG] Oct. 22, 2024 (Year: 2024). [cited by examiner]
Aluru, et al., “EnGRaiN: A Supervised Ensemble Learning Method for Recovery of Large-Scale Gene Regulatory Networks”, In Journal of Bioinformatics, vol. 38, Issue 5, Dec. 9, 2021, pp. 1312-1319. [cited by applicant]
Aminikhanghahi, et al., “A Survey of Methods for Time Series Change Point Detection”, In Journal of Knowledge and information systems, vol. 51, Issue 2, May 2017, pp. 339-367. [cited by applicant]
Aoki, et al., “Segmentation of Human Upper Body Movement Using Multiple IMU Sensors”, In Proceedings of the 38th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, Aug. 16, 2016, pp… [cited by applicant]
Deldari, et al., “Espresso: Entropy and Shape Aware Time-Series Segmentation for Processing Heterogeneous Sensor Data”, In Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies, Sep. 4, 202… [cited by applicant]
Ermshaus, et al., “ClaSP—Parameter-free Time Series Segmentation”, In Repository of arXiv:2207.13987v2, Nov. 18, 2022, 43 Pages. [cited by applicant]
Friedman, et al., “Sparse inverse covariance estimation with the graphical lasso”, In Journal of Biostatistics, vol. 9, Issue 3, Dec. 12, 2007, pp. 432-441. [cited by applicant]
Gharghabi, et al., “Domain Agnostic Online Semantic Segmentation for Multi-Dimensional Time Series”, In Proceedings of Data Mining and Knowledge Discovery, Jan. 15, 2019, pp. 96-130. [cited by applicant]
Hallac, et al., “Greedy Gaussian Segmentation of Multivariate Time Series”, In Proceedings of the Advances in Data Analysis and Classification, Sep. 1, 2019, pp. 727-751. [cited by applicant]
Hallac, et al., “Network Inference via the Time-Varying Graphical Lasso”, In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 13, 2017, pp. 205-213. [cited by applicant]
Harguess, et al., “Semantic Labeling of Track Events using Time Series Segmentation and Shape Analysis”, In Proceedings of the 16th IEEE International Conference on Image Processing, Nov. 7, 2009, pp. 4317-4320. [cited by applicant]
Haury, et al., “TIGRESS: Trustful Inference of Gene REgulation using Stability Selection”, In Journal of BMC Systems Biology, vol. 6, Issue 1, Nov. 22, 2012, 17 Pages. [cited by applicant]
Imani, et al., “Multi-Window-Finder: Domain Agnostic Window Size for Time Series Data”, In Proceedings of the MileTS 21, Aug. 14, 2021, 5 Pages. [cited by applicant]
Keadle, et al., “Validation of Wearable Monitors for Assessing Sedentary Behavior”, In Journal of Medicine & Science in Sports & Exercise, vol. 43, Issue 8, Aug. 1, 2011, pp. 1561-1567. [cited by applicant]
Koller, et al., “Probabilistic Graphical Models: principles and techniques”, Published by MIT Press, Jul. 31, 2009, 16 Pages. [cited by applicant]
Lan, et al., “Automated Human Motion Segmentation via Motion Regularities”, In Proceedings of the Visual Computer, Jan. 31, 2015, pp. 35-53. [cited by applicant]
Lin, et al., “Movement Primitive Segmentation for Human Motion Modeling: A Framework for Analysis”, In Proceedings of the IEEE Transactions on Human-Machine Systems, Jan. 7, 2016, pp. 325-339. [cited by applicant]
Moerman, et al., “GRNBoost2 and Arboreto: Efficient and Scalable Inference of Gene Regulatory Networks”, In Journal of Bioinformatics, vol. 35, Issue 12, Nov. 15, 2018, pp. 2159-2161. [cited by applicant]
Omranian, et al., “Segmentation of Biological Multivariate Time-Series Data”, In Journal of Scientific Reports, vol. 5, Issue 1, Mar. 11, 2015, 6 Pages. [cited by applicant]
Pu, et al., “Learning to Learn Graph Topologies”, In Journal of Advances in Neural Information Processing Systems, vol. 34, Dec. 6, 2021, 14 Pages. [cited by applicant]
Reinhardt, et al., “Predicting the Power Consumption of Electric Appliances through Time Series Pattern Matching”, In Proceedings of the 5th ACM Workshop on Embedded Systems For Energy-Efficient Buildings, Nov. 11, 2013… [cited by applicant]
Rolfs, et al., “Iterative Thresholding Algorithm for Sparse Inverse Covariance Estimation”, In Proceedings of Advances in Neural Information Processing Systems, Dec. 3, 2012, 9 Pages. [cited by applicant]
Serra, et al., “Unsupervised Music Structure Annotation by Time Series Structure Features and Segment Similarity”, In Proceedings of the IEEE Transactions on Multimedia, Mar. 11, 2014, pp. 1229-1240. [cited by applicant]
Shafer, et al., “Clasp—Time Series Segmentation”, In Proceedings of the 30th ACM International Conference on Information & Knowledge Management, Oct. 26, 2021, pp. 1578-1587. [cited by applicant]
Shrivastava, et al., “A Deep Learning Approach to Recover Conditional Independence Graphs”, In Proceedings of the NeurIPS Workshop: New Frontiers in Graph Learning, Dec. 2, 2022, 16 Pages. [cited by applicant]
Shrivastava, et al., “GLAD: Learning Sparse Graph Recovery”, In Repository of arXiv:1906.00271v1, Jun. 1, 2019, 20 Pages. [cited by applicant]
Shrivastava, et al., “GRNUlar: A Deep Learning Framework for Recovering Single-Cell Gene Regulatory Networks”, In Journal of Computational Biology, vol. 29, Issue 1, Jan. 1, 2022, pp. 27-44. [cited by applicant]
Shrivastava, et al., “Grnular: Gene Regulatory Network Reconstruction Using Unrolled Algorithm From Single Cell RNA-Sequencing Data”, In Repository of bioRxiv, Apr. 25, 2020, 10 Pages. [cited by applicant]
Shrivastava, et al., “Methods for Recovering Conditional Independence Graphs: A Survey”, In Repository of arXiv:2211.06829v1, Nov. 13, 2022, 14 Pages. [cited by applicant]
Shrivastava, et al., “Neural Graph Revealers”, In Repository of arXiv:2302.13582v2, Feb. 28, 2023, 13 Pages. [cited by applicant]
Shrivastava, et al., “Neural Graphical Models”, In Repository of arXiv:2210.00453v1, Oct. 2, 2022, 16 Pages. [cited by applicant]
Shrivastava, Harsh, “On using Inductive Biases for Designing Deep Learning Architectures”, A Dissertation Submitted for the Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Machine Learning… [cited by applicant]
Shrivastava, et al., “uGLAD: Sparse Graph Recovery by Optimizing Deep Unrolled Networks”, In Repository of arXiv:2205.11610v1, May 23, 2022, 17 Pages. [cited by applicant]
Thu, et al., “Inferring Regula-Tory Networks from Expression Data Using Tree-Based Methods”, In Journal of PloS one, vol. 5, Issue 9, Sep. 28, 2010, 10 Pages. [cited by applicant]
Yeh, et al., “Matrix Profile I: All Pairs Similarity Joins for Time Series: A Unifying View That Includes Motifs, Discords and Shapelets”, In Proceedings of IEEE 16th International Conference on Data Mining, Dec. 12, 20… [cited by applicant]
Imani, et al., “Are uGLAD? Time will tell!”, arXiv preprint arXiv:2303.11647, Mar. 21, 2023, pp. 1-10. [cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/US2024/019625, Jul. 11, 2024, 14 pages. [cited by applicant]
Li, et al., “Integrated Data Augmentation for Accelerometer Time Series in Behavior Recognition: Roles of Sampling, Balancing, and Fourier Surrogates”, IEEE Sensors Journal, vol. 22, Issue 24, Nov. 9, 2022, pp. 24230-24… [cited by applicant]