Browse > Article

An Efficient Algorithm for Mining Interactive Communication Sequence Patterns  

Haam, Deok-Min (KAIST 전산학과)
Song, Ji-Hwan (KAIST 전산학과)
Kim, Myoung-Ho (KAIST 전산학과)
Abstract
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.
Keywords
Data mining; Sequential pattern mining; Interactive communication Sequence; telecommunications data retention;
Citations & Related Records
연도 인용수 순위
  • Reference
1 DIRECTIVE 2006/24/EC OF THE EUROPEAN PARLIAMENT AND OF THE COUNCIL of 15 March 2006 on the retention of data generated or processed in connection with the provision of publicly available electronic communications services or of public communications networks and amen-ding Directive 2002/58/EC
2 ETSI TS 101 671 - Telecommunications security; Lawful Interception(LI): Handover interface for the lawful interception of telecommunications traffic
3 H. Mannila, H. Toivonen. and A. I. Verkamo, 'Discovering frequent episodes in sequences,' Proc. of the Int'l Conference on Knowledge Discovery in Databases and Data Mining(KDD-95), pp. 210-215, 1995
4 J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu, 'Prefixopan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth,; Proc. of the 17th International Conference on Data Engineering (ICDE'0l), pp. 215-224, 2001   DOI
5 C. Raissi and M. Plantevit, 'Mining Multidimensional Sequential Patterns over Data Streams,' LNCS 5182, pp. 263-272, 2008   DOI   ScienceOn
6 M. Plantevit, A. Laurent, M. Teisseire, 'HYPE: mining hierarchical sequential patterns,' Proc. of the 9th ACM international workshop on Data warehousing and OLAP(DOLAP), pp. 19-26, 2006   DOI
7 R. Agrawal and R. Srikant, 'Mining Sequential Patterns: Generalizations and Performance Improvements,' Advances in Database Technology EDBT'96, 5th International Conference on Extending Database Technology, pp. 3-17, 1996   DOI
8 ETSI TS 101 331 - Telecommunications security; Lawful Interception(LI); Requirements of Law Enforcement Agencies
9 J. Pei, B. Mortazavi Asl, J. Wang, H. Pinto, Q. Chen, U Dayal, and M. Hsu, 'Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach,' IEEE Transactions on Knowledge and Data Engineering 16, pp. 1424-1440, 2004   DOI   ScienceOn
10 C. Yu and Y. Chen, 'Mining Sequential Patterns from Multidimensional Sequence Data,' IEEE Trans actions on Knowledge and Data Engineering, v.17, n.1, pp. 136-140, 2005   DOI   ScienceOn
11 R. Agrawal and R Srikant, 'Fast algorithms for mining association rules,' Proc. of the 20th VLDB Conference, pp, 487-499, 1994
12 M. Zaki, 'SPADE: An Efficient Algorithm for Mining Frequent Sequences,' Machine Learning 40, pp. 31-60, 2001   DOI
13 Philip A. Branch. Lawful Interception of the Internet. Centre for Advanced Internet Architectures. Technical Report 030606A
14 S. Aseervatham, A. Osmani and E. Viennet, 'Bitspade: A Lattice-Based Sequential Pattern Mining Algorithm Using Bitmap Representation,' Proc. Sixth Int'l Conf. Data Mining(ICDM), pp. 792-797, 2006   DOI