iVIBRATE: Interactive visualization-based framework for clustering large datasets

ACM Transactions on Information Systems

Volumn 24, Issue 2, 2006, Pages 245-294

  Chen, Keke ^a,b   Liu, Ling ^a,b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Algorithms; Design; Human Factors; Reliability

Indexed keywords

CLUSTERING; HUMAN FACTOR; INTERACTIVE VISUALIZATION; SENSING TECHNOLOGY;

ALGORITHMS; COMPUTER AIDED DESIGN; INFORMATION ANALYSIS; LARGE SCALE SYSTEMS; NUMERICAL METHODS; PROBLEM SOLVING; RELIABILITY;

TELECOMMUNICATION NETWORKS;

EID: 33745475658     PISSN: 10468188     EISSN: 10468188     Source Type: Journal    
DOI: 10.1145/1148020.1148024     Document Type: Article

References (58)

1. ANKERST, M., BREUNIG, M. M., KRIEGEL, H.-P., AND SANDER, J. 1999. OPTICS: Ordering points to identify the clustering structure. In Proceedings of the ACM SIGMOD Conference, 49-60.
2. ASIMOV, D. 1985. The grand tour: A tool for viewing multidimensional. SIAM J. Sci. Statistical Comput. 6, 1, 128-143.
3. BAEZA-YATES, R. AND RIBEIRO-NETO, B. 1999. Modern Information Retrieval. Addison Wesley, New York.
4. BARBARÁ, D., DUMOUCHEL, W., FALOUTSOS, C., HAAS, P. J., HELLERSTEIN, J. M., IOANNIDIS, Y. E., JAGADISH, H. V., JOHNSON, T., NG, R. T., POOSALA, V., ROSS, K. A., AND SEVCIK, K. C. 1997. The New Jersey data reduction report. IEEE Data Eng. Bull. 20, 4, 3-45.
5. BRADLEY, P. S., FAYYAD, U. M., AND REINA, C. 1998. Scaling clustering algorithms to large databases. In Proceedings of the ACM SIGKDD Conference, 9-15.
6. CHEN, K. AND LIU, L. 2004a. Clustermap: Labeling clusters in large datasets via visualization. In Proceedings of the ACM Conference on Information and Knowledge Management (CIKM), 285-293.
7. CHEN, K. AND LIU, L. 2004b. VISTA: Validating and refining clusters via visualization. Inf. Visualization 3, 4, 257-270.
8. CHEN, K. AND LIU, L. 2005. The "best k" for entropy-based categorical clustering. In Proceedings of the International Conference on Scientific and Statistical Database Management (SSDBM), 253-262.
9. CONOVER, W. 1998. Practical Nonparametric Statistics. John Wiley and Sons, New York.
10. COOK, D., BUJA, A., CABRERA, J., AND HURLEY, C. 1995. Grand tour and projection pursuit. J. Comput. Graphical Statistics 23, 155-172.
11. COX, T. F. AND COX, M. A. A. 2001. Multidimensional Scaling. Chapman and Hall, London, UK.
12. CUTTING, D. R., KARGER, D. R., PEDERSEN, J. O., AND TUKEY, J. W. 1992. Scater/Gather: A cluster-based approach to browsing large document collections. In Proceedings of the ACM SIGIR Conference, 318-329.
13. DHILLON, I. S., MODHA, D. S., AND SPANGLER, W. S. 1998. Visualizing class structure of multidimensional data. In Proceedings of the 30th Symposium on the Interface: Computing Science and Statistics 30, 488-493.
14. DUBES, R. C. AND JAIN, A. K. 1979. Validity studies in clustering methodologies. Pattern Recogn. Lett., 235-254.
15. ESTER, M., KRIEGEL, H.-P., SANDER, J., AND XU, X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, 226-231.
16. FALOUTSOS, C. AND LIN, K.-I. D. 1995. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proceedings of the ACM SIGMOD Conference, 163-174.
17. FREIDMAN, J. H., BENTLEY, J. L., AND FINKEL, R. A. 1977. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3, 3, 209-226.
18. GALLIER, J. 2000. Geometric Methods and Applications for Computer Science and Engineering. Springer-Verlag, New York.
19. GRAY, J. 2000. What next? A few remaining problems in information technlogy. In Proceedings of the Sigmod Conference 1999, ACM Turing Award Lecture (video). ACM SIGMOD Digital Symposium. Collection 2, 2.
20. GUHA, S., RASTOGI, R., AND SHIM, K. 1998. CURE: An efficient clustering algorithm for large databases. In Proceedings of the ACM SIGMOD Conference, 73-84.
21. GUHA, S., RASTOGI, R., AND SHIM, K. 2000. ROCK: A robust clustering algorithm for categorical attributes. Inf. Syst. 25, 5, 345-366.
22. HALKIDI, M., BATISTAKIS, Y., AND VAZIRGIANNIS, M. 2002. Cluster validity methods: Part I and II. SIGMOD Record 31, 2, 40-45.
23. HINNEBURG, A. AND KEIM, D. A. 1998. An efficient approach to clustering in large multimedia databases with noise. In Proceedings of the ACM SIGKDD Conference, 58-65.
24. HINNEBURG, A., KEIM, D. A., AND WAWRYNIUK, M. 1999. Visual mining of high-dimensional data. IEEE Comput. Graphics Appl., 1-8.
25. HOFFMAN, P., GRINSTEIN, G., MARX, K., GROSSE, I., AND STANLEY, E. 1997. DNA visual and analytic data mining. IEEE Visualization, 437-442.
26. INSELBERG, A. 1997. Multidimensional detective. In Proceedings of the IEEE Symposium on Information Visualization, 100-107.
27. JAIN, A. K. AND DUBES, R. C. 1988. Algorithms for Clustering Data. Prentice Hall, New York.
28. JAIN, A. K. AND DUBES, R. C. 1999. Data clustering: A review. ACM Comput. Surv. 31, 264-323.
29. KANDOGAN, E. 2001. Visualizing multidimensional clusters, trends, and outliers using star coordinates. In Proceedings of the ACM SIGKDD Conference, 107-116.
30. KARYPIS, G., HAN, E.-H. S., AND KUMAR, V. 1999. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Comput. 32, 8, 68-75.
31. KEIM, D. 2001. Visual exploration of large data sets. ACM Commun. 44, 8, 38-44.
32. LARKIN, J. AND SIMON, H. 1987. Why a diagram is (sometimes) worth ten thousand words. Cognitive Sci. 11, 65-99.
33. LEBLANC, J., WARD, M. O., AND WITTELS, N. 1990. Exploring n-dimensional databases. In Proceedings of the IEEE Conference on Visualization, 230-239.
34. LI, C., CHANO, E., GARCIA-MOLINA, H., AND WIEDERHOLD, G. 2002. Clustering for approximate similarity search in high-dimensional spaces. IEEE Trans. Knowledge Data Eng. 14, 4, 792-808.
35. LITTLEFIELD, R. J. 1983. Using the GLYPH concept to create user-definable display formats. National Comput. Graphics Association, 697-706.
36. LIU, H. AND MOTODA, H. 1998. Feature Extraction, Construction and Selection: A Data Mining Perspective. Kluwer Academic, Boston, MA.
37. MEEK, C., THIESSON, B., AND HECKERMAN, D. 2002. The learning-curve sampling method applied to model-based clustering. J. Mach. Learn. Research 2, 397-418.
38. NEWMAN, M. E. 2003. The structure and function of complex networks. SIAM Rev., 167-256.
39. PALMER, C. AND FALOUTSOS, C. 2000. Density biased sampling: An improved method for data mining and clustering. In Proceedings of the ACM SIGMOD Conference, 82-92.
40. RAMASWAMY, L., GEDIK, B., AND LIU, L. Sept. 2005. A distributed approach to node clustering in decentralized peer-to-peer networks. IEEE Trans. Parallel Distrib. Syst. 16, 9, 1-16.
41. ROSS, S. M. 2000. Introduction to Probability Models. Academic Press, San Diego, CA.
42. ROUSSINOV, D., TOLLE, K., RAMSEY, M., AND CHEN, H. 1999. Interactive Internet search through automatic clustering: An empirical study. In Proceedings of the ACM SIGIR Conference, 289-290.
43. SCHUTZE, H. AND SILVERSTEIN, C. 1997. Projections for efficient document clustering. In Proceedings of the ACM SIGIR Conference, 74-81.
44. SEO, J. AND SHNEIDERMAN, B. 2002. Interactively exploring hierarchical clustering results. IEEE Comput. 35, 7, 80-86.
45. SHARMA, S. 1995. Applied Multivariate Techniques. Wiley and Sons, New York.
46. SHEKHOLESLAMI, G., CHATTERJEE, S., AND ZHANG, A. 1998. Wavecluster: A multiresolution clustering approach for very large spatial databases. In Proceedings of the Very Large Databases Conference (VLDB), 428-439.
47. SHNEIDERMAN, B. 2002. Inventing discovery tools: Combining information visualization with data mining. Inf. Visualization 1, 5-12.
48. SILVERSTEIN, C. AND PEDERSEN, J. O. 1997. Almost-Constant-Time clustering of arbitrary corpus subsets. In Proceedings of the ACM SIGIR Conference, 60-66.
49. SONKA, M., HLAVAC, V., AND BOYLE, R. 1999. Image Processing, Analysis and Machine Vision. Brooks/Cole Publishing, Pacific Grove, CA.
50. VITTER, J. S. 1985. Random sampling with a reservoir. ACM Trans. Math. Softw. 11, 1, 37-57.
51. WARD, M. 1994. Xmdvtool: Integrating multiple methods for visualizing multivariate data. IEEE Visualization, 326-333.
52. WILLETT, P. 1988. Recent trends in hierarchic document clustering: A critical review. Inf. Process. Manage. 24, 5, 577-597.
53. XU, X., ESTER, M., KRIEGEL, H.-P., AND SANDER, J. 1998. A distribution-based clustering algorithm for mining in large spatial databases. In Proceedings of the IEEE International Conference on Data Engineering (ICDE), 324-331.
54. YANG, J., WARD, M. O., AND RUNDENSTEINER, E. A. 2002. Interactive hierarchical displays: A general framework for visualization and exploration of large multivariate datasets. Comput. Graphics J. 27, 265-283.
55. YANG, L. 2000. Interactive exploration of very large relational datasets through 3D dynamic projections. In Proceedings of the ACM SIGKDD Conference, 236-243.
56. YANG, Y. AND PEDERSEN, J. O. 1997. A comparative study on feature selection in text categorization. In Proceedings of the ICML-97, 14th International Conference on Machine Learning, 412-420.
57. ZAMIR, O. AND ETZIONI, O. 1998. Web document clustering: A feasibility demonstration. In Proceedings of the ACM SIGIR Conference, 46-54.
58. ZHANG, T., RAMAKRISHNAN, R., AND LIVNY., M. 1996. BIRCH: An efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD Conference, 103-114.