Database Reference
In-Depth Information
[14] P. S. Bradley, K. P. Bennett, and A. Demiriz. Constrained k-means
clustering. Technical report, Microsoft Research, May 2000.
[15] M. Collins. The EM algorithm. In fulfillment of Written Preliminary
Exam II requirement, September 1997.
[16] T. M. Cover and J. A. Thomas. Elements of Information Theory . Wiley-
Interscience, 1991.
[17] I. S. Dhillon, J. Fan, and Y. Guan. Ecient clustering of very large doc-
ument collections. In V. Kumar R. Grossman, C. Kamath and R. Nam-
buru, editors, Data Mining for Scientific and Engineering Applications .
Kluwer Academic Publishers, 2001.
[18] I. S. Dhillon, Y. Guan, and J. Kogan. Iterative clustering of high di-
mensional text data augmented by local search. In Proceedings of The
2002 IEEE International Conference on Data Mining , 2002.
[19] I. S. Dhillon, E. M. Marcotte, and U. Roshan. Diametrical clustering for
identifying anti-correlated gene clusters. Bioinformatics , 19(13):1612-
1619, 2003.
[20] I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse
text data using clustering. Machine Learning , 42(1):143-175, 2001.
[21] I. S. Dhillon and S. Sra. Modeling data using directional distributions.
Technical Report TR-03-06, Department of Computer Sciences, Univer-
sity of Texas at Austin, Austin, TX, 2003.
[22] B. E. Dom. An information-theoretic external cluster-validity measure.
Technical Report RJ 10219, IBM Research Report, 2001.
[23] C. Elkan. Clustering documents with an exponential-family approxima-
tion of the Dirichlet compund multinomial distribution. In Proceedings
of the 23rd International Conference on Machine Learning , 2006.
[24] N. I. Fisher. Statistical Analysis of Circular Data . Cambridge University
Press, 1996.
[25] T. Jaakkola and D. Haussler. Exploiting generative models in discrimi-
native classifiers. In M. S. Kearns, S. A. Solla, and D. D. Cohn, editors,
Advances in Neural Information Processing Systems , volume 11, pages
487-493. MIT Press, 1999.
[26] A. K. Jain and R. C. Dubes. Algorithms for Clustering Data .Prentice
Hall, New Jersey, 1988.
[27] R. Kannan, S. Vempala, and A. Vetta. On clusterings—good, bad and
spectral. In 41st Annual IEEE Symposium Foundations of Computer
Science , pages 367-377, 2000.
Search WWH ::




Custom Search