A dimensionality reduction algorithm and its application for interactive visualization

Journal of Visual Languages & Computing - Tập 18 - Trang 48-70 - 2007
Jiyuan An1, Jeffrey Xu Yu2, Chotirat Ann Ratanamahatana3, Yi-Ping Phoebe Chen4,5
1School of Information Technology, Faculty of Science & Technology, Deakin University, Melbourne, Australia
2Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, China
3Department of Computer Science & Engineering, University of California, Riverside, CA 92521, USA
4Faculty of Science & Technology, Deakin University, Melbourne, Australia
5Australia Research Council Centre in Bioinformatics, Australia

Tài liệu tham khảo

Jain, 1999, Data clustering: a review, ACM Computing Surveys, 31, 264, 10.1145/331499.331504

Jolliffe, 1986

Keim, 2002, Information visualization and visual data mining, IEEE Transactions on Visualization and Computer Graphics, 8, 1, 10.1109/2945.981847

Keim, 1994, Visdb: database exploration using multidimensional visualization, Computer Graphics and Appplications, 6, 40, 10.1109/38.310723

M. Ankerst, M. Breunig, H.-P. Kriegel, R.T. Ng, J. Sander, Ordering points to identify the clustering structure, SIGMOD, 1999, pp. 49–60.

Torgerson, 1958

Roweis, 2000, Nonlinear dimensionality reduction by locally linear embedding, Science, 290, 2323, 10.1126/science.290.5500.2323

Tenenbaum, 2000, A global geometric framework for nonlinear dimensionality reduction, Science, 290, 2319, 10.1126/science.290.5500.2319

C. Faloutsos, K. I. Lin, Fastmap: a fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets, SIGMOD, 1995, pp. 163–174.

G. Lebanon, J. Lafferty, Hyperplane margin classifiers on the multinomial manifold, in: Proceeding of the 21st International Conference on Machine Learning, 2004.

Chen, 2004, VISTA: validating and refining clusters via visualization, Information Visualization, 3, 257, 10.1057/palgrave.ivs.9500076

E. Kandogan, Visualizing multi-dimensional clusters, trends, and outliers using star coordinates, KDD, 2001, pp. 107–116.

T. Feder, D. H. Greene, Optimal algorithms for approximate clustering, Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, 1988, pp. 434–444.

C. Aggarwal, C. Procopiuc, J. Wolf, P. Yu, J. Park, Fast algorithms for projected clustering, SIGMOD, 1999, pp. 61–72.

C. Aggarwal, P. Yu, Finding generalized projected clusters in high dimensional spaces, SIGMOD, 2000, pp. 70–81.

P. S. Bradley, O. L. Mangasarian, k-plane clustering, Mathematical Programming Technical Report 98-08, Department of Computer Science, University of Wisconsin-Madison, August 1998.

T. Zhang, R. Ramakrishnan, M. Livny, Birch:an effective data clustering method for very large databases, in: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996, pp. 103–114.

Thông tin
Thông tin xuất bản

Journal of Visual Languages & Computing

Tập 18

48-70

Thông tin tác giả