Generalizing the k-Windows clustering algorithm in metric spaces

Mathematical and Computer Modelling

Volumn 46, Issue 1-2, 2007, Pages 268-277

  Tasoulis, D K ^a   Vrahatis, M N ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Clustering; Data mining; k Windows

Indexed keywords

DATA MINING; DATA REDUCTION; DATA STRUCTURES; DISTANCE MEASUREMENT; NUMERICAL METHODS;

DISTANCE FUNCTIONS; K-WINDOWS; NUMERICAL VALUES;

CLUSTERING ALGORITHMS;

EID: 34247511600     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2006.12.035     Document Type: Article

References (41)

1. Fayyad U.M., Piatetsky-Shapiro G., and Smyth P. Advances in Knowledge Discovery and Data Mining (1996), MIT Press
2. Aldenderfer M.S., and Blashfield R.K. Cluster Analysis. Quantitative Applications in the Social Sciences vol. 44 (1984), SAGE Publications, London
3. Ramasubramanian V., and Paliwal K. Fast k-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding. IEEE Transactions on Signal Processing 40 3 (1992) 518-531
4. R.W. Becker, G.V. Lago, A global optimization algorithm, in: Proceedings of the 8th Allerton Conference on Circuits and Systems Theory, 1970, pp. 3-12
5. Törn A., and Žilinskas A. Global Optimization (1989), Springer-Verlag, Berlin
6. M. Rigou, S. Sirmakessis, A. Tsakalidis, A computational geometry approach to web personalization, in: IEEE International Conference on E-Commerce Technology, CEC'04, San Diego, California, 2004, pp. 377-380
7. Tryon C. Cluster Analysis (1939), Edward Brothers, Ann Arbor, MI
8. Linnaeus C. Clavis Classium in Systemate Phytologorum in Bibliotheca Botanica (1736), Biblioteca Botanica, Amsterdam, The Netherlands
9. Tasoulis D.K., and Vrahatis M.N. Unsupervised clustering on dynamic databases. Pattern Recognition Letters 26 13 (2006) 2116-2127
10. Tasoulis D.K., and Vrahatis M.N. Unsupervised clustering using fractal dimension. International Journal of Biffurcation and Chaos 16 7 (2006) 2073-2079
11. Vrahatis M.N., Boutsinas B., Alevizos P., and Pavlides G. The new k-Windows algorithm for improving the k-means clustering algorithm. Journal of Complexity 18 (2002) 375-391
12. D.K. Tasoulis, V.P. Plagianakos, M.N. Vrahatis, Unsupervised cluster analysis in bioinformatics, in: Fourth European Symposium on "Biomedical Engineering", 2004
13. D.K. Tasoulis, V.P. Plagianakos, M.N. Vrahatis, Unsupervised clustering of bioinformatics data, in: European Symposium on Intelligent Technologies, Hybrid Systems and Their Implementation on Smart Adaptive Systems, Eunite, 2004, pp. 47-53
14. G.D. Magoulas, V.P. Plagianakos, D.K. Tasoulis, M.N. Vrahatis, Tumor detection in colonoscopy using the unsupervised k-Windows clustering algorithm and neural networks, in: Fourth European Symposium on "Biomedical Engineering", 2004
15. Tasoulis D.K., Vladutu L., Plagianakos V.P., Bezerianos A., and Vrahatis M.N. On-line neural network training for automatic ischemia episode detection. In: Rutkowski L., Siekmann J.H., Tadeusiewicz R., and Zadeh L.A. (Eds). Lecture Notes in Computer Science vol. 2070 (2003), Springer-Verlag 1062-1068
16. Pavlidis N.G., Tasoulis D.K., Plagianakos V.P., and Vrahatis M.N. Computational intelligence methods for financial time series modeling. International Journal of Biffurcation and Chaos 16 7 (2006) 2053-2062
17. N.G. Pavlidis, D.K. Tasoulis, M.N. Vrahatis, Financial forecasting through unsupervised clustering and evolutionary trained neural networks, in: Congress on Evolutionary Computation, Canberra, Australia, 2003, pp. 2314-2321
18. Gowda K.C., and Diday E. Symbolic clustering using a new dissimilarity measure. Pattern Recognition 24 6 (1991) 567-578
19. Gower J.C. A general coefficient of similarity and some of its properties. Biometrics 27 (1971) 857-871
20. Huang Z. Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery 2 3 (1998) 283-304
21. Ralambondrainy H. A conceptual version of the k-means algorithm. Pattern Recognition Letters 16 11 (1995) 1147-1157
22. Ng R.T., and Han J. Clarans: A method for clustering objects for spatial data mining. IEEE Transactions on Knowledge and Data Engineering 14 5 (2002) 1003-1016
23. Sander J., Ester M., Kriegel H.-P., and Xu X. Density-based clustering in spatial databases: The algorithm GDBSCAN and its applications. Data Mining and Knowledge Discovery 2 2 (1998) 169-194
24. Ankerst M., Breunig M.M., Kriegel H.-P., and Sander J. Optics: Ordering points to identify the clustering structure. 1999 ACM SIGMOD International Conference on Management of Data (1999), ACM Press 49-60
25. Preparata F., and Shamos M. Computational Geometry (1985), Springer Verlag, New York, Berlin
26. P. Alevizos, An algorithm for orthogonal range search in d ≥ 3 dimensions, in: Proceedings of the 14th European Workshop on Computational Geometry, Barcelona, 1998
27. Bentley J.L., and Maurer H.A. Efficient worst-case data structures for range searching. Acta Informatica 13 (1980) 155-168
28. Chazelle B. Filtering search: A new approach to query-answering. SIAM Journal on Computing 15 3 (1986) 703-724
29. G. Qian, Q. Zhu, Q. Xue, S. Pramanik, The nd-tree: A dynamic indexing technique for multidimensional non-ordered discrete data spaces, in: 29th International Conference on Very Large Data Bases, Berlin, Germany, 2003, pp. 620-631
30. Hjaltason G.R., and Samet H. Index-driven similarity search in metric spaces. ACM Transactions on Database Systems 28 4 (2003) 517-580
31. Bozkaya T., and Ozsoyoglu M. Indexing large metric spaces for similarity search queries. ACM Transactions on Database Systems 24 3 (1999) 361-404
32. Cui B., Ooi B.C., Su J., and Tan K.-L. Indexing high-dimensional data for efficient in-memory similarity search. IEEE Transactions on Knowledge and Data Engineering 17 3 (2005) 333-353
33. Dohnal V., Gennaro C., Savino P., and Zezula P. D-index: Distance searching index for metric data sets. Multimedia Tools and Applications 21 1 (2003) 9-33
34. Navarro G. Searching in metric spaces by spatial approximation. The VLDB Journal 11 1 (2002) 28-46
35. Jain A.K., and Dubes R.C. Algorithms for Clustering Data (1988), Prentice Hall
36. C.L. Blake, C.J. Merz, UCI repository of machine learning databases, 1998
37. Fisher D.H. Knowledge acquisition via incremental conceptual clustering. Machine Learning 2 2 (1987) 139-172
38. Michalski R.S., and Stepp R.E. Automated construction of classifications: Conceptual clustering versus numerical taxonomy. IEEE Transactions on Pattern Analysis and Machine Intelligence 5 4 (1983) 396-409
39. Yianilos N.P. Data structures and algorithms for nearest neighbor search in general metric spaces. ACM-SIAM Symposium on Discrete Algorithms (1993), ACM Press 311-321
40. Boley D. Principal direction divisive partitioning. Data Mining and Knowledge Discovery 2 4 (1998) 325-344
41. D. Zeimpekis, E. Gallopoulos, PDDP(l): Towards a flexing principal direction divisive partitioning clustering algorithms, in: D. Boley, I. Dhillon, J. Ghosh, J. Kogan (Eds.), Proc. IEEE ICDM '03 Workshop on Clustering Large Data Sets, Melbourne, Florida, 2003, pp. 26-35