Hierarchical Clustering Algorithm of the Minimum Risk

Article Preview

Abstract:

Clustering analysis is grouping a set of physical or abstract objects into the similar class. In traditional clustering algorithm, objects are usually divided into a certain cluster. This paper applies the risk evaluation of decision-theoretic rough set model in clustering analysis which solves the problem of uncertain boundary region, and proposes a hierarchical clustering algorithm of the minimum risk which can adjust threshold value to construct a clustering evaluation function in order to find the solution to optimize the result. At last, the case analysis shows the algorithm is feasible. It could provide a strong support for marine environment monitoring system and so on.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1410-1413

Citation:

Online since:

July 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Zhou Zhihua, Yang Qiang. Machine learning and its application. Beijing: Tsinghua University Press, (2011).

Google Scholar

[2] Serban Gabriela, Campan Alina. Hierarchical adaptive clustering. Informatica, 2008, 19(1): 101-112.

Google Scholar

[3] Hirano S, Tsumoto S. A knowledge-oriented clustering technique based on rough set. Processing of 25thIEEE International Conference on Computer and Software Application, (2001).

DOI: 10.1109/cmpsac.2001.960679

Google Scholar

[4] Asharaf S, Murty M. An adaptive rough set fuzzy single pass algorithm for cluster large data sets. Pattern Recognition, 2003, 36: 3015-3018.

DOI: 10.1016/s0031-3203(03)00081-5

Google Scholar

[5] Liu Shaohui, Hu Pei, Jia Ziyan, et al. A rough set-based hierarchical clustering algorithm. Journal of computer research and development, 2004, 41(4): 552-557.

Google Scholar

[6] KUMAR P, KRISHNA P R, BAPI R S, et al. Rough clustering of sequential data. Data & Knowledge Engineering, 2007, 63(2): 183-199.

DOI: 10.1016/j.datak.2007.01.003

Google Scholar

[7] Bean C, Kambhampati C. Autonomous clustering using rough set theory. International Journal of Automation and Computing, 2008, 5(1): 90-102.

DOI: 10.1007/s11633-008-0090-3

Google Scholar

[8] Fan Liling, Wang Juan. Clustering algorithm for mixed attribute based on rough set. Journal of computer applications, 2012, 30(12): 3377-3379.

DOI: 10.3724/sp.j.1087.2010.03377

Google Scholar

[9] Wu X, Zhou J. A novel possibilistic fuzzy C-mean clustering. ACTA Electronica Sinia, 2008, 10: 1996-(2000).

Google Scholar

[10] Yin Gang, Miao Duoqian, Duan Qiguo. New rough leader clustering algorithm. Computer sciences, 2009, 36(5): 203-205.

Google Scholar

[11] Pawan Lingras, Min Chen, Duoqian Miao. Rough cluster quality index based on decision theory. IEEE Transaction on Knowledge and Data Engineering, 2009, 21(7): 1014-1026.

DOI: 10.1109/tkde.2008.236

Google Scholar

[12] Liang Lin, Xu Guanghua. Reduction of Rough Set Attribute Based on Immune Clone Selection. Journal of Xi'an Jiaotong University, 2005, 39(11): 1231-1235.

Google Scholar