[1]ZHAO Mengmeng,LI Fanzhang.Neighborhood homology learning algorithm[J].CAAI Transactions on Intelligent Systems,2014,9(3):336-342.[doi:10.3969/j.issn.1673-4785.201403063]
Copy

Neighborhood homology learning algorithm

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 9 Number of periods: 2014 3 Page number: 336-342 Column: 学术论文—智能系统 Public date: 2014-06-25
Title:
Neighborhood homology learning algorithm
Author(s):
ZHAO Mengmeng;  LI Fanzhang
School of Computer Science and Technology, Soochow University, Suzhou 215006, China
Keywords:
homology learning; homology algebra; machine learning; margin partitioning; margin homology learning; neighborhood homology learning algorithm; neighborhood complex graphs; similarity
CLC:
TP181
DOI:
10.3969/j.issn.1673-4785.201403063
Abstract:
At present , the existing margin learning algorithms still have some affects when attempting to solve the data partitioning problem of variable margins.These algorithms can not effectively maintain the structure feature of datas in classification.. At present, the existing margin learning algorithms still have defects when attempting to solve the data partitioning problem of variable margins. As a consequence, this paper initially proposes a neighborhood homology learning algorithm through using the monomorphic division theory in homology algebra. The neighborhood homology learning algorithm reasearchs the margin partitioning problem from the perspective of machine learning. The neighborhood homology learning algorithm includes the method of structuring the neighborhood complex, and the criterion for judging the similarity between two given graphs. Finally, this algorithm is justified through the experimental results contrasted with SVM and TVQ on an image dataset named MPEG7 CE and a database of handwritten digits named USPS-ALL.
References:
[1] 周志华, 王珏.机器学习及其应用研究[M].北京:清华大学出版社, 2007:1-161.
[2] 李凡长, 张莉, 杨季文.李群机器学习[M].合肥:中国科学技术大学出版社, 2013:281-296.
[3] PERNKOPF F, WOHLMAYR M, TSCHIATSCHEK S. Maximum margin Bayesian network classifiers[J]. Pattern Analysis and Machine Intelligence, 2012, 34(3):521-532.
[4] PANWAR H, GUPTA S. Advances in Computer Science, Engineering and Applications[M]. Berlin:Springer, 2012:385-392.
[5] EIDELMAN V. Optimization strategies for online large-margin learning in machine translation[C]//Proceedings of the 7th Workshop on Statistical Machine Translation, Montreal, Canada, 2012:480-489.
[6] VAPNIK V. Statistical learning theory[M]. New York:Wiley, 1998:1-768.
[7] LEE Y J, HSIEH W F, HUANG C F. e-SSVR:A smooth support vector machine for e-insensitive regression[J]. IEEE Transactions on Knowledge and data Engineering, 2005, 17(5):678-685.
[8] LIN C F, WANG S D. Fuzzy support vector machines[J]. IEEE Transactions on Neural Networks, 2002, 13(3):466-471.
[9] FABIO A, ALESSANDRO S. A re-weighting strategy for improving margins[J]. Artificial Intelligence, 2002, 137:197-216.
[10] 鲜敏, 李凡长.一种同调边缘学习算法[J].计算机工程与应用, 2008, 44(21):192-194.XIAN Min, LI Fanzhang. Learning algorithm based on homology margin[J].Computer Engineering and Applications, 2008, 44(21):192-194.
[11] 杨季文, 李哲硕, 何书萍, 等.胞腔同调边缘学习算法研究[J].计算机研究与发展, 2013, 50(5):1005-1011.YANG Jiwen, LI Zheshuo, HE Shuping et al.On celluar homology margin learning algorithms[J].Computer Research and Development, 2013, 50(5):1005-1011.
[12] 邓乃杨, 田英杰.数据挖掘中的新方法——支持向量机[M].北京:科学出版社, 2005:1-408.
[13] BURGES C J C. A tutorial on support vector machines for pattern recognition[J]. Data Mining and Knowledge Discovery, 1998, 2(2):121-167.
[14] SHAWE-TAYLOR J, CRISTININI N. Kernel methods for pattern analysis[M]. Cambridge University Press, 2004:289-436.
[15] CORTES C, VAPNIK V. Support-vector networks[J]. Machine Learning, 1995, 20(3):273-297.
[16] SIMARD P Y, LECUN Y, DENKER J. Efficient pattern recognition using a new transformation distance[J]. Advanced in Neural Information Processing System, 1993, 5:50-58.
[17] SCHAPIRE R E, SINGER Y. Improved boosting algorithms using confidence-rated predictions[J]. Machine Learning, 1999, 37(3):297-336.
[18] DUFFY N, HELMBOLD D. Boosting methods for regression[J]. Machine Learning, 2002, 47(2/3):153-200.
[19] 南基洙, 王颖.同调代数导论[M].大连:大连理工大学出版社, 2011:112-222.
[20] 姜伯驹.同调论[M].北京:北京大学出版社, 2006:1-90.
[21] 江泽涵.拓扑学引论[M].上海:上海科学技术出版社, 1978:25-169.
[22] 孟道骥, 白承铭.李群[M].北京:科学出版社, 2003:28-92.
[23] 黄保军.同调与同伦原理[M].合肥:中国科学技术出版社, 2005:16-59.
[24] 沈信耀.同调论——代数拓扑学之一[M].北京:科学出版社, 2002:19-132.
[25] 谢力同.组合拓扑方法在图论和拟阵理论中的应用[J].数学进展, 1983, 12(3):1-5.XIE Litong.Applications of combinatorial topology method in graph theory and matroid theory[J]. Advances in Mathematics, 1983, 12(3):1-5.
[26] 方冬云.不包含{4, 8, 9}-圈平面图结构的性质[J].长春工业大学学报, 2011, 32(5):485-488.FANG Dongyun.Nature of stucture planar graph without {4, 8, 9}-cycles[J]. Journal of Changchun University of Technology, 2011, 32(5):485-488.
[27] 薛秀谦.仙人掌图的邻域同调分类[J].山东大学学报, 1994, 29(1):13-17.XUE Xiuqian.The neighborhood homology classification of cactus[J]. Journal of Shandong University, 1994, 29(1):13-17.
[28] 薛秀谦.立方图的邻域同调分类[J].中国矿业大学学报, 1995, 24(4):110-112.XUE Xiuqian.The neighborhood homology classification of cubic graphs[J]. Journal of China University of Mining and Technology, 1995, 24(4):110-112.
[29] 薛秀谦.无C4图的邻域同调分类[J].系统科学与数学, 1998, 18(1):101-103.XUE Xiuqian.The neighborhood homology classification of the C4free graphs[J]. Systems Science and Mathematics, 1998, 18(1):101-103.
Similar References:

Memo

-

Last Update: 1900-01-01

Copyright © CAAI Transactions on Intelligent Systems