DocumentCode :
2851160
Title :
Predicting density-based spatial clusters over time
Author :
Lai, Chih ; Nguyen, Nga T.
Author_Institution :
Graduate Programs in Software Eng., St. Thomas Univ., St. Paul, MN, USA
fYear :
2004
fDate :
1-4 Nov. 2004
Firstpage :
443
Lastpage :
446
Abstract :
Most of existing clustering algorithms are designed to discover snapshot clusters that reflect only the current status of a database. Snapshot clusters do not reveal the fact that clusters may either persist over a period of time, or slowly fade away as other clusters may gradually develop. Predicting dynamic cluster evolutions and their occurring periods are important because this information can guide users to prepare appropriate actions toward the right areas during the right time for the most effective results. In this paper we developed a simple but effective approach in predicting the future distance among object pairs. Objects that will be close in distance over different periods of time are then processed to discover density-based clusters that may occur or change over time.
Keywords :
data mining; pattern clustering; statistical analysis; cluster evolution prediction; clustering algorithm; density-based spatial cluster; snapshot cluster discovery; Air traffic control; Algorithm design and analysis; Cities and towns; Clustering algorithms; Computational efficiency; Missiles; Software algorithms; Software engineering; Spatial databases; Weapons;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining, 2004. ICDM '04. Fourth IEEE International Conference on
Print_ISBN :
0-7695-2142-8
Type :
conf
DOI :
10.1109/ICDM.2004.10018
Filename :
1410331
Link To Document :
بازگشت