Author
Listed:
- Yuanyuan Han
- Juanjuan Zhai
- Ping Li
Abstract
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.
Suggested Citation
Yuanyuan Han & Juanjuan Zhai & Ping Li, 2026.
"Enterprise service user intent prediction based on fast K-means++ fusion algorithm,"
PLOS ONE, Public Library of Science, vol. 21(4), pages 1-16, April.
Handle:
RePEc:plo:pone00:0334478
DOI: 10.1371/journal.pone.0334478
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0334478. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.