TIME SERIES DATA CLUSTERING BASED ON DIFFERENTIAL EVOLUTION ALGORITHM AND DISCRETE COSINE TRANSFORM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

IZAKIAN Z.; AMERIAN Y.; MESGARI SAADI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF GEOMATICS SCIENCE AND TECHNOLOGY Year:2016 | Volume:5 | Issue:4 Page(s): 199-209

Download Full-Text

Persian Verion

View:

1,572

Download:

Cites:

Information Journal Paper

Title

TIME SERIES DATA CLUSTERING BASED ON DIFFERENTIAL EVOLUTION ALGORITHM AND DISCRETE COSINE TRANSFORM

Author(s)

IZAKIAN Z. | AMERIAN Y. | MESGARI SAADI M. | Issue Writer Certificate

Keywords

TIME SERIESQ2

CLUSTERINGQ2

FUZZY CQ2

MEANSQ2

DIFFERENTIAL EVOLUTIONQ2

DISCRETE COSINE TRANSFORMQ2

Abstract

TIME SERIES is a type of data with complex structure. Analysis of TIME SERIES is used in sciences such as meteorology, economics, geology, marine science, medicine and engineering widely. So, Because of TIME SERIES applications in various sciences, the interest to analyze these data has been increased. On the other hand by developing information gathering technologies such as mobile, GPS and sensors, and Access to large volumes of TIME SERIES data, we always require methods to extract useful information from large datasets. Thus, data mining is an important method for solving this problem. CLUSTERING analysis as the most commonly used function of data mining, has attracted many researchers in computer science. CLUSTERING is a strong instrument for knowledge discovery and it provides useful information about existing patterns in datasets. In general, the purpose of CLUSTERING is representing large datasets by a fewer number of cluster centers. It simplifies large datasets and thus is an important step in the process of knowledge discovery and data mining. FUZZY C-means (FCM) CLUSTERING is one of the most important classic CLUSTERING methods that have been used in many researches. The main disadvantage of this method is the high probability of getting trapped in local optima especially in facing high-dimensional data such as TIME SERIES. Furthermore Euclidean distance is the most commonly used similarity measure in FUZZY C-means but sometimes, its necessary to use another similarity/dissimilarity measures instead of Euclidean distance. In this paper in order to compensate the shortcomings of FUZZY C-means algorithm, we used one of the existing evolutionary algorithms. Evolutionary algorithms has gained huge popularity in the field of pattern recognition and CLUSTERING recently. Among the existing evolutionary algorithms, the DIFFERENTIAL EVOLUTION algorithm as a strong, fast and efficient global search method has been attracted the attention of researchers. In this paper, we proposed a technique for CLUSTERING TIME SERIES data using a combination of FUZZY C-means and DIFFERENTIAL EVOLUTION (DE) approach and we considered dynamic time warping (DTW) as distance measures between TIME SERIES. Also, in this method we used DISCRETE COSINE TRANSFORM (DCT) to TIME SERIES dimension reduction. Finding all elements of cluster centers using DIFFERENTIAL EVOLUTION is time consuming and the large number of unknown parameters related to the cluster centers will reduce the efficiency and the speed of DIFFERENTIAL EVOLUTION algorithm. So, for reducing the search space, the most important DISCRETE COSINE TRANSFORM coefficients of the cluster centers were recognized as the main unknown CLUSTERING problem in the proposed method and DIFFERENTIAL EVOLUTION algorithm tries to determine the near optimal DISCRETE COSINE TRANSFORM coefficients of cluster centers by minimizing the FUZZY C-means objective function. Experimental results over two popular data sets indicate the superiority of the proposed technique compared to FUZZY C-means and a CLUSTERING algorithm based on DIFFERENTIAL EVOLUTION without using dimension reduction techniques. Comparing the run time of the methods, the proposed method is slower than the FUZZY C-means CLUSTERING algorithm, but due to the use of DISCRETE COSINE TRANSFORM method to reduce unknowns, it operates faster than DIFFERENTIAL EVOLUTION without using dimension reduction techniques.

Cites

No record.

References

No record.

Cite

APA: Copy

IZAKIAN, Z., AMERIAN, Y., & MESGARI SAADI, M.. (2016). TIME SERIES DATA CLUSTERING BASED ON DIFFERENTIAL EVOLUTION ALGORITHM AND DISCRETE COSINE TRANSFORM. JOURNAL OF GEOMATICS SCIENCE AND TECHNOLOGY, 5(4), 199-209. SID. https://sid.ir/paper/249560/en

Vancouver: Copy

IZAKIAN Z., AMERIAN Y., MESGARI SAADI M.. TIME SERIES DATA CLUSTERING BASED ON DIFFERENTIAL EVOLUTION ALGORITHM AND DISCRETE COSINE TRANSFORM. JOURNAL OF GEOMATICS SCIENCE AND TECHNOLOGY[Internet]. 2016;5(4):199-209. Available from: https://sid.ir/paper/249560/en

IEEE: Copy

Z. IZAKIAN, Y. AMERIAN, and M. MESGARI SAADI, “TIME SERIES DATA CLUSTERING BASED ON DIFFERENTIAL EVOLUTION ALGORITHM AND DISCRETE COSINE TRANSFORM,” JOURNAL OF GEOMATICS SCIENCE AND TECHNOLOGY, vol. 5, no. 4, pp. 199–209, 2016, [Online]. Available: https://sid.ir/paper/249560/en

Related Journal Papers