Spring-Based Lattice Drawing Highlighting Conceptual Similarity

  • Tim Hannan
  • Alex Pogel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3874)


This paper presents a spring-based lattice drawing method that uses natural spring lengths determined by assigning a dissimilarity value, the size of symmetric difference, to every pair of concept extents. This extends previous work on incorporating support structure in a concept lattice diagram, in which the support weight function was applied to modify any layout. That work was a partial advance toward the goal of viewing high confidence association rules via the lattice diagram in a way that naturally extends the traditional viewing of implications in a diagram, but also caused the appearance of nearly horizontal edges. The spring-based method solves this problem by placing concepts in the ambient space such that the distance between concepts is proportional to the size of the symmetric difference of the extents of the respective concepts. Besides meeting the proportionality criteria, the algorithm yields highly symmetric diagrams in cases where it is expected.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Dea]
    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, NJ (1999)zbMATHGoogle Scholar
  2. [Co1]
    Cole, R.J.: Automatic Layout of Concept Lattices using Layer Diagrams and Additive Diagrams. In: Oudshoorn, M. (ed.) Proceedings of the 24th Australasian Conference on Computer science, Gold Coast, Queensland, Australian Computer Science Communications, vol. 23, pp. 47–53. IEEE Computer Society, Los Alamitos (2001)Google Scholar
  3. [LDW]
    Freese, R.: LatDrawWin, a lattice drawing applet, available at
  4. [Fre]
    Freese, R.: Automated Lattice Drawing. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 112–127. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. [GaL]
    University of Montreal, Galicia - Galois Lattice Interactive Constructor,
  6. [FCA]
    Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations, pp. 68–79. Springer, New York (1999)zbMATHGoogle Scholar
  7. [UCI]
    Hettich, S., Bay, S.D.: The UCI KDD Archive. University of California, Department of Information and Computer Science, Irvine (1999), Google Scholar
  8. [PHM]
    Pogel, A., Hannan, T., Miller, L.: Visualization of Concept Lattices Using Weight Functions. In: Supplementary Proceedings of ICCS 2004, Shaker (2004)Google Scholar
  9. [Lea]
    Langsdorf, R., Skorsky, M., Wille, R., Wolf, A.: An Approach to Automated Drawing of Concept Lattices. Technical Report 1874, Technical University of Darmstadt, Schlossgatenstasse, Darmstadt, Germany (1996)Google Scholar
  10. [OPH]
    Ozonoff, D., Pogel, A., Hannan, T.: Generalized Contingency Tables and Concept Lattices. In: Abello, J., Cormode, G. (eds.) AMS-DIMACS Special Volume: Discrete Methods in Epidemiology, AMS (2006) (to appear)Google Scholar
  11. [PSL]
    For higher resolution images of various Figures in this paper and additional images of the results of the drawing algorithm, go to,
  12. [St1]
    Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with Titanic. Data and Knowledge Engineering 42, 189–222 (2002)zbMATHCrossRefGoogle Scholar
  13. [StW]
    Stumme, G., Wille, R.: A Geometrical Heuristic for Drawing Concept Lattices. In: Graph Drawing, pp. 452–460. Springer, Heidelberg (1995)Google Scholar
  14. [Yev]
    Yevtushenko, S., et al.: Concept Explorer, Open source java software, Release 1.2 (2003), available at

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Tim Hannan
    • 1
  • Alex Pogel
    • 1
  1. 1.Physical Science LaboratoryNew Mexico State UniversityLas CrucesUSA

Personalised recommendations