信息抽取国外文献

时间:2017-10-16 08:32:20
【文件属性】:
文件名称:信息抽取国外文献
文件大小:2.22MB
文件格式:PDF
更新时间:2017-10-16 08:32:20
信息抽取 In compressed sensing and sparse representation-based pattern recognition, random projection with a dense random transform matrix is widely used for information extraction. However, the complicated structure makes dense random matrices computationally expensive and difficult in hardware implementation. This paper considers the simplification of the random projection method. First, we propose a simple random method, random combination, for information extraction to address the issues of dense random methods. The theoretical analysis and the experimental results show that it can provide comparable performance to those of dense random methods. Second, we analyze another simple random method, random choosing, and give its applicable occasions. The comparative analysis and the experimental results show that it works well in dense cases but worse in sparse cases. Third, we propose a practical method for measuring the effectiveness of the feature transform matrix in sparse representation-based pattern recognition. A matrix satisfying the Representation Residual Restricted Isometry Property can provide good recognition results. &2014 Elsevier B.V. All rights reserved

网友评论

  • 很不错,多谢