Name
Abstract | ||
|---|---|---|
Rule flow is a directed graph with condition and action operator over business object's attributes. The results from the the rule flow is usually not linearly separable, which proposes great challenges to rule flow learning from sample results. This paper proposes to use multiple linear classifiers for rule flows whose condition is the linear combination of business object attributes. This is a two-step process. First, to construct the boundary of each category based on the nearest distance points policy. Then, use a stochastic selection approach to approximate the boundary by linear equations. The computation complexity of the process is quadratic level. The feasibility of such process is illustrated by a simple toy sample and air cargo load planning case. ©2009 IEEE. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/SOLI.2009.5204027 | 2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009 |
Keywords | DocType | Volume |
directed graphs,learning artificial intelligence,commerce,atmospheric modeling,directed graph,classification algorithms,linear equations,computational complexity,decision trees,engines,kernel,business,stochastic processes,packaging,planning,context modeling,logic | Conference | null |
Issue | ISSN | ISBN |
null | null | 978-1-4244-3541-8 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
5 | ||