Please use this identifier to cite or link to this item: https://repositori.uma.ac.id/handle/123456789/31238
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHartono-
dc.contributor.authorZuhanda, Muhammad Khahfi-
dc.contributor.authorSyah, Rahmad-
dc.contributor.authorFauzi, Fikriyah Iftinan-
dc.contributor.authorWahyuni, Nini Sri-
dc.contributor.authorIstiana-
dc.contributor.authorYulina, Eva-
dc.date.accessioned2026-09-14T04:58:18Z-
dc.date.available2026-09-14T04:58:18Z-
dc.date.issued2025-
dc.identifier.urihttps://repositori.uma.ac.id/handle/123456789/31238-
dc.description20 Halamanen_US
dc.description.abstractPersonality prediction has become an increasingly important area in psychological computing and humancentered AI, especially with the rise of user-generated textual data from social media platforms. However, current approaches – primarily based on supervised learning – face major challenges in dealing with class imbalance, noisy inputs, and poor generalization in real-world scenarios. This study introduces an adaptive hybrid clustering framework for MBTI-based personality prediction by integrating K-Means with Nearest Neighbor Density Peak (K-NNDP) and Determinantal Point Process (DPP) to enhance seed optimization. The framework addresses key limitations of traditional clustering methods – such as poor class imbalance handling, lack of diversity, and outlier sensitivity – by combining density-based refinement with probabilistic, diversitydriven seed selection. Applied to the MBTI Kaggle dataset of 8,675 instances, the model transforms unstructured text into numerical vectors using TF-IDF, Bag-of-Words, and GloVe embeddings. Experimental results show that the proposed method outperforms six established supervised models – Decision Trees, KNN, Logistic Regression, LSVC, SGD, and XGBoost – across all multi-label classification metrics, achieving the highest Exact Match Ratio (0.813), Accuracy (0.915), Precision (0.878), Recall (0.897), and F1-Score (0.887), while significantly reducing Hamming Loss (0.103) and Zero-One Loss (0.187). Sensitivity analyses under varying imbalance ratios (up to 1:20), increasing textual noise, and data diversity levels further validate the model’s robustness and generalizability, even in challenging conditions. These findings confirm the effectiveness of the proposed unsupervised approach in uncovering coherent personality clusters without requiring labeled data. Nonetheless, further improvements are needed in enhancing cluster interpretability and optimizing runtime performance. Future research will explore real-time implementation and integration into personality-aware systemsen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectMachine learningen_US
dc.subjectPersonality modelingen_US
dc.subjectClustering optimizationen_US
dc.subjectSeed selectionen_US
dc.subjectText-based predictionen_US
dc.subjectUnstructured dataen_US
dc.titleAn adaptive clustering framework for personality prediction using enhanced seed optimizationen_US
dc.title.alternativeKerangka kerja pengelompokan adaptif untuk prediksi kepribadian menggunakan optimasi benih yang disempurnakanen_US
dc.typeKarya Tulis Dosenen_US
Appears in Collections:Published Articles

Files in This Item:
File Description SizeFormat 
An adaptive clustering framework for personality prediction using enhanced seed optimization.pdf
  Restricted Access
Journal Article1.08 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.