Using Force-based Graph Layout for Clustering of Relational Data

Advances in Databases and Information Systems: Associated Workshops and Doctoral Consortium of the 13th East European Conference ADBIS 2009: Revised Selected Papers 2010
Vitālijs Zabiņako

Data clustering is essential problem in database technology – successful solutions in this field provide data storing and accessing optimizations, which yield better performance characteristics. Another advantage of clustering is in relation with ability to distinguish similar data patterns and semantically interconnected entities. This in turn is very valuable for data mining and knowledge discovery activities. Although many general clustering strategies and algorithms were developed in past years, this search is still far from end, as there are many potential implementation fields, each stating its own unique requirements. This paper describes data clustering based on original spatial partitioning of force-based graph layout, which provides natural way for data organization in relational databases. Practical usage of developed approach is demonstrated.

Keywords
clustering, database, relationship, force, graph
DOI
10.1007/978-3-642-12082-4_25
Hyperlink
http://link.springer.com/chapter/10.1007%2F978-3-642-12082-4_25

Zabiņako, V. Using Force-based Graph Layout for Clustering of Relational Data. In: Advances in Databases and Information Systems: Associated Workshops and Doctoral Consortium of the 13th East European Conference ADBIS 2009: Revised Selected Papers, Latvia, Rīga, 7-10 September, 2009. Berlin ; Heidelberg: Springer, 2010, pp.193-201. ISBN 978-3-642-12081-7. e-ISBN 978-3-642-12082-4. ISSN 0302-9743. Available from: doi:10.1007/978-3-642-12082-4_25

Publication language
English (en)