Annotatsiya
Ekran grafik o‘qi bo‘ylab bor-yo‘g‘i bir necha yuz nuqtani ajrata oladi, shu sababli yuqori chastotali ma’lumotlar oqimi chizishdan oldin agregatsiya qilinishi lozim. Klassik M4 usuli har bir piksel ustunidan to‘rtta nuqtani (birinchi, oxirgi, minimum va maksimum) saqlaydi, biroq ustun ekstremumi bo‘lmagan muhim nuqtalar – anomaliyalar, keskin burilishlar va sath siljishlari – yo‘qoladi. Maqolada M4 rasterizatsiya negizini saqlagan holda pozitsion tanlovni og‘irlikli kompozit muhimlik bahosi bilan almashtiruvchi AdaptiveM4 algoritmi formal tavsiflanadi va qiyosiy eksperimental baholanadi. Baho uchta masshtabdan mustaqil geometrik kattalikni – standart og‘ish (Z-baho), mahalliy qiyalik va uchburchak yuzasi orqali egrilikni – birlashtiradi. Ko‘p yo‘lli nomzodlik qoidasi anomaliya va trend burilishlarini ustuvor qiladi, chiqish hajmi esa qat’iy cheklanadi. O‘n bazaviy usul teng nuqta byudjetida, to‘rt sintetik pattern va binolarning konstruktiv holatini monitoring qilish (SHM) bo‘yicha real belgilangan ma’lumotlar to‘plamida geometrik, perseptual va anomaliyani saqlash metrikalari bilan solishtirildi. Real ma’lumotlarda AdaptiveM4 eng yuqori F1 = 0.318 natijani berdi (eng kuchli bazaviy usulda 0.283), 100 000 nuqta taxminan 20 ms da qayta ishlanadi – bu aniq geometrik soddalashtiruvchilardan bir tartibga tezroq. Og‘irliklarni tanlashdagi optimistik siljish va yaxlit egri aniqligining pasayishi ochiq bayon qilinadi
Foydalanilgan adabiyotlar
1. Geometric perceptual importance algorithm for real-time visualization of streaming time series // Eurasian Journal of Mathematical and Computer Applications. – 2026. – Vol. 14, № 3. – P. 64–84. – DOI: 10.32523/2306-6172-2026-14-3-64-84.
2. Jugel U., Jerzak Z., Hackenbroich G., Markl V. M4: A Visualization-Oriented Time Series Data Aggregation // Proceedings of the VLDB Endowment. – 2014. – Vol. 7, No. 10. – P. 797–808. – DOI: 10.14778/2732951.2732953.
3. Jugel U., Jerzak Z., Hackenbroich G., Markl V. VDDA: Automatic Visualization-Driven Data Aggregation in Relational Databases // The VLDB Journal. – 2016. – Vol. 25, No. 1. – P. 53–77. – DOI: 10.1007/s00778-015-0396-z.
4. Rui L., Huang X., Song S., Kang Y., Wang C., Wang J. Time Series Representation for Visualization in Apache IoTDB // Proc. ACM on Management of Data. – 2024. – Vol. 2, No. 1. – Art. 35. – DOI: 10.1145/3639290.
5. Wang Y. et al. OM3: An Ordered Multi-Level Min-Max Representation for Interactive Progressive Visualization of Time Series // Proc. ACM on Management of Data. – 2023. – Vol. 1, No. 2. – Art. 145. – DOI: 10.1145/3589290.
6. Maroulis S., Stamatopoulos V., Papastefanatos G., Terrovitis M. Visualization-Aware Time Series Min-Max Caching with Error Bound Guarantees // Proceedings of the VLDB Endowment. – 2024. – Vol. 17, No. 8. – P. 2091–2103. – DOI: 10.14778/3659437.3659460.
7. Steinarsson S. Downsampling Time Series for Visual Representation: Master’s thesis. – Reykjavik: University of Iceland, 2013.
8. Visvalingam M., Whyatt J.D. Line Generalisation by Repeated Elimination of Points // The Cartographic Journal. – 1993. – Vol. 30, No. 1. – P. 46–51. – DOI: 10.1179/000870493786962263.
9. Van Der Donckt J., Van Der Donckt J., Rademaker M., Van Hoecke S. MinMaxLTTB: Leveraging MinMax-Preselection to Scale LTTB // Proc. IEEE Visualization and Visual Analytics (VIS). – 2023. – P. 21–25. – DOI: 10.1109/VIS54172.2023.00013.
10. Van Der Donckt J., Van Der Donckt J., Deprost E., Van Hoecke S. Plotly-Resampler: Effective Visual Analytics for Large Time Series // Proc. IEEE Visualization and Visual Analytics (VIS). – 2022. – DOI: 10.1109/VIS54862.2022.00013.
11. Rui L., Huang X., Song S., Wang C., Wang J., Cao Z. Largest Triangle Sampling for Visualizing Time Series in Database // Proc. ACM on Management of Data. – 2025. – Vol. 3, No. 1. – Art. 49. – DOI: 10.1145/3709699.
12. Van Der Donckt J., Van Der Donckt J., Rademaker M., Van Hoecke S. Data Point Selection for Line Chart Visualization: Methodological Assessment and Evidence-Based Guidelines // arXiv:2304.00900. – 2023.
13. Douglas D.H., Peucker T.K. Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature // Cartographica. – 1973. – Vol. 10, No. 2. – P. 112–122. – DOI: 10.3138/FM57-6770-U75U-7727.
14. Elmeleegy H., Elmagarmid A.K., Cecchet E., Aref W.G., Zwaenepoel W. Online Piece-wise Linear Approximation of Numerical Streams with Precision Guarantees // Proceedings of the VLDB Endowment. – 2009. – Vol. 2, No. 1. – P. 145–156. – DOI: 10.14778/1687627.1687645.
15. Kitsios X., Liakos P., Papakonstantinopoulou K., Kotidis Y. Sim-Piece: Highly Accurate Piecewise Linear Approximation through Similar Segment Merging // Proceedings of the VLDB Endowment. – 2023. – Vol. 16, No. 8. – P. 1910–1922. – DOI: 10.14778/3594512.3594521.
16. Kitsios X., Liakos P., Papakonstantinopoulou K., Kotidis Y. Flexible Grouping of Linear Segments for Highly Accurate Lossy Compression of Time Series Data // The VLDB Journal. – 2024. – Vol. 33, No. 5. – P. 1569–1589. – DOI: 10.1007/s00778-024-00862-z.
17. Muniz-Cuza C.E., Boehm M., Pedersen T.B. CAMEO: Autocorrelation-Preserving Line Simplification for Lossy Time Series Compression // Proc. 29th Int. Conf. on Extending Database Technology (EDBT). – 2026. – P. 15–28. – DOI: 10.48786/edbt.2026.02.
18. Keogh E., Chakrabarti K., Pazzani M., Mehrotra S. Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases // Knowledge and Information Systems. – 2001. – Vol. 3, No. 3. – P. 263–286. – DOI: 10.1007/PL00011669.
19. Lin J., Keogh E., Lonardi S., Chiu B. A Symbolic Representation of Time Series, with Implications for Streaming Algorithms // Proc. 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. – 2003. – P. 2–11. – DOI: 10.1145/882082.882086.
20. Lin J., Keogh E., Wei L., Lonardi S. Experiencing SAX: A Novel Symbolic Representation of Time Series // Data Mining and Knowledge Discovery. – 2007. – Vol. 15, No. 2. – P. 107–144. – DOI: 10.1007/s10618-007-0064-z.
21. Rong K., Bailis P. ASAP: Prioritizing Attention via Time Series Smoothing // Proceedings of the VLDB Endowment. – 2017. – Vol. 10, No. 11. – P. 1358–1369. – DOI: 10.14778/3137628.3137645.
22. Cleveland W.S., McGill R. Graphical Perception: Theory, Experimentation, and Application to the Development of Graphical Methods // Journal of the American Statistical Association. – 1984. – Vol. 79, No. 387. – P. 531–554. – DOI: 10.1080/01621459.1984.10478080.
23. Haehn D., Tompkin J., Pfister H. Evaluating ‘Graphical Perception’ with CNNs // IEEE Transactions on Visualization and Computer Graphics. – 2019. – Vol. 25, No. 1. – P. 641–650. – DOI: 10.1109/TVCG.2018.2865138.
24. Yeh C.-C.M. et al. Matrix Profile I: All Pairs Similarity Joins for Time Series: A Unifying View that Includes Motifs, Discords and Shapelets // Proc. IEEE 16th Int. Conf. on Data Mining (ICDM). – 2016. – P. 1317–1322. – DOI: 10.1109/ICDM.2016.0179.
25. Esling P., Agon C. Time-Series Data Mining // ACM Computing Surveys. – 2012. – Vol. 45, No. 1. – Art. 12. – P. 1–34. – DOI: 10.1145/2379776.2379788.
26. Schmidl S., Wenig P., Papenbrock T. Anomaly Detection in Time Series: A Comprehensive Evaluation // Proceedings of the VLDB Endowment. – 2022. – Vol. 15, No. 9. – P. 1779–1797. – DOI: 10.14778/3538598.3538602.
27. Wu R., Keogh E.J. Current Time Series Anomaly Detection Benchmarks are Flawed and are Creating the Illusion of Progress // IEEE Transactions on Knowledge and Data Engineering. – 2023. – Vol. 35, No. 3. – P. 2421–2429. – DOI: 10.1109/TKDE.2021.3112126.
28. Eiter T., Mannila H. Computing Discrete Fréchet Distance: Technical Report CD-TR 94/64. – Vienna: Christian Doppler Laboratory for Expert Systems, TU Vienna, 1994.
29. Alt H., Godau M. Computing the Fréchet Distance between Two Polygonal Curves // International Journal of Computational Geometry & Applications. – 1995. – Vol. 5, No. 1–2. – P. 75–91. – DOI: 10.1142/S0218195995000064.
30. Huttenlocher D.P., Klanderman G.A., Rucklidge W.J. Comparing Images Using the Hausdorff Distance // IEEE Transactions on Pattern Analysis and Machine Intelligence. – 1993. – Vol. 15, No. 9. – P. 850–863. – DOI: 10.1109/34.232073.
31. Wang Z., Bovik A.C., Sheikh H.R., Simoncelli E.P. Image Quality Assessment: From Error Visibility to Structural Similarity // IEEE Transactions on Image Processing. – 2004. – Vol. 13, No. 4. – P. 600–612. – DOI: 10.1109/TIP.2003.819861.