Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Kernel-based deterministic annealing algorithm for data clustering

Kernel-based deterministic annealing algorithm for data clustering

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Vision, Image and Signal Processing — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

Data clustering in kernel-induced feature space is interesting in that, by nonlinearly mapping the observed data from a low-dimensional input space into a high (possibly infinite)-dimensional feature space by means of a given kernel function, the kernel-based clustering can reveal complicated (e.g. linearly nonseparable) data structures that may be missed by traditional clustering methods in the standard Euclidean space. A kernel-based deterministic annealing (KDA) algorithm is developed for data clustering by using a Gaussian kernel function. The Gaussian parameter (width), which determines the nonlinear mapping together with the Gaussian kernel, is adaptively selected by the scaled inverse of data covariance. The effectiveness of the Gaussian parameter (width) selection method and the superiority of the KDA algorithm for clustering a variety of data structures are supported by the experimental results on artificial and real data sets.

Inspec keywords: covariance analysis; pattern clustering; Gaussian processes; data structures; deterministic algorithms

Other keywords: standard Euclidean space; kernel-based deterministic annealing algorithm; data clustering; data covariance scaled inverse; data structures; kernel-induced feature space; Gaussian kernel function

Subjects: Other topics in statistics; Pattern recognition; Data handling techniques; File organisation

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
      • J. Bezdek . (1981) Pattern recognition with fuzzy objective function algorithms.
    5. 5)
    6. 6)
      • Scholkopf, B., Burges, C.J.C., Vapnik, V.N.: `Extracting support data for a given task', 1st Int. Conf. on Knowledge Discovery and Data Mining, 1995, p. 252–257.
    7. 7)
      • B. Schölkopf , A. Smola . (2002) Learning with kernels.
    8. 8)
    9. 9)
      • Scholkopf, B., Smola, A.J., Muller, K.R.: `Nonlinear component analysis as a kernel eigenvalue problem', Technical Report, 1996.
    10. 10)
      • S.M. Zhou , J.Q. Gan . An unsupervised kernel based fuzzy c-means clustering algorithm with kernel normalization. Int. J. Comput. Intell. Appl. , 4 , 355 - 373
    11. 11)
    12. 12)
      • D. Miller , K. Rose . Hierarchical, unsupervised learning with growing via phase transitions. Neural Comput. , 2 , 427 - 452
    13. 13)
      • D.Q. Zhang , S.C. Chen . Robust image segmentation using FCM with spatial constraints based on new kernel-induced distance measure. IEEE Trans. Syst. Man Cybern. , 4 , 1907 - 1916
    14. 14)
      • ‘UCI Benchmark repository: A huge collection of artificial and real world data sets’. University of California at Irvine. Available at: http://www.ics.uci.edu/mlearn.
    15. 15)
      • C. Cortes , V.N. Vapnik . Support vector networks. Mach. Learn. , 3 , 273 - 297
    16. 16)
    17. 17)
      • Yang, X.L., Song, Q., Cao, A.Z.: `Clustering nonlinearly separable and unbalanced data set', Intelligent Systems, 2nd Int. IEEE Conf., 2004, 2, p. 491–496.
    18. 18)
    19. 19)
      • MacQueen, S.: `Some methods for classification and analysis of multivariate observations', Proc. Fifth Berkeley Symp. on Mathematical Statistics and Probability, 1967, 1, p. 281–297.
    20. 20)
    21. 21)
      • R.O. Duda , P.E. Hart , D.G. Stork . Pattern classification.
    22. 22)
      • Graepel, T., Obermayer, K.: `Fuzzy topographic kernel clustering', Proc. 5th GI Workshop on Fuzzy Neuro Systems, 1998, p. 90–97.
    23. 23)
    24. 24)
    25. 25)
    26. 26)
    27. 27)
    28. 28)
    29. 29)
      • N. Cristianini , J. Shawe-Taylor . (2000) An introduction to support vector machines and other kernel-based learning methods.
    30. 30)
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-vis_20050366
Loading

Related content

content/journals/10.1049/ip-vis_20050366
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address