{"title":"用线性规划匹配场景模式","authors":"Guoxing Zhao, B. Luo, Jixin Ma","doi":"10.1109/FSKD.2007.389","DOIUrl":null,"url":null,"abstract":"This paper continues the work presented previously at ICNC-FSKD-05 for representing and matching scenario patterns. A unified scheme is presented to replace the two previous equivalent schemas for formalizing scenario patterns. In the unified scheme, a scenario is denoted in terms of a collection of states with the corresponding temporal constraints, where a state is defined as a set of Boolean-valued time-dependent fluents. The concept of a scenario graph is formally introduced as a directed, partially weighted and labeled simple graph. Based on such a graphical representation, an extended linear programming graph matching algorithm is proposed for recognizing scenario patterns.","PeriodicalId":201883,"journal":{"name":"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)","volume":"39 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Matching Scenarios Patterns by Using Linear Programming\",\"authors\":\"Guoxing Zhao, B. Luo, Jixin Ma\",\"doi\":\"10.1109/FSKD.2007.389\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper continues the work presented previously at ICNC-FSKD-05 for representing and matching scenario patterns. A unified scheme is presented to replace the two previous equivalent schemas for formalizing scenario patterns. In the unified scheme, a scenario is denoted in terms of a collection of states with the corresponding temporal constraints, where a state is defined as a set of Boolean-valued time-dependent fluents. The concept of a scenario graph is formally introduced as a directed, partially weighted and labeled simple graph. Based on such a graphical representation, an extended linear programming graph matching algorithm is proposed for recognizing scenario patterns.\",\"PeriodicalId\":201883,\"journal\":{\"name\":\"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)\",\"volume\":\"39 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FSKD.2007.389\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2007.389","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Matching Scenarios Patterns by Using Linear Programming
This paper continues the work presented previously at ICNC-FSKD-05 for representing and matching scenario patterns. A unified scheme is presented to replace the two previous equivalent schemas for formalizing scenario patterns. In the unified scheme, a scenario is denoted in terms of a collection of states with the corresponding temporal constraints, where a state is defined as a set of Boolean-valued time-dependent fluents. The concept of a scenario graph is formally introduced as a directed, partially weighted and labeled simple graph. Based on such a graphical representation, an extended linear programming graph matching algorithm is proposed for recognizing scenario patterns.