• Title/Summary/Keyword: 대화형 통신 순서열

Search Result 1, Processing Time 0.015 seconds

An Efficient Algorithm for Mining Interactive Communication Sequence Patterns (대화형 통신 순서열 패턴의 마이닝을 위한 효율적인 알고리즘)

  • Haam, Deok-Min;Song, Ji-Hwan;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.36 no.3
    • /
    • pp.169-179
    • /
    • 2009
  • Communication log data consist of communication events such as sending and receiving e-mail or instance message and visiting web sites, etc. Many countries including USA and EU enforce the retention of these data on the communication service providers for the purpose of investigating or detecting criminals through the Internet. Because size of the retained data is very large, the efficient method for extracting valuable information from the data is needed for Law Enforcement Authorities to use the retained data. This paper defines the Interactive Communication Sequence Patterns(ICSPs) that is the important information when each communication event in communication log data consists of sender, receiver, and timestamp of this event. We also define a Mining(FDICSP) problem to discover such patterns and propose a method called Fast Discovering Interactive Communication Sequence Pattern(FDICSP) to solve this problem. FDICSP focuses on the characteristics of ICS to reduce the search space when it finds longer sequences by using shorter sequences. Thus, FDICSP can find Interactive Communication Sequence Patterns efficiently.