The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Synchronization of batch trajectories using dynamic time warping
Abstract
The application of dynamic time warping (DTW) to the analysis and monitoring of batch processes is presented. This dynamic‐programming‐based technique has been used in the area of speech recognition for the recognition of isolated and connected words. DTW has the ability to synchronize two trajectories by appropriately translating, expanding, and contracting localized segments within both trajectories to achieve a minimum distance between the trajectories. Batch processes often are characterized by unsynchronized trajectories, due to the presence of batch‐to‐batch disturbances and the existence of physical constraints. To compare these batch histories and apply statistical analysis one needs to reconcile the timing differences among these trajectories. This can be achieved using DTW with only a minimal amount of process knowledge. The combination of DTW and a monitoring method based on Multiway PCA/PLS is used for both off‐line and on‐line implementation. Data fiom an industrial polymerization reactor are used to illustrate the implementation and the performance of this method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
Bellman, R. E., & Dreyfus, S. E. (1962) · Princeton University Press eBooks · doi:10.1515/9781400874651 · Cited by 1,971
Minimum prediction residual principle applied to speech recognition
Itakura, F. (1975) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1975.1162641 · Cited by 1,627
Monitoring batch processes using multiway principal component analysis
Nomikos, P., & MacGregor, J. F. (1994) · AIChE Journal · doi:10.1002/aic.690400809 · Cited by 1,483
Self-citationMultivariate SPC Charts for Monitoring Batch Processes
Nomikos, P., & MacGregor, J. F. (1995) · Technometrics · doi:10.1080/00401706.1995.10485888 · Cited by 1,422
Self-citationMulti-way partial least squares in monitoring batch processes
Nomikos, P., & MacGregor, J. F. (1995) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(95)00043-7 · Cited by 737
Self-citationPerformance tradeoffs in dynamic time warping algorithms for isolated word recognition
Myers, C., Rabiner, L., & Rosenberg, A. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163491 · Cited by 568
Considerations in dynamic time warping algorithms for discrete word recognition
Rabiner, L., Rosenberg, A., & Levinson, S. (1978) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1978.1163164 · Cited by 369
Pattern recognition engineering
Nadler, M., & Smith, E. P. (1993) · Cited by 343
Analysis, monitoring and fault diagnosis of batch processes using multiblock and multiway PLS
Kourti, T., Nomikos, P., & MacGregor, J. F. (1995) · Journal of Process Control · doi:10.1016/0959-1524(95)00019-m · Cited by 340
Self-citationThe use of a one-stage dynamic programming algorithm for connected word recognition
Ney, H. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164320 · Cited by 300
Kourti, T., Lee, J., & Macgregor, J. F. (1996) · Computers & Chemical Engineering · doi:10.1016/0098-1354(96)00132-9 · Cited by 202
Self-citationThe application of dynamic programming to connected speech recognition
Silverman, H. F., & Morgan, D. P. (1990) · IEEE ASSP Magazine · doi:10.1109/53.54526 · Cited by 102
O’Shaughnessy, D. D. (1986) · IEEE ASSP Magazine · doi:10.1109/massp.1986.1165388 · Cited by 75
Performance trade-offs in dynamic time warping algorithms for isolated word recognition
Myers, C. S., Rabiner, L. R., & Rosenberg, A. E. (1979) · The Journal of the Acoustical Society of America · doi:10.1121/1.2017729 · Cited by 60
Cited by
Particle swarm optimization (PSO). A tutorial
Marini, F., & Walczak, B. (2015) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2015.08.020 · Cited by 1,828
Data Mining and Analytics in the Process Industry: The Role of Machine Learning
Ge, Z., Song, Z., Ding, S. X., & Huang, B. (2017) · IEEE Access · doi:10.1109/access.2017.2756872 · Cited by 922
“To do this, some methods for time warping/dynamic time warping may be useful [18].”
MethodTomasi, G., van den Berg, F., & Andersson, C. (2004) · Journal of Chemometrics · doi:10.1002/cem.859 · Cited by 709
Kourti, T. (2005) · International Journal of Adaptive Control and Signal Processing · doi:10.1002/acs.859 · Cited by 330
Iterative Deepening Dynamic Time Warping for Time Series
Chu, S., Keogh, E., Hart, D., & Pazzani, M. (2002) · Proceedings of the 2002 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.12 · Cited by 268
Metadata
- Authors
- Kassidas, A., MacGregor, J. F., & Taylor, P. A.
- Venue
- AIChE Journal
- Publisher
- Wiley
- Published
- 1998-04
- Volume
- 44
- Issue
- 4
- Pages
- 864-875
- ISSN
- 0001-1541 (ISSN-L)
- 1547-5905
- OpenAlex
- W2168715542
- Cited by
- 456
- References
- 16
- FWCI
- 15.40
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.