Hybridized Gradient Descent Spectral Graph and Local-global Louvain Based Clustering of Temporal Relational Data
L. Jaya Singh Dhas1, B. Mukunthan2, G. Rakesh3
1L. Jaya Singh Dhas*, Research Scholar, Department of Computer Science, Jairams Arts and Science College, (Affiliated to Bharathidasan University, Tiruchirapalli) Karur, Tamilnadu, India.
2B. Mukunthan, Research Supervisor & Assistant Professor, Department of Computer Science, Jairams Arts and Science College, (Affiliated to Bharathidasan University, Tiruchirapalli) Karur, Tamilnadu, India.
3G. Rakesh, Dean of Science, Department of Computer Science, Jairams Arts and Science College, (Affiliated to Bharathidasan University, Tiruchirapalli) Karur, Tamil Nadu, India.
Manuscript received on January 23, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 30, 2020. | PP: 3515-3521 | Volume-9 Issue-3, February 2020. | Retrieval Number: C5989029320/2020©BEIESP | DOI: 10.35940/ijeat.C5989.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Temporal data clustering examines the time series data to determine the basic structure and other characteristics of the data. Many methodologies simply process the temporal dimension of data but it still faces the many challenges for extracting useful patterns due to complex data types. In order to analyze the complex temporal data, Hybridized Gradient Descent Spectral Graph and Local-Global Louvain Clustering (HGDSG-LGLC) technique are designed. The number of temporal data is gathered from input dataset. Then the HGDSG-LGLC technique performs graph-based clustering to partitions the vertices i.e. data into different clusters depending on similarity matrix spectrum. The distance similarity is measured between the data and cluster mean. The Gradient Descent function find minimum distance between data and cluster mean. Followed by, the Local-Global Louvain method performs the merging and filtering of temporal data to connect the local and global edges of the graph with similar data. Then for each data, the change in modularity is calculated for filtering the unwanted data from its own cluster and merging it into the neighboring cluster. As a result, optimal ‘k’ numbers of clusters are obtained with higher accuracy with minimum error rate. Experimental analysis is performed with various parameters like clustering accuracy ( ), error rate ( ), computation time ( ) and space complexity ( ) with respect to number of temporal data. The proposed HGDSG-LGLC technique achieves higher and lesser , minimum as well as than conventional methods.
Keywords: Temporal data analysis, Gradient Descent Spectral graph clustering, Local-Global Louvain method, change in modularity.