LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Mining moving object gathering pattern based on Resilient Distributed Datasets and R-tree index

Photo from wikipedia

Abstract It is important to mine moving object gathering pattern, but the traditional algorithms cannot effectively analyze the trajectory data with mass scale. A parallel mining algorithm based on Resilient… Click to show full abstract

Abstract It is important to mine moving object gathering pattern, but the traditional algorithms cannot effectively analyze the trajectory data with mass scale. A parallel mining algorithm based on Resilient Distributed Datasets (RDD-Gathering) and R-tree index is proposed to discover the gathering pattern in the massive trajectory data, and the mining functions are provided as cloud services on Spark. MongoDB cluster is constructed to store massive trajectory data, R-tree index structure is used to store the trajectory data, and the RDD-Gathering algorithm interface is encapsulated with RESTful cloud service. The RDD-Gathering algorithm is implemented based on Apache Spark and performances are better than normal methods in real trajectory dataset testing.

Keywords: object gathering; moving object; gathering pattern; mining; tree index

Journal Title: Neurocomputing
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.