• DocumentCode
    1989171
  • Title

    Efficiently maintaining moving micro clusters for clustering moving objects

  • Author

    Lai, Chih ; Heuer, Edward A.

  • Author_Institution
    Grad. Programs in Software Eng., Univ. of St. Thomas, St. Paul, MN
  • fYear
    2008
  • fDate
    2-4 June 2008
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    Clustering moving objects is a challenging task, especially when space consumption must be flexibly and efficiently adjusted based on dynamic object movement. In this paper we develop an efficient approach to dynamically maintain a small set of moving micro clusters (MMCs) to represent groups of similar moving objects. Global clusters can then be generated by any clustering algorithm, whenever is needed, from these representative MMCs, not from individual objects. Under our approach, each MMC is represented by a vector that summarizes the position and velocity information of its member objects. Based on this summarized information, a set of simple formulas is developed to efficiently predict when the contents of MMCs must be updated. MMCs are also organized into a moving cluster feature (MCF) tree so they can be efficiently merged for conserving space and accelerating global clustering.
  • Keywords
    pattern clustering; trees (mathematics); vectors; global clustering; moving cluster feature tree; moving microcluster; object clustering; vector; Acceleration; Algorithm design and analysis; Animals; Cellular phones; Clustering algorithms; Data structures; Kinetic theory; Merging; Software engineering; Spatial databases;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    System of Systems Engineering, 2008. SoSE '08. IEEE International Conference on
  • Conference_Location
    Singapore
  • Print_ISBN
    978-1-4244-2172-5
  • Electronic_ISBN
    978-1-4244-2173-2
  • Type

    conf

  • DOI
    10.1109/SYSOSE.2008.4724194
  • Filename
    4724194