Initialization of Iterative Refinement Clustering Algorithms

Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, KDD 1998

Volumn , Issue , 1998, Pages

  Fayyad, Usama ^a   Reina, Cory ^a   Bradley, P S ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA MINING; ITERATIVE METHODS; MAXIMUM PRINCIPLE;

CONDITION; CONTINUOUS DATA; DISCRETE DATA; EXPECTATION MAXIMIZATION; INITIAL CONDITIONS; INITIAL POINT; ITERATIVE REFINEMENT; K-MEANS; LOCAL MINIMUMS; RUNTIMES;

CLUSTERING ALGORITHMS;

EID: 85043349209     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. [BR93] J. Banfield and A. Raftery, “Model-based Gaussian and non-Gaussian Clustering”, Biometrics, vol. 49: 803-821, pp. 15-34, 1993.
2. [B95] C. Bishop, 1995. Neural Networks for Pattern Recognition. Oxford University Press.
3. [BMS97] P. S. Bradley, O. L. Mangasarian, and W. N. Street. 1997. "Clustering via Concave Minimization", in Advances in Neural Information Processing Systems 9, M. C. Mozer, M. I. Jordan, and T. Petsche (Eds.) pp 368-374, MIT Press, 1997.
4. th International Conf. on Knowledge Discovery and Data Mining (KDD-98). AAAI Press, 1998.
5. [CS96] P. Cheeseman and J. Stutz, “Bayesian Classification (AutoClass): Theory and Results”, in [FPSU96], pp. 153-180. MIT Press, 1996.
6. [DLR77] A.P. Dempster, N.M. Laird, and D.B. Rubin, “Maximum Likelihood from Incomplete Data via the EM algorithm”. Journal of the Royal Statistical Society, Series B, 39(1): 1-38, 1977.
7. [DH73] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. New York: John Wiley and Sons. 1973
8. [FHS96] U. Fayyad, D. Haussler, and P. Stolorz. “Mining Science Data.” Communications of the ACM 39(11), 1996.
9. th International Conf. Machine Learning. Morgan Kaufmann 1998.
10. [F87] D. Fisher. “Knowledge Acquisition via Incremental Conceptual Clustering”. Machine Learning, 2:139-172, 1987.
11. [F90] K. Fukunaga, Introduction to Statistical Pattern Recognition, San Diego, CA: Academic Press, 1990.
12. [J62] Jones, “A note on sampling from a tape file”. Communications of the ACM, vol 5, 1962.
13. [KR89] L. Kaufman and P. Rousseeuw, 1989. Finding Groups in Data, New York: John Wiley and Sons.
14. [MH98] M. Meila and D. Heckerman, 1998. "An experimental comparison of several clustering methods", Microsoft Research Technical Report MSR-TR-98-06, Redmond, WA.
15. [R92] E. Rasmussen, “Clustering Algorithms”, in Information Retrieval Data Structures and Algorithms, Frakes and Baeza-Yates (Eds.), pp. 419-442, New Jersey: Prentice Hall, 1992.
16. [S92] D. W. Scott, Multivariate Density Estimation, New York: Wiley. 1992
17. [SI84] S. Z. Selim and M. A. Ismail, "K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality." IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. PAMI-6, No. 1, 1984.
18. [S86] B.W. Silverman, Density Estimation for Statistics and Data Analysis, London: Chapman & Hall, 1986.
19. [TMCH97] B. Thiesson, C. Meek, D. Chickering, and D. Heckerman, 1997. "Learning Mixtures of Bayesian Networks", Microsoft Research Technical Report TR-97-30, Redmond, WA.