【24h】

Regreesion by feature projections

机译:通过特征投影进行回归

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

摘要

This paper describes a machine learning method,called Regression by Feature Projections (RFP),for predicting a real-valued target feature.In RFP training is based on simply storing the projections of the training instances on each feature separately.prediction of the target value for a query point is obtained through two approximationprocedures executed sequentially.The first approximation process is to find the individual predictions of features by using the k-nearest neighbor algorithm (KNN).The second approximation process combines the predictions of all features.During the first approximation step,each feature is associated with a weight in order to determine the predication ability of the feature at the local query point.The weights,found for each local query point,are used in the second step adn enforce the method to have an adaptive or context-sensitive nature.We have compared RFP with the KNN algorithm.Results on real data sets show that RFP is much faster than KNN,yet its predication accuracy is comparable with the KNN algorithm.
机译:本文描述了一种用于预测实值目标特征的机器学习方法,称为特征投影回归(RFP)。在RFP中,训练基于简单地将训练实例的投影分别存储在每个特征上的基础。通过依次执行的两个近似过程获得一个查询点。第一个近似过程是使用k最近邻算法(KNN)查找特征的各个预测;第二个近似过程将所有特征的预测结合起来。近似步骤,每个特征都与一个权重相关联,以便确定该特征在本地查询点的预测能力。在第二步中使用为每个本地查询点找到的权重,并强制该方法具有自适应性我们已经将RFP与KNN算法进行了比较。实际数据集的结果表明,RFP比KNN快得多,但其前提是修正精度与KNN算法相当。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号