期刊文献+

高维空间中数据的相似性度量 被引量:20

Similarity Measurement Of Data In High-dimensional Spaces
原文传递
导出
摘要 高维空间中数据之间的相似性度量是目前数据挖掘、信息处理与检索等领域所面临的一个重要问题.文章在总结分析了高维数据的特点以及现有的一些度量方法的基础上,提出了一种新的度量方式,该方法在对高维数据进行相似性度量之前,首先对原始数据空间进行网格划分.文章的最后对其有效性作了定量分析,实验证明,该方式是行之有效的. Similarity measurement of data in high-dimensional spaces is an important problem in most current research domains such as data mining, information processing & searching, etc.. After the summarization and analysis of the characteristics of high-dimensional data and existing typical measurement methods, this paper proposes a new measurement approach based on a special grid splitting strategy. In order to illustrate the efficiency of the proposed method in high-dimensional spaces, a quantitative analysis is given in the paper. Experiment indicates that this method is efficacious,
出处 《数学的实践与认识》 CSCD 北大核心 2006年第9期189-194,共6页 Mathematics in Practice and Theory
基金 国家自然科学基金(60473117)
关键词 维度灾难 相似度量 距离度量 curse of dimensionality similarity measurement distance measurement
  • 相关文献

参考文献7

  • 1Yannis Sismanis. Nick Roussopoulos. The dwarf data cube eliminates the high dimensionality eurse[R]. TR-CS4552. University of Maryland, 2003.
  • 2Pitor Indyk. Rajeev Motvani. Approximate nearest neighbo::s: Toward removing the curse of dimensionality[C].In ACM Symposium on Theory of Computing. 1998.
  • 3Bellmann R. Adaptive Control Processes: A Guided Tour[M]. Princeton University Press. 1961.
  • 4Jerome H Friedman. Flexible metric nearest neighbor classification [R]. Technical Report, Department of Statistics, Stanford University, 1994.
  • 5汪祖媛,庄镇泉,王煦法.逐维聚类的相似度索引算法[J].计算机研究与发展,2004,41(6):1003-1009. 被引量:5
  • 6Ishikawa Y, Suhramanya R, Faloustos C. Minder Reader: Query database through multiple examples[C]. In Proc of VLDB 1998.
  • 7Beyer K. Goldstein J. Ramarkrishnan R. When is nearest neighbor meaningful?[C]. Proc of the Int Conf Database Theorie. 1999.

二级参考文献9

  • 1M Flickner, H Sawhney, W Niblack, et al. Query by image and video content: The QBIC system. IEEE Computer, 1995, 28(9): 23~32
  • 2A Guttman. R-tree: A dynamic index structure for spatial searching. ACM SIGMOD, Boston, MA, 1984
  • 3N Bechmann, H P Kriegel, R Schneider, et al. The R * -tree: An efficient and robust access method for points and rectangles. In:Proc of ACM SIGMOD. Atlantic: ACM Press, 1990. 322~331
  • 4K Norio, Shin' ichi Scaoh. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In: Proc of the 16th ACM SIGACT-SIGMOD-SIGART Symp on PODS. New York:ACM Press, 1997. 369~380
  • 5D A White, R Jain. Similarity indexing with the SS-tree. The 12th Int'l Conf on Data Engineering, New Orleans, LA, 1996
  • 6J T Robinson. The K-D-B-tree: A searching structure for large multidimensional dynamic indexes. ACM SIGMOD, Ann Arbor,USA, 1981
  • 7S Berchtold, D A Keim, H P Kriegel. The X-tree: An index structure for high-dimensional data. The 22nd V1DB Conf,Bombay, India, 1996
  • 8R Weber, S Blott. An approximation-based data structure for similarity search. Institute of Information System, ETHZ, Tech Rep: 24, 1997
  • 9J H Friedman. Flexible metric nearest neighbor classification.Department of Statistics, Stanford University, Tech Rep: 113,1994

共引文献4

同被引文献207

引证文献20

二级引证文献88

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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