EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Enterprise service user intent prediction based on fast K-means++ fusion algorithm

Yuanyuan Han iD, Juanjuan Zhai, Ping Li

PLOS One · 27.04.2026 · 21 (4) · e0334478

DOI: 10.1371/journal.pone.0334478 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS One, online erschienen am 27.04.2026. Verfasst von Yuanyuan Han und 2 weiteren Autor:innen. Beteiligte Einrichtung: Institute of Digital Economy and Smart Management, Huanghe Jiaotong University, Jiaozuo, China. Hauptthemen laut MEDLINE: Algorithms, Intention, Commerce. Die Arbeit nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: 2025 Key Scientific Research Program of Henan Provincial Colleges and Universities, Key Discipline of Business Administration in Henan Province, First-Class Specialty Construction Project of Huanghe Jiaotong University.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

To address the low efficiency of feature mining and limited prediction accuracy in enterprise service user intent prediction, a research proposes an enterprise service user intention prediction model that integrates heuristic variants inspired by Kmeans++and Stacking ensemble learning. The model improves traditional K-means++ clustering through adaptive weighted grid information entropy optimization, solving the problems of slow convergence and uneven weight distribution in large-scale data. It also builds a weighted ensemble learner using base classifiers such as random forest to enhance intent prediction performance after multidimensional feature fusion. The experimental results show that the optimized Fast K-means++clustering algorithm achieved a contour coefficient of 0.92, a Calinski Harabasz index of 2500, and a Davies Bouldin index of 0.12 on dense point datasets, with significantly better clustering quality than the comparative algorithms. In the testing of the FK Stacking prediction model in real e-commerce scenarios, the accuracy, recall, and F1 score all exceeded 0.97, and the error rate remained stable below 2.1% in medium and long-term time series predictions; After iterative optimization, the model’s memory usage was reduced by 50% and response time was shortened by 82.5%. The results show that the proposed model offers lightweight and high-accuracy advantages in enterprise service user data analysis and intent prediction. It can help enterprises optimize resource allocation and improve service response speed.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsIntentionCommercePrediction AlgorithmsClustering AlgorithmsRandom ForestEnsemble LearningHumansPredictive Learning ModelsClassification AlgorithmsData Mining

Autor:innen und Institutionen

  • Institute of Digital Economy and Smart Management, Huanghe Jiaotong University, Jiaozuo, China.

ORCID-Profile: Yuanyuan Han

Förderung

  • 2025 Key Scientific Research Program of Henan Provincial Colleges and Universities
  • Key Discipline of Business Administration in Henan Province
  • First-Class Specialty Construction Project of Huanghe Jiaotong University
  • First-Class Course Construction Project of Cost and Management Accounting

Zitieren

APA

Han, Y., Zhai, J., & Li, P. (2026). Enterprise service user intent prediction based on fast K-means++ fusion algorithm. PLOS One, 21(4), e0334478. https://doi.org/10.1371/journal.pone.0334478

Vancouver

Han Y, Zhai J, Li P. Enterprise service user intent prediction based on fast K-means++ fusion algorithm. PLOS One. 2026;21(4):e0334478. doi:10.1371/journal.pone.0334478

BibTeX
@article{Han2026,
  author = {Han, Yuanyuan and Zhai, Juanjuan and Li, Ping},
  title = {Enterprise service user intent prediction based on fast K-means++ fusion algorithm},
  journal = {PLOS One},
  year = {2026},
  volume = {21},
  number = {4},
  pages = {e0334478},
  doi = {10.1371/journal.pone.0334478}
}
Kostenlos starten →