Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Verant corp.: How Data Clustering Can Benefit Performance. A Versant Whitepaper (2007), http://www.versant.com/developer/resources/objectdatabase/whitepapers/vsnt_whitepaper_scalability_clustering.pdf
Férey, N., Gros, P.-E., Hérisson, J., Gherbi, R.: Visual data mining of genomic databases by immersive graph-based exploration. In: Proceedings of GRAPHITE 2005, pp. 143–146 (2005)
Koutsoudis, A., Arnaoutoglou, F., Pavlidis, G., Chamzas, C.: 3D content-based visualization of databases. In: Proceedings of the International Conference on Knowledge Generation, Communication and Management (2007)
Huang, M.L.: Information Visualization of Attributed Relational Data. In: Australian Symposium on Information Visualization, Sydney (December 2001); Conferences in Research and Practice in Information Technology, vol. 9 (2001)
Fung, B., Wang, K., Ester, M.: Hierarchical Document Clustering. Encyclopedia of Data Warehousing and Mining, 555–559 (2004)
Davidson, I., Wagstaff, K.L.: Measuring Constraint-Set Utility for Partitional Clustering Algorithms. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 115–126. Springer, Heidelberg (2006)
Neville, J., Adler, M.: Clustering Relational Data Using Attribute and Link Information. In: Proc. of the Text Mining and Link Analysis Workshop, IJCAI (2003)
Eades, P.: A Heuristic for Graph Drawing. Congressus Numerantium 42, 149–160 (1984)
Zabiniako, V., Rusakov, P.: Development and Implementation of Partial Hybrid Algorithm for Graphs Visualization. Scientific Proceedings of Riga Technical University, Computer Science, Applied Computer Systems, ser. 5, 34, 192–203 (2008)
Microsoft Corp., Northwind Traders Sample Database, http://www.microsoft.com/downloads
Han, E.-H., Karypis, G., Kumar, V.: Hypergraph based clustering in high-dimensional data sets: A summary of results. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering 21, 15–22 (1997)
Taskar, B., Segal, E., Koller, D.: Probabilistic clustering in relational data. In: Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 870–878 (2001)
Yin, X., Han, J., Yu, P.S.: Cross-relational clustering with user’s guidance. In: KDD 2005: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 344–353. ACM Press, New York (2005)
Zong, N., Gui, F., Adjouadi, M.: A new clustering algorithm of large datasets with O(N) computational complexity, Intelligent Systems Design and Applications. In: Proceedings of 5th International Conference on Knowledge Discovery and Data Mining, pp. 79–82 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zabiniako, V. (2010). Using Force-Based Graph Layout for Clustering of Relational Data. In: Grundspenkis, J., Kirikova, M., Manolopoulos, Y., Novickis, L. (eds) Advances in Databases and Information Systems. ADBIS 2009. Lecture Notes in Computer Science, vol 5968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12082-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-12082-4_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12081-7
Online ISBN: 978-3-642-12082-4
eBook Packages: Computer ScienceComputer Science (R0)