메뉴 건너뛰기




Volumn , Issue , 2011, Pages 463-470

Speedup of fuzzy and possibilistic kernel c-means for large-scale clustering

Author keywords

clustering; fuzzy partitions; kernel methods; large scale data; possibilistic partitions

Indexed keywords

CLUSTERING; FUZZY PARTITION; KERNEL METHODS; LARGE-SCALE DATA; POSSIBILISTIC;

EID: 80053085247     PISSN: 10987584     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FUZZY.2011.6007618     Document Type: Conference Paper
Times cited : (29)

References (24)
  • 1
    • 84889378759 scopus 로고    scopus 로고
    • Advances in fuzzy clustering and feature discrimination with applications
    • John Wiley and Sons, 2007, ch.
    • H. Frigui, Advances in Fuzzy Clustering and Feature Discrimination with Applications. John Wiley and Sons, 2007, ch. Simultaneous Clustering and Feature Discrimination with Applications, pp. 285-312.
    • Simultaneous Clustering and Feature Discrimination with Applications , pp. 285-312
    • Frigui, H.1
  • 2
    • 50649118116 scopus 로고    scopus 로고
    • Cluster boosted tree classifier for multi-view, multi-pose object detection
    • October
    • W. Bo and R. Nevatia, "Cluster boosted tree classifier for multi-view, multi-pose object detection," in Proc. ICCV, October 2007.
    • (2007) Proc. ICCV
    • Bo, W.1    Nevatia, R.2
  • 3
    • 0348143187 scopus 로고    scopus 로고
    • GoFigure: Automated gene ontology annotation
    • S. Khan, G. Situ, K. Decker, and C. Schmidt, "GoFigure: Automated Gene Ontology annotation," Bioinf., vol. 19, no. 18, pp. 2484-2485, 2003.
    • (2003) Bioinf. , vol.19 , Issue.18 , pp. 2484-2485
    • Khan, S.1    Situ, G.2    Decker, K.3    Schmidt, C.4
  • 4
    • 33846041078 scopus 로고    scopus 로고
    • The universal protein resource (UniProt)
    • The UniProt Consotium
    • The UniProt Consotium, "The universal protein resource (UniProt)," Nucleic Acids Res., vol. 35, pp. D193-D197, 2007.
    • (2007) Nucleic Acids Res. , vol.35
  • 10
  • 11
    • 84893405732 scopus 로고    scopus 로고
    • Data clustering: A review
    • September
    • A. Jain, M. Murty, and P. Flynn, "Data clustering: A review," ACM Computing Surveys, vol. 31, no. 3, pp. 264-323, September 1999.
    • (1999) ACM Computing Surveys , vol.31 , Issue.3 , pp. 264-323
    • Jain, A.1    Murty, M.2    Flynn, P.3
  • 14
    • 78649727290 scopus 로고    scopus 로고
    • Relational duals of cluster validity functions for the c-means family
    • Dec.
    • I. Sledge, T. Havens, J. Bezdek, and J. Keller, "Relational duals of cluster validity functions for the c-means family," IEEE Trans. Fuzzy Systems, vol. 18, no. 6, pp. 1160-1170, Dec. 2010.
    • (2010) IEEE Trans. Fuzzy Systems , vol.18 , Issue.6 , pp. 1160-1170
    • Sledge, I.1    Havens, T.2    Bezdek, J.3    Keller, J.4
  • 15
    • 57849144858 scopus 로고
    • Optimization of clustering criteria by reformulation
    • R. Hathaway and J. Bezdek, "Optimization of clustering criteria by reformulation," IEEE Trans. Fuzzy Systems, vol. 3, pp. 241-245, 1995.
    • (1995) IEEE Trans. Fuzzy Systems , vol.3 , pp. 241-245
    • Hathaway, R.1    Bezdek, J.2
  • 16
    • 0030214781 scopus 로고    scopus 로고
    • The possibilistic c-means: Insights and recommendations
    • R. Krishnapuram and J. Keller, "The possibilistic c-means: insights and recommendations," IEEE Trans. Fuzzy Systems, vol. 4, pp. 385-393, 1996.
    • (1996) IEEE Trans. Fuzzy Systems , vol.4 , pp. 385-393
    • Krishnapuram, R.1    Keller, J.2
  • 17
    • 80053055246 scopus 로고    scopus 로고
    • Large scale clustering using approximate kernel k-means
    • To be submitted
    • R. Chitta, T. Havens, A. Jain, and R. Jin, "Large scale clustering using approximate kernel k-means," in To be submitted, Proc. ACM SIGKDD, 2011.
    • (2011) Proc. ACM SIGKDD
    • Chitta, R.1    Havens, T.2    Jain, A.3    Jin, R.4
  • 21
    • 33745781694 scopus 로고    scopus 로고
    • Clustering high-dimensional data using an efficient and effective data space reduction
    • R. Orlandia, Y. Lai, and W. Lee, "Clustering high-dimensional data using an efficient and effective data space reduction," in Proc. ACM Conf. Information and Knowledge Management, 2005, pp. 201-208.
    • (2005) Proc. ACM Conf. Information and Knowledge Management , pp. 201-208
    • Orlandia, R.1    Lai, Y.2    Lee, W.3
  • 23
    • 29244453931 scopus 로고    scopus 로고
    • On the nyström method for approximating a gram matrix for improved kernelbased learning
    • P. Drineas and M. Mahoney, "On the Nyström method for approximating a gram matrix for improved kernelbased learning," J. Machine Learning Research, vol. 6, pp. 2153-2175, 2005.
    • (2005) J. Machine Learning Research , vol.6 , pp. 2153-2175
    • Drineas, P.1    Mahoney, M.2


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