Abstract
In the paper a view, based on the optimization approach, is given on different types of constrained clustering problems and methods for their solution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E. & Lenstra, J.K. (Eds.)(1997). Local Search in Combinatorial Optimization. Wiley, Chichester.
Batagelj, V. (1984). Agglomerative methods in clustering with constraints. Preprint Series Dept. Math. Univ. Ljubljana, 22(1984)102, 5–19.
Batagelj, V. (1985). Algorithmic aspects of clustering problem, (invited talk) Proceedings of the 7 th International Symposium Computer at the University, Cavtat, 27–29.5. 1985, SRCE, Zagreb.
Batagelj, V. (1997). Notes on Blockmodeling. Social Networks 19, 143–155.
Batagelj, V., Doreian, P. & Ferligoj, A. (1992). An Optimizational Approach to Regular Equivalence. Social Networks 14, 121–135.
Batagelj, V., Ferligoj, A. & Doreian, R (1992). Direct and Indirect Methods for Structural Equivalence. Social Networks 14, 63–90.
Batagelj, V., Ferligoj, A. & Doreian, R (1998). Fitting Pre-specified Blockmodels. C. Hayashi, & (Eds.): Data Science, Classification, and Related Methods/IPCS’96, Springer, Tokyo, 199–206.
Batagelj, V., Korenjak-Cerne, S. & Klavzar, S. (1994). Dynamic Programming and Convex Clustering. Algorithmica 11, 93–103.
Brucker, P. (1978). On the complexity of clustering problems, in: R.Henn, B. Korte, W. Oettli (Eds.): Optimization and Operations Research. Lecture Notes in Economics and Mathematical Systems, Vol. 157, Springer-Verlag, Berlin.
Ferligoj, A. (1986). Clustering with constraining variable. Journal of Mathematical Sociology, 12, 299–313.
Ferligoj, A. & Batagelj, V. (1982). Clustering with relational constraint. Psychometrika, 47, 4, 413–426.
Ferligoj, A. & Batagelj, V. (1983). Some types of clustering with relational constraints. Psychometrika, 48, 4, 541–552.
Ferligoj, A. & Batagelj, V. (1992). Direct Multicriteria Clustering Algorithms. Journal of Classification 9, 1, 43–61.
Garey, M.R. & Johnson, D.S. (1979). Computer and intractability. Freeman, San Francisco.
Gordon, A.D. (1996). A survey of constrained classification. Computational Statistics & Data Analysis 21, 17–29.
Hansen, P., Jaumard, B. & Sanlaville, E. (1994). A Review of Mathematical Programming Approaches, in: P. Bertrand, B. Burtschy (Eds.): New Approaches in Classification and Data Analysis /IFCS’93, Springer-Verlag, Berlin, 228–240.
Klauer, K.C. (1994). Representing proximities by network models, in: P. Bertrand, B. Burtschy (Eds.): New Approaches in Classification and Data Analysis/IFCS’93, Springer-Verlag, Berlin, 493–501.
Lebbe, J. & Vignes, R. (1996). Optimal Hierarchical Clustering with Order Constraint, in: E. Diday, Y. Lechevallier, O. Opitz (Eds.): Ordinal and Symbolic Data Analysis/OSDA’95, Springer-Verlag, Berlin, 265–276.
Murtagh, F. (1985). A survey of algorithms for contiguity-constrained clustering and related problems. The Computer Journal 28, 82–88.
Shamos, M.I. (1976). Geometry and statistics: Problems at the interface, in: J. Traub (Ed.): Algorithms and Complexity (New directions and recent results). Academic Press, New York, 251–288.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Batagelj, V., Ferligoj, A. (1998). Constrained Clustering Problems. In: Rizzi, A., Vichi, M., Bock, HH. (eds) Advances in Data Science and Classification. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72253-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-72253-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64641-9
Online ISBN: 978-3-642-72253-0
eBook Packages: Springer Book Archive