In the last few years, RFID is commonly used in many related fields of new service application and new study as one of the significant technological advancements, such as science manufacturing, logistics transportation, traffic management, medical information, and so on. Those intelligent and automatic innovative products gradually take the place of manpower. Due to low cost and remote automatic identification advantages, RFID technology seems to be a popular current trend. In RFID database, there is a vast number of RFID trajectory data with the spatial-temporal characteristic. How to extract the traveling partners from these data is a difficult problem. For solving the difficult problem, we proposed an algorithm called MTP to discovery the traveling partners from RFID database, it uses a intersecting method to mine moving objects with moving together in a period of time. Meanwhile, we analyze the performance of MTP, the result of our experiment demonstrate that the MTP algorithm is suited to mine the traveling partners.
[1]
Joachim Gudmundsson,et al.
Reporting flock patterns
,
2008,
Comput. Geom..
[2]
Jae-Gil Lee,et al.
Incremental Clustering for Trajectories
,
2010,
DASFAA.
[3]
Jiawei Han,et al.
Mining periodic behaviors of object movements for animal and biological sustainability studies
,
2011,
Data Mining and Knowledge Discovery.
[4]
Yingjiu Li,et al.
SecTTS: A secure track & trace system for RFID-enabled supply chains
,
2012,
Comput. Ind..
[5]
Kongfa Hu,et al.
Mining Frequent Path of Moving Objects in Radio Frequency IDentification Database
,
2012
.
[6]
Bettina Speckmann,et al.
Trajectory Grouping Structures
,
2013,
ArXiv.
[7]
Jiawei Han,et al.
Swarm: Mining Relaxed Temporal Moving Object Clusters
,
2010,
Proc. VLDB Endow..