Privacy preserving data mining of sequential patterns for network traffic data

Citations

WEB OF SCIENCE

20
Citations

SCOPUS

35

초록

As the total amount of traffic data in networks has been growing at an alarming rate, there is currently a substantial body of research that attempts to mine traffic data with the purpose of obtaining useful information. For instance, there are some investigations into the detection of Internet worms and intrusions by discovering abnormal traffic patterns. However, since network traffic data contain information about the Internet usage patterns of users, network users' privacy may be compromised during the mining process. In this paper, we propose an efficient and practical method that preserves privacy during sequential pattern mining on network traffic data. In order to discover frequent sequential patterns without violating privacy, our method uses the N-repository server model, which operates as a single mining server and the retention replacement technique, which changes the answer to a query probabilistically. In addition, our method accelerates the overall mining process by maintaining the meta tables in each site so as to determine quickly whether candidate patterns have ever occurred in the site or not. Extensive experiments with real-world network traffic data revealed the correctness and the efficiency of the proposed method.

키워드

data miningsequential patternnetwork trafficprivacyComputer wormsData miningData transferServersTelecommunication traffic
제목
Privacy preserving data mining of sequential patterns for network traffic data
저자
Kim, Seung-WooPark, SanghyunWon, Jung-ImKim, Sang-Wook
DOI
10.1016/j.ins.2007.08.022
발행일
2008-02
유형
Article
저널명
Information Sciences
178
3
페이지
694 ~ 713