Heuristic Search Based Feature Selection and Discretive Self-Organized Map Clustering for Spatio-Temporal Pattern Discovery
R.Sarala1, V.Saravanan2

1Mrs.R.Sarala is a Assistant Professor in Department of Computer Science at KG College of Arts and Science, Coimbatore.

2Dr. V. Saravanan, Associate Professor & HEAD, Hindusthan College of Arts and Science, Department of IT, Hindusthan College of Arts and Science,Coimbatore – 641 028

Manuscript received on 02 October 2019 | Revised Manuscript received on 13 October 2019 | Manuscript Published on 29 June 2020 | PP: 197-207 | Volume-8 Issue-10S2 August 2019 | Retrieval Number: J103508810S19/2019©BEIESP | DOI: 10.35940/ijitee.J1035.08810S19

Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© 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: Spatio-temporal pattern discovery is an essential one in data mining for predictive analytics. Since it manages both space and time information depending on their characteristics and the preferred applications performances. The predictive analytics uses the Spatio-temporal features to discover future outcomes. The several works have been done in the Spatio-temporal pattern discovery. But the accurate pattern discovery is the major challenges. In order to improve the accurate pattern discovery, Heuristic Best-First Search based Discretized Self-Organizing Feature Map (HBFS-DSOFM) Model is introduced. The HBFS-DSOFM model comprises two processes namely, Spatio-temporal feature selection and clustering. Initially, the Heuristic Best-First Search Algorithm is used for selecting the relevant Spatio-temporal features from the large dataset for pattern discovery. Best-first search explores a decision tree for selecting the relevant Spatio-temporal features through the maximum information gain value. After that, the Spatio-temporal data are clustered with the selected features by using Discretized Self-Organizing Feature Mapping Algorithm for Spatio-temporal pattern discovery. In Discretized Self-Organizing Feature Mapping, input spatio-temporal data is connected to the prototype neurons through the synaptic weight. For the clustering process, weights of the neurons (i.e. cluster) are initialized with random values. After that, the Manhattan distance is used to compute the distance between the input vector and cluster weight value. The gradient descent is applied to discover closest distance. The cluster whose weight is closest to the input data is grouped into the particular cluster. Then the weight of the cluster is updated with the previous weight value for grouping the entire data. This clustering process gets iterated until it satisfies termination condition. Finally, the outputs of Spatio-temporal data are combined to form a spatio-temporal pattern for efficient predictive analytics. Experimental evaluation is carried out for El Nino Dataset and taxi trajectory dataset using the factors such as time complexity, clustering accuracy, and false positive rate. The results confirm that the proposed HBFS-DSOFM model increases the Spatio-temporal pattern discovery in terms of high clustering accuracy with a less false positive rate as well as minimum time complexity. Based on the clarification, HBFS-DSOFM model is more efficient than the state-of-the-art methods.

Keywords: Spatio-Temporal Pattern Discovery, Spatio-Temporal Feature Selection, Heuristic Best-First Search,
Scope of the Article: Service Discovery and Composition