Abstract
Mining of time series pattern is an important research area, of which getting LCSS(Longest Common Subsequence) between high-dimensional time series is one of the most important issues. Large scale data needs to be handled in practical applications, so the research of efficient retrieval method is becoming a realistic work. Based on the issues above, we propose an efficient parallel algorithm to get LCSS between time series with the help of GPU (Graphics Processor Unit). On that basis, propose a parallel limit least matching rate LCSS algorithm (Parallel-Limited-LCSS), and optimize the retrieve parts of the algorithm with the help of inverted index structure, so as to enhance the efficiency of the algorithm. Experiments show that our algorithm has excellent speed and accuracy, and can be applied to the field of data mining widely.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
