Database Reference
In-Depth Information
3.19 Fiedler, M., A property of eigenvectors of nonnegative symmetric matrices and
its application to graph theory, Czechoslovak Mathematical Journal,25:619-33,
1975.
3.20 Murtagh, F., Multidimensional Clustering Algorithms, Physica-Verlag, Hei-
delberg, Vienna, 1985.
3.21 Eisen, M. B., Spellman, P. T.,Brown, P. O., and Botstein, D., Cluster analysis
and display of genome-wide expression patterns, Proc. Natl. Acad. Sci. USA,
95:14863-8, Dec. 1998.
3.22 Banerjee, A., and Ghosh, J., Clickstream clustering using weighted longest
common subsequences, in Workshop on Web Mining: 1st SIAM Conference on
Data Mining,pp. 33-40, April 2001.
3.23 Cutting, D. R., Karger, D. R., Pedersen, J. O.,andTukey,J. W.,Sca-
ter/gather:Acluster-based approach to browsing large document collection, in
Proc. 15th Intl. ACM SIGIR Conf. on Research and Development in Informa-
tion Retrieval,pp.318-29, 1992.
3.24 Indyk, P., A sublinear-time approximation scheme for clustering in metric
spaces, in Proc. 40th Symposium on Foundations of Computer Science,pp. 154-
9, 1999.
3.25 Banerjee, A., and Ghosh, J., On scaling up balanced clustering algorithms,
in Proc. 2nd SIAM Intl Conf on Data Mining,pp. 333-49, April 2002.
3.26 Zhang, T., Ramakrishnan, R.,andLivny, M.,BIRCH:Anew data cluster-
ing algorithm and its applications, Data Mining and Knowledge Discovery,
1(2):141-82, 1997.
3.27 Ben-Dor, A., Shamir, R., and Yakhini, Z., Clustering gene expression patterns,
Journal of Computational Biology,6(3/4):281-97, 1999.
3.28 Bradley, P. S.,Fayyad,U. M., and Reina, C., Scaling clustering algorithms to
large databases, in Knowledge Discovery and Data Mining,pp. 9-15, 1998.
3.29 Gusfield, D. R., and Irving, R.W., The Stable Marriage Problem: Structure
and Algorithms, MIT Press, Cambridge, MA, 1989.
3.30Schloegel,K.,Karypis,G., and Kumar, V., Parallel multilevel algorithms for
multi-constraint graph partitioning, Technical Report 99-031, Dept. of Com-
puter Sc. and Eng, Univ. of Minnesota, 1999.
3.31 Hartigan, J. A., Clustering Algorithms, Wiley, New York, 1975.
3.32 Chakaravathy, S.V., and Ghosh, J., Scale based clustering using a radial basis
function network, IEEE Transactions on Neural Networks,2(5):1250-61, Sept.
1996.
3.33 Kaufmann, L., and Rousseeuw,P., Finding Groups in Data: An Introdution
to Cluster Analysis, John Wiley and Sons, 1990.
3.34 Rastogi, R. and Shim, K., Scalable algorithms for mining large databases, in
Han, J. (ed.), KDD-99 Tutorial Notes, ACM, 1999.
3.35Friedman,J. H., Anoverview of predictive learning and function approxi-
mation, in Cherkassky, V., Friedman, J. H., and Wechsler, H. (eds.), From
Statistics to Neural Networks, Proc. NATO/ASI Workshop,pp. 1-61, Springer-
Verlag, 1994.
3.36 Aggarwal, C., Re-designing distance functions and distance based applications
for high dimensional data, SIGMOD Record, 30(1), March 2001.
3.37 Chakrabarti, K., and Mehrotra, S., The hybrid tree:An index structure for
high dimensional feature spaces, in Proc. ICDE,pp. 440-7, 1999.
3.38Han,E.-H.,Karypis,G.,Kumar,V., and Mobasher, B., Hypergraph based
clustering in high-dimensional data sets:Asummary of results, Data Engineer-
ing Bulletin, 21(1):15-22, 1998.
Search WWH ::




Custom Search