{"title":"复杂匹配特征的推理算法","authors":"Wei Jiang, Yanchao Yin","doi":"10.1145/3380688.3380689","DOIUrl":null,"url":null,"abstract":"Aiming at the problem of unclear description of matching relationship between complex surfaces and insufficient consideration of feature attributes reflecting process constraints, an accurate reasoning algorithm based on topological ranking of feature matching is proposed. Based on the analysis of matching process correlation and feature attributes of typical complex surfaces, a matching topological sequencing model is constructed. The matching objects are encapsulated and topologically ranked by directed acyclic graph, and the precise reasoning among matching feature attributes is realized by using the fuzzy ideal solution. Finally, the validity of the model and the algorithm is verified by an application case.","PeriodicalId":414793,"journal":{"name":"Proceedings of the 4th International Conference on Machine Learning and Soft Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reasoning Algorithms for Complex Matching Features\",\"authors\":\"Wei Jiang, Yanchao Yin\",\"doi\":\"10.1145/3380688.3380689\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the problem of unclear description of matching relationship between complex surfaces and insufficient consideration of feature attributes reflecting process constraints, an accurate reasoning algorithm based on topological ranking of feature matching is proposed. Based on the analysis of matching process correlation and feature attributes of typical complex surfaces, a matching topological sequencing model is constructed. The matching objects are encapsulated and topologically ranked by directed acyclic graph, and the precise reasoning among matching feature attributes is realized by using the fuzzy ideal solution. Finally, the validity of the model and the algorithm is verified by an application case.\",\"PeriodicalId\":414793,\"journal\":{\"name\":\"Proceedings of the 4th International Conference on Machine Learning and Soft Computing\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 4th International Conference on Machine Learning and Soft Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3380688.3380689\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th International Conference on Machine Learning and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3380688.3380689","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reasoning Algorithms for Complex Matching Features
Aiming at the problem of unclear description of matching relationship between complex surfaces and insufficient consideration of feature attributes reflecting process constraints, an accurate reasoning algorithm based on topological ranking of feature matching is proposed. Based on the analysis of matching process correlation and feature attributes of typical complex surfaces, a matching topological sequencing model is constructed. The matching objects are encapsulated and topologically ranked by directed acyclic graph, and the precise reasoning among matching feature attributes is realized by using the fuzzy ideal solution. Finally, the validity of the model and the algorithm is verified by an application case.