期刊文献+

基于启发式参考集选取的复杂数据特征提取算法

A Heuristic Reference Set Selection-based Algorithm for Feature Extraction from High-dimensional Data
在线阅读 下载PDF
导出
摘要 对当前具有代表性的几种特征提取算法进行了分析与比较,并在Bourgain算法的基础上,提出一种基于数据类别数及各类代表元素等启发式信息的复杂数据特征提取算法。对于M类复杂数据,该算法可以提取出维向量用来表示这些数据。针对实际数据,对几种算法的降维性能进行了比较实验,实验结果表明该算法具有很好的特征提取效果。 This paper analyzes several existing feature extraction algorithms. Based on Bourgain, the paper proposes an improved algorithm, it uses the heuristics coming from the data itself in selecting reference sets and reference elements. It can reduce the dimensions of the data of M categories to dimensions. The paper has done some experiments on some practical document data to compare the performance of those algorithms .The experimental results show that the algorithm outperforms them in feature extraction.
出处 《计算机工程》 CAS CSCD 北大核心 2003年第19期68-69,179,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60005004) 安徽省自然科学基金资助项目(01042302)
关键词 高维数据 特征提取 降维 High-dimensional data Feature extraction Dimension reduction
  • 相关文献

参考文献4

  • 1[1]YaKatama N, Satoh S. The Sr-tree: An Index Structure for Highdimensional Nearest Neighbor Queries. In Proc. ACM SIGMOD Conf.,1997:369-380
  • 2[2]Faloutsos C, King-Ip lin. FastMap: A Fast Algorithm for Indexing Datamiring and Visualization of Traditional and Mltimedia Dtasets.ACM SIGMOD, 1995, 24(2): 163-174
  • 3[3]Hristescu G, Farach-colton M. Cofe: A Scalable Method for Feature Extraxtion from Complex Objects. In Proc. 2nd International Conference on Data Warehousing and Knowledge Discovery, 2000:358-371
  • 4[4]Han Jiawei, Kamber M. Data Mining: Concepts and Techniques.Morgan Kaufmann Publishers, 2000

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部