Your browser does not support JavaScript!

A taxonomy and empirical analysis of clustering algorithms for traffic classification

A taxonomy and empirical analysis of clustering algorithms for traffic classification

For access to this article, please select a purchase option:

Buy chapter PDF
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Network Classification for Traffic Management: Anomaly detection, feature selection, clustering and classification — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Clustering algorithms have emerged as an alternative powerful meta-learning tool to accurately analyze the massive volume of data generated by modern applications. In particular, their main goal is to categorize data into clusters such that objects are grouped in the same cluster when they are “similar” according to specific metrics. There is a vast body of knowledge in the area of clustering and there have been attempts to analyze and categorize them for a larger number of applications. However, one of the major issues in using clustering algorithms for big data that created a confusion amongst the practitioners is the lack of consensus in the definition of their properties as well as a lack of formal categorization. With the intention of alleviating these problems, this chapter introduces concepts and algorithms related to clustering, a concise survey existing (clustering) algorithms as well as providing a comparison both from a theoretical and empirical perspective. From a theoretical perspective, we come up with a categorizing framework based on the main properties pointed out in previous study. Empirically, extensive experiments are carried out where we compared the most representative algorithm from each of the categories using a large number of real (big) data sets. The effectiveness of the candidate clustering algorithms is measured through a number of internal and external validity metrics, stability, runtime, and scalability tests. Additionally, we highlighted the set of clustering algorithms that are the best performing for big data.

Chapter Contents:

  • 4.1 Introduction
  • 4.2 Clustering algorithm categories
  • 4.3 Criteria to compare clustering methods
  • 4.4 Candidate clustering algorithms
  • 4.5 Experimental evaluation on real data
  • 4.5.1 The data sets
  • 4.5.2 Experimental set up
  • 4.5.3 Validity metrics
  • 4.5.4 Experimental results and comparison
  • 4.6 Conclusion

Inspec keywords: Big Data; program testing; pattern clustering; learning (artificial intelligence)

Other keywords: traffic classification; meta-learning tool; representative algorithm; Big Data; candidate clustering algorithms

Subjects: Data handling techniques; Knowledge engineering techniques; Diagnostic, testing, debugging and evaluating systems

Preview this chapter:
Zoom in

A taxonomy and empirical analysis of clustering algorithms for traffic classification, Page 1 of 2

| /docserver/preview/fulltext/books/pc/pbpc032e/PBPC032E_ch4-1.gif /docserver/preview/fulltext/books/pc/pbpc032e/PBPC032E_ch4-2.gif

Related content

This is a required field
Please enter a valid email address