Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

A Preliminary Performance Evaluation of K-means, KNN and EM Unsupervised Machine Learning Methods for Network Flow Classification

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 6 No. 2 (2016)

DOI
10.11591/ijece.v6i2.8909
ISSN
2088-8708, 2088-8708
Published
2016-04-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc-nd/4.0

Abstract

Unsupervised leaning is a popular method for classify unlabeled dataset i.e. without prior knowledge about data class. Many of unsupervised learning are used to inspect and classify network flow. This paper presents in-deep study for three unsupervised classifiers, namely: K-means, K-nearest neighbor and Expectation maximization. The methodologies and how it’s employed to classify network flow are elaborated in details. The three classifiers are evaluated using three significant metrics, which are classification accuracy, classification speed and memory consuming. The K-nearest neighbor introduce better results for accuracy and memory; while K-means announce lowest processing time.

Collaboration network of the authors

30 authors · 75 co-authorship links · 31 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universiti Sains Malaysia
  • Al-Ahliyya Amman University
  • Universiti of Malaysia Sabah
  • Universiti Malaysia Perlis
  • Liwa University
  • China Internet Network Information Center
  • Thamar University
  • Other organisations
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Manjur KolharAffiliation unknown2
Faiza RizwanAffiliation unknown2
Anwar H. KatrawiUniversiti Sains Malaysia2
Rosni AbdullahUniversiti Sains Malaysia2
Ammar Kamal AbasiUniversiti Sains Malaysia2
Yu‐Beng LeauUniversiti of Malaysia Sabah2
Ibrahim AlShourbajiAffiliation unknown1
Low Xian WeeUniversiti of Malaysia Sabah1
Zhiwei YanChina Internet Network Information Center1
Yong Jin ParkUniversiti of Malaysia Sabah1
Arkan Hammoodi Hasan KablaUniversiti Sains Malaysia1
Shady HamoudaLiwa University1
Abdullah Ahmed BahashwanUniversiti Sains Malaysia1
Taief Alaa Al-AmiedyUniversiti Sains Malaysia1
Iznan Husainy HasbullahUniversiti Sains Malaysia1
Serri FaisalLiwa University1
Ahmad Adel Abu-SharehaAl-Ahliyya Amman University1
Sumaya Nabil Al-KhatibAl-Ahliyya Amman University1
Mohammad O. HiariAl-Ahliyya Amman University1
Layth Al-MahadeenAffiliation unknown1
Alhamza MuntherAffiliation unknown1
Alabass AlalousiThamar University1
Hilal A. FadhilSohar University1
Mohammad Shahrul Mohd ShahUniversiti of Malaysia Sabah1
Liang ZhaoShenyang Aerospace University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>A Preliminary Performance Evaluation of K-means, KNN and EM Unsupervised Machine Learning Methods for Network Flow Classification</dc:title><dc:creator>Alalousi, Alhamza</dc:creator><dc:creator>Razif, Rozmie</dc:creator><dc:creator>AbuAlhaj, Mosleh</dc:creator><dc:creator>Anbar, Mohammed</dc:creator><dc:creator>Nizam, Shahrul</dc:creator><dc:description>&lt;jats:p&gt;Unsupervised leaning is a popular method for classify unlabeled dataset i.e. without prior knowledge about data class. Many of unsupervised learning are used to inspect and classify network flow. This paper presents in-deep study for three unsupervised classifiers, namely: K-means, K-nearest neighbor and Expectation maximization. The methodologies and how it’s employed to classify network flow are elaborated in details. The three classifiers are evaluated using three significant metrics, which are classification accuracy, classification speed and memory consuming. The K-nearest neighbor introduce better results for accuracy and memory; while K-means announce lowest processing time.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2016-04-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v6i2.8909</dc:identifier><dc:identifier>10.11591/ijece.v6i2.8909</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 6 No 2 (2016); 778</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://www.iaescore.com/journals/index.php/IJECE/article/viewFile/159/175</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0</dc:rights></oai_dc:dc>