K/S value prediction of cotton fabric using PSO-LSSVM
Source abstract
Abstract
Cotton is one of the world’s most common natural clothing materials. It is dyed mainly using the exhaustion, cold pad-batch, and pad-dry-pad-steam dyeing methods. The K/S value, an important index for measuring the depth of color, of cotton fabric dyed with reactive dyes is greatly influenced by various factors of the dyeing process. In this study, three models were developed incorporating least squares support vector machine (LSSVM) to predict the K/S values of dyed cotton fabrics, while particle swarm optimization (PSO) was applied to optimize and tune the parameters of the LSSVM model (PSO-LSSVM). Model inputs include dye concentration and process conditions, which are both easily obtainable variables. The K/S values from the PSO-LSSVM model are consistent with actual measured K/S values of dyed cotton fabrics. Moreover, a comparison among PSO-LSSVM, LSSVM and back propagation neural network results shows the superiority of the PSO-LSSVM approach. Results of this work indicate that a PSO-LSSVM model is a powerful tool for predicting the K/S value in cotton fabric dyed with reactive dye and thus a means to improve production processes and reduce costs.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Dyeing and Modifying Textile Fibers · Color Science and Applications · Textile materials and evaluations
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Materials Science and Engineering, Shanghai University, China
College of Chemistry, Chemical Engineering and Biotechnology, Donghua University, Shanghai, China
Funding
National Major Science and Technology Projects in 13th Five-Year
References (40)
Show source-provided references
1. 10.1016/j.jclepro.2015.02.07910.1016/j.jclepro.2015.02.079 ↗
2. 10.1016/j.jclepro.2014.09.01710.1016/j.jclepro.2014.09.017 ↗
3. 10.1002/app.1074010.1002/app.10740 ↗
4. 10.1016/j.carbpol.2014.09.06410.1016/j.carbpol.2014.09.064 ↗
5. 10.14502/Tekstilec2018.61.192-20010.14502/Tekstilec2018.61.192-200 ↗
6. 10.1177/004051751559177610.1177/0040517515591776 ↗
7. 10.1111/cote.1221610.1111/cote.12216 ↗
8. 10.1007/s12221-017-1241-310.1007/s12221-017-1241-3 ↗
9. 10.1177/00405175900600020710.1177/004051759006000207 ↗
10. 10.1177/004051751453737210.1177/0040517514537372 ↗
11. 10.1177/004051751876402010.1177/0040517518764020 ↗
12. 10.1016/j.ultsonch.2011.04.00110.1016/j.ultsonch.2011.04.001 ↗
13. 10.1007/s10570-014-0320-510.1007/s10570-014-0320-5 ↗
14. Xu YF · J Huizhou Univ Nat Sci · 2001 · 21 · 75
15. 10.1111/j.1478-4408.1979.tb00214.x10.1111/j.1478-4408.1979.tb00214.x ↗
16. Shi KQ · China Dyeing Finish · 2019 · 45 · 20
17. 10.1080/15440478.2019.164578710.1080/15440478.2019.1645787 ↗
18. Tavanai H · Iran Polym J · 2006 · 15 · 207
19. 10.1109/ACCESS.2018.284033310.1109/ACCESS.2018.2840333 ↗
20. 10.1177/004051751774368910.1177/0040517517743689 ↗
21. 10.1080/01496395.2017.128296510.1080/01496395.2017.1282965 ↗
22. 10.1007/s00449-014-1344-910.1007/s00449-014-1344-9 ↗
23. 10.1007/s00170-017-1417-410.1007/s00170-017-1417-4 ↗
24. 10.1007/s00500-018-3349-910.1007/s00500-018-3349-9 ↗
25. Moreira CA · Appl Math Comput · 2019 · 359 · 502
26. 10.1109/TIE.2018.281137110.1109/TIE.2018.2811371 ↗
27. 10.1016/j.jngse.2015.03.01310.1016/j.jngse.2015.03.013 ↗
28. 10.1016/j.omega.2012.06.00510.1016/j.omega.2012.06.005 ↗
29. 10.1016/S0893-6080(03)00169-210.1016/S0893-6080(03)00169-2 ↗
30. 10.1016/j.ijhydene.2010.08.02210.1016/j.ijhydene.2010.08.022 ↗
31. Kennedy J and Eberhart R. Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks (ICNN’95) , Perth, Australia, 27 November–1 December 1995, pp.1942-1948. New York: IEEE.10.1109/ICNN.1995.488968 ↗
32. 10.1016/j.jclepro.2019.07.05310.1016/j.jclepro.2019.07.053 ↗
33. 10.3390/rs1112145510.3390/rs11121455 ↗
34. 10.1080/2150704X.2019.167163310.1080/2150704X.2019.1671633 ↗
35. Al G · Soft Comput · 2018 · 23 · 883910.1007/s00500-018-3483-4 ↗
36. 10.1007/s12065-019-00210-z10.1007/s12065-019-00210-z ↗
37. 10.1007/s13369-018-03713-610.1007/s13369-018-03713-6 ↗
38. 10.1007/s10570-013-9957-810.1007/s10570-013-9957-8 ↗
39. 10.1016/j.neucom.2018.08.08110.1016/j.neucom.2018.08.081 ↗
40. 10.1016/j.anucene.2019.06.03410.1016/j.anucene.2019.06.034 ↗