Abstract
Mining Time Series data has a tremendous growth of interest in today's world. Clustering time series is a trouble that has applications in an extensive assortment of fields and has recently attracted a large amount of researchers. Time series data are frequently large and may contain outliers. In addition, time series are a special type of data set where elements have a temporal ordering. Therefore clustering of such data stream is an important issue in the data mining process. The clustering algorithms and its effectiveness on various applications are compared to develop a new method to solve the existing problem. This paper presents a comparison between Hierarchical clustering algorithm and Online Divisible Agglomerative Clustering algorithm (ODAC) using ECG data sets.
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.
