메뉴 건너뛰기




Volumn 5, Issue 2, 2003, Pages 14-25

Using projections to visually cluster high-dimensional data

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SOFTWARE; DATA MINING; INTERPOLATION; LEARNING SYSTEMS; PROBABILITY DENSITY FUNCTION; STATISTICS;

EID: 0037336305     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCISE.2003.1182958     Document Type: Article
Times cited : (15)

References (24)
  • 2
    • 0000835955 scopus 로고    scopus 로고
    • Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering
    • Morgan Kaufmann
    • A. Hinneburg and D.A. Keim, "Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering," Proc. 25th Int'l Conf. Very Large Databases, Morgan Kaufmann, 1999, pp. 506-517.
    • (1999) Proc. 25th Int'l Conf. Very Large Databases , pp. 506-517
    • Hinneburg, A.1    Keim, D.A.2
  • 3
    • 0003136237 scopus 로고
    • Efficient and effective clustering methods for spatial data mining
    • Morgan Kaufmann
    • R.T. Ng and J. Han, "Efficient and Effective Clustering Methods for Spatial Data Mining," Proc. 20th Int'l Conf. Very Large Databases, Morgan Kaufmann, 1994, pp. 144-155.
    • (1994) Proc. 20th Int'l Conf. Very Large Databases , pp. 144-155
    • Ng, R.T.1    Han, J.2
  • 4
    • 0000550189 scopus 로고    scopus 로고
    • A density-based algorithm for discovering clusters in large spatial databases with noise
    • AAAI Press
    • M. Ester et al., "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise," Proc. 2nd Int'l Conf. Knowledge Discovery and Data Mining, AAAI Press, 1996, pp. 226-231.
    • (1996) Proc. 2nd Int'l Conf. Knowledge Discovery and Data Mining , pp. 226-231
    • Ester, M.1
  • 5
    • 0031701179 scopus 로고    scopus 로고
    • A distribution-based clustering algorithm for mining in large spatial databases
    • IEEE CS Press
    • X. Xu et al., "A Distribution-Based Clustering Algorithm for Mining in Large Spatial Databases," Proc. 14th Int'l Conf. Data Eng., IEEE CS Press, 1998, pp. 324-331.
    • (1998) Proc. 14th Int'l Conf. Data Eng. , pp. 324-331
    • Xu, X.1
  • 6
    • 84898817460 scopus 로고    scopus 로고
    • Grid-clustering: An efficient hierarchical clustering method for very large data sets
    • IEEE CS Press
    • E. Schikuta, "Grid-Clustering: An Efficient Hierarchical Clustering Method for Very Large Data Sets," Proc. 13th Int'l Conf. Pattern Recognition, IEEE CS Press, 1996, pp. 101-105.
    • (1996) Proc. 13th Int'l Conf. Pattern Recognition , pp. 101-105
    • Schikuta, E.1
  • 8
    • 84994158589 scopus 로고    scopus 로고
    • Sting: A statistical information grid approach to spatial data mining
    • Morgan Kaufmann
    • W. Wang, I. Yang, and R.R. Muntz, "Sting: A Statistical Information Grid Approach to Spatial Data Mining," Proc. 23rd Int'l Conf. Very Large Databases, Morgan Kaufmann, 1997, pp. 186-195.
    • (1997) Proc. 23rd Int'l Conf. Very Large Databases , pp. 186-195
    • Wang, W.1    Yang, I.2    Muntz, R.R.3
  • 11
    • 0032090765 scopus 로고    scopus 로고
    • Automatic subspace clustering of high dimensional data for data mining applications
    • ACM Press
    • R. Aggrawal et al., "Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications," Proc. ACM SIGMOD Int'l Conf. Management of Data, ACM Press, 1998, pp. 94-105.
    • (1998) Proc. ACM SIGMOD Int'l Conf. Management of Data , pp. 94-105
    • Aggrawal, R.1
  • 13
    • 0039253822 scopus 로고    scopus 로고
    • Finding generalized projected clusters in high dimensional spaces
    • ACM Press
    • C.C. Aggarwal and P.S. Yu, "Finding Generalized Projected Clusters in High Dimensional Spaces," Proc. ACM SIGMOD Int'l Conf. Management of Data, ACM Press, 2000, pp. 70-81.
    • (2000) Proc. ACM SIGMOD Int'l Conf. Management of Data , pp. 70-81
    • Aggarwal, C.C.1    Yu, P.S.2
  • 14
    • 0036361164 scopus 로고    scopus 로고
    • A Monte Carlo algorithm for fast projective clustering
    • ACM Press
    • C.M. Procopiuc et al., "A Monte Carlo Algorithm for Fast Projective Clustering," Proc. ACM SIGMOD Int'l Conf. Management of Data, ACM Press, 2002, pp. 418-427.
    • (2002) Proc. ACM SIGMOD Int'l Conf. Management of Data , pp. 418-427
    • Procopiuc, C.M.1
  • 15
    • 0028699378 scopus 로고
    • XmdvTool: Integrating multiple methods for visualizing multivariate data
    • IEEE CS Press
    • M.O Ward, "XmdvTool: Integrating Multiple Methods for Visualizing Multivariate Data," Proc. Visualization '94, IEEE CS Press, 1994, pp. 326-336.
    • (1994) Proc. Visualization '94 , pp. 326-336
    • Ward, M.O.1
  • 17
    • 0025568642 scopus 로고
    • Parallel coordinates: A tool for visualizing multi-dimensional geometry
    • IEEE CS Press
    • A. Inselberg and B. Dimsdale, "Parallel Coordinates: A Tool for Visualizing Multi-Dimensional Geometry," Proc. Visualization '90, IEEE CS Press, 1990, pp. 361-370.
    • (1990) Proc. Visualization '90 , pp. 361-370
    • Inselberg, A.1    Dimsdale, B.2
  • 18
    • 50549087394 scopus 로고    scopus 로고
    • Visual data mining techniques
    • M. Bertold and D. Hand, eds., Springer
    • D. Keim and M. Ward, "Visual Data Mining Techniques," to be published in Intelligent Data Analysis: An Introduction, M. Bertold and D. Hand, eds., Springer, 2003.
    • (2003) Intelligent Data Analysis: An Introduction
    • Keim, D.1    Ward, M.2
  • 22
    • 27544512071 scopus 로고    scopus 로고
    • A general approach to clustering in large databases with noise
    • Springer
    • A. Hinneburg and D. Keim, "A General Approach to Clustering in Large Databases with Noise," to be published in J. Knowledge and Information Systems, Springer, 2002.
    • (2002) J. Knowledge and Information Systems
    • Hinneburg, A.1    Keim, D.2
  • 23
    • 84976826673 scopus 로고
    • Voronoi diagrams: A survey of a fundamental geometric data structure
    • F. Aurenhammer, "Voronoi Diagrams: A Survey of a Fundamental Geometric Data Structure," ACM Computing Surveys, vol. 23, no. 3, 1991, pp. 345-405.
    • (1991) ACM Computing Surveys , vol.23 , Issue.3 , pp. 345-405
    • Aurenhammer, F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.