An Efficient Trajectory Representative Generation Moving Web-Based Data Prediction Using Different Clustering Algorithms

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

This paper highlighted moving and trajectory object cluster (MOTRACLUS) algorithm and analyzed the sub-trajectories and real-trajectories algorithm for moving web-based data and suggested a new approach of moving elements. This paper evaluates the hurricane data measure and mass less data measure entropy of trajectories objects of moving data of Chhattisgarh location. The paper covered prediction generation with their distance cluster minimum description length (MDL) algorithm and other corresponding distance cluster (CLSTR) algorithm. This paper highlighted the k-nearest algorithm with least cluster section (LCSS) model and dimensional Euclidean of MDL algorithm. The algorithm consists of two parts, that is, partitioning and grouping phase. This paper develops and enhances a cluster of trajectory objects and calculates the actual distance of moving objects. This algorithm works on the CLSTR algorithm and calculates trajectory movement of the object. In this, the authors evaluate the entropy of moving objects by consideration of the heuristic parameter.

Cite

CITATION STYLE

APA

Mishra, V. K., Mishra, M., Dewangan, B. K., & Choudhury, T. (2023). An Efficient Trajectory Representative Generation Moving Web-Based Data Prediction Using Different Clustering Algorithms. International Journal of Information System Modeling and Design, 13(7). https://doi.org/10.4018/IJISMD.316132

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free