Abstract
By means of analyzing kernel clustering algorithm and rough set theory, a novel clustering algorithm, rough kernel k-means clustering algorithm, was proposed for clustering analysis. Through using Mercer kernel functions, samples in the original space were mapped into a high-dimensional feature space, which the difference among these samples in sample space was strengthened through kernel mapping, combining rough set with k-means to cluster in feature space. These samples were assigned into up-approximation or low-approximation of corresponding clustering centers, and then these data that were in up-approximation and low-approximation were combined and to update cluster center. Through this method, clustering precision was improved, clustering convergence speed was fast compared with classical clustering algorithms The results of simulation experiments show the feasibility and effectiveness of the kernel clustering algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Mathematical programming, pp. 191–215. Springer, Berlin (1997)
Pawlak, Z.: Rough Sets theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)
Hartigan, J.A., Wong, M.A.: Algorithm AS136: A k-means clustering algorithm. Applied statistics 28(1), 100–108 (1979)
Gestel, T.V., Baesses, B., Suykens, J., et al.: Bayesian Kernel based classification for financial distress detection. European Journal of Operational research 172(3), 979–1003 (2006)
Xu, R.: Donald Wunsch II, Survey of clustering algorithm. IEEE transaction on neural networks 10(3), 645–678 (2005)
Rajen, B.B., Gopal, M.: On fuzzy-rough sets approach to feature selection. Pattern Recognition Letter 26(7), 865–975 (2005)
Lingras, P., West, J.: Interval set clustering of web users with rough k-means. Journal of Intelligent Information Systems 23(1), 5–16 (2004)
Peters, G.: Some refinements of rough k-means clustering. Pattern Recognition 39(8), 1481–1491 (2006)
Mitra, S.: An evolutionary rough partitive clustering. Pattern Recognition Letters 25(12), 1439–1449 (2004)
Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE transaction on pattern analysis and Machine Intelligence 1(4), 224–227 (1979)
Su, C.-T., Chen, L., Yih, Y.: Knowledge acquisition through information granulation for imbalanced data. Expert Systems with Applications 31(3), 531–541 (2006)
Alexei, P., Samy, B.: Invariances in kernel methods: From samples to objects. Pattern Recognition Letters 27(10), 1087–1097 (2006)
Stphane, C., Alex, S.: Kernel methods and the exponential family. Neurocomputing 69(7), 714–720 (2006)
Zhang, L., Zhou, W., Jiao, L.: Kernel clustering Algorithm. Chinese Journal of Computers 25(6), 587–590 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, T., Zhang, Y., Lu, H., Deng, F., Wang, F. (2008). Rough Cluster Algorithm Based on Kernel Function. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2008. Lecture Notes in Computer Science(), vol 5009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79721-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-79721-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79720-3
Online ISBN: 978-3-540-79721-0
eBook Packages: Computer ScienceComputer Science (R0)