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

半监督复杂结构数据降维方法 被引量：1

Semi-supervised complex structure data dimensionality reduction method
下载PDF
导出
摘要 现有的一些典型半监督降维算法,往往在利用标记信息的同时却忽略了样本数据本身的流形特征,或者是对流形特征使用不当,导致算法性能表现不佳并且应用领域狭窄。针对上述问题提出了半监督复杂结构数据降维方法,同时保持样本数据的全局与局部的流形特征。通过设置适当的目标函数,使算法结果能有更广泛的应用场合,实验证明了算法的有效性。 Most existing typical semi-supervised dimensionality reduction algorithms often ignore the manifold features of data or use them inappropriately, while focusing on how to use supervised information.Therefore those algorithms show poor performance and can not be used in many fields.This paper presents a semiupervised complex structure data dimensionality reduction method,called CSDDR, which keeps the global and local structure of the whole data manifold in the low dimensional embedding subspace.An appropriate objective function makes the method has more areas of application, and the experimental results show the effectiveness of the method.
作者 陈斌辉 白清源
机构地区 福州大学至诚学院计算机教研室 福州大学数学与计算机科学学院
出处 《计算机工程与应用》 CSCD 北大核心 2011年第35期135-138,241,共5页 Computer Engineering and Applications
基金 福建省教育厅科技项目(No.JA11292) 中科院软件所(No.SYSKF0701)
关键词 半监督降维 流形假设 约束对 目标函数 聚类分析 Semi-Supervised Dimensionality Reduction（SSDR） manifold assumption constraints objective function clustering analysis
分类号 TP391.9 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献15

  • 1Martinez A M, Kak A C.PCA versus LDA[J].IEEE Trans on Pattern Analysis and Machine Intelligence,2001,23(2) :228-233.
  • 2Ding C, Li T.Adaptive dimension reduction using discriminant analysis and K-means clustering[C]//Ghahramani Z.Proc of the 19th Int'l Conf on Machine Learning.New York: ACM Press, 2007: 521-528.
  • 3Bar-Hillel A, Hertz T, Shental N, et al.Leaming a mahalanobis metric from equivalence constraints[J].Joumal of Machine Learning Research, 2005,6 (6) : 937-965.
  • 4Shental N,Hertz T, Weinshall D, et al.Adjustment learning and relevant component analysis[C]//Shental N, Hertz T, Weinshall D, et al.Proc of the 7th European Conf on Computer Vision. London:Springer Berlin Heidelberg,2002:776-792.
  • 5Tang W, Zhong S.Pairwise constraints-guided dimensionality reduction[C]//Proc of the 2006 SIAM Int'l Conf on Data Mining Workshop on Feature Selection for Data Mining,2006:59-66.
  • 6Wu F, Zhou Y L, Zhang C S.Relevant linear feature extraction using side-information and unlabeled data[C]//Proc of the 17th Int'l Conf on Pattern Recogniton.Washington: IEEE Computer Society, 2004: 582-585.
  • 7彭岩,张道强.半监督典型相关分析算法[J].软件学报,2008,19(11):2822-2832. 被引量：32
  • 8Zhaug D Q, Zhou Z H, Chcn S C.Semi-Supervised dimcnsionality reduction[C]//Proc of the 7th SIAM Int'l Conf on Data Mining, 2007: 629-634.
  • 9韦佳,彭宏.基于局部与全局保持的半监督维数约减方法[J].软件学报,2008,19(11):2833-2842. 被引量：25
  • 10Basu S, Bilenko M, Mooney R J.A probabilistic framework for semi-supervised clustering[C]//Boulicaut J F; Esposito F, Giannotti F, et al.Proc of the 10th ACM SIGKDD Int'l Conf on Knowledge Discovery and Data Mining,KDD,2004:59-68.

二级参考文献72

  • 1Basu S, Banerjee A, Mooney RJ. A probabilistic framework for semi-supervised clustering. In: Boulicaut JF, Esposito F, Giannotti F, Pedreschi D, eds. Proc. of the 10th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining. New York: ACM Press, 2004.59-68.
  • 2Bilenko M, Basu S, Mooney RJ. Integrating constraints and metric learning in semi-supervised clustering. In: Brodley CE, ed. Proc. of the 21st Int'l Conf. on Machine Learning. New York: ACM Press, 2004. 81-88.
  • 3Tang W, Xiong H, Zhong S, Wu J. Enhancing semi-supervised clustering: a feature projection perspective. In: Berkhin P, Caruana R, Wu XD, eds. Proc. of the 13th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining. New York: ACM Press, 2007. 707-716.
  • 4Basu S, Banerjee A, Mooney RJ. Active semi-supervision for pairwise constrained clustering. In: Jonker W, Petkovic M, eds. Proc. of the SIAM Int'l Conf. on Data Mining. Cambridge: MIT Press, 2004. 333-344.
  • 5Yan B, Domeniconi C. An adaptive kernel method for semi-supervised clustering. In: Fiirnkranz J, Scheffer T, Spiliopoulou M, eds. Proc. of the 17th European Conf. on Machine Learning. Berlin: Sigma Press, 2006. 18-22.
  • 6Yeung DY, Chang H. Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints. Pattern Recognition, 2006,39(5):1007-1010.
  • 7Beyer K, Goldstein J, Ramakrishnan R, Shaft U. When is "Nearest Neighbors Meaningful"? In: Beeri C, Buneman P, eds. Proc. of the Int'l Conf. on Database Theory. New York: ACM Press, 1999.217-235.
  • 8Ding CH, Li T. Adaptive dimension reduction using discriminant analysis and K-means clustering. In: Ghahramani Z, ed. Proc. of the 19th Int'l Conf. on Machine Learning. New York: ACM Press, 2007.521-528.
  • 9Zhang DQ, Zhou ZH, Chen SC. Semi-Supervised dimensionality reduction. In: Mandoiu I, Zelikovsky A, eds. Proc. of the 7th SIAM Int'l Conf. on Data Mining. Cambridge: MIT Press, 2007. 629-634.
  • 10Ye JP, Zhao Z, Liu H. Adaptive distance metric learning for clustering. In: Bishop CM, Frey B, eds. Proc. of IEEE Computer Society Conf. on Computer Vision and Pattern Recognition. Madison: IEEE Computer Society Press, 2007. 1-7.

共引文献97

同被引文献1

引证文献1

二级引证文献8

计算机工程与应用
2011年 第35期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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