An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic Analysis

Mahmood, A, Leckie, C and Udaya, P 2008, 'An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic Analysis', IEEE Transactions on Knowledge and Data Engineering (TKDE), vol. 20, no. 6, pp. 152-767.


Document type: Journal Article
Collection: Journal Articles

Title An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic Analysis
Author(s) Mahmood, A
Leckie, C
Udaya, P
Year 2008
Journal name IEEE Transactions on Knowledge and Data Engineering (TKDE)
Volume number 20
Issue number 6
Start page 152
End page 767
Total pages 616
Publisher IEEE
Abstract There is significant interest in the data mining and network management communities about the need to improve existing techniques for clustering multi-variate network traffic flow records so that we can quickly infer underlying traffic patterns. In this paper we investigate the use of clustering techniques to identify interesting traffic patterns from network traffic data in an efficient manner. We develop a framework to deal with mixed type attributes including numerical, categorical and hierarchical attributes for a one-pass hierarchical clustering algorithm. We demonstrate the improved accuracy and efficiency of our approach in comparison to previous work on clustering network traffic.
Subject Data Structures
DOI - identifier 10.1109/TKDE.2007.190725
ISSN 1041-4347
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 31 times in Scopus Article | Citations
Altmetric details:
Access Statistics: 252 Abstract Views  -  Detailed Statistics
Created: Mon, 06 Dec 2010, 14:11:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us