메뉴 건너뛰기




Volumn 12, Issue 2, 2004, Pages 209-217

Improved possibilistic C-means clustering algorithms

Author keywords

Approach; C means; Clustering; Possibilistic

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; MEMBERSHIP FUNCTIONS; NUMERICAL METHODS; SET THEORY;

EID: 1942532748     PISSN: 10636706     EISSN: None     Source Type: Journal    
DOI: 10.1109/TFUZZ.2004.825079     Document Type: Article
Times cited : (162)

References (15)
  • 1
    • 0027595430 scopus 로고
    • A possibilistic approach to clustering
    • Feb.
    • R. Krishnapuram and J. Keller, "A possibilistic approach to clustering," IEEE Trans. Fuzzy Syst., vol. 1, pp. 98-110, Feb. 1993.
    • (1993) IEEE Trans. Fuzzy Syst. , vol.1 , pp. 98-110
    • Krishnapuram, R.1    Keller, J.2
  • 2
    • 0030214781 scopus 로고    scopus 로고
    • The possibilistic C-means algorithm: Insights and recommendations
    • ____, "The possibilistic C-means algorithm: Insights and recommendations," IEEE Trans. Fuzzy Syst., vol. 4, pp. 385-393, 1996.
    • (1996) IEEE Trans. Fuzzy Syst. , vol.4 , pp. 385-393
    • Krishnapuram, R.1    Keller, J.2
  • 3
    • 0030212286 scopus 로고    scopus 로고
    • Comments on 'A possibilistic approach to clustering
    • June
    • M. Barni, V. Cappellini, and A. Mecocci, "Comments on 'A possibilistic approach to clustering'," IEEE Trans. Fuzzy Syst., vol. 4, pp. 393-396, June 1996.
    • (1996) IEEE Trans. Fuzzy Syst. , vol.4 , pp. 393-396
    • Barni, M.1    Cappellini, V.2    Mecocci, A.3
  • 5
    • 0030260017 scopus 로고    scopus 로고
    • A robust algorithm for automatic extraction of an unknown number of clusters for noisy data
    • Oct.
    • H. Frigui and R. Krishnapuram, "A robust algorithm for automatic extraction of an unknown number of clusters for noisy data," Pattern Recogn. Lett., vol. 17, no. 12, pp. 1223-1232, Oct. 1996.
    • (1996) Pattern Recogn. Lett. , vol.17 , Issue.12 , pp. 1223-1232
    • Frigui, H.1    Krishnapuram, R.2
  • 6
    • 0031192257 scopus 로고    scopus 로고
    • Clustering by competitive agglomeration
    • July
    • ____, "Clustering by competitive agglomeration," Pattern Recogn., vol. 30, no. 7, pp. 1109-1119, July 1997.
    • (1997) Pattern Recogn. , vol.30 , Issue.7 , pp. 1109-1119
    • Frigui, H.1    Krishnapuram, R.2
  • 7
    • 0032650370 scopus 로고    scopus 로고
    • A robust competitive clustering algorithm with applications in computer vision
    • May
    • ____, "A robust competitive clustering algorithm with applications in computer vision," IEEE Trans. Pattern Anal. Machine Intell., vol. 21, pp. 450-465, May 1999.
    • (1999) IEEE Trans. Pattern Anal. Machine Intell. , vol.21 , pp. 450-465
    • Frigui, H.1    Krishnapuram, R.2
  • 8
    • 25044461754 scopus 로고    scopus 로고
    • Improved possibilistic c-means clustering algorithm
    • Dept. Comput. Sci., Hong Kong Baptist Univ.
    • J. S. Zhang and Y. W. Leung. (2003) "Improved possibilistic c-means clustering algorithm". Dept. Comput. Sci., Hong Kong Baptist Univ., [Online]. Available: http://www.comp.hkbu.edu.hk/~ywleung/papers/ipcm.zip
    • (2003)
    • Zhang, J.S.1    Leung, Y.W.2
  • 13
    • 0000586827 scopus 로고
    • Characterization and detection of noise in clustering
    • R. N. Dave, "Characterization and detection of noise in clustering," Pattern Recogn. Lett., vol. 12, pp. 657-664, 1991.
    • (1991) Pattern Recogn. Lett. , vol.12 , pp. 657-664
    • Dave, R.N.1
  • 14
    • 0031139176 scopus 로고    scopus 로고
    • Robust clustering methods: A unified review
    • May
    • R. N. Dave and R. Krishnapuram, "Robust clustering methods: A unified review," IEEE Trans. Fuzzy Syst., vol. 5, no. 2, pp. 270-293, May 1997.
    • (1997) IEEE Trans. Fuzzy Syst. , vol.5 , Issue.2 , pp. 270-293
    • Dave, R.N.1    Krishnapuram, R.2
  • 15
    • 1942540494 scopus 로고    scopus 로고
    • Y.-W. Leung. Hong Kong Baptist Univ., Hong Kong. [Online]. Available: http://www.comp.hkbu.edu.hk/~ywleung/paper/ipcm.html
    • Leung, Y.-W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.