1. 南京大学计算机软件新技术国家重点实验室,江苏,南京,210046
2. 南京邮电大学宽带无线通信与传感网教育部重点实验室,江苏,南京,210003
3. 南京大学计算机软件新技术国家重点实验室,江苏,南京,210046
4. 南京邮电大学宽带无线通信与传感网教育部重点实验室,江苏,南京,210003
网络出版:2016-04-25,
纸质出版:2016
移动端阅览
陈松乐, 孙正兴, 张岩, 等. 一种运动数据检索的相关反馈算法[J]. 电子学报, 2016,44(4):868-872.
CHEN Song-le, SUN Zheng-xing, ZHANG Yan, et al. A Relevance Feedback Algorithm for Motion Data Retrieval[J]. Acta Electronica Sinica, 2016, 44(4): 868-872.
陈松乐, 孙正兴, 张岩, 等. 一种运动数据检索的相关反馈算法[J]. 电子学报, 2016,44(4):868-872. DOI: 10.3969/j.issn.0372-2112.2016.04.016.
CHEN Song-le, SUN Zheng-xing, ZHANG Yan, et al. A Relevance Feedback Algorithm for Motion Data Retrieval[J]. Acta Electronica Sinica, 2016, 44(4): 868-872. DOI: 10.3969/j.issn.0372-2112.2016.04.016.
本文提出了一种基于RankBoost的运动数据检索相关反馈算法.该算法具有以下二个方面的特点:首先
以KNN-DTW作为RankBoost集成学习的弱排序器
在适应变长多变量时间序列(Variable-Length Multivariate Time Series
VLMTS)数据的同时
利用RankBoost的集成性与高效性解决相关反馈实时性要求与VLMTS数据计算复杂度高的矛盾;其次
以本文提出的最小化排序经验损失和泛化损失风险作为RankBoost集成学习目标
有效地克服了相关反馈小样本学习环境下的过拟合问题.在CMU动作库上的实验结果验证了该方法的有效性.
A relevance feedback algorithm based on RankBoost for content-based motion data retrieval (CBMR) is presented and has two characteristics.First
KNN-DTW is employed as the weak ranker for RankBoost ensemble learning.While adapting to variable-length multivariate time series (VLMTS) data
by taking the advantage of the ensemble and efficiency of RankBoost
it can resolve the conflict between the real-time requirement of relevance feedback and the high computational complexity of VLMTS data.Second
minimizing ranking experience loss and generalization loss risk proposed in this paper are used as the learning objective for RankBoost ensemble learning
which can effectively solve the over-fitting problem caused by small-sample training in relevance feedback.Experimental results on CMU action library verify the effectiveness of the proposed algorithm.
0
浏览量
2
下载量
1
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621