The relevant-set correlation model for data clustering

Society for Industrial and Applied Mathematics - 8th SIAM International Conference on Data Mining 2008, Proceedings in Applied Mathematics 130

Volumn 2, Issue , 2008, Pages 775-786

  Houle, Michael E ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

BETWEEN CLUSTERS; CLUSTER SETS; DATA CLUSTERING; DEGREE OF ASSOCIATION; NEIGHBORHOOD SIZE; SET CORRELATION; SIGNIFICANCE MEASURES; STATISTICAL SIGNIFICANCE;

DATA MINING;

EID: 52649106960     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972788.70     Document Type: Conference Paper

References (16)

1. R. Agrawal and R. Srikant, Fast algorithms for minng association rules, Proc. 20th VLDB Conf., Santiago, Chile, 1994, pp. 487-499.
2. N. Boujemaa, J. Fauqueur, M. Ferecatu, F. Fleuret, V. Gouet, B. Le Saux and H. Sahbi, IKONA: Interactive Generic and Specific Image Retrieval, Proc. Intern. Workshop on Multimedia Content-Based Indexing and Retrieval (MMCBIR), Rocquencourt, France, 2001.
3. E. Chavez, G. Navarro, R. Baeza-Yates and J. L. Marroquin, Searching in metric spaces, ACM Comput. Surv., 33 (2001), pp. 273-321.
4. R. O. Duda, P. E. Hart and D. G. Stork, Pattern Classification, Wiley, New York, NY, USA, 2001.
5. L. Ertöz, M. Steinbach and V. Kumar, Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data, Proc. 3rd SIAM Intern. Conf. on Data Mining (SDM), San Francisco, CA, USA, 2003.
6. M. Ester, H.-P. Kriegel, J. Sander and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, Proc. 2nd Int. Conf. on Knowl. Discovery and Data Mining (KDD), Portland, OR, USA, 1996, pp. 226-231.
7. J. M. Geusebroek, G. J. Burghouts and A. W. M. Smeulders, The Amsterdam library of object images, Int. J. Comput. Vision 61 (2005), pp. 103-112.
8. S. Guha, R. Rastogi and K. Shim, CURE: an efficient cluster algorithm for large databases, Proc. ACM SIGMOD Conf. on Management of Data, New York, USA, 1998, pp. 73-84.
9. S. Guha, R. Rastogi and K. Shim, ROCK: a robust clustering algorithm for categorical attributes, Inform. Sys. 25 (2000), pp. 345-366.
10. J. Han and M. Kamber, Data Mining: Concepts and Techniques (2nd ed.), Morgan Kaufmann, San Francisco, CA, USA, 2006.
11. M. E. Houle, Navigating massive data sets via local clustering, Proc. 9th ACM SIGKDD Conf. on Knowl. Disc, and Data Mining (KDD), Washington DC, USA, 2003, pp. 547-552.
12. M. E. Houle and J. Sakuma, Fast approximate similarity search in extremely high-dimensional data sets, Proc. 21st IEEE Int. Conf. on Data Eng. (ICDE), Tokyo, Japan, 2005, pp. 619-630.
13. R. A. Jaivis and E. A. Patrick, Clustering using a similarity measure based on shared nearest neighbors, IEEE Trans. Comput. C-22 (1973), pp. 1025-1034.
14. L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: an Introduction to Cluster Analysis, John Wiley & Sons, New York, USA, 1990.
15. J. McQueen, Some methods for classification and analysis of multivariate observations, Proc. 5th Berkeley Symp. on Math. Statistics and Probability, 1967, pp. 281-297.
16. T. Zhang, R. Ramakrishnan and M. Livny, BIRCH: an efficient data clustering method for very large databases, Proc. ACM SIGMOD Conf. on Management of Data, Montréal, Canada, 1996, pp. 103-114.