메뉴 건너뛰기




Volumn , Issue , 2010, Pages 15-19

Scalable recursive top-down hierarchical clustering approach with implicit model selection for textual data sets

Author keywords

Growing k means; Landscape; Model selection; Topic hierarchy; Vector space model

Indexed keywords

K-MEANS; LANDSCAPE; MODEL SELECTION; TOPIC HIERARCHY; VECTOR SPACE MODEL;

EID: 78449268893     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DEXA.2010.25     Document Type: Conference Paper
Times cited : (9)

References (16)
  • 1
    • 7044240682 scopus 로고    scopus 로고
    • Automatic taxonomy generation: Issues and possibilities
    • Springer-Verlag Heidelberg
    • R. Krishnapuram and K. Kummamuru, "Automatic taxonomy generation: Issues and possibilities." in IFSA, vol. 2715. Springer-Verlag Heidelberg, 2003, pp. 52-63.
    • (2003) IFSA , vol.2715 , pp. 52-63
    • Krishnapuram, R.1    Kummamuru, K.2
  • 2
    • 0026961606 scopus 로고
    • Scatter/gather: A cluster-based approach to browsing large document collections
    • ACM Press
    • D. R. Cutting, J. O. Pedersen, D. Karger, and J. W. Tukey, "Scatter/gather: A cluster-based approach to browsing large document collections." in SIGIR. ACM Press, 1992, pp. 318-329.
    • (1992) SIGIR , pp. 318-329
    • Cutting, D.R.1    Pedersen, J.O.2    Karger, D.3    Tukey, J.W.4
  • 3
    • 72449142736 scopus 로고    scopus 로고
    • Dynamicity vs. effectiveness: A user study of a clustering algorithm for scatter/gather
    • ACM Press
    • W. Ke, C. Sugimoto, and J. Mostafa, "Dynamicity vs. effectiveness: A user study of a clustering algorithm for scatter/gather." in SIGIR. ACM Press, 2009, pp. 19-26.
    • (2009) SIGIR , pp. 19-26
    • Ke, W.1    Sugimoto, C.2    Mostafa, J.3
  • 5
    • 70449479368 scopus 로고    scopus 로고
    • Visual knowledge discovery in dynamic enterprise text repositories
    • IEEE Computer Society
    • V. Sabol, W. Kienreich, M. Muhr, W. Klieber, and M. Granitzer, "Visual knowledge discovery in dynamic enterprise text repositories." in IV. IEEE Computer Society, 2009, pp. 361-368.
    • (2009) IV , pp. 361-368
    • Sabol, V.1    Kienreich, W.2    Muhr, M.3    Klieber, W.4    Granitzer, M.5
  • 7
    • 0036864164 scopus 로고    scopus 로고
    • On the optimal partitioning of data with k-means, growing k-means, neural gas, and growing neural gas
    • M. Daszykowski, B. Walczak, and D. L. Massart, "On the optimal partitioning of data with k-means, growing k-means, neural gas, and growing neural gas." Journal of Chemical Information and Computer Sciences, vol. 42, no. 6, pp. 1378-1389, 2002.
    • (2002) Journal of Chemical Information and Computer Sciences , vol.42 , Issue.6 , pp. 1378-1389
    • Daszykowski, M.1    Walczak, B.2    Massart, D.L.3
  • 8
    • 85135470835 scopus 로고
    • A growing neural gas network learns topologies
    • MIT Press
    • B. Fritzke, "A growing neural gas network learns topologies," in NIPS. MIT Press, 1994, pp. 625-632.
    • (1994) NIPS , pp. 625-632
    • Fritzke, B.1
  • 9
    • 0003219068 scopus 로고    scopus 로고
    • Efficient clustering of very large document collections
    • R. Grossman, C. Kamath, and R. Naburu, Eds. Kluwer Academic Publishers
    • I. Dhillon, J. Fan, and Y. Guan, "Efficient clustering of very large document collections." in Data Mining for Scientific and Engineering Applications, R. Grossman, C. Kamath, and R. Naburu, Eds. Kluwer Academic Publishers, 2001.
    • (2001) Data Mining for Scientific and Engineering Applications
    • Dhillon, I.1    Fan, J.2    Guan, Y.3
  • 10
    • 0038156237 scopus 로고    scopus 로고
    • Evaluation of hierarchical clustering algorithms for document datasets
    • Y. Zhao and G. Karypis, "Evaluation of hierarchical clustering algorithms for document datasets." in CIKM, McLean, Virginia, 2002, pp. 515-524.
    • CIKM, McLean, Virginia, 2002 , pp. 515-524
    • Zhao, Y.1    Karypis, G.2
  • 11
    • 33748990773 scopus 로고    scopus 로고
    • Efficient online spherical k-means clustering
    • 5, July-4 Aug.
    • S. Zhong, "Efficient online spherical k-means clustering," IJCNN, vol. 5, pp. 3180-3185 vol. 5, July-4 Aug. 2005.
    • (2005) IJCNN , vol.5 , pp. 3180-3185
    • Zhong, S.1
  • 12
    • 57649143299 scopus 로고    scopus 로고
    • Knee point detection on bayesian information criterion
    • IEEE Computer Society
    • Q. Zhao, M. Xu, and P. Frnti, "Knee point detection on bayesian information criterion." in ICTAI. IEEE Computer Society, 2008, pp. 431-438.
    • (2008) ICTAI , pp. 431-438
    • Zhao, Q.1    Xu, M.2    Frnti, P.3
  • 13
    • 85156245319 scopus 로고    scopus 로고
    • Stability-based model selection
    • MIT Press
    • T. Lange, M. L. Braun, V. Roth, and J. M. Buhmann, "Stability-based model selection." in NIPS. MIT Press, 2002, pp. 617-624.
    • (2002) NIPS , pp. 617-624
    • Lange, T.1    Braun, M.L.2    Roth, V.3    Buhmann, J.M.4
  • 14
    • 72449171584 scopus 로고    scopus 로고
    • Enhancing cluster labeling using wikipedia
    • ACM Press
    • D. Carmel, H. Roitman, and N. Zwerdling, "Enhancing cluster labeling using wikipedia." in SIGIR. ACM Press, 2009, pp. 139-146.
    • (2009) SIGIR , pp. 139-146
    • Carmel, D.1    Roitman, H.2    Zwerdling, N.3
  • 15
    • 84969135721 scopus 로고    scopus 로고
    • K-means++: The advantages of careful seeding
    • N. Bansal, K. Pruhs, and C. Stein, Eds. SIAM
    • D. Arthur and S. Vassilvitskii, "k-means++: the advantages of careful seeding." in SODA, N. Bansal, K. Pruhs, and C. Stein, Eds. SIAM, 2007, pp. 1027-1035.
    • (2007) SODA , pp. 1027-1035
    • Arthur, D.1    Vassilvitskii, S.2
  • 16
    • 71149116739 scopus 로고    scopus 로고
    • A scalable framework for discovering coherent co-clusters in noisy data
    • ACM New York, NY, USA
    • M. Deodhar, G. Gupta, J. Ghosh, H. Cho, and I. Dhillon, "A scalable framework for discovering coherent co-clusters in noisy data." in ICML. ACM New York, NY, USA, 2009, pp. 241-248.
    • (2009) ICML , pp. 241-248
    • Deodhar, M.1    Gupta, G.2    Ghosh, J.3    Cho, H.4    Dhillon, I.5


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