메뉴 건너뛰기




Volumn 27, Issue 11, 2005, Pages 1710-1719

Scalable model-based clustering for large databases based on data summarization

Author keywords

Data summary; Expectation maximization; Gaussian mixture model; Maximum penalized likelihood estimate; Scalable clustering

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; DATABASE SYSTEMS; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION; PATTERN RECOGNITION;

EID: 28044431838     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2005.226     Document Type: Article
Times cited : (35)

References (20)
  • 3
    • 0032630575 scopus 로고    scopus 로고
    • "Mining Very Large Databases"
    • Aug
    • V. Ganti, J. Gehrke, and R. Ramakrishnan, "Mining Very Large Databases," Computer, vol. 32, no. 8, pp. 38-45, Aug. 1999.
    • (1999) Computer , vol.32 , Issue.8 , pp. 38-45
    • Ganti, V.1    Gehrke, J.2    Ramakrishnan, R.3
  • 4
    • 21944442892 scopus 로고    scopus 로고
    • "BIRCH: A New Data Clustering Algorithm and Its Applications"
    • T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: A New Data Clustering Algorithm and Its Applications," Data Mining and Knowledge Discovery, vol. 1, no. 2, pp. 141-182, 1997.
    • (1997) Data Mining and Knowledge Discovery , vol.1 , Issue.2 , pp. 141-182
    • Zhang, T.1    Ramakrishnan, R.2    Livny, M.3
  • 6
    • 0035575419 scopus 로고    scopus 로고
    • "Accelerating EM for Large Databases"
    • B. Thiesson, C. Meek, and D. Heckerman, "Accelerating EM for Large Databases," Machine Learning, vol. 45, pp. 279-299, 2001.
    • (2001) Machine Learning , vol.45 , pp. 279-299
    • Thiesson, B.1    Meek, C.2    Heckerman, D.3
  • 7
    • 84899029127 scopus 로고    scopus 로고
    • "Very Fast EM-Based Mixture Model Clustering Using Multiresolution KD-Trees"
    • A. Moore, "Very Fast EM-Based Mixture Model Clustering Using Multiresolution KD-Trees," Advances in Neural Information Processing Systems 11, pp. 543-549, 1999.
    • (1999) Advances in Neural Information Processing Systems , vol.11 , pp. 543-549
    • Moore, A.1
  • 8
    • 0040438433 scopus 로고    scopus 로고
    • "Density Biased Sampling: An Improved Method for Data Mining and Clustering"
    • C. Palmer and C. Faloutsos, "Density Biased Sampling: An Improved Method for Data Mining and Clustering," Proc. 2000 ACM SIGMOD, pp. 82-92, 2000.
    • (2000) Proc. 2000 ACM SIGMOD , pp. 82-92
    • Palmer, C.1    Faloutsos, C.2
  • 9
    • 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, vol. 42, no. 1/ 2, pp. 9-29, 2001.
    • (2001) Machine Learning , vol.42 , Issue.1-2 , pp. 9-29
    • Meila, M.1    Heckerman, D.2
  • 10
    • 13644258738 scopus 로고    scopus 로고
    • "Scalable Model-Based Clustering Algorithms for Large Databases and Their Applications"
    • PhD thesis, The Chinese Univ. of Hong Kong, Hong Kong, Aug. see errata, codes, and data at
    • H.-D. Jin, "Scalable Model-Based Clustering Algorithms for Large Databases and Their Applications," PhD thesis, The Chinese Univ. of Hong Kong, Hong Kong, Aug. 2002, see errata, codes, and data at http://www.cmis.csiro.au/Warren.Jin/PhDthesisWork.htm.
    • (2002)
    • Jin, H.-D.1
  • 11
    • 25444432911 scopus 로고    scopus 로고
    • "Clustering by Committee"
    • PhD dissertation, Univ. of Alberta, Canada
    • P.A. Pantel, "Clustering by Committee," PhD dissertation, Univ. of Alberta, Canada, 2003.
    • (2003)
    • Pantel, P.A.1
  • 14
    • 0002629270 scopus 로고
    • "Maximum-Likelihood from Incomplete Data via the EM Algorithm"
    • A. Dempster, N. Laird, and D. Rubin, "Maximum-Likelihood from Incomplete Data via the EM Algorithm," J. Royal Statistical Soc. Series B, vol. 39, pp. 1-38, 1977.
    • (1977) J. Royal Statistical Soc. Series B , vol.39 , pp. 1-38
    • Dempster, A.1    Laird, N.2    Rubin, D.3
  • 15
    • 13644262819 scopus 로고    scopus 로고
    • "Scalable Model-Based Cluster Analysis Using Clustering Features"
    • May
    • H.-D. Jin, K.-S. Leung, M.-L. Wong, and Z.-B. Xu, "Scalable Model-Based Cluster Analysis Using Clustering Features," Pattern Recognition, vol. 38, no. 5, pp. 637-649, May 2005.
    • (2005) Pattern Recognition , vol.38 , Issue.5 , pp. 637-649
    • Jin, H.-D.1    Leung, K.-S.2    Wong, M.-L.3    Xu, Z.-B.4
  • 17
    • 0002607026 scopus 로고    scopus 로고
    • "Bayesian Classification (AutoClass): Theory and Results"
    • U. Fayyad et al., eds
    • P. Cheeseman and J. Stutz, "Bayesian Classification (AutoClass): Theory and Results," Advances in Knowledge Discovery and Data Mining, U. Fayyad et al., eds., pp. 153-180, 1996.
    • (1996) Advances in Knowledge Discovery and Data Mining , pp. 153-180
    • Cheeseman, P.1    Stutz, J.2
  • 18
    • 0037250978 scopus 로고    scopus 로고
    • "Transformation-Invariant Clustering Using the EM Algorithm"
    • Jan
    • B.J. Frey and N. Jojic, "Transformation-Invariant Clustering Using the EM Algorithm," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 1, pp. 1-17, Jan. 2003.
    • (2003) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.25 , Issue.1 , pp. 1-17
    • Frey, B.J.1    Jojic, N.2
  • 19
    • 0032131702 scopus 로고    scopus 로고
    • "Algorithms for Model-Based Gaussian Hierarchical Clustering"
    • Jan
    • C. Fraley, "Algorithms for Model-Based Gaussian Hierarchical Clustering," SIAM J. Scientific Computing, vol. 20, no. 1, pp. 270-281, Jan. 1999.
    • (1999) SIAM J. Scientific Computing , vol.20 , Issue.1 , pp. 270-281
    • Fraley, C.1
  • 20
    • 0002678075 scopus 로고    scopus 로고
    • "Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions"
    • J. Shanmugasundaram, U. Fayyad, and P. Bradley, "Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions," Proc. Fifth ACM SIGKDD, pp. 223-232, 1999.
    • (1999) Proc. Fifth ACM SIGKDD , pp. 223-232
    • Shanmugasundaram, J.1    Fayyad, U.2    Bradley, P.3


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