Important point-based time sequence fixed segmentation algorithm

A time series and segmentation algorithm technology, applied in computing, special data processing applications, instruments, etc., can solve the problems of selecting the degree of compression, inability to find, and the error threshold parameter value is not well estimated, so as to reduce the simulation Fitting error, small fitting error, good fitting effect and adaptive effect

Inactive Publication Date: 2017-12-12
TIANJIN UNIV OF SCI & TECH
View PDF0 Cites 24 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the defect of this method is that the degree of compression cannot be selected according to the user's needs, because this method uses a recursive call method to decompose the leftmost sequence until the fitting error is less than a certain value specified by the user. The need to find the most important specified number of points
[0008] The time series fixed segment number segmentation algorithm based on important points proposed by Chen Ran uses the fitting error of each segment as the priority standard, and sets the error threshold as the input parameter, but the parameter value of the error threshold is not easy to estimate
[0009] In summary, the existing time series important point segmentation algorithm has a lot of room for improvement in the accuracy of fitting error and time efficiency

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Important point-based time sequence fixed segmentation algorithm
  • Important point-based time sequence fixed segmentation algorithm
  • Important point-based time sequence fixed segmentation algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] Embodiments of the present invention will be described in further detail below in conjunction with the accompanying drawings.

[0042] The present invention proposes a time series fixed segmentation algorithm (PLR_TSIP, PiecewiseLinear Representation Time Series Important Points) based on important points, and this algorithm input is time series X=(x 1 ,x 2 ,x 3 ,...,x i ,...,x n ) and a fixed number of segments N or compression rate, the output of this algorithm is the important point set IPs. Such as figure 1 Shown, the present invention comprises the following steps:

[0043] Step 1. Normalize the time series data X, initialize the set IPs of the segmentation points, add the start and end points of the time series X to the set IPs, and add the segments formed by the start and end points of X to the priority In queue Q.

[0044] Step 2. Calculate the fitting error of the newly added segment in the priority queue Q, and the priority queue Q is sorted according t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to an important point-based time sequence fixed segmentation algorithm. According to the main technical characteristics, the algorithm comprises the steps of performing normalization processing on time sequence data; calculating segmentation fitting errors and performing sorting according to priorities of the segmentation fitting errors from high to low; extracting first k segments with maximum fitting errors and performing sorting from long to short according to segment lengths of a time sequence; extracting first two segments sorted according to the segment lengths, and performing fitting preprocessing; and comparing symbol and value relationships of maximum values and minimum values of the fitting errors in segmentation, determining important points to perform segmentation, progressively increasing the number of the important points, and performing loop iteration until a fixed segment number is reached. The algorithm is reasonable in design, greatly reduces the fitting errors, improves the segmentation efficiency, has very good fitting effect and adaptability, and can be widely used in the fields of time sequence prediction, clustering, anomaly detection and the like.

Description

technical field [0001] The invention belongs to the technical field of intelligent information processing, in particular to a time series fixed segmentation algorithm based on important points. Background technique [0002] Time series refers to the ordered collection of observation records arranged in chronological order, which widely exists in the fields of business, economics, scientific engineering and social sciences. In recent years, data mining research on time series data has received widespread attention, including association rule mining, similarity query, pattern discovery, anomaly detection, etc. As time goes by, time series usually contains a large amount of data. How to conduct statistics and analysis on these time series data and find some valuable information and knowledge has always been an issue of interest to users. However, due to the massive and complex characteristics of time series data, data mining directly on the time series will not only cost a lot...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
CPCG06F16/90348
Inventor 孙志伟董亮亮马永军
Owner TIANJIN UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products