Algorithms for identification and classification of repeating fragments on experimental curves

MaRDI QIDQ1082018zbMATH OpenFDO

Authors S. A. Vorob'ev

Publication date 1985

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

algorithmclassificationexperimental curves with repeating fragmentssegmentation problem

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inference from stochastic processes (62M99) Artificial intelligence (68T99)

Review text

A model is proposed for the description of experimental curves with repeating fragments. The segmentation problem is considered for such curves and the estimation of model parameters from a sample curve is discussed. An algorithm is proposed for solving the segmentation and estimation problems.

Recommendations

• Algorithmic implementation of a linguistic approach to analysis of experimental curves
• Selection of thresholds for failure algorithm of segmentation of experimental curves
• Segmentation of structural curves using dynamic programming methods
• Optimal segmentation of empirical structural curves using dynamic programming
• Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems

Cited in

(2)

• Algorithmic implementation of a linguistic approach to analysis of experimental curves
• Selection of thresholds for failure algorithm of segmentation of experimental curves

This page was built for publication: Algorithms for identification and classification of repeating fragments on experimental curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082018)