Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 2

Optimizing Clustering Models Using Principle Component Analysis for Car Customers

IJCCS (Indonesian Journal of Computing and Cybernetics Systems) · Vol. 18 No. 2 (2024)

DOI
10.22146/ijccs.94744
ISSN
2460-7258, 1978-1520
Published
2024-04-30
Publisher
IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

In the competitive business world, companies strategically utilize customer data to achieve goals, requiring a comprehensive understanding of various customer traits, behaviors and needs. Customer segmentation, an important strategy, requires grouping individuals based on various characteristics. The K-Means algorithm is widely used for customer data grouping connectivity because of its ease of implementation in Machine Learning. However, challenges arise in high-dimensional data, prompting the need for dimensionality reduction. Principal Component Analysis (PCA) is emerging as an effective method for data communication while minimizing information loss. Previous research emphasizes the success of PCA in improving analysis and clustering efficiency. This research contributes by integrating PCA into K-Means clustering to analyze customer segments in a car company. This empowers companies to attract new customers, implement targeted marketing, understand customer-company relationships, and increase expected profitability. PCA, which preserves 75% of the variation with 3 principal components, precedes the implementation of K-Means after normalization. Evaluation using the Elbow and Silhouette Score Method identified eight optimal clusters. The post-PCA K-Means model with optimal cluster selection produces a Silhouette Score of 0.7789.

Keywords

Collaboration network of the authors

No co-authors found in Melola yet.

Metadata source: OAI-PMH (metadata jurnal) https://journal.ugm.ac.id/ijccs/oai, first harvested 26 Okt 2026, last seen 26 Okt 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">Optimizing Clustering Models Using Principle Component Analysis for Car Customers</dc:title>
	<dc:creator>Savira, Agnes Riska</dc:creator>
	<dc:subject xml:lang="en-US">Computer Science</dc:subject>
	<dc:subject xml:lang="en-US">K-Means, PCA, Customer Segmentations, Machine Learning</dc:subject>
	<dc:description xml:lang="en-US"> In the competitive business world, companies strategically utilize customer data to achieve goals, requiring a comprehensive understanding of various customer traits, behaviors and needs. Customer segmentation, an important strategy, requires grouping individuals based on various characteristics. The K-Means algorithm is widely used for customer data grouping connectivity because of its ease of implementation in Machine Learning. However, challenges arise in high-dimensional data, prompting the need for dimensionality reduction. Principal Component Analysis (PCA) is emerging as an effective method for data communication while minimizing information loss. Previous research emphasizes the success of PCA in improving analysis and clustering efficiency. This research contributes by integrating PCA into K-Means clustering to analyze customer segments in a car company. This empowers companies to attract new customers, implement targeted marketing, understand customer-company relationships, and increase expected profitability. PCA, which preserves 75% of the variation with 3 principal components, precedes the implementation of K-Means after normalization. Evaluation using the Elbow and Silhouette Score Method identified eight optimal clusters. The post-PCA K-Means model with optimal cluster selection produces a Silhouette Score of 0.7789. </dc:description>
	<dc:publisher xml:lang="en-US">IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.</dc:publisher>
	<dc:contributor xml:lang="en-US">Department of Computer Science University of Buana Perjuangan Karawang, Indonesia</dc:contributor>
	<dc:date>2024-04-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.ugm.ac.id/ijccs/article/view/94744</dc:identifier>
	<dc:identifier>10.22146/ijccs.94744</dc:identifier>
	<dc:source xml:lang="en-US">IJCCS (Indonesian Journal of Computing and Cybernetics Systems); Vol 18, No 2 (2024): April</dc:source>
	<dc:source>2460-7258</dc:source>
	<dc:source>1978-1520</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.ugm.ac.id/ijccs/article/view/94744/39107</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 IJCCS (Indonesian Journal of Computing and Cybernetics Systems)</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>