{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T12:34:35Z","timestamp":1730291675862,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1109\/qrs-c55045.2021.00074","type":"proceedings-article","created":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:34:21Z","timestamp":1648830861000},"page":"463-469","source":"Crossref","is-referenced-by-count":1,"title":["Augmentation Method of Test Data for Path Coverage based on K-means Clustering"],"prefix":"10.1109","author":[{"given":"Wei","family":"Xie","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Mudanjiang Normal University,Mudanjiang,China"}]},{"given":"ChunYan","family":"Xia","sequence":"additional","affiliation":[{"name":"Army Engineering University of PLA Nanjing, China, Mudanjiang Normal University,Mudanjiang,China"}]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Suqian University,Suqian,China"}]},{"given":"TingTing","family":"Huo","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Mudanjiang Normal University,Mudanjiang,China"}]},{"given":"Xiao","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Mudanjiang Normal University,Mudanjiang,China"}]}],"member":"263","reference":[{"issue":"12","key":"ref1","first-page":"2630","article-title":"Test data generation of path coverage based on negative selection genetic algorithm[J]","volume":"4","author":"Xia","year":"2019","journal-title":"Acta Electronica Sinica"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2017.06.069"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2019.03.064"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.01.009"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/32.536955"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1998.738487"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.23940\/ijpe.20.11.p9.17711780"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/32.962562"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.23940\/ijpe.20.08.p15.12791288"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/smr.1794"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572296"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2011.6080805"},{"issue":"5","key":"ref13","first-page":"133","article-title":"Research of software testing case reduction algorithm based on K Means[J]","volume":"33","author":"Gao","year":"2016","journal-title":"Microelectronics & computer"},{"issue":"1","key":"ref14","first-page":"249","article-title":"Test Case Selection Technique Based on Semi-supervised Clustering Method","volume":"45","author":"Cheng","year":"2018","journal-title":"Computer Science"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1001.2013.04379"},{"issue":"11","key":"ref16","first-page":"2159","article-title":"Path-directed regression test suite augmentation[J]","volume":"36","author":"Yin","year":"2014","journal-title":"Computer Engineering & Science"},{"issue":"9","key":"ref17","first-page":"2492","article-title":"Test data augmentation method based on adaptive particle swarm optimization algorithm[J]","volume":"36","author":"Wang","year":"2016","journal-title":"Journal of Computer Applications"},{"issue":"7","key":"ref18","first-page":"2075","article-title":"Search-based hierarchical regression test suit augmentation method[J]","volume":"36","author":"Wang","year":"2019","journal-title":"Application Research of Computers"},{"journal-title":"Computer Engineering","article-title":"Software test data augmentation algorithm based on beetle antennae search[J]","author":"Wang","key":"ref19"},{"issue":"11","key":"ref20","first-page":"2247","article-title":"Evolutionary generation of test data for regression testing based on path correlation[J]","volume":"38","author":"Wu","year":"2015","journal-title":"Chinese Journal of Computers"}],"event":{"name":"2021 IEEE 21st International Conference on Software Quality, Reliability and Security Companion (QRS-C)","start":{"date-parts":[[2021,12,6]]},"location":"Hainan, China","end":{"date-parts":[[2021,12,10]]}},"container-title":["2021 IEEE 21st International Conference on Software Quality, Reliability and Security Companion (QRS-C)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9741747\/9741863\/09741964.pdf?arnumber=9741964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T19:00:07Z","timestamp":1705518007000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9741964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/qrs-c55045.2021.00074","relation":{},"subject":[],"published":{"date-parts":[[2021,12]]}}}