| 查看: 1197 | 回复: 9 | |||
| 当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖 | |||
[交流]
2010年09月02日 ICICTA2010被EI 检索！！！ 已有7人参与
|
|||
|
2010年09月02日 ICICTA2010被EI 检索！！！ 2010年09月02日 ICICTA2010被EI 检索！！！ 2010年09月02日 ICICTA2010被EI 检索！！！ 2010年09月02日 ICICTA2010被EI 检索！！！ |
回复此楼» 猜你喜欢
写了一篇“相变储能技术在冷库中应用”的论文，论文内容以实验为主，投什么期刊合适？
已经有3人回复
-
需要合成515-64-0，50g，能接单的留言
已经有3人回复
-
最近几年招的学生写论文不引自己组发的文章
已经有10人回复
-
中科院杭州医学所招收博士生一名（生物分析化学、药物递送）
已经有3人回复
-
临港实验室与上科大联培博士招生1名
已经有8人回复
-
26申博自荐
已经有7人回复
-
想换工作。大多数高校都是 评职称时 认可5年内在原单位取得的成果吗？
已经有4人回复
-
带资进组求博导收留
已经有9人回复
★
小木虫: 金币+0.5, 给个红包，谢谢回帖
小木虫: 金币+0.5, 给个红包，谢谢回帖
|
本帖内容被屏蔽 |
9楼2017-05-31 19:39:53
我心永恒1567
木虫 (正式写手)
- 应助: 0 (幼儿园)
- 金币: 3975.3
- 散金: 5
- 红花: 1
- 帖子: 359
- 在线: 255.2小时
- 虫号: 601710
- 注册: 2008-09-13
- 性别: GG
- 专业: 植物化学保护
4楼2010-09-02 13:30:21
6楼2010-09-02 16:12:39
我心永恒1567
木虫 (正式写手)
- 应助: 0 (幼儿园)
- 金币: 3975.3
- 散金: 5
- 红花: 1
- 帖子: 359
- 在线: 255.2小时
- 虫号: 601710
- 注册: 2008-09-13
- 性别: GG
- 专业: 植物化学保护
★
小木虫(金币+0.5):给个红包，谢谢回帖交流
小木虫(金币+0.5):给个红包，谢谢回帖交流
|
Accession number: 20103413169767 Title: Feature selection through optimization of k-nearest neighbor matching gain Authors: Luo, Yihui1 ; Xiong, Shuchu1 Author affiliation: 1 Department of Information, Hunan University of Commerce, Changsha, China Corresponding author: Luo, Y. (yihuiluo@yahoo.com.cn) Source title: 2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010 Abbreviated source title: Int. Conf. Intelligent Comput. Technol. Autom., ICICTA Volume: 2 Monograph title: 2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010 Issue date: 2010 Publication year: 2010 Pages: 309-312 Article number: 5522419 Language: English ISBN-13: 9780769540771 Document type: Conference article (CA) Conference name: 2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010 Conference date: May 11, 2010 - May 12, 2010 Conference location: Changsha, China Conference code: 81471 Sponsor: IEEE Intelligent Computation Society; Res. Assoc. Intelligent Comput. Technol. Autom.; Hunan University; Changsha University of Science and Technology; Hunan University of Science and Technology Publisher: IEEE Computer Society, 445 Hoes Lane - P.O.Box 1331, Piscataway, NJ 08855-1331, United States Abstract: Many problems in information processing involve some form of dimensionality reduction. In this paper, we propose a new model for feature evaluation and selection in unsupervised learning scenarios. The model makes no special assumptions on the nature of the data set. For each of the data set, the original features induce a ranking list of items in its k nearest neighbors. The evaluation criterion favors reduced features that result in the most consistent to these ranked lists. And an efficiently local descent search based on the model is adopted to select the reduced features. Our experiments with several data sets demonstrate that the proposed algorithm is able to detect completely irrelevant features and to remove some additional features without significantly hurting the performance of the clustering algorithm. © 2010 IEEE. Number of references: 11 Main heading: Feature extraction Controlled terms: Clustering algorithms - Data processing - Unsupervised learning Uncontrolled terms: Data sets - Dimensionality reduction - Evaluation criteria - Feature evaluation and selection - Feature selection - Information processing - K-nearest neighbors - New model - Search-based Classification code: 716 Telecommunication; Radar, Radio and Television - 721 Computer Circuits and Logic Elements - 723 Computer Software, Data Handling and Applications DOI: 10.1109/ICICTA.2010.608 Database: Compendex Compilation and indexing terms, © 2010 Elsevier Inc. |
7楼2010-09-02 16:42:14