메뉴 건너뛰기




Volumn 17, Issue 5, 2005, Pages 628-637

Dual clustering: Integrating data clustering over optimization and constraint domains

Author keywords

Data clustering; Data mining; Dual clustering

Indexed keywords

ALGORITHMS; FUNCTIONS; FUZZY SETS; HIERARCHICAL SYSTEMS; NEURAL NETWORKS; OPTIMIZATION; PATTERN RECOGNITION; PROBLEM SOLVING;

EID: 19944388875     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2005.75     Document Type: Article
Times cited : (70)

References (29)
  • 3
    • 0005943240 scopus 로고    scopus 로고
    • Constrained K-means clustering
    • Microsoft Research, May
    • P.S. Bradley, K.P. Bennett, and A. Demiriz, "Constrained K-Means Clustering," Technical Report MSR-TR-2000-65, Microsoft Research, May 2000.
    • (2000) Technical Report , vol.MSR-TR-2000-65
    • Bradley, P.S.1    Bennett, K.P.2    Demiriz, A.3
  • 4
    • 0346702962 scopus 로고    scopus 로고
    • Discovery internet marketing intelligence through online analytical web usage mining
    • Dec.
    • A.G. Buchner and M. Mulvenna, "Discovery Internet Marketing Intelligence through Online Analytical Web Usage Mining," ACM SIGMOD Record, vol. 27, no. 4, pp. 54-61, Dec. 1998.
    • (1998) ACM SIGMOD Record , vol.27 , Issue.4 , pp. 54-61
    • Buchner, A.G.1    Mulvenna, M.2
  • 5
    • 0034228643 scopus 로고    scopus 로고
    • The analysis of decomposition methods for support vector machines
    • C.-C. Chang, C.-W. Hsu, and C.-J. Lin, "The Analysis of Decomposition Methods for Support Vector Machines," IEEE Trans. Neural Networks, pp. 1003-1008, 2000.
    • (2000) IEEE Trans. Neural Networks , pp. 1003-1008
    • Chang, C.-C.1    Hsu, C.-W.2    Lin, C.-J.3
  • 6
    • 0030387631 scopus 로고    scopus 로고
    • Data mining: An overview from database perspective
    • Dec.
    • M.-S. Chen, J. Han, and P.S. Yu, "Data Mining: An Overview from Database Perspective," IEEE Trans. Knowledge and Data Eng., vol. 5, no. 1, pp. 866-883, Dec. 1996.
    • (1996) IEEE Trans. Knowledge and Data Eng. , vol.5 , Issue.1 , pp. 866-883
    • Chen, M.-S.1    Han, J.2    Yu, P.S.3
  • 8
    • 0023523514 scopus 로고
    • How many clusters are best?-an experiment
    • R.C. Dubes, "How Many Clusters Are Best?-An Experiment," Pattern Recognition, vol. 20, no. 6, pp. 645-663, 1987.
    • (1987) Pattern Recognition , vol.20 , Issue.6 , pp. 645-663
    • Dubes, R.C.1
  • 14
    • 0036505670 scopus 로고    scopus 로고
    • A comparison of methods for multi-class support vector machines
    • C.-W. Hsu and C.-J. Lin, "A Comparison of Methods for Multi-class Support Vector Machines," IEEE Trans. Neural Networks, pp. 415-425, 2002.
    • (2002) IEEE Trans. Neural Networks , pp. 415-425
    • Hsu, C.-W.1    Lin, C.-J.2
  • 15
    • 0037399781 scopus 로고    scopus 로고
    • Polynomial-time decomposition algorithms for support vector machines
    • D. Hush and C. Scovel, "Polynomial-Time Decomposition Algorithms for Support Vector Machines," Machine Learning, pp. 51-71, 2003.
    • (2003) Machine Learning , pp. 51-71
    • Hush, D.1    Scovel, C.2
  • 16
    • 84947386456 scopus 로고
    • Step-wise clustering procedures
    • B. King, "Step-Wise Clustering Procedures," J. Am. Statistical Assoc., vol. 69, pp. 86-101, 1967.
    • (1967) J. Am. Statistical Assoc. , vol.69 , pp. 86-101
    • King, B.1
  • 19
    • 0017969553 scopus 로고
    • A sentence-to-sentence clustering procedure for pattern analysis
    • S.Y. Lu and K.S. Fu, "A Sentence-to-Sentence Clustering Procedure for Pattern Analysis," IEEE Trans. Systems, Man, and Cybernetics, vol. 8, pp. 381-389, 1978.
    • (1978) IEEE Trans. Systems, Man, and Cybernetics , vol.8 , pp. 381-389
    • Lu, S.Y.1    Fu, K.S.2
  • 28
    • 84944319598 scopus 로고    scopus 로고
    • Indexing the distance: An efficient method to KNN processing
    • C. Yu, B.-C. Ooi, K.-L. Tan, and H.V. Jagadish, "Indexing the Distance: An Efficient Method to KNN Processing," The VLDB J., pp. 421-430, 2001.
    • (2001) The VLDB J. , pp. 421-430
    • Yu, C.1    Ooi, B.-C.2    Tan, K.-L.3    Jagadish, H.V.4


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