期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

C^s相似度函数下正则谱聚类的收敛阶(英) 被引量：14

Convergence rates of normalized spectral clustering with a similarity function in C^s
下载PDF
导出
摘要 用覆盖数逼近的方法给出Cs相似度函数下正则谱聚类的收敛阶. Rates of convergence with similarity function in C s for normalized spectral clustering were studied and the method of covering number approach was used for our purposes.
作者 高炜 张云港 梁立
机构地区 云南师范大学信息学院 苏州大学数学科学学院
出处 《兰州大学学报（自然科学版）》 CAS CSCD 北大核心 2011年第2期109-111,共3页 Journal of Lanzhou University(Natural Sciences)
基金 Supported by the National Natural Science Foundation of China(60903131)
关键词 正则谱聚类 相似度函数 覆盖数 图像分割 本体相似度计算 normalized spectral clustering similarity function covering number image segmentation ontology similarity computation
分类号 TP391 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献5

  • 1LUXBURG U, BELKIN M, BOUSQUET O. Consistency of spectral clustering[J]. Ann Stat, 2008, 36(2): 555-586.
  • 2CHUNG F. Spectral graph theory[M]. Fresno: American Mathem Atical Society, 1997: 1-50.
  • 3ZHOU D X. Capacity of reproducing kernel spaces in learning theory[J]. IEEE Trans Inform Theory, 2003, 49(7): 1 743-1 752.
  • 4ZHOU D. The covering number in learning theory[J]. J Complexity, 2002, 18(3): 739-767.
  • 5CUCKER F, ZHOU D. Learning theory: an approximation theory viewpoint[M[. Cambridge: Cambridge University Press, 2007: 113-117.

同被引文献101

  • 1http: //www. geneontology, org.
  • 2Mork P, Bernstein P. Adapting a generic match algorithm to align on- tologies of human anatomy. In : 20th International Conf. on Data En- gineering,Los Alamitos, CA, USA, Publisher: IEEE Comput Soc, 2004 : 787-790.
  • 3Fonseca F, Egenhofer M, Davis C, et al. Semantic granularity in on- tology-driven geographic information systems. AMAI Annals of Mathe- matics and Artificial Intelligence-Special Issue on Spatial and Tempo- ral Granularity, 2002; 36(1-2): 121-151.
  • 4Bouzeghoub A, Elbyed A. Ontology mapping for web-based educa- tional systems interoperability. Interoperability in Business Infor- mation Systems, 2006 ; 1 ( 1 ) : 73-84.
  • 5王雅砑,高炜,张云港,等.图推进排序学习算法.Proceed-ings of 2010 International Conference on Circuit and Signal Process- ing, Shanghai, 2010:368-371.
  • 6Huang X, Xu T, Gao W, et al. Ontology similarity measure and on- tology mapping via fast ranking method. International Journal of Ap- plied Physics and Mathematics, 2011; 1 (1) :54-59.
  • 7Gao W, Liang L Ontology similarity measure by optimizing NDCG measure and application in physics education. Lecture Notes in E- lectrical Engineering, 2012 ; 142 (2,) : 415-421.
  • 8Teo C, Smola A, Vishwanathan S, et al. A scalable modular convex solver for regularized risk minimization. In: Proc. 13th ACM SIGK- DD Internat Conf on Knowledge Discovery and Data Mining ( KDD 2007), ACM, New York, NY, USA, 2007:727-736.
  • 9Smola A, Vishwarmthan S, Le Q. Bundle methods for machine learning. In: McCallum A Ed. Advances in Neural Information Pro- cessing Systems, Cambridge, MA, USA : MIT Press, 2007.
  • 10Teo C, Vishwanathan S, Smola A, et al. Bundle methods for regu- larized risk minimization. J Mach Learn Res, 2010; 11 : 311-365.

引证文献14

二级引证文献21

兰州大学学报（自然科学版）
2011年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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