메뉴 건너뛰기




Volumn 126, Issue , 2008, Pages 31-48

Random subspace ensembles for clustering categorical data

Author keywords

Categorical data; Clustering; Clustering ensembles; High dimensionality

Indexed keywords


EID: 42449148765     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-78981-9_2     Document Type: Conference Paper
Times cited : (16)

References (23)
  • 2
    • 33745445856 scopus 로고    scopus 로고
    • Weighted clustering ensembles
    • Ghosh J, Lambert D, Skillicorn DB, Srivastava J eds, Bethesda, MD, USA. SIAM, Philadelphia, pp
    • Al-Razgan M, Domeniconi C (2006) Weighted clustering ensembles. In: Ghosh J, Lambert D, Skillicorn DB, Srivastava J (eds) Proc 6th SIAM Int Conf Data Mining, Bethesda, MD, USA. SIAM, Philadelphia, pp 258-269
    • (2006) Proc 6th SIAM Int Conf Data Mining , pp. 258-269
    • Al-Razgan, M.1    Domeniconi, C.2
  • 3
    • 35248893423 scopus 로고    scopus 로고
    • Finding natural clusters using multi-clusterer combiner based on shared nearest neighbors
    • Windeatt T, Roli F eds, Guildford, UK. Springer, Berlin/Heidelberg, pp
    • Ayad H, Kamel M (2003) Finding natural clusters using multi-clusterer combiner based on shared nearest neighbors. In: Windeatt T, Roli F (eds) Proc 4th Int Workshop Multiple Classifier Systems, Guildford, UK. Springer, Berlin/Heidelberg, pp 166-175
    • (2003) Proc 4th Int Workshop Multiple Classifier Systems , pp. 166-175
    • Ayad, H.1    Kamel, M.2
  • 4
    • 0038494682 scopus 로고    scopus 로고
    • COOLCAT: An entropy-based algorithm for categorical clustering
    • McLean, VA, USA. ACM Press, New York, pp
    • Barbará D, Li Y, Couto J (2002) COOLCAT: An entropy-based algorithm for categorical clustering. In: Proc 11th Int Conf Inf Knowl Manag, McLean, VA, USA. ACM Press, New York, pp 582-589
    • (2002) Proc 11th Int Conf Inf Knowl Manag , pp. 582-589
    • Barbará, D.1    Li, Y.2    Couto, J.3
  • 5
    • 0035789644 scopus 로고    scopus 로고
    • Co-clustering documents and words using bipartite spectral graph partitioning
    • San Francisco, CA, USA. ACM Press, New York, pp
    • Dhillon I (2001) Co-clustering documents and words using bipartite spectral graph partitioning. In: Proc 7th SIGKDD Int Conf Knowl Discov Data Mining, San Francisco, CA, USA. ACM Press, New York, pp 269-274
    • (2001) Proc 7th SIGKDD Int Conf Knowl Discov Data Mining , pp. 269-274
    • Dhillon, I.1
  • 6
    • 14344258244 scopus 로고    scopus 로고
    • Solving cluster ensemble problems by bipartite graph partitioning
    • Banff, AL, Canada. ACM, New York, pp
    • Fern X, Brodley C (2004) Solving cluster ensemble problems by bipartite graph partitioning. In: Proc 21st Int Conf on Mach Learn, Banff, AL, Canada. ACM, New York, pp 281-288
    • (2004) Proc 21st Int Conf on Mach Learn , pp. 281-288
    • Fern, X.1    Brodley, C.2
  • 7
    • 33845229615 scopus 로고    scopus 로고
    • Data clustering using evidence accumulation
    • Canada. IEEE Computer Society, Washington, pp
    • Fred A, Jain A (2002) Data clustering using evidence accumulation. In: Proc 16th Int Conf Pattern Recognition, Quebec, QB, Canada. IEEE Computer Society, Washington, pp 276-280
    • (2002) Proc 16th Int Conf Pattern Recognition, Quebec, QB , pp. 276-280
    • Fred, A.1    Jain, A.2
  • 8
    • 26844445118 scopus 로고    scopus 로고
    • Subspace clustering for high dimensional categorical data
    • Gan G, Wu J (2004) Subspace clustering for high dimensional categorical data. ACM SIGKDD Explorations Newsletter 6:87-94
    • (2004) ACM SIGKDD Explorations Newsletter , vol.6 , pp. 87-94
    • Gan, G.1    Wu, J.2
  • 9
    • 0032652570 scopus 로고    scopus 로고
    • ROCK: A robust clustering algorithm for categorical attributes
    • Sydney, NSW, Australia. IEEE Computer Society, Washington, pp
    • Guha S, Rastogi R, Shim K (1999) ROCK: A robust clustering algorithm for categorical attributes. In: Proc 15th Int Conf Data Engineering, Sydney, NSW, Australia. IEEE Computer Society, Washington, pp 512-521
    • (1999) Proc 15th Int Conf Data Engineering , pp. 512-521
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 10
    • 13444273324 scopus 로고    scopus 로고
    • A cluster ensemble method for clustering categorical data
    • He Z, Xu X, Deng S (2005) A cluster ensemble method for clustering categorical data. Inf Fusion 6:143-151
    • (2005) Inf Fusion , vol.6 , pp. 143-151
    • He, Z.1    Xu, X.2    Deng, S.3
  • 12
    • 0032139235 scopus 로고    scopus 로고
    • The random subspace method for constructing decision forests
    • Ho TK (1998) The random subspace method for constructing decision forests. IEEE Trans Pattern Analysis Mach Intell 20:832-844
    • (1998) IEEE Trans Pattern Analysis Mach Intell , vol.20 , pp. 832-844
    • Ho, T.K.1
  • 13
    • 4544221782 scopus 로고    scopus 로고
    • Integration of cluster ensemble and text summarization for gene expression analysis
    • Taichung, Taiwan, ROC. IEEE Computer Society, Washington, pp
    • Hu X (2004) Integration of cluster ensemble and text summarization for gene expression analysis. In: Proc 4th IEEE Symp Bioinformatics and Bioengineering, Taichung, Taiwan, ROC. IEEE Computer Society, Washington, pp 251-258
    • (2004) Proc 4th IEEE Symp Bioinformatics and Bioengineering , pp. 251-258
    • Hu, X.1
  • 14
    • 27144536001 scopus 로고    scopus 로고
    • Extensions to the k-means algorithm for clustering large data sets with categorical values
    • Huang Z (1998) Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining Knowl Discov 2:283-304
    • (1998) Data Mining Knowl Discov , vol.2 , pp. 283-304
    • Huang, Z.1
  • 15
    • 42449138578 scopus 로고    scopus 로고
    • Karypis G, Kumar V (1995) Multilevel k-way partitioning scheme for irregular graphs. Technical report, University of Minnesota, Department of Computer Science and Army HPC Research Center
    • Karypis G, Kumar V (1995) Multilevel k-way partitioning scheme for irregular graphs. Technical report, University of Minnesota, Department of Computer Science and Army HPC Research Center
  • 17
    • 0030343231 scopus 로고    scopus 로고
    • An overtraining-resistant stochastic modeling method for pattern recognition
    • Kleinberg EM (1996) An overtraining-resistant stochastic modeling method for pattern recognition. The Annals of Stat 24:2319-2349
    • (1996) The Annals of Stat , vol.24 , pp. 2319-2349
    • Kleinberg, E.M.1
  • 18
    • 15744388753 scopus 로고    scopus 로고
    • Using diversity in cluster ensembles
    • Man and Cybernetics, The Hague, The Netherlands. IEEE Computer Society, Washington, pp
    • Kuncheva L, Hadjitodorov S (2004) Using diversity in cluster ensembles. In: Proc IEEE Int Conf Systems, Man and Cybernetics, The Hague, The Netherlands. IEEE Computer Society, Washington, pp 1214-1219
    • (2004) Proc IEEE Int Conf Systems , pp. 1214-1219
    • Kuncheva, L.1    Hadjitodorov, S.2
  • 19
    • 33749579895 scopus 로고    scopus 로고
    • Generating semantic annotations for frequent patterns with context analysis
    • Philadelphia, PA, USA. ACM Press, New York, pp
    • Mei Q, Xin D, Cheng H, Han J, Zhai C (2006) Generating semantic annotations for frequent patterns with context analysis. In: Proc 12th SIGKDD Int Conf Knowl Discov Data Mining, Philadelphia, PA, USA. ACM Press, New York, pp 337-346
    • (2006) Proc 12th SIGKDD Int Conf Knowl Discov Data Mining , pp. 337-346
    • Mei, Q.1    Xin, D.2    Cheng, H.3    Han, J.4    Zhai, C.5
  • 20
    • 42449120031 scopus 로고    scopus 로고
    • Newman D, Hettich S, Blake C, Merz, C (1998) UCI repository of machine learning databases
    • Newman D, Hettich S, Blake C, Merz, C (1998) UCI repository of machine learning databases
  • 21
    • 84957007471 scopus 로고    scopus 로고
    • Bagging and the random subspace method for redundant feature spaces
    • Kittler J, Roli, F eds, Cambridge, UK. Springer, London, pp
    • Skurichina M, Duin RPW (2001) Bagging and the random subspace method for redundant feature spaces. In: Kittler J, Roli, F (eds) Proc 2nd Int Workshop Multiple Classifier Systems, Cambridge, UK. Springer, London, pp 1-10
    • (2001) Proc 2nd Int Workshop Multiple Classifier Systems , pp. 1-10
    • Skurichina, M.1    Duin, R.P.W.2
  • 23
    • 0036740348 scopus 로고    scopus 로고
    • Squeezer: An efficient algorithm for clustering categorical data
    • Zengyou H, Xiaofei X, Shengchun D (2002) Squeezer: An efficient algorithm for clustering categorical data. J Comput Sci Technol 17:611-624
    • (2002) J Comput Sci Technol , vol.17 , pp. 611-624
    • Zengyou, H.1    Xiaofei, X.2    Shengchun, D.3


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