Jia Keat Lee, S. Phon-Amnuaisuk, Huat Chin Chew, C. Ho
{"title":"制造试验数据分析——不同分类算法的比较","authors":"Jia Keat Lee, S. Phon-Amnuaisuk, Huat Chin Chew, C. Ho","doi":"10.1109/ISITC.2007.65","DOIUrl":null,"url":null,"abstract":"Due to the circuit complexity and the number of parameters involved, test relationship of a Test Program (TP) might not be fully discovered. Traditionally, TP setup are defined based on the domain expertise and gathered experience of an engineer. Such judgment is time consuming and could be inefficient especially when new products and technologies are rapidly developed for the competing market. If the complexity of a TP increases, the undetected interrelationship among tests in a TP will also increase. In this paper, inferences are performed to a huge and complex TP using different classification algorithms, with the primary goal to discover potential test relationships in a fast and efficient way. The mining output can be used as a reference and basis for test engineers to improve TP setup or to reprogram test machine to replace current exhaustive test policy.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Manufacturing Test Data Analysis-On Comparing Different Classification Algorithms\",\"authors\":\"Jia Keat Lee, S. Phon-Amnuaisuk, Huat Chin Chew, C. Ho\",\"doi\":\"10.1109/ISITC.2007.65\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the circuit complexity and the number of parameters involved, test relationship of a Test Program (TP) might not be fully discovered. Traditionally, TP setup are defined based on the domain expertise and gathered experience of an engineer. Such judgment is time consuming and could be inefficient especially when new products and technologies are rapidly developed for the competing market. If the complexity of a TP increases, the undetected interrelationship among tests in a TP will also increase. In this paper, inferences are performed to a huge and complex TP using different classification algorithms, with the primary goal to discover potential test relationships in a fast and efficient way. The mining output can be used as a reference and basis for test engineers to improve TP setup or to reprogram test machine to replace current exhaustive test policy.\",\"PeriodicalId\":394071,\"journal\":{\"name\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITC.2007.65\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITC.2007.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Manufacturing Test Data Analysis-On Comparing Different Classification Algorithms
Due to the circuit complexity and the number of parameters involved, test relationship of a Test Program (TP) might not be fully discovered. Traditionally, TP setup are defined based on the domain expertise and gathered experience of an engineer. Such judgment is time consuming and could be inefficient especially when new products and technologies are rapidly developed for the competing market. If the complexity of a TP increases, the undetected interrelationship among tests in a TP will also increase. In this paper, inferences are performed to a huge and complex TP using different classification algorithms, with the primary goal to discover potential test relationships in a fast and efficient way. The mining output can be used as a reference and basis for test engineers to improve TP setup or to reprogram test machine to replace current exhaustive test policy.