• Article
  • | |
  • Metrics
  • |
  • Reference [12]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    Outliers are data values that lie away from the general clusters of other data values. It may be that an outlier implies the most important feature of a dataset. In this paper, a new fuzzy kernel clustering algorithm is presented to locate the critical areas that are often represented by only a few outliers. Through mercer kernel functions, the data in the original space are firstly mapped to a high-dimensional feature space. Then a modified objective function for fuzzy clustering is introduced in the feature space. An additional weighting factor is assigned to each vector in the feature space, and the weight value is updated using the iterative functions derived from the objective function. The final weight of a datum represents a kind of representativeness of the corresponding datum. With these weights, the experts can identify the outliers easily. The simulations demonstrate the feasibility of this method.

    Reference
    [1]Last M, Kandel A. Automated perceptions in data mining. In: Proc. of the 8th Int'l Conf. on Fuzzy System. Seoul, 1999. 190~197.
    [2]Mendenhall W, Reinmuth JE, Beaver RJ. Statistics for Management and Economics. 6th ed., Belmont: Duxbury Press, 1993.
    [3]Keller A. Fuzzy clustering with outliers. In: Proc. of the NAFIPS00.2000. 143~147.
    [4]Girolami M. Mercer kernel-based clustering in feature space. IEEE Trans. on Neural Networks, 2002,13(3):780~784.
    [5]Vapnik VN. The Nature of Statistical Learning Theory. 2nd ed., New York: John Wiley and Sons, 1998.
    [6]Roth V, Steinhage V. Nonlinear discriminant analysis using kernel functions. In: Solla SA, Leen TK, Muller K-R, ed. Advances in Neural Information Processing Systems. Cambridge: MIT Press, 1999. 568~574.
    [7]Scho1kopf B, Mika S, Burges CJC, Knirsch P, Miller K-R, Raitsch G, Smola AJ. Input space versus feature space in kernel-based methods. IEEE Trans. on Neural Networks, 1999,10(5): 1000~1017.
    [8]Buhmann JM. Data clustering and data visualization. In: Jordan MI, ed. Learning in Graphical Models. Boston: Kluwer, 1998.
    [9]Hoppner F, Klawonn F, Eklund P. Learning indistinguishability from data. Soft Computing, 2002,6(1):6~13. z
    [10]Roberts SJ, Everson R, Rezek I. Maximum certainty data partitioning. Pattern Recognition, 2000,33(5):833~839.
    [11]Zhang L, Zhou WD, Jiao LC. Kernel clustering algorithm. Chinese Journal of Computers, 2002,25(6):587~590 (in Chinese with English abstract).
    [12]张莉,周伟达,焦李成核聚类算法.计算机学报,2002,25(6):587~590.
    Related
    Cited by
Get Citation

沈红斌,王士同,吴小俊.离群模糊核聚类算法.软件学报,2004,15(7):1021-1029

Copy
Share
Article Metrics
  • Abstract:4830
  • PDF: 5936
  • HTML: 0
  • Cited by: 0
History
  • Received:August 11,2003
  • Revised:October 08,2003
You are the first2044989Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063