Advertisement

Acta Informatica

, Volume 23, Issue 3, pp 311–323 | Cite as

NP-hard problems in hierarchical-tree clustering

  • Mirko Křivánek
  • Jaroslav Morávek
Article

Summary

We consider a class of optimization problems of hierarchical-tree clustering and prove that these problems are NP-hard. The sequence of polynomial reductions and/or transformations used in our proof is based on relatively laborious graph-theoretical constructions and starts in the NP-complete problem of 3-dimensional matching. Using our main result we establish the NP-completeness of a problem of the best approximation of a symmetric relation on a finite set by an equivalence relation, thus answering in the negative a question proposed implicitly by C.T. Zahn.

Keywords

Information System Operating System Data Structure Communication Network Information Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anderberg, M.: Cluster Analysis for Applications. New York: Academic Press 1973Google Scholar
  2. 2.
    Brucker, P.: On the Complexity of Clustering Problems. In: Optimization and Operations Research (R. Henn, B. Korte, W. Oletti eds.), pp. 45–54. Berlin, Heidelberg, New York: Springer 1977Google Scholar
  3. 3.
    Diday, E, Bochi, S., Brossier, G., Celeux, G., Charles, C., Chifflet, R., Darcos, J., Diday, E., Diebolt, J., Fevre, P., Govaert, G., Hanani, C., Jacquet, D., Lechevallier, Y., Lemaire, J., Lemoine, Y., Molliere, J.L., Morisset, G., Ok-Sakun, Y., Rousseau, P., Sankoff, D., Schroeder, A., Sidi, J., Taleng, F.: Optimisation en classification automatique. INRIA, Rocquencourt, 1979Google Scholar
  4. 4.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman 1979Google Scholar
  5. 5.
    Gonzales, T.: On the Computational Complexity of Clustering and Related Problems. In: System Modelling and Optimization (R. Drenick, F. Kozin eds.), pp. 174–182. Berlin, Heidelberg, New York: Springer 1982Google Scholar
  6. 6.
    Hartigan, J.A.: Clustering Algorithms. New York: John Wiley 1975Google Scholar
  7. 7.
    Hartigan, J.A.: Representation of Similarity Matrices by Trees. JASA 62, 1140–1158 (1967)Google Scholar
  8. 8.
    Jambu, M., Lebeaux, M.-O.: Cluster Analysis and Data Analysis. Amsterdam: North-Holland 1983Google Scholar
  9. 9.
    Jardine, N., Sibson, R.: Mathematical Taxonomy. New York: John Wiley 1971Google Scholar
  10. 10.
    Johnson, S.C.: Hierarchical Clustering Schemes. Psychometrika 32, 241–254 (1967)Google Scholar
  11. 11.
    Karp, R.M.: Reducibility among Combinatorial Problems. In: Complexity of Computer Computations (E.W. Miller, J.W. Thatcher, eds.), pp. 85–104. New York: Plenum Press 1972Google Scholar
  12. 12.
    Křivánek, M., Morávek, J.: On NP-Hardness in Hierarchical Clustering. In: Proceedings COMPSTAT '84, pp. 189–194. Vienna: Physica 1984Google Scholar
  13. 13.
    Lerman, I.C.: Classification et analyse ordinale des données. Paris: Dunod 1981Google Scholar
  14. 14.
    Lovász, L.: Combinatorial Problems and Exercises. Budapest: Akademiai Kiadó 1979Google Scholar
  15. 15.
    Späth, H.: Cluster Analysis Algorithms for Data Reduction and Classification of Objects. London: Ellis Horwood 1980Google Scholar
  16. 16.
    Zahn, C.T.: Approximating Symmetric Relations by Equivalence Relations. SIAM J. Appl. Math. 12, 840–847 (1964)Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Mirko Křivánek
    • 1
  • Jaroslav Morávek
    • 2
  1. 1.Research Institute of Mathematical MachinesPraha 1ČSSR
  2. 2.Mathematical InstituteCzechoslovak Academy of SciencesPraha 1CSSR

Personalised recommendations