• DocumentCode
    3104776
  • Title

    Mixed-Drove Spatio-Temporal Co-occurence Pattern Mining: A Summary of Results

  • Author

    Celik, Mete ; Shekhar, Shashi ; Rogers, James P. ; Shine, James A. ; Yoo, Jin Soung

  • Author_Institution
    Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN
  • fYear
    2006
  • fDate
    18-22 Dec. 2006
  • Firstpage
    119
  • Lastpage
    128
  • Abstract
    Mixed-drove spatio-temporal co-occurrence patterns (MDCOPs) represent subsets of object-types that are located together in space and time. Discovering MDCOPs is an important problem with many applications such as identifying tactics in battlefields, games, and predator-prey interactions. However, mining MDCOPs is computationally very expensive because the interest measures are computationally complex, datasets are larger due to the archival history, and the set of candidate patterns is exponential in the number of object-types. We propose a monotonic composite interest measure for discovering MDCOPs and a novel MDCOP mining algorithm. Analytical and experimental results show that the proposed algorithm is correct and complete. Results also show the proposed method is computationally more efficient than naive alternatives.
  • Keywords
    computational complexity; data mining; spatiotemporal phenomena; very large databases; MDCOP mining algorithm; archival history; candidate patterns; computationally complex; mixed-drove spatiotemporal co-occurrence pattern mining; monotonic composite interest measure; Application software; Clustering algorithms; Computer science; Contracts; Current measurement; Military computing; Pollution measurement; Rabbits; Spatiotemporal phenomena; Strategic planning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Mining, 2006. ICDM '06. Sixth International Conference on
  • Conference_Location
    Hong Kong
  • ISSN
    1550-4786
  • Print_ISBN
    0-7695-2701-7
  • Type

    conf

  • DOI
    10.1109/ICDM.2006.112
  • Filename
    4053040