中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页
机构
成果
学者
登录
注册
登陆
×
验证码:
换一张
忘记密码?
记住我
×
校外用户登录
CAS IR Grid
机构
长春光学精密机械与物... [2]
自动化研究所 [1]
采集方式
OAI收割 [3]
内容类型
会议论文 [2]
学位论文 [1]
发表日期
2012 [2]
2005 [1]
学科主题
筛选
浏览/检索结果:
共3条,第1-3条
帮助
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
题名升序
题名降序
提交时间升序
提交时间降序
作者升序
作者降序
发表日期升序
发表日期降序
社会计算中组织行为的计算建模与预测方法
学位论文
OAI收割
工学博士, 中国科学院自动化研究所: 中国科学院研究生院, 2012
作者:
李晓晨
收藏
  |  
浏览/下载:102/0
  |  
提交时间:2015/09/02
组织行为预测
社会文化建模
规划知识抽取
规划识别
斯坦纳树算法
group behavior forecasting
social and cultural modeling
plan knowledge extraction
plan recognition
Steiner tree algorithm
An approach to the misleading action solving in plan recognition (EI CONFERENCE)
会议论文
OAI收割
2012 International Conference on Machine Learning and Cybernetics, ICMLC 2012, July 15, 2012 - July 17, 2012, Xian, Shaanxi, China
作者:
Wang Y.
;
Wang Y.
;
Wang Y.
;
Wang Y.
;
Wang Y.
收藏
  |  
浏览/下载:20/0
  |  
提交时间:2013/03/25
Misleading actions have not been considered in previous researches on plan recognition. It leads to poor recognition results for some special domains. This paper introduces new concepts including reliability
correlativity
and correlated action sequence etc. A novel algorithm is proposed to recognize a misleading action by using correlated action sequences. The proposed algorithm is shown to improve the accuracy of plan recognition. Moreover
it could also be applied to intrusion detection and network security problems. 2012 IEEE.
An algorithm for domain axiom plan recognition based on extended goal graph (EI CONFERENCE)
会议论文
OAI收割
International Conference on Machine Learning and Cybernetics, ICMLC 2005, August 18, 2005 - August 21, 2005, Guangzhou, China
作者:
Chen J.
收藏
  |  
浏览/下载:58/0
  |  
提交时间:2013/03/25
This paper introduces a novel algorithm for domain axiom plan recognition. Using a method of domain axiom inference expansion
the algorithm can reconstruct goal graph to extend and improve original algorithm to allow plan recognition with domain axiom. The algorithm based on goal graph needs no plan library
so it can't be suffered from the problems in the acquisition and hand-coding of large plan libraries. It also has no problem in searching the plan space of exponential size. 2005 IEEE.