【24h】

Self Basis Selection in a Finite Set

机译:有限集合中的自我基础选择

获取原文
获取原文并翻译 | 示例

摘要

Given a set of n vectors in R~m, m < n, we wish to find a subset of m vectors that are good "predictors" for the complementary set. We consider two criteria of goodness, one leads to requiring that the least-squares expansion coefficients of the complementary set be bounded by one, the other leads to maximizing the determinant of the selected subset. Exhaustive search requires checking all n choose m possible subsets. We present a low-complexity iterative selection algorithm, and examine its worst loss with respect to the optimum solution under both goodness criteria. We show that with linear complexity in n, the proposed algorithm achieves expansion coefficients which are uniformly bounded by 1 + ε, while the determinant of the selected subset is at most m~(m/2) below the true maximum determinant.
机译:给定Rm中的n个向量的集合,m

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号