Abstract
Location based updation and clustering is important issue in dynamic road network. In dynamic road network moving object clustering is needed because huge number of moving objects are moving in the constrained road network. In this paper introduced new clustering algorithm for grouping similar objects in dynamic road network. The proposed clustering method is called density-based clustering. In this work the spatial and temporal objects are clustered separated and combined as per the requirements. The spatial distance between the moving objects are calculated with the help of Non-Ecludeian Distance. The Experiment is conducted using Geo-life GPS trajectory data and results are compared with K-mean moving object clustering (K-MCL) and moving object clustering methods (MC). The results are compared using accuracy, updation cost and speed of clustering parameters.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
