Privacy preserving data mining of sequential patterns for network traffic data

2Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As a total amount of traffic data in networks has been growing at an alarming rate, many researches to mine traffic data with the purpose of getting useful information are currently being performed. However, since network traffic data contain the information about Internet usage patterns of users, network users' privacy can be compromised during the mining process. In this paper, we propose an efficient and practical method for privacy preserving 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 that operates as a single mining server and the retention replacement technique that changes the answer to a query probabilistically. In addition, our method accelerates the overall mining process by maintaining the meta tables in each site. Extensive experiments with real-world network traffic data revealed the correctness and the efficiency of the proposed method. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Kim, S. W., Park, S., Won, J. I., & Kim, S. W. (2007). Privacy preserving data mining of sequential patterns for network traffic data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4443 LNCS, pp. 201–212). Springer Verlag. https://doi.org/10.1007/978-3-540-71703-4_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free