📞 +91-7667918914 | âœ‰ī¸ ijarcce@gmail.com
International Journal of Advanced Research in Computer and Communication Engineering
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 1, ISSUE 10, DECEMBER 2012

A Survey on Temporal Data Clustering

M.YASODHA, DR. P.PONMUTHURAMALINGAM

👁 1 viewđŸ“Ĩ 0 downloads
Share: 𝕏 f in ✈ ✉
Abstract: Temporal data clustering provides underpinning techniques for discovering the intrinsic structure and condensing information over temporal data. To classify data mining problems and algorithms used two dimensions: data type and type of mining operations. One of the main issue that arise during the data mining process is treating data that contains temporal information. Temporal data representations are generally classified into two categories: piecewise and global representations the area of temporal data mining has very much attention in the last decade because from the time related feature of the data, one can extract much significant information which cannot be extracted by the general methods of data mining. Many interesting techniques of temporal data clustering were proposed and shown to be useful in many applications. Since temporal data clustering brings together techniques from different fields such as databases, statistics and machine learning the literature is scattered among many different sources. In this paper, present a survey on temporal data clustering.

Keywords: Temporal Data, Data Mining, Clustering

How to Cite:

[1] M.YASODHA, DR. P.PONMUTHURAMALINGAM, “A Survey on Temporal Data Clustering,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License.