Towards Comparison of Decomposable Systems

  • Mark Sh. Levin
Conference paper
Part of the Studies in Classification, Data Analysis, and Knowledge Organization book series (STUDIES CLASS)


The paper focuses on the comparison of decomposable systems on the base of combinatorial descriptions of systems and their parts. Our system description involves the following interconnected hierarchies: a tree-like system model; criteria and restrictions for system components (nodes of the model); design alternatives (DAs) for nodes; interconnection (Is) or compatibility between DAs of different system components; estimates of DAs and Is A vector-like proximity for rankings is described.


System Description Proximity Measure Combinatorial Object Combinatorial Description Label Leaf 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Arabie, Ph. and Boorman, S.A. (1973): Multidimensional Scaling of Measures of Distance between Partitions. J. of Math. Psychology, 10, 2, 148–203.MathSciNetMATHCrossRefGoogle Scholar
  2. Arabic, Ph. and Hubert, L.J. (1992): Combinatorial Data Analysis..donnai Review of Psychology, 43, 169–203.Google Scholar
  3. Barthelemy, J.-P., Guenoche, A. (1991): Trees and proximity Representation, Wiley, New York.Google Scholar
  4. Barthelemy, J.-P., Leclerc, B. and Nionjardet. B. (1986): On the Use of Ordered Sets in Problems of Comparison and Consensus of Classifications. J. of Classification, 3, 2, 17–224.MathSciNetGoogle Scholar
  5. Belkin, A.R. and Levin. M.Sh. (1990): Decision Making: Combinatorial Models of Information.Approximation, Nauka Publishing House, Moscow (in Russian).MATHGoogle Scholar
  6. Bogart, K.P. (1973): Preference Structures I: Distance between Transitive Preference Relations. J. Math. Soc., 3, -19–67.Google Scholar
  7. Boorman, S.A. and Oliver, D.C. (1973): Metrics on Spaces of Finite Trees. J. of Math. Psychology, 10, 1, 26–59.MATHCrossRefGoogle Scholar
  8. Botafogo, R.A., Rivlin, E. and Shneiderman, B. (1992): Structural Analysis of Hypertexts: Identifying Hierarchies and Useful Metrics..4C’1,/ Trans. on Information Systems, 10, 2, 1–42–180.Google Scholar
  9. Cook, W.D. and Kress, M. (1984): Relationships between l’ Metrics on Linear Rankings Space. SLAM J. on.1ppl. Math., 44, 1, 209–220.MathSciNetMATHCrossRefGoogle Scholar
  10. Day, W.H.E. (1985): Optimal Algorithms for Comparing Trees with Labeled Leafs. J. of Classification, 2, 1, 7–28.MATHCrossRefGoogle Scholar
  11. Ganter, B. and \Ville, R. (1989): Conceptual Scaling. In Applications of Corabinatorics and Graph Theory to the Biological and Social Sciences. Roberts F.S. (ed.), 140–167, Springer-Verlag, New York.Google Scholar
  12. Gordon, A.D. (1986): Consensus Supertrees: The Synthesis of Rooted Trees Containing Overlapping Sets of Labeled Leafs. J. of Classification, 3, 2, 33. 5–348.Google Scholar
  13. Gower, J.C. (1985): Measures of Similarity, Dissimilarity, and Distance. In Encyclopedia of Statistical Sciences, 5, S. Kotz, and N.L. Johnson (ads.), 397–405, Wiley, New York.Google Scholar
  14. Hannenhalli, S. and Pevzner, P. (1995): Transforming (lien into,Alice, Technical Report CSE-95–012. Dept. of Computer Science and Engineering, Pennsylvania State University.Google Scholar
  15. Heady, M.D., Little, C.H.C. and Penny, D. (1984): Comparing Tress with Pendant Vertices Labelled. SIAM J. on Appl. Math., 44, 5, 1054–1065.CrossRefGoogle Scholar
  16. Hubert, L. and Arable, P. (1985): Comparing Partitions. J. of Classification, 2, 3, 193–218.CrossRefGoogle Scholar
  17. Jawhari, E.M., Pouzet, M. and Missane, D. (1986): Retracts: Graphs and Ordered Sets From The Metrics Point of View. In Contemporary ItIathematics, 57, Rival, I. (ed.), AMS. Providence.Google Scholar
  18. Kemeny, J.G. and Snell, J.L. (1972): Mathematical Models in the Social Sciences. MIT Press, Cambridge, Mass.MATHGoogle Scholar
  19. Kendall, M. (1962): Rank Correlation Methods, 3rd ed., Hafner, New York..Google Scholar
  20. Kruskal, J.B. (1977): The relationship between multidimensional scaling and clustering. In Classification and Clustering, Van Ryzin. J. (ed.). 17–44, Academic. New York.Google Scholar
  21. Lemone, K.A. (1982): Similarity Measures Between Strings Extended to Sets of Strings. IEEE Trans. on Pattern Analysis and Machine Intelligence, 4, 3, 345–347.MATHCrossRefGoogle Scholar
  22. Levin, M.Sh. (1988): Vector-like Criterion for Proximity of Structures. In Abstracts of The Third Conf. “Problems and Approaches of Decision Making in Organizational Management Systems”, Inst. for System Analysis, Moscow, 20–21 (in Russian).Google Scholar
  23. Levin, M.Sh. (1996a): Towards Combinatorial Engineering of Decomposable Systems, In 13th European Meeting on Cybernetics and Systems, 1, Vienna, 265–270.Google Scholar
  24. Levin, M.Sh. (1996b): Hierarchical Morphological Design of Decomposable Systems. Concurrent Engineering: Research and Applications, 4, 2, 111–117.CrossRefGoogle Scholar
  25. Margush, T. (1982): Distance Between Trees. Disc. Appl. Math., 4, 281–290.MathSciNetMATHCrossRefGoogle Scholar
  26. Mirkin, B.G. and Chernyi, L.B. (1970): On Measurement of Distance Between Partitions of a Finite Set of Units. Automation and Remote Control, 31, 786–792.MathSciNetGoogle Scholar
  27. Pouzet, M. and Rosenberg, I.G. (1994): General Metrics and Contracting Operations. Discrete Mathematics, 130, 1–3, 103–169.MathSciNetGoogle Scholar
  28. Robinson, D.F. and Foulds, L.R. (1981): Comparison of Phylogenetic Trees. Mathematical Biosciences, 53, 1 /2, 131–147.MathSciNetCrossRefGoogle Scholar
  29. Rote, G. (1991): Computing the Minimum Hausdorff Distance between Two Point Sets on a Line under Translation. Information Processing Letters, 38, 3, 123–127.MathSciNetMATHCrossRefGoogle Scholar
  30. Sellers, P.H. (1974): An Algorithm for the Distance between two Finite Sequences. J. of Combinatorial Theory, Ser. 4, 16, 253–258.MathSciNetCrossRefGoogle Scholar
  31. Tai, K.-C. (1979): The Tree-to-Tree Correction Problem. J. of the.ACM, 26, 3, 422–133.MathSciNetMATHGoogle Scholar
  32. Timkovskii, V.G. (1989): Complexity of Common Subsequence and Supersequence Problems and Related Problems, English translation from Kibernetika, 5, 1–13.MathSciNetGoogle Scholar
  33. Torgenson, W.S. (1958): Theory and Method of Scaling. Wiley, New York.Google Scholar
  34. Wagner, R.A. and Fisher, M.J. (1974): The String-to-String Correction Problem. J. of the ACM, 21, 1, 168–173.MATHCrossRefGoogle Scholar
  35. Zeitoun, J. (1977): Trames Planes. Introduction a une etude architecturale des trames. Bordas, Paris.Google Scholar

Copyright information

© Springer Japan 1998

Authors and Affiliations

  • Mark Sh. Levin
    • 1
  1. 1.The University of AizuFukushimaJapan

Personalised recommendations