| Abstrakt: |
Trajectory contains spatial-data generated from traces of moving objects like people, animals, etc. Community generated from trajectories portrays common behaviour. Trajectory clustering based on community-detection involves region-graph generation and community-detection. In region-graph generation, trajectories are projected to spatial grid to transform GPS representation into string representation. Sequential graph is generated from string representation. Edge-based similarity is calculated between trajectories to create an adjacency matrix representing relationship and represent entire region. In community-detection phase, region-graph is divided into communities using various algorithms and validated using modularity values. Based on analysis, Louvain, fast-greedy, leading-eigenvector, and edge-betweenness algorithms provide the optimum modularity value for better community detection. Analysing the community can be used as a pre-processing step in identifying location for location-based services (LBS), including hotspots, delay-tolerant-networks, and mobile antenna placements for better coverage. Design and capacity planning of the network based on the size and pattern of the community improves quality of LBS. |
