Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

A NOVEL APPROACH TO SYMBOLIC DATA CLUSTERING USING ENHANCED K-MEANS ALGORITHM

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 20 No. 2 (2026) · pp. 1263–1282

DOI
10.30598/barekengvol20iss2pp1263-1282
ISSN
2615-3017, 1978-7227
Published
2026-01-26
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Clustering is a crucial technique in image analysis, yet traditional methods such as K-Means often struggle when dealing with complex, high-dimensional, or uncertain data. This limitation reduces their effectiveness in accurately grouping images, particularly when variability and overlapping features exist across categories. To address this problem, this paper introduces a novel approach that integrates symbolic data with the K-Means algorithm to cluster image data more effectively. By symbolically representing both color intensity and spatial features, we enhance the algorithm’s ability to handle variability and uncertainty. We test our method on the CIFAR-10 dataset, where it achieves a clustering accuracy of 94.0% with an Adjusted Rand Index of 0.7, outperforming traditional methods such as K-Means (82.5%), DBSCAN (78.1%), and Hierarchical clustering (81.3%). Our results demonstrate that symbolic data analysis offers a more flexible and accurate solution for image clustering, with potential applications in fields such as medical image processing and environmental monitoring. Limitations and directions for future research are also discussed.

Collaboration network of the authors

6 authors · 7 co-authorship links

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

  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Karunia Eka LestariAffiliation unknown1
Mokhammad Ridwan YudhanegaraAffiliation unknown1
Ari Ratna GumilangAffiliation unknown1

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.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 5 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">A NOVEL APPROACH TO SYMBOLIC DATA CLUSTERING USING ENHANCED K-MEANS ALGORITHM</dc:title>
	<dc:creator>Serviana Husain, Husty</dc:creator>
	<dc:creator>Wahyu Indratno, Sapto</dc:creator>
	<dc:creator>Vantika, Sandy</dc:creator>
	<dc:description xml:lang="en-US">Clustering is a crucial technique in image analysis, yet traditional methods such as K-Means often struggle when dealing with complex, high-dimensional, or uncertain data. This limitation reduces their effectiveness in accurately grouping images, particularly when variability and overlapping features exist across categories. To address this problem, this paper introduces a novel approach that integrates symbolic data with the K-Means algorithm to cluster image data more effectively. By symbolically representing both color intensity and spatial features, we enhance the algorithm’s ability to handle variability and uncertainty. We test our method on the CIFAR-10 dataset, where it achieves a clustering accuracy of 94.0% with an Adjusted Rand Index of 0.7, outperforming traditional methods such as K-Means (82.5%), DBSCAN (78.1%), and Hierarchical clustering (81.3%). Our results demonstrate that symbolic data analysis offers a more flexible and accurate solution for image clustering, with potential applications in fields such as medical image processing and environmental monitoring. Limitations and directions for future research are also discussed.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2026-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/19144</dc:identifier>
	<dc:identifier>10.30598/barekengvol20iss2pp1263-1282</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 20 No 2 (2026): BAREKENG: Journal of Mathematics and Its Application; 1263-1282</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol20iss2year2026</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/19144/12437</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2026 Husty Serviana Husain, Sapto Wahyu Indratno, Sandy Vantika</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>