制造试验数据分析——不同分类算法的比较

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}
引用次数: 0

摘要

由于电路的复杂性和所涉及的参数的数量,测试程序的测试关系可能无法被完全发现。传统上,TP设置是根据领域专业知识和工程师收集的经验来定义的。这样的判断既耗时又低效,尤其是当新产品和新技术在竞争激烈的市场上迅速发展时。如果TP的复杂性增加,TP中未检测到的测试之间的相互关系也会增加。本文使用不同的分类算法对一个庞大而复杂的TP进行推理,以快速有效地发现潜在的测试关系为主要目标。挖掘结果可作为测试工程师改进TP设置或对试验机进行重新编程以取代现有穷举测试策略的参考和依据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信