Relationship-Based Clustering and Visualization for High-Dimensional Data Mining

References

• Aggarwal C. Re-designing distance functions and distance based applications for high dimensional data. SIGMOD Record (2001) 30:13–18Crossref, Google Scholar
• Ankerst M., Breunig M. M., Kriegel H-P., Sander J. OPTICS: Ordering points to identify the clustering structure. Proc. of the ACM SIGMOD Internat. Conf. on Management of Data (1999) Philadelphia, Pennsylvania:49–60Crossref, Google Scholar
• Banerjee A., Ghosh J. Click stream clustering using weighted longest common subsequences. Workshop on Web Mining: 1st SIAM Conf. on Data Mining (2001) 33–40Google Scholar
• Ben-Dor A., Shamir R., Yakhini Z. Clustering gene expression patterns. J. Comput. Biol. (1999) 6:281–297Crossref, Google Scholar
• Berry M. J. A., Linoff G.Data Mining Techniques for Marketing, Sales and Customer Support (1997) (Wiley, New York) Google Scholar
• Berry M. W., Hendrickson B., Raghavan P., Renegar J., Shub M., Smale S. Sparse matrix reordering schemes for browsing hypertext. Lectures in Applied Mathematics (LAM) (1996) 32(American Mathematical Society, Providence, RI) 99–123Google Scholar
• Boley D., Gini M., Gross R., Han E., Hastings K., Karypis G., Kumar V., Mobasher B., Moore J. Partitioning-based clustering for web document categorization. Decision Support Systems (1999) 27:329–341Crossref, Google Scholar
• Bradley P. S., Fayyad U. M., Reina C. Scaling clustering algorithms to large databases. Proc. of the Fourth Internat. Conf. on Knowledge Discovery and Data Mining (1998) New York:9–15Google Scholar
• Chakaravathy S. V., Ghosh J. Scale based clustering using a radial basis function network. IEEE Trans. on Neural Networks (1996) 2:1250–1261Crossref, Google Scholar
• Chakrabarti K., Mehrotra S. The hybrid tree: An index structure for high dimensional feature spaces. ICDE (1999) 440–447Google Scholar
• Chang K., Ghosh J. A unified model for probabilistic principal surfaces. IEEE Trans. PAMI (2001) 23:22–41Crossref, Google Scholar
• Chen C. Visualising semantic spaces and author co-citation networks in digital libraries. Inform. Processing and Management (1999) 35:401–420Crossref, Google Scholar
• Cutting D. R., Karger D., Pedersen J. O., Tukey J. W. Scatter/gather: A cluster-based approach to browsing large document collections. Proc. of the Fifteenth Annual Intern. ACM SIGIR Conf. on Research and Development in Inform. Retrieval (1992) 318–329Crossref, Google Scholar
• Dhillon I. S., Modha D. S. Concept decompositions for large sparse text data using clustering. Machine Learning (2001) 42:143–175Crossref, Google Scholar
• Dhillon I. S., Modha D. S., Spangler W. S., Weisberg S. Visualizing class structure of multidimensional data. Proc. of the 30th Sympos. on the Interface: Comput. Sci. and Statist. (1998) Minneapolis, MN:13–16May 1998Google Scholar
• Duda R. O., Hart P. E., Stork D. G.Pattern Classification (2001) 2nd ed.(Wiley, New York) Google Scholar
• Eisen M. B., Spellman P. T., Brown P. O., Botstein D. Cluster analysis and display of genome-wide expression patterns. Proc. Natl. Acad. Sci. USA (1998) 95:14863–14868Crossref, Google Scholar
• Faloutsos C., Lin K. Fastmap: A fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets. Proc. ACM SIGMOD Int. Conf. on Management of Data (1995) San Jose, CA:163–174Crossref, Google Scholar
• Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. (1975) 25:619–633Crossref, Google Scholar
• Frakes W., Frakes W., Baeza-Yates R. Stemming algorithms. Information Retrieval: Data Structures and Algorithms (1992) (Prentice Hall, Englewood Cliffs, NJ)131–160Google Scholar
• Friedman J. H., Cherkassky V., Friedman J., Wechsler H. An overview of computational learning and function approximation. From Statistics to Neural Networks, Proc. NATO/ASI Workshop (1994) (Springer Verlag)1–61Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, San Francisco, CA) Google Scholar
• Guha S., Rastogi R., Shim K. Rock: A robust clustering algorithm for categorical attributes. Proc. of the 15th Internat. Conf. on Data Engrg. (1999) 512–521Crossref, Google Scholar
• Gupta G. K., Ghosh J. Detecting seasonal trends and cluster motion visualization for very high dimensional transactional data. Proc. First Siam Conf. on Data Mining, (SDM2001) (2001) 115–129Crossref, Google Scholar
• Gusfield D. R., Irving R. W.The Stable Marriage Problem: Structure and Algorithms (1989) (MIT Press, Cambridge, MA) Google Scholar
• Han E-H., Karypis G., Kumar V., Mobasher B. Hypergraph based clustering in high-dimensional data sets: A summary of results. Data Engrg. Bull. (1998) 21:15–22Google Scholar
• Han J., Kamber M., Tung A. K. H. Spatial clustering methods in data mining: A survey. Geographic Data Mining and Knowledge Discovery (2001) (Taylor & Francis, London, U.K) Crossref, Google Scholar
• Hartigan J. A.Clustering Algorithms (1975) (Wiley, New York) Google Scholar
• Haykin S.Neural Networks: A Comprehensive Foundation (1999) 2nd ed.(Prentice-Hall, Englewood Cliffs, NJ)Google Scholar
• Hendrickson B., Leland R. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. on Sci. Comput. (1995) 16:452–469Crossref, Google Scholar
• Indyk P. A sublinear-time approximation scheme for clustering in metric spaces. Proc. of the 40th Sympos. on Foundations of Comput. Sci. (1999) New York:154–159Crossref, Google Scholar
• Jaakkola T. S., Haussler D. Exploiting generative models in discriminative classifiers. Adv. in Neural Inform. Processing Systems (1999) 11:487–493Google Scholar
• Jain A. K., Dubes R. C.Algorithms for Clustering Data (1988) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Joachims T. Text categorization with support vector machines: Learning with many relevant features. Machine Learning: ECML-98, Tenth Eur. Conf. on Machine Learning (1998) 137–142Crossref, Google Scholar
• Karypis G., Han E-H., Kumar V. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Comput (1999) 32:68–75Crossref, Google Scholar
• Karypis G., Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. of Sci. Comput. (1998) 20:359–392Crossref, Google Scholar
• Kaufmann L., Rousseeuw P.Finding Groups in Data: An Introdution to Cluster Analysis (1990) (John Wiley and Sons, New York) Crossref, Google Scholar
• Keim D. A., Kriegel H-P. Visualization techniques for mining large databases: a comparison (Special Issue on Data Mining). IEEE Trans. on Knowledge and Data Engrg. (1996) 8:932–938Crossref, Google Scholar
• Kernighan B., Lin S. An efficient heuristic procedure for partitioning graphs. Bell Systems Tech. J. (1970) 49:291–307Crossref, Google Scholar
• Kohonen T. The self-organizing map. Proc. IEEE (1990) 78:1464–1480Crossref, Google Scholar
• Lawrence R. D., Almasi G. S., Kotlyar V., Viveros M. S., Duri S. S. Personalization of supermarket product recommendations. Data Mining and Knowledge Discovery (2001) 4:11–32Crossref, Google Scholar
• Mao J., Jain A. K. Artificial neural networks for feature extraction and multivariate data projection. IEEE Trans. on Neural Networks (1995) 6:296–317Crossref, Google Scholar
• McCallum A., Nigam K. A comparison of event models for naive Bayes text classification. In. AAAI/ICML-98 Workshop on Learning for Text Categorization (1998) (AAAI Press, Menlo Park, CA) 41–48Google Scholar
• Meila M., Shi J. Learning segmentation by random walks. Adv. in Neural Inform. Processing Systems (2001) 13:873–879Google Scholar
• Miller G. L., Teng S-H., Thurston W., Vavasis S. A. Separators for sphere packings and nearest neighbor graphs. J. of the ACM (1997) 44:1–29Crossref, Google Scholar
• Murtagh F. A survey of recent advances in hierarchical clustering algorithms. The Comput. J. (1983) 26:354–359Crossref, Google Scholar
• Murtagh F.Multidimensional Clustering Algorithms (1985) (Physica-Verlag, Heidelberg, Germany and Vienna, Austria) Google Scholar
• Pothen A., Simon H., Liou K. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. of Matrix Anal. and Appl. (1990) 11:430–452Crossref, Google Scholar
• Rastogi R., Shim K., Han J. Scalable algorithms for mining large databases. KDD-99 Tutorial Notes (1999) (ACM, New York) Crossref, Google Scholar
• Schloegel K., Karypis G., Kumar V. Parallel multilevel algorithms for multi-constraint graph partitioning. (1999) . Technical Report 99-031, Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MNGoogle Scholar
• Strehl A., Ghosh J. A scalable approach to balanced, high dimensional clustering of market-baskets. Proc. HiPC 2000, Bangalore, LNCS (2000) 1970(Springer, New York) 525–536 http://www.springer.de/comp/Crossref, Google Scholar
• Strehl A., Ghosh J., Mooney R. J. Impact of similarity measures on web-page clustering. Proc. AAAI Workshop on AI for Web Search (AAAI 2000), Austin, TX (2000) (AAAI/MIT Press, Cambridge, MA) 58–64Google Scholar
• Torgerson W. S. Multidimensional scaling, i: theory and method. Psychometrika (1952) 17:401–419Crossref, Google Scholar
• Tufte E. R.The Visual Display of Quantitative Information (1983) (Graphics Press, Cheshire, CT) Google Scholar
• Vapnik V.The Nature of Statistical Learning Theory (1995) (Springer, New York) Crossref, Google Scholar
• Young T. Y., Calvert T. W.Classification, Estimation and Pattern Recognition (1974) (Elsevier, New York) Google Scholar
• Zhang T., Ramakrishnan R., Livny M. BIRCH: A new data clustering algorithm and its applications. Data Mining and Knowledge Discovery (1997) 1:141–182Crossref, Google Scholar
• Zipf G. K. Relative frequency as a determinant of phonetic change. Reprinted from the Harvard Studies in Classical Philiology, XL (1929) Google Scholar