StarLion: Auto-configurable Layouts for Exploring Ontologies

  • Stamatis Zampetakis
  • Yannis Tzitzikas
  • Asterios Leonidis
  • Dimitris Kotzinos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6089)


The visualization of ontologies is a challenging task especially if they are large. We will demonstrate StarLion, a system providing exploratory visualizations which enhance the user understanding. StarLion combines many of the existing visualization methods with some novel features for providing better 2D layouts. Specifically, one distinctive feature of StarLion is the provision of Star-like graphs of variable radius whose layout is derived by a Force Directed Placement algorithm (FDPA) specially adapted for RDF Schemas. This approach enables users to gradually explore and navigate through the entire ontology without overloading them. StarLion can also handle multiple namespaces, a very useful feature for assisting the understanding of interdependent ontologies. Another distinctive characteristic of StarLion is the provision of a novel method for configuring automatically the FDPA parameters based on layout quality metrics, and the provision of an interactive configuration method offered via an intuitive tool-bar.


Formal Concept Analysis Variable Radius Graph Drawing Layout Algorithm Popular Open Source 
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.


  1. 1.
    Chen, X., Fan, C., Lo, P., Kuo, L., Yang, C.: Integrated visualization for semantic web. In: Intern. Conf. on Advanced Information Networking and Applications, pp. 701–706 (2005)Google Scholar
  2. 2.
    Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42(3), 146–160 (1984)MathSciNetGoogle Scholar
  3. 3.
    Fruchterman, T., Reingold, E.: Graph drawing by force-directed placement. Software - Practice and Experience 21(11), 1129–1164 (1991)CrossRefGoogle Scholar
  4. 4.
    Kamada, T.: On Visualization of Abstract Objects and Relations. Ph.D. thesis, Dept. of Information Science, Univ. of Tokyo (1988)Google Scholar
  5. 5.
    Sugiyama, K., Misue, K.: A simple and unified method for drawing graphs: Magnetic-spring algorithm. In: Graph Drawing, pp. 364–375. Springer, Heidelberg (1994)Google Scholar
  6. 6.
    Sugiyama, K., Misue, K.: Graph drawing by magnetic-spring model. Journal on Visual Lang. Comput. 6(3), 217–231 (1995)CrossRefGoogle Scholar
  7. 7.
    Tzitzikas, Y., Hainaut, J.: How to tame a very large er diagram (using link analysis and force-directed placement algorithms). In: Delcambre, L.M.L., Kop, C., Mayr, H.C., Mylopoulos, J., Pastor, Ó. (eds.) ER 2005. LNCS, vol. 3716, pp. 144–159. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Stamatis Zampetakis
    • 1
  • Yannis Tzitzikas
    • 1
  • Asterios Leonidis
    • 1
  • Dimitris Kotzinos
    • 1
  1. 1.Computer Science DepartmentUniversity of Crete, Greece, and, Institute of Computer Science, FORTH-ICSGreece

Personalised recommendations