期刊文献+

基于数据最优分区间相似度算法及应用 被引量:6

Similarity Algorithm and Its Application on the Data Optimization Partition
原文传递
导出
摘要 通过定义了一种基于数据最优分区间相似度算法,利用学习样本得单位相似度向量,并得各维数据的最优分区间.利用最优分区间得预测样本与学习样本的单位相似度向量,从而得预测样本的预测值.通过实例表明,算法所预测的结果相对误差可达百分位,并且本算法能应用到其它数据处理中,具有较广泛的通用性. A algorithm of similarity on the data optimization partition is definited, unit similarity vector and data optimization partition are got through study samples. Using optimization partition, the unit similarity vector between forecast samples and study samples is computated, and prediction value of prediction sample is gained. The examples show that the Relative error of results got by the algorithm has the one-thousandth, and the algorithm can be applied on other data and has widespread versatility.
出处 《数学的实践与认识》 CSCD 北大核心 2009年第20期31-34,共4页 Mathematics in Practice and Theory
基金 国家自然科学基金(60661003) 赣财教[2008]147号省科技厅项目支持 校基金支持
关键词 最优分区间 单位相似度向量 预测 optimization partition unit similarity vector similarity agorithm prediction
  • 相关文献

参考文献7

  • 1Yannis Sismanis Nick Roussopoulos. The dwarf data cube eliminates the high dimensionality curse [R]. TRCS4552. University of Maryland,2003.
  • 2Pitor Indyk, Rajeev Motvani. Approximate nearest neighbors: Toward removing thecurse of dimensionality[C]. In ACM Symposium on Theory of Computing,1998.
  • 3Bellmann R. Adaptive Control Processes: A Guided Tour[M]. Princeton University Press,1961.
  • 4汪祖媛,庄镇泉,王煦法.逐维聚类的相似度索引算法[J].计算机研究与发展,2004,41(6):1003-1009. 被引量:5
  • 5Zhang Yuanquan, Rueda L. A Geometric Framework to Visualize Fuzzy-clustered Data[C]//Proeeedings of IEEE 25th International Conference of the Chilean Computer Science Society Valdivia, Chile:[s. n], 2005.8-13.
  • 6Davidson I, Satyanarayana A. Speeding Up K-means Clustering by Bootstrap Averaging[C]//Proc of IEEE Data Mining Workshop on Clustering Large Data Sets. Brighton, UK : [s. n], 2004, 98-102.
  • 7贺玲,吴玲达,蔡益朝.高维空间中数据的相似性度量[J].数学的实践与认识,2006,36(9):189-194. 被引量:20

二级参考文献16

  • 1汪祖媛,庄镇泉,王煦法.逐维聚类的相似度索引算法[J].计算机研究与发展,2004,41(6):1003-1009. 被引量:5
  • 2M Flickner, H Sawhney, W Niblack, et al. Query by image and video content: The QBIC system. IEEE Computer, 1995, 28(9): 23~32
  • 3A Guttman. R-tree: A dynamic index structure for spatial searching. ACM SIGMOD, Boston, MA, 1984
  • 4N 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
  • 5K 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
  • 6D A White, R Jain. Similarity indexing with the SS-tree. The 12th Int'l Conf on Data Engineering, New Orleans, LA, 1996
  • 7J T Robinson. The K-D-B-tree: A searching structure for large multidimensional dynamic indexes. ACM SIGMOD, Ann Arbor,USA, 1981
  • 8S Berchtold, D A Keim, H P Kriegel. The X-tree: An index structure for high-dimensional data. The 22nd V1DB Conf,Bombay, India, 1996
  • 9R Weber, S Blott. An approximation-based data structure for similarity search. Institute of Information System, ETHZ, Tech Rep: 24, 1997
  • 10J H Friedman. Flexible metric nearest neighbor classification.Department of Statistics, Stanford University, Tech Rep: 113,1994

共引文献22

同被引文献52

引证文献6

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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