Database Reference
In-Depth Information
3.39 Boley, D., Gini, M., Gross, R., Han, E.,Hastings,K.,Karypis,G., Kumar, V.,
Mobasher, B., and Moore, J., Partitioning-based clustering for web document
categorization, Decision Support Systems,27:329-41, 1999.
3.40 Miller, G. L.,Teng,S.-H., Thurston, W.,andVavasis, S.A., Separators for
sphere packings and nearest neighbor graphs, Journal of the ACM,44:1-29,
1997.
3.41 Meila, M., and Shi, J., Learning segmentation by random walks, in Leen,
T. K., Dietterich, T. G., and Tresp, V. (eds.), Advances in Neural Information
Processing Systems 13,pp. 873-9, MIT Press, 2001.
3.42 Dhillon, I., Modha, D., and Spangler, W., Visualizing class structure of multi-
dimensional data, in Weisberg, S. (ed.), Proc. 30th Symposium on the Interface:
Computing Science and Statistics, Minneapolis, MN, May 13-6, 1998, 1998.
3.43 Chang, K., and Ghosh, J., A unified model for probabilistic principal surfaces,
IEEE Trans. PAMI,23(1):22-41, Jan. 2001.
3.44 Torgerson, W. S., Multidimensional scaling, I: Theory and method, Psy-
chometrika,17:401-19, 1952.
3.45 Kohonen, T., The self-organizing map, in New Concepts in Computer Science:
Proc. Symp. in Honour of Jean-Claude Simon,pp. 181-90, Paris, France, 1990,
AFCET.
3.46 Berry, M.W., Hendrickson, B., and Raghavan. P., Sparse matrix reordering
schemes for browsing hypertext, in Lectures in Applied Mathematics (LAM),
vol.32, pp. 99-123. American Mathematical Society, 1996.
3.47 Keim, D.A., and Kriegel, H.-P., Visualization techniques for mining large
databases:Acomparison, IEEE Transactions on Knowledge and Data Engi-
neering,8(6):932-8, 1996, special issue on Data Mining.
Search WWH ::




Custom Search