Journal of Software, Vol 6, No 7 (2011), 1321-1328, Jul 2011
doi:10.4304/jsw.6.7.1321-1328

Social Network Analysis Layout Algorithm under Ontology Model

Peng Wu, SiKun Li

Abstract


Social network analysis and visualization is an active area of study but good organizations of social network information are lacking. This paper proposes a domain ontologies model focusing on social network information, which abstracts the impersonal existences in social network information domain into some primary ontologies. The model is suitable for describing a wide variety of social network analysis and visualization methods. For overcoming the disadvantage of transitional force directed layout algorithms in social network structure analysis, we propose a Social Network Analysis Layout (SNAL) algorithm based on domain ontologies model. SNAL algorithm analyses the subgroups, the roles and the key attributes in social network. Then the results are used to improve the force directed layout algorithm, in both 2D and 3D visualization. Results with the case of terrorist information demonstrate its advantages in analyzing and displaying the structure of social network.


Keywords


social network, domain ontology, force directed layout algorithm, structure analysis, SNAL algorithm, subgroup analysis

References


[1] S. Hachul and M. Junger, An experimental comparison of fast algorithms for drawing large general graphs, Proceedings of Graph Drawing 2005, 2005, pp. 235-250.

[2] T. R. Gruber, A translation approach to portable ontology specifications, Knowledge Acquisition, vol. 5, February 1993, pp. 199-220.
http://dx.doi.org/10.1006/knac.1993.1008

[3] P. Eades. A heuristic for graph drawing, Congressus Nutnerantiunt, vol. 42, 1984, pp. 149-160.

[4] D. S. Chan -M, K. S. Chua, C. Leckie, and A. Parhar, Visualisation of Power-Law Network Topologies, Proceedings of the Eleventh IEEE Internationa1 Conference on Networks, Sydney, 2003, pp. 69-74.

[5] A. Quigley and P. Eades. FADE: Graph Drawing, Clustering, and Visual Abstraction, Lecture Notes in Computer Science. Heidelberg: Springer, 2001, vol. 1984, pp. 77-80.

[6] A. Ahmed, T. Dywer, S. H. Hong, C. Murray, L. Song, and Y. X. Wu, Visualisation and Analysis of Large and Complex Scale-free Networks, Proceedings of Eurographics/IEEE VGTC Symposium on Visualization, Leeds, 2005, pp.1-8.

[7] N. Henry and J. D. Fekete, MatrixExplorer: a dual-representation system to explore social networks, IEEE Transactions on Visualization and Computer Graphics, vol. 12, May 2006, pp. 677-684.
http://dx.doi.org/10.1109/TVCG.2006.160
PMid:17080787

[8] N. Henry, J. D. Fekete, and M. J. McGuffin. NodeTrix: a hybrid visualization of social networks, IEEE Transactions on Visualization and Computer Graphics, vol. 13, June 2007, pp. 1302-1309.
http://dx.doi.org/10.1109/TVCG.2007.70582
PMid:17968078

[9] N. Henry, A. Bezerianos, and J. D. Fekete, Improving the readability of clustered social networks using node duplication. IEEE Transactions on Visualization and Computer Graphics, vol. 14, June 2008, pp. 1317-1324.
http://dx.doi.org/10.1109/TVCG.2008.141
PMid:18988979

[10] J. J. Jung and J. Euzenat. Towards semantic social networks. Proceedings of the Semantic Web: Research and Applications. Berlin: Springer, 2007, vol. 4519, pp. 267-280.

[11] O. Gilson, N. Silva, P. W. Grant, and M. Chen, From web data to visualization via ontology mapping, Eurographics/IEEE-VGTC Symposium on Visualization, A. Vilanova, A. Telea, G. Scheuermann, and T. Moller, Eds. Eindhoven, vol. 27, March 2008, pp. 959-966.

[12] Z. Q. Shen, K. L. Ma, and T. Eliassi-Rad. Visual analysis of large heterogeneous social networks by semantic and structural abstraction, IEEE Transactions on Visualization and Computer Graphics, vol. 12, June 2006, pp. 1427-1439.
http://dx.doi.org/10.1109/TVCG.2006.107
PMid:17073366

[13] J. Scott. Social network analysis: a handbook, 2nd ed, Sage Publications: 2006, pp. 6-25.


Full Text: PDF


Journal of Software (JSW, ISSN 1796-217X)

Copyright @ 2006-2013 by ACADEMY PUBLISHER – All rights reserved.