| 程勖,高雍政,郭芳.基于M-distance算法思想的优化加权KNN算法[J].,2021,61(6):645-651 |
| 基于M-distance算法思想的优化加权KNN算法 |
| Optimized weighted KNN algorithm based on M-distance algorithm idea |
| |
| DOI：10.7511/dllgxb202106012 |
| 中文关键词: 样本近邻 加权特征向量 谐振子 样本分类 |
| 英文关键词: sample nearest neighbor weighted eigenvector harmonic oscillator sample classification |
| 基金项目:国家自然科学基金资助项目(71802035)；辽宁省纺织之光教学改革研究资助项目(BKJGLX333). |
|
| 摘要点击次数: 227 |
| 全文下载次数: 296 |
| 中文摘要: |
| 为快速对数据进行特征选择以实现精确分类，采用M-distance算法思想进行数据集簇聚类，对样本数据进行预处理；设计加权K近邻算法缩减样本间距并构建样本分类模型；采用模拟简谐振动的方法遍历样本数据，求解最优加权特征向量，实现样本分类．实验结果表明：设计的算法是正确的，分类模型是合理的．在样本数据特征中，分离出的消费者最为关心的前10个样本特征符合消费者的行为选择，说明算法设计有一定实用性． |
| 英文摘要: |
| To select features quickly and classify the data accurately, the idea of M-distance algorithm is used to cluster the data set, and the sample data is preprocessed. The weighted Knearest neighbor algorithm is designed to reduce the sample spacing and construct the sample classification model. The method of simulating harmonic vibration is used to traverse the sample data, solve the optimal weighted eigenvector and realize the sample classification. The experimental results show that the designed algorithm is correct and the classification model is reasonable. In the sample data features, the top 10 sample features that consumers are most concerned about are separated, which are in line with consumers′ behavior choice, indicating that the algorithm design has a certain practicality. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |