Abstract
along with more and more trajectory dataset being collected into application servers, the research in trajectory clustering has become increasingly important topic. This paper proposes a new mobile object trajectory Clustering algorithm (Trajectory Clustering based Improved Minimum Hausdorff Distance under Translation, TraClustMHD). In this framework, improved Minimum Hausdorff Distance under Translation is presented to measure the similarity between sub-segments. In additional, R-Tree is employed to improve the efficiency. The experimental results showed that this algorithm better than based on Hausdorff distance and based on line Hausdorff distance has good trajectory clustering performance.
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.
