Abstract

Implicit polynomial (IP) curve is applied to represent data set boundary in image processing and computer vision. In this work, we employed it to reduce dimensionality of time series and produce similarity measure for time series mining. To use IP curve, time series was transformed to star coordination series. Then the star coordination series was fitted by implicit polynomial curve. That is, IP curve approximated (IPA) time series. Lastly, similarity measure of the time series was produced from the fitting implicit polynomial curve. To guarantee no false negatives, the lower bounding lemma for the similarity measure based on IP curve (IPD) was proved. We extensively compared IPA with other similarity measure and dimension reduction techniques in classification frameworks. Experimental results from the tests on various datasets indicate that IPA is more efficient than other methods.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.