메뉴 건너뛰기




Volumn 3406, Issue , 2005, Pages 735-745

ESPClust: An effective skew prevention method for model-based document clustering

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATA PROCESSING; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; WORLD WIDE WEB;

EID: 24344500272     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30586-6_82     Document Type: Conference Paper
Times cited : (1)

References (22)
  • 4
    • 3543131400 scopus 로고    scopus 로고
    • Interpreting and extending classical agglomerative clustering algorithms using a model-based approach
    • S. Kamvar, D. Klein, and C. Manning: Interpreting and Extending Classical Agglomerative Clustering Algorithms Using A Model-based Approach. In Proc. 19th Int. Conf. Machine Learning, 2002.
    • (2002) Proc. 19th Int. Conf. Machine Learning
    • Kamvar, S.1    Klein, D.2    Manning, C.3
  • 5
    • 0027453616 scopus 로고
    • Model-based Gaussian and non-Gaussian clustering
    • J. D. Banfield and A. E. Raftery: Model-based Gaussian and non-Gaussian Clustering. Biometrics, 1993.
    • (1993) Biometrics
    • Banfield, J.D.1    Raftery, A.E.2
  • 6
    • 24344453224 scopus 로고    scopus 로고
    • Algorithms for model-based Gaussian hierarchical clustering
    • C. Fraley: Algorithms for Model-based Gaussian Hierarchical Clustering. SIAM Journal on Scientific Computing, 1999.
    • (1999) SIAM Journal on Scientific Computing
    • Fraley, C.1
  • 10
    • 0034824884 scopus 로고    scopus 로고
    • Concept decompositions for large sparse text data using clustering
    • I. S. Dhillon and D. S. Modha: Concept Decompositions for Large Sparse Text Data Using Clustering. Machine Learning, 2001.
    • (2001) Machine Learning
    • Dhillon, I.S.1    Modha, D.S.2
  • 11
    • 0036083217 scopus 로고    scopus 로고
    • Frequency sensitive competitive learning for clustering on high-dimensional hyperspheres
    • A. Banerjee and J. Ghosh: Frequency Sensitive Competitive Learning for Clustering on High-Dimensional Hyperspheres. In Proc. IEEE Int. Joint Conf. Neural Networks, 2002.
    • (2002) Proc. IEEE Int. Joint Conf. Neural Networks
    • Banerjee, A.1    Ghosh, J.2
  • 12
    • 0034826101 scopus 로고    scopus 로고
    • An experimental comparison of model-based clustering methods
    • M. Meila and D. Heckerman: An Experimental Comparison of Model-Based Clustering Methods. Machine Learning, 2001.
    • (2001) Machine Learning
    • Meila, M.1    Heckerman, D.2
  • 14
    • 0005943240 scopus 로고    scopus 로고
    • Constrained k-means clustering
    • Microsoft Research, Redmond, WA
    • P. S. Bradley, K. P. Bennett, and A. Demiriz: Constrained k-means Clustering. Technical Report MSR-TR-2000-65, Microsoft Research, Redmond, WA, 2000.
    • (2000) Technical Report , vol.MSR-TR-2000-65
    • Bradley, P.S.1    Bennett, K.P.2    Demiriz, A.3
  • 16
  • 17
    • 0032131147 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • G. Karypis and V. Kumar: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing, 1998.
    • (1998) SIAM Journal on Scientific Computing
    • Karypis, G.1    Kumar, V.2
  • 20
    • 0002080138 scopus 로고    scopus 로고
    • On the surprising behavior of distance metrics in high dimensional spaces
    • C. C. Aggarwal, A. Hinneburg, D. A. Keim: On the Surprising Behavior of Distance Metrics in High Dimensional Spaces. In Proc. of ICDT, 2001.
    • (2001) Proc. of ICDT
    • Aggarwal, C.C.1    Hinneburg, A.2    Keim, D.A.3
  • 21
    • 24344456279 scopus 로고    scopus 로고
    • http://kdd.ics.uci.edu/databases/20newsgroups/20newsgroups.html
  • 22
    • 24344485887 scopus 로고    scopus 로고
    • http://net.pku.edu.cn/~yanqiong/


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