Journal article Open Access

# Hybridized Gradient Descent Spectral Graph and Local-global Louvain Based Clustering of Temporal Relational Data

L. Jaya Singh Dhas,; B. Mukunthan; G. Rakesh

### DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<identifier identifierType="URL">https://zenodo.org/record/5593850</identifier>
<creators>
<creator>
<creatorName>L. Jaya Singh Dhas,</creatorName>
<familyName>L. Jaya Singh Dhas</familyName>
<affiliation>Research Scholar, Department of Computer  Science, Jairams Arts and Science College, (Affiliated to Bharathidasan  University, Tiruchirappalli) Karur - 639003, Tamilnadu, India.</affiliation>
</creator>
<creator>
<creatorName>B. Mukunthan</creatorName>
<affiliation>Research Scholar, Department of Computer  Science, Jairams Arts and Science College, (Affiliated to Bharathidasan  University, Tiruchirappalli) Karur - 639003, Tamilnadu, India.</affiliation>
</creator>
<creator>
<creatorName>G. Rakesh</creatorName>
<affiliation>Dean of Science, Department of Computer Science, Jairams  Arts and Science College, (Affiliated to Bharathidasan University,  Tiruchirappalli) Karur - 639003, Tamilnadu, India.</affiliation>
</creator>
</creators>
<titles>
<title>Hybridized Gradient Descent Spectral Graph and  Local-global Louvain Based Clustering of  Temporal Relational Data</title>
</titles>
<publisher>Zenodo</publisher>
<publicationYear>2020</publicationYear>
<subjects>
<subject>Temporal data analysis, Gradient Descent Spectral graph clustering, Local-Global Louvain method, change in modularity</subject>
<subject subjectScheme="issn">2249-8958</subject>
</subjects>
<contributors>
<contributorName>Blue Eyes Intelligence Engineering  &amp; Sciences Publication(BEIESP)</contributorName>
<affiliation>Publisher</affiliation>
</contributor>
</contributors>
<dates>
<date dateType="Issued">2020-02-29</date>
</dates>
<language>en</language>
<resourceType resourceTypeGeneral="JournalArticle"/>
<alternateIdentifiers>
<alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/5593850</alternateIdentifier>
</alternateIdentifiers>
<relatedIdentifiers>
<relatedIdentifier relatedIdentifierType="ISSN" relationType="IsCitedBy" resourceTypeGeneral="JournalArticle">2249-8958</relatedIdentifier>
<relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.35940/ijeat.C5989.029320</relatedIdentifier>
</relatedIdentifiers>
<rightsList>
<rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
</rightsList>
<descriptions>
<description descriptionType="Abstract">&lt;p&gt;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 &amp;lsquo;k&amp;rsquo; 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.&lt;/p&gt;</description>
</descriptions>
</resource>

39
18
views