Common Clustering Algorithms

Comprehensive Chemometrics

Volumn 2, Issue , 2009, Pages 577-618

  Lee, I ^a   Yang, J ^b  

^a JAMES COOK UNIVERSITY   (Australia)

^b UNIVERSITY OF WESTERN SYDNEY   (Australia)

Author keywords

Agglomerative clustering; Clustering; Constrained clustering; Divisive clustering; Hierarchical clustering; Hybrid clustering; K Means clustering; K medoid clustering; Partitioning clustering; Unsupervised learning

Indexed keywords

EID: 84882534399     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-044452701-1.00064-8     Document Type: Chapter

References (141)

1. Aldenderfer M.S., Blashfield R.K. Cluster Analysis 1984, Sage Publications, Beverly Hills, CA.
2. Grabmeier J., Rudolph A. Techniques of Cluster Algorithms in Data Mining. Data Min. Knowledge Discov. 2002, 6:303-360.
3. Jain A.K., Dubes R.C. Algorithms for Clustering Data 1988, Prentice-Hall, New York.
4. Jain A.K., Murty M.N., Flynn P.J. Data Clustering: A Review. ACM Comput. Surv. 1999, 31(3):264-323.
5. Kaufman L., Rousseuw P.J. Finding Groups in Data: An Introduction to Cluster Analysis 1990, John Wiley & Sons, New York.
6. Höppner F., Klawonn F., Kruse R., Runkler T. Fuzzy Cluster Analysis 1999, John Wiley & Sons, New York.
7. Cherkassky V., Muller F. Learning from Data - Concept, Theory and Methods 1998, John Wiley & Sons, New York.
8. Bezdek J.C. Pattern Recognition with Fuzzy Objective Function Algorithms 1981, Plenum Press, New York.
9. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979, W. H. Freeman and Company, New York.
10. Estivill-Castro V. Why So Many Clustering Algorithms: A Position Paper. SIGKDD Explor. 2002, 4(1):65-75.
11. Ester M., Kriegel H.P., Sander J., Wimmer M., Xu X. Incremental Clustering for Mining for a Data Warehousing Environment. Proceedings of the 24th International Conference on Very Large Data Bases 1998, 323-333. AAAI Press, New York. A. Gupta, O. Shmueli, J. Widom (Eds.).
12. Sander J., Ester M., Kriegel H.P., Wimmer M., Xu X. Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications. Data Min. Knowledge Discov. 1998, 2(2):169-194.
13. Sander, J. Generalized Density-Based Clustering for Spatial Data Mining. Ph.D. thesis, University of Munich, Germany, 1998.
14. Wang W., Yang J., Muntz R.R. An Approach to Active Spatial Data Mining Based on Statistical Information. IEEE Trans. Knowledge Data Eng. 2000, 12(5):715-728.
15. Rao M. Cluster Analysis and Mathematical Programming. J. Am. Stat. Assoc. 1971, 66:622-626.
16. Rosing K., ReVelle C. Optimal Clustering. Environ. Plan. A 1986, 18:1463-1476.
17. Vinod H. Integer Programming and the Theory of Grouping. J. Am. Stat. Assoc. 1969, 64:506-517.
18. Berry M.J.A., Linoff G.S. Data Mining Techniques for Marketing, Sales and Customer Support 1997, John Wiley & Sons, New York.
19. Fasulo, D. An Analysis of Recent Work on Clustering Algorithms; Technical Report UW-CSE01-03-02, Department of Computer Science & Software Engineering, University of Washington, 1999 [Available at ]. http://www.cs.washington.edu.
20. MacQueen J. Some Methods for Classification and Analysis of Multivariate Observations. 5th Berkeley Symposium on Mathematical Statistics and Probability 1967, Vol. 1:281-297. L. Le Cam, J. Neyman (Eds.).
21. Huang Z. Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values. Data Min. Knowledge Discov. 1998, 2(3):2283-2304.
22. Gupta S.K., Rao K.S., Bhatnagar V. K-Means Clustering Algorithm for Categorical Attributes. Lecture Notes Comput. Sci. 1999, Vol. 1676:203-208. Springer, Berlin. M. Mohania, A.M. Tjoa (Eds.).
23. Hitchinson A. Algorithmic Learning 1994, Clarendon Press, Oxford, UK, (Graduate Texts in Computer Science).
24. Jambu M., Leebaux M.-O. Cluster Analysis and Data Analysis 1983, North-Holland, Amsterdam, The Netherlands.
25. Francis R.L. Facility Layout and Location 1974, Prentice-Hall, Upper Saddle River, NJ.
26. Murray A.T., Estivill-Castro V. Cluster Discovery Techniques for Exploratory Spatial Data Analysis. Int. J. Geogr. Inf. Sci. 1998, 12(5):431-443.
27. Haining R.P. Spatial Data Analysis in the Social and Environmental Sciences 1990, Cambridge University Press, New York.
28. Duda R.O., Hart P.E. Pattern Classification and Scene Analysis 1973, John Wiley & Sons, New York.
29. Wishart D. Supplement, CLUSTAN User Manual 1982, Prigram Library Unit, Edinburgh University, Edinburgh, UK. 3rd ed.
30. Huang Z. Clustering Large Data Sets with Mixed Numeric and Categorical Values. Proceedings of the First Asia-Pacific Conference on Knowledge Discovery and Data Mining 1997, World Scientific, Singapore.
31. Schalkoff R.J. Pattern Recognition - Statistical, Structural and Neural Approaches 1992, John Wiley & Sons, New York.
32. Bradley P.S., Mangasarian O.L., Street W.N. Clustering via Concave Minimization. Adv. Neural Inf. Process. Syst. 1997, 9:368-374.
33. Fraley C., Raftery A.E. How Many Clusters? Which Clustering Method? Answers via Model-Based Cluster Analysis. Comp. J. 1998, 41(8):578-588.
34. Bradley P.S., Fayyad U., Reina C. Scaling Clustering Algorithms to Large Databases. Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining 1998, 9-15. AAAI Press, New York. R. Agrawal, P. Stolorz (Eds.).
35. Fayyad U., Reina C., Bradley P.S. Initialization of Iterative Refinement Clustering Algorithms. Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining 1998, 194-198. AAAI Press, New York. R. Agrawal, P. Stolorz (Eds.).
36. Dempster A.P., Laird N.M., Rubin D.B. Maximum Likelihood from Incomplete Data via the EM Algorithm. J. R. Stat. Soc. Ser. B 1977, 39:1-38.
37. Banfield J.D., Raftery A.E. Model-Based Gaussian and Non-Gaussian Clustering. Biometrics 1993, 49:803-821.
38. Celeux G., Govaret G. Gaussian Parsimonious Clustering Models. Pattern Recognit. 1995, 28(5):781-793.
39. Tanner M.A. Tools for Statistical Inference 1993, Springer, New York.
40. Arnold S.F. Gibbs Sampling. Handbook of Statistics 9 1993, 599-625. North-Holland, Amsterdam, The Netherlands. C.R. Rao (Ed.).
41. Gelman A., Carlin J.B., Stern H.S., Rubin D.B. Bayesian Data Analysis 1995, Chapman & Hall, London.
42. Smith A.F.M., Roberts G.O. Bayesian Computation via the Gibbs Sampler and Related Markov Chain Monte Carlo Methods. J. R. Stat. Soc. Ser. B 1993, 55(1):2-23.
43. Dowe D., Baxter R.A., Oliver J.J., Wallace C. Point Estimation Using the Kullback-Leibler Loss Function and MML. Lecture Notes Artif. Intell. 1998, Vol. 1394:87-95. Springer, Berlin. X. Wu, R. Kotagiri, K.K. Korb (Eds.).
44. Wallace C.S., Freeman P.R. Estimation and Inference by Compact Coding. J. R. Stat. Soc. Ser. B 1987, 49(3):240-265.
45. Wallace C.S., Boulton D.M. An Information Measure for Classification. Comp. J. 1968, 11:185-195.
46. Rissanen J. Stochastic Complexity. J. R. Stat. Soc. Ser. B 1987, 49(3):223-239.
47. Wallace C.S., Dowe D.L. Minimum Message Length and Kolmogorov Complexity. Comp. J. 1999, 42(4):270-283.
48. Massa S., Paolucci M., Puliafito P.P. A New Modelling Technique Based on Markov Chains to Mine Behavioral Patterns in Event Based Time Series. Lecture Notes Comput. Sci. 1999, Vol. 1676:331-342. Springer, Berlin. M. Mohania, A.M. Tjoa (Eds.).
49. Vazirgiannis M., Halkidi M., Batistakis Y. On Clustering Validation Techniques. Intell. Inf. Syst. J. Scientific and Statistical Database Management (Special Issue) 2001.
50. Zhang B., Hsu M., Dayal U. K-Harmonic Means - A Spatial Clustering Algorithm with Boosting. Lect. Notes Artif. Intell. 2007, Vol. 2007:31-45. Springer, Berlin, ISBN:3-540-41773-7. J. Roddick, K. Hornsby (Eds.).
51. Rousseeuw P.J., Leroy A.M. Robust Regression and Outlier Detection 1987, John Wiley & Sons, New York.
52. Kuhn H.W. On a Pair of Dual Non-Linear Problems. Nonlinear Programming 1967, 38-54. John Wiley & Sons, New York. J. Abadie, S. Vajda (Eds.).
53. Bajaj C. Proving Geometric Algorithm Non-Solvability: An Application of Factoring Polynomials. J. Symb. Comput. 1986, 2:99-102.
54. Arora S., Raghavan P., Rao S. Approximation Schemes for Euclidean k-Medians and Related Problems. Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (STOC) 1998, ACM Press, Dallas, Texas.
55. Kuhn H.W., Kuenne R.E. An Efficient Algorithm for the Numerical Solution of the Generalized Weber Problem in Spatial Economics. J. Reg. Sci. 1962, 4(2):21-33.
56. Kuhn H.W. A Note on Fremat's Problem. Math. Prog. 1973, 4:98-107.
57. Overton M.L. A Quadratically Convergent Method for Minimizing a Sum of Euclidean Norms. Math. Prog. 1983, 27:34-63.
58. Estivill-Castro V., Houle M.E. Robust Distance-Based Clustering with Applications to Spatial Data Mining. Algorithmica 2001, 30(2):216-242.
59. Estivill-Castro V., Murray A.T. Discovering Associations in Spatial Data - An Efficient Medoid Based Approach. Lecture Notes Artif. Intell. 1998, Vol. 1394:110-121. Springer, Berlin. X. Wu, R. Kotagiri, K.K. Korb (Eds.).
60. Ng R.T., Han J. CLARANS: A Method for Clustering Objects for Spatial Data Mining. IEEE Trans. Knowledge Data Eng. 2002, 14(5):1003-1016.
61. Mao J., Jain A.K. A Self-Organizing Network for Hyperellipsoidal Clustering (HEC). IEEE Trans. Neural Netw. 1996, 7(1):16-29.
62. Bulmer M.G. Principles of Statistics 1979, Dover, New York. 2nd ed.
63. Guha S., Rastogi R., Shim K. CURE: An Efficient Clustering Algorithm for Large Databases. Inf. Syst. 2001, 26(1):35-58.
64. Estivill-Castro V., Houle M.E. Data Structures for Minimization of Total Within-Group Distance for Spatio-Temporal Clustering. Lecture Notes Artif. Intell. 2001, 2168:91-102.
65. Wesolowsky G. The Weber Problem: History and Perspectives. Loc. Sci. 1993, 1:5-23.
66. Estivill-Castro V., Yang J. Fast and Robust General Purpose Clustering Algorithms. J. Data Min. Knowledge Discov. 2004, 8:127-150.
67. Estivill-Castro V., Houle M.E. Fast Randomized Algorithms for Robust Estimation of Location. Proceedings of the International Workshop on Temporal, Spatial and Spatio-Temporal Data Mining - TSDM2000, in Conjunction with the 4th European Conference on Principles and Practices of Knowledge Discovery and Databases 2007, 74-85. Springer, Berlin, Lecture Notes Artif. Intell. J. Roddick, K. Hornsby (Eds.).
68. Estivill-Castro V., Yang J. Clustering Web Visitors by Fast, Robust and Convergent Algorithms. Int. J. Foundations Comp. Sci. 2002, 13(4):497-520.
69. Apostol T.M. Calculus 1969, Vol. II. John Wiley & Sons, New York. 2nd ed.
70. Selim S.Z., Ismail M.A. k-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality. IEEE Trans. Pattern Anal. Mach. Intell. (PAMI) 1984, 6(1):81-86.
71. Bishop C.M. Neural Networks for Pattern Recognition 2004, Oxford University Press, New York.
72. Litinskii L.B., Romanov D.E. Neural Network Clustering Based on Distances between Objects. Proceedings of the Internet Corporation for Assigned Names and Numbers (ICANN'06) 2006, Athens, Greece.
73. Moller U., Galicki M., Witte H. Fast Vector Quantizer on Neural Clustering Networks Providing Globally Optimal Cluster Solutions. Proceedings of the 13th International Conference on Pattern Recognition 1996, IEEE Computer Society, Vienna, Austria, August, pp 351-355.
74. Sato-Ilic M. Non-Metric Neural Clustering. Proceedings of the 6th International Conference on Neural Information Processing (ICONIP'99) 1999, 72-77. IEEE Service Center, Piscataway, NJ, ISBN: 0-7803-5871-6. T. Gedeon, P. Wong, S. Halgamuge, N. Kasabov, D. Nauck, K. Fukushima (Eds.).
75. Artificial Neural Networks and Pattern Recognition: Old and New Connections 1991, Elsevier Science, New York. I. Sethi, A.K. Jain (Eds.).
76. Jain A.K., Mao J. Neural Networks and Pattern Recognition. Computational Intelligence: Imitating Life 1994, 194-212. IEEE Press, New York, NY, ISBN: 0-7803-1104-3. J.M. Zurada, R.J. Marks, C.J. Robinson (Eds.).
77. Kohonen T. Learning Vector Quantization for Pattern Recognition; Technical Report TKK-K-A610 1986, Helsinki University of Technology, Finland.
78. Pal N.R., Bezdek J.C., Tsao E.C.-K. Generalized Clustering Networks and Kohonens Self-Organizing Scheme. IEEE Trans. Neural Netw. 1993, 4:549-557.
79. Kohonen T. Self-Organized Formation of Topologically Correct Feature Maps. Biol. Cybern. 1982, 43:59-69.
80. Kohonen T. Self-Organization Maps 2001, Springer, Berlin, Heidelberg. 3rd ed.
81. Carpenter G., Grossberg S. Art3: Hierarchical Search Using Chemical Transmitters in Self-Organizing Pattern Recognition Architectures. Neural Netw. 1990, 3:129-152.
82. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning 1989, Addison-Wesley, Redwood City, CA.
83. Holland J.H. Adaption in Natural and Artificial Systems 1975, University of Michigan Press, Ann Arbor, MI, pp 261-271.
84. Jones G., Robertson A.M., Santimetvirul C., Willett P. Non-Hierarchic Document Clustering Using a Genetic Algorithm. Inf. Res. 1995, 1(1).
85. Freitas A. A Survey of Evolutionary Algorithms for Data Mining and Knowledge Discovery. Advances in Evolutionary Computing: Theory and Applications 2003, 819-845. Springer-Verlag, ISBN: 3-540-43330-9. A. Ghosh, S. Tsutsui (Eds.).
86. Lee C.-Y., Antonsson E. Dynamic Partitional Clustering Using Evolution Strategies. Proceedings of the 3rd Asia Pacific Conference on Simulated Evolution and Learning 2000, Nagoya, Japan.
87. Lin H.-J., Yang F.-W., Kao Y.-T. An Efficient Ga-Based Clustering Technique. Tamkang J. Sci. Eng. 2005, 8(2):113-122.
88. Liu Y.-G., Chen K.-F., Li X.-M. A Hybrid Genetic Based Clustering Algorithm. Proceedings of 2004 International Conference on Machine Learning and Cybernetics 2004, Vol. 3:1677-1682.
89. Maulik U., Bandyopadhyay S. Genetic Algorithm-Based Clustering Technique. Pattern Recognit. 2000, 33:1455-1465.
90. Painho M., Bacao F. Using Genetic Algorithms in Clustering Problems. Proceedings of the 5th International Conference on GeoComputation 2000, University of Greenwich, UK. R.J. Abrahart, B.H. Carlisle (Eds.).
91. Raghavan V.V., Birchand K. A Clustering Strategy Based on a Formalism of the Reproductive Process in a Natural System. Proceedings of the Second International Conference on Information Storage and Retrieval 1979, 10-22. ACM Press, New York, NY.
92. Bhuyan J.N., Raghavan V.V., Venkatesh K.E. Genetic Algorithm for Clustering with an Ordered Representation. Proceedings of the Fourth International Conference on Genetic Algorithms 1991, 408-415. Morgan Kaufmann Publishers Inc., San Francisco, ISBN: 1-55860-208-9. R.K. Belew, L.B. Booker (Eds.).
93. Jones D., Beltramo M.A. Solving Partitioning Problems with Genetic Algorithms. Proceedings of the Fourth International Conference on Genetic Algorithms 1991, 442-449.
94. Grefenstette J. Optimization of Control Parameters for Genetic Algorithms. IEEE Trans. Syst. Man Cybern. 1986, 16(1):122-128. ISSN 0018-9472.
95. Kirpatrick S., Gelatt C.D., Vecchi M.P. Optimization by Simulated Annealing. Science 1983, 220:671-680.
96. Metropolis N., Rosenbluth A., Rosenbluth M., Teller A. Equation of State Calculations by Fast Computing Machines. J. Chem. Phys. 1953, 21(6):1087-1092.
97. Brown D.E., Huntley C.L. A Practical Application of Simulated Annealing to Clustering. Pattern Recognit. 1992, 25(4):401-412.
98. Klein R.W., Dubes R.C. Experiments in Projection and Clustering by Simulated Annealing. Pattern Recognit. 1989, 22(2):213-220.
99. Selim S.Z., Al-Sultan K.S. A Simulated Annealing Algorithm for the Clustering Problem. Pattern Recognit. 1991, 24(10):1003-1008.
100. Wang X.Y., Whitwell G., Garibaldi J.M. The Application of a Simulated Annealing Fuzzy Clustering Algorithm for Cancer Diagnosis. Proceedings of the IEEE 4th International Conference on Intelligent System Design and Application 2004, 467-472. IEEE Computer Society, Washington, DC, ISBN/ISSN: 963-71546-30-2.
101. Baeza-Yates R.A. Introduction to Data Structures and Algorithms Related to Information Retrieval. Information Retrieval: Data Structures and Algorithms 1992, 1327. Prentice-Hall, Englewood Cliffs, New Jersey, ISBN/ISSN: 0-13-463837-9. W.B. Frakes, R.A. Baeza-Yates (Eds.).
102. Glover F., Laguna M. Tabu Search 1997, Kluwer Academic Publishers, Norwell, MA.
103. Abramson M., Wechsler H. Tabu Search Exploration for On-Policy Reinforcement Learning. Proceedings of the IEEE International Joint Conference on Neural Networks 2003, Vol. 4:2910-2915. IEEE Press, Portland. J. Van Campenhout (Ed.).
104. Ng M.K., Wong J.C. Clustering Categorical Data Sets Using Tabu Search Techniques. Pattern Recognit. 2002, 35(12):2783-2790.
105. Al-Sultan K.S. A Tabu Search Approach to the Clustering Problem. Pattern Recognit. 1995, 28(9):1443-1451.
106. Al-Sultan K.S., Fedjki C.A. A Tabu Search Based Algorithm for the Fuzzy Clustering Problem. Pattern Recognit. 1997, 30(12):2023-2030.
107. Zhong S., Ghosh J. A Unified Framework for Model-Based Clustering. J. Mach. Learn. Res. 2003, 4:1001-1037.
108. Martinetz T.M., Berkovich S.G., Schulten K.J. "Neural-Gas" Network for Vector Quantization and Its Application to Time-Series Prediction. IEEE Trans. Neural Netw. 1993, 4(4):558-569.
109. Dubes R.C. How Many Clusters Are Best? - An Experiment. Pattern Recognit. 1987, 20(6):645-663.
110. Oliver J.J., Baxter R.A., Wallace C.S. Unsupervised Learning Using MML. Machine Learning: Proceedings of the Thirteenth International Conference (ICML96) 1996, 364-372. Morgan Kaufmann Publishers, San Mateo, CA. L. Saitta (Ed.).
111. Lance G.N., Williams W.T. A General Theory of Classificatory Sorting Strategies: II. Clustering Systems. Comput. J. 1967, 10:271-277.
112. Gower J.C. A Comparison of Some Methods of Cluster Analysis. Biometrics 1967, 23:623-628.
113. Sneath P.H.A. The Application of Computers to Taxonomy. J. Gen. Microbiol. 1957, 17:201-226.
114. Sokal R., Michener C.D. A Statistical Method for Evaluating Systematic Relationships. Univ. Kans. Sci. Bull. 1958, 38:1409-1438.
115. Ward J. Hierarchical Grouping to Optimize an Objective Function. J. Am. Stat. Assoc. 1963, 58:236-244.
116. Boberg J., Salakoski T. General Formulation and Evaluation of Agglomerative Clustering Methods with Metric and Non-Metric Distances. Pattern Recognit. 1993, 26(9):1395-1406.
117. Milligan G.W., Cooper M.C. An Examination of Procedures for Determining the Number of Clusters in a Data Set. Psychometrika 1985, 50(2):159-179.
118. Kurita T. An Efficient Agglomerative Clustering Algorithm Using a Heap. Pattern Recognit. 1991, 24:205-209.
119. Murtagh F. A Survey of Recent Advances in Hierarchical Clustering Algorithms. Comput. J. 1983, 26(4):354-359.
120. Murtagh F. Complexities of Hierarchic Clustering Algorithms. Comput. Stat. Q. 1984, 1(2):101-113.
121. Everitt B. Cluster Analysis 1981, Halsted Press, New York, NY.
122. Estivill-Castro V., Lee I. Multi-Level Clustering and Its Visualization for Exploratory Spatial Analysis. Geoinformatica 2002, 6(2):123-152.
123. Gowda C.K., Ravi T.V. Divisive Clustering of Symbolic Objects Using the Concepts of Both Similarity and Dissimilarity. Pattern Recognit. 1995, 28(8):1277-1282.
124. Berkhin P. Survey of Clustering Data Mining Techniques 2002, Accrue Software Inc., San Jose, CA, Technical Report 92-10.
125. Ghosh J. Scalable Clustering Methods for Data Mining. Handbook of Data Mining 2003, 247-277. Lawrence Ealbaum, Mahwah, New Jersey. N. Ye (Ed.).
126. Han J., Kamber M. Data Mining: Concepts and Techniques 2006, Morgan Kaufmann Publishers, San Francisco, CA. 2nd ed.
127. Zhang T., Ramakrishnan R., Livny M. BIRCH: A New Data Clustering Algorithm and Its Applications. Data Min. Knowledge Discov. 1997, 1(2):141-182.
128. Karypis G., Han E., Kumar V. CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling. IEEE Comp. Data Anal. Min. (Special Issue) 1999, 32(8):68-75.
129. Sheikholeslami G., Chatterjee S., Zhang A. WaveCluster: A Wavelet Based Clustering Approach for Spatial Data in Very Large Databases. VLDB J. 2000, 8(3-4):289-304.
130. Agrawal R., Gehrke J., Gunopulos D., Raghavan P. Automatic Subspace Clustering of High Dimensional Data. Data Min. Knowledge Discov. 2005, 11(1):5-33.
131. Lin C.-R., Chen M.-S. Combining Partitional and Hierarchical Algorithms for Robust and Efficient Data Clustering with Cohesion Self-Merging. IEEE Trans. Knowledge Data Eng. 2005, 17(2):145-159.
132. Murty N.M., Krishna G. A Hybrid Clustering Procedure for Concentric and Chain-Like Clusters. Int. J. Comp. Inf. Sci. 1981, 10(6):397-412.
133. Yang J., Lee I. Hybrid O ( n n ) Clustering for Sequential Web Usage Mining. Lecture Notes Comput. Sci. 2006, Vol. 4304:1022-1026. Springer, Berlin. A. Sattar, B.H. Kang (Eds.).
134. Boros E., Hammer P.L. On Clustering Problems with Connected Optima in Euclidean Spaces. Discrete Math. 1989, 75(1-3):81-89.
135. Estivill-Castro V., Lee I. Clustering with Obstacles for Geographical Data Mining. ISPRS 2004, 59(1-2):21-34.
136. Klein S.D., Kamvar D., Manning C.D. From Instance-Level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering. Proceedings of the 9th International Conference on Machine Learning 2002, 307-314. Morgan Kaufmann, Sydney, Australia. C. Sammut, A.G. Hoffmann (Eds.).
137. Tung A.K.H., Ng R.T., Lakshmanan V.S., Han J. Proceedings of the 8th International Conference on Database Theory. Lecture Notes Artifi. Intell. 1973, Vol. 1973:405-419. Springer, Berlin. J.V. Bussche, V. Vianu (Eds.).
138. Wagstaff K., Cardie C., Rogers S., Schrödl S. Constrained K-Means Clustering with Background Knowledge. Proceedings of the 8th International Conference on Machine Learning 2001, 577-584. Morgan Kaufmann, Williamstown, MA. C.E. Brodley, A.P. Danyluk (Eds.).
139. Zaïane O.R., Lee C.-H. Clustering Spatial Data When Facing Physical Constraints. Proceedings of the International Workshop on Temporal, Spatial and Spatio-Temporal Data Mining 2002, IEEE Computer Society, Maebashi City, Japan, pp 214-223.
140. Estivill-Castro V., Lee I. Argument Free Clustering via Boundary Extraction for Massive Point-Data Sets. Comput. Environ. Urban Syst. 2002, 26(4):315-334.
141. Chew L.P. Constrained Delaunay Triangulations. Algorithmica 1989, 4:97-108.