Paper Info
Title
Matching Scenarios Patterns by Using Linear Programming
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.
Year
DOI
Venue
2007
10.1109/FSKD.2007.389
FSKD (3)
Keywords
Field
DocType
linear programming,scenario graph,unified scheme,scenario pattern,matching scenario pattern,matching scenarios patterns,simple graph,boolean-valued time,extended linear programming graph,corresponding temporal constraint,dependent fluents,formalizing scenario pattern,graph matching,linear program,pattern matching,graph theory
Graph theory,Graph,Computer science,Matching (graph theory),Linear programming,Artificial intelligence,Pattern matching,Schema (psychology),Machine learning
Conference
ISBN
Citations 
PageRank 
0-7695-2874-0
0
0.34
References 
Authors
20
3
Name
Order
Citations
PageRank
Guoxing Zhao1163.43
Bin Luo2802107.57
Ma Jixin320632.69