메뉴 건너뛰기




Volumn 16, Issue 2, 2007, Pages 201-217

Constrained data clustering by depth control and progressive constraint relaxation

Author keywords

Constrained clustering; Data clustering; Data mining

Indexed keywords


EID: 33846666918     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-005-0164-6     Document Type: Article
Times cited : (5)

References (27)
  • 1
    • 0346702962 scopus 로고    scopus 로고
    • Discovery internet marketing intelligence through online analytical web usage mining
    • Büchner, A.G., Mulvenna, M.D.: Discovery internet marketing intelligence through online analytical web usage mining. ACM SIGMOD Rec. 27(4), 54-61 (1998)
    • (1998) ACM SIGMOD Rec , vol.27 , Issue.4 , pp. 54-61
    • Büchner, A.G.1    Mulvenna, M.D.2
  • 2
    • 0030387631 scopus 로고    scopus 로고
    • Data mining: An overview from database perspective
    • Chen, M.-S., Han, J., Yu, P.S.: Data mining: An overview from database perspective. IEEE Trans. Knowl. Data Eng. 8(6), 866-883 (1996)
    • (1996) IEEE Trans. Knowl. Data Eng , vol.8 , Issue.6 , pp. 866-883
    • Chen, M.-S.1    Han, J.2    Yu, P.S.3
  • 6
    • 0005943240 scopus 로고    scopus 로고
    • Constrained K-Means Clustering. MSR-TR-2000-65, Microsoft Research
    • May
    • Bradley, P.S., Bennett, K.P., Demiriz, A.: Constrained K-Means Clustering. MSR-TR-2000-65, Microsoft Research, May (2000)
    • (2000)
    • Bradley, P.S.1    Bennett, K.P.2    Demiriz, A.3
  • 7
    • 0242540424 scopus 로고    scopus 로고
    • A robust and efficient clustering algorithm based on cohesion self-merging
    • Lin, C.-R., Chen, M.-S.: A robust and efficient clustering algorithm based on cohesion self-merging. In: Proceedings of the ACM SIGKDD (2002)
    • (2002) Proceedings of the ACM SIGKDD
    • Lin, C.-R.1    Chen, M.-S.2
  • 8
    • 0003136237 scopus 로고
    • Efficient and effective clustering methods for spatial data mining
    • Ng, R.T., Han, J.: Efficient and effective clustering methods for spatial data mining. In: Proceedings of the VLDB (1994)
    • (1994) Proceedings of the VLDB
    • Ng, R.T.1    Han, J.2
  • 11
    • 33846672416 scopus 로고    scopus 로고
    • Crescenzi, P., Kann, V.: A compendium of NP optimization problems [http://www.nada.kth.se/~viggo/problemlist/compendium.html]
    • Crescenzi, P., Kann, V.: A compendium of NP optimization problems [http://www.nada.kth.se/~viggo/problemlist/compendium.html]
  • 12
    • 0017969553 scopus 로고
    • A sentence-to-sentence clustering procedure for pattern analysis
    • Lu, S.Y., Pu, K.S.: A sentence-to-sentence clustering procedure for pattern analysis. IEEE Trans. Syst. Man Cybem. 8, 381-389 (1978)
    • (1978) IEEE Trans. Syst. Man Cybem , vol.8 , pp. 381-389
    • Lu, S.Y.1    Pu, K.S.2
  • 14
    • 0023523514 scopus 로고
    • How many clusters are best? - an experiment
    • Dubes, R.C.: How many clusters are best? - an experiment. Pattern Recognit. 20(6), 645-663 (1987)
    • (1987) Pattern Recognit , vol.20 , Issue.6 , pp. 645-663
    • Dubes, R.C.1
  • 18
    • 0037986929 scopus 로고    scopus 로고
    • Autoclust+:automatic clustering of point-data sets in the presence of obstacles
    • Estivill-Castro, V., Lee, I.: Autoclust+:automatic clustering of point-data sets in the presence of obstacles. In: Proceedings of the TSDM, pp. 133-146 (2000)
    • (2000) Proceedings of the TSDM , pp. 133-146
    • Estivill-Castro, V.1    Lee, I.2
  • 19
    • 0035013804 scopus 로고    scopus 로고
    • Spatial clustering in the presence of obstacles
    • Tung, A.K.H., Hou, J., Han, J.: Spatial clustering in the presence of obstacles. In: Proceedings of the ICDE, pp. 359-367 (2001)
    • (2001) Proceedings of the ICDE , pp. 359-367
    • Tung, A.K.H.1    Hou, J.2    Han, J.3
  • 20
    • 84945291085 scopus 로고    scopus 로고
    • Zaïane, O.R., Foss, A., Lee, C.-H., Wang, W.: On data clustering analysis: Scalability, constraints, and validation. In: PAKDD, pp. 28-39 (2002)
    • Zaïane, O.R., Foss, A., Lee, C.-H., Wang, W.: On data clustering analysis: Scalability, constraints, and validation. In: PAKDD, pp. 28-39 (2002)
  • 23
    • 0002928691 scopus 로고    scopus 로고
    • Semantic compression and pattern extraction with fascicles
    • Jagadish, H.V., Madar, J., Ng, R.T.: Semantic compression and pattern extraction with fascicles, In: Proceedings of the VLDB, pp. 186-198 (1999)
    • (1999) Proceedings of the VLDB , pp. 186-198
    • Jagadish, H.V.1    Madar, J.2    Ng, R.T.3
  • 24
    • 84898824104 scopus 로고    scopus 로고
    • Time-constrained clustering for segmentation of video into story units
    • May
    • Yeung, M., Yeo, B.L.: Time-constrained clustering for segmentation of video into story units. In: International Conference on Pattern Recognition, pp. 375-380, May (1996)
    • (1996) International Conference on Pattern Recognition , pp. 375-380
    • Yeung, M.1    Yeo, B.L.2
  • 25
    • 0040438433 scopus 로고    scopus 로고
    • Density-biased sampling: An improved method for data mining and clustering
    • Data
    • Palmer, C.R., Faloutsos, C.: Density-biased sampling: An improved method for data mining and clustering. In: ACM SIGMOD Int. Conf. Manage. Data (2000)
    • (2000) ACM SIGMOD Int. Conf. Manage
    • Palmer, C.R.1    Faloutsos, C.2
  • 26
    • 84947386456 scopus 로고
    • Step-wise clustering procedures
    • King, B.: Step-wise clustering procedures. J. Am. Stat. Assoc. 69, 86-101 (1967)
    • (1967) J. Am. Stat. Assoc , vol.69 , pp. 86-101
    • King, B.1


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