用线性规划匹配场景模式

Guoxing Zhao, B. Luo, Jixin Ma
{"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}
引用次数: 1

摘要

本文继续了之前在ICNC-FSKD-05上提出的表示和匹配场景模式的工作。提出了一种统一的模式来取代先前的两个等价模式,用于形式化场景模式。在统一方案中,一个场景被表示为具有相应时间约束的状态集合,其中状态被定义为一组布尔值的时间相关流。场景图的概念被正式引入为有向、部分加权和标记的简单图。在此基础上,提出了一种用于场景模式识别的扩展线性规划图匹配算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信