International Journal on Computer Science and Technology (IJCST)
In this paper, the authors exploit the characteristics of group movements to discover the information about groups of moving objects in tracking applications. They propose a distributed mining algorithm, which consists of a local GMP-Mine algorithm and a CE algorithm, to discover group movement patterns. With the discovered information, they devise the 2P2D algorithm, which comprises a sequence merge phase and an entropy reduction phase. In the sequence merge phase, they propose the Merge algorithm to merge the location sequences of a group of moving objects with the goal of reducing the overall sequence length. In the entropy reduction phase, they formulate the HIR problem and propose a Replace algorithm to tackle the HIR problem.