［1］ WATTS D J, STROGATZ S H. Collective dynamics of ‘small-world-networks ［J］. Nature, 1998, 393(6): 440-442.
［2］ BARABASI A L, BONABEAU E. Scale-free networks ［J］. Scientific American, 2003, 288(5): 50-59.
［3］ LONG B,ZHANG M,WU X,et al. Spectral clustering for multitype relational data ［C］∥ Proceedings of the 23rd International Conference on Machine Learning. New York: ACM,2006: 585-592．
［4］ LI T, ANAND S S. DIVA a variancebased clustering approach for multi-type relational data ［C］∥ Proceedings of the 16th ACM Conference on Information and Knowledge Management CIKM. New York: ACM, 2007: 147-156．
［5］ YIN X X, HAN J W, PHILIP S Y. CrossClus: user-guided multi-relational clustering ［J］. Data Mining Knowledge Discovery, 2007, 15: 321-348.
［6］ CHENG Y, HUANG S B, LV T Y, et al. A hierarchical multi-relational clustering algorithm based on modal logic ［C］∥ 2011 4th International Congress on Image and Signal Processing (CISP). Los Alamitos: IEEE, 2011: 2459-2463．
［7］ HERMAN I, MELANCON G, MARSHALLl M S. Graph visualization and navigation in information visualization: a survey ［J］. IEEE Transactions on Visualization and Computer Graphics, 2000, 6(1): 24-43．
［8］ BEN M, EPPSTEIN D. Worst-case bounds for subadditive geometric graphs ［C］∥ Proceedings of the 9th ACM Symposium on Computational Geometry. New York: ACM,1993: 183-188.
［9］ NGUYEN Q V, HUANG M L. A space-optimized tree visualization ［C］∥ IEEE Symposium on Information Visualization. Los Alamitos: IEEE, 2002:85-92．
［10］ JOHNSON B, SHNEIDERMAN B. TreeMaps: a spacefilling approach to the visualization of hierarchical information ［C］∥Proceedings of the Visualization 91. Los Alamitos: IEEE, 1991: 284-291．
［11］ ROBERTSON G G, MACKINLAY J D, CARD S K. Cone trees: animated 3D visualizations of hierarchical information ［C］∥ Proceedings of CHI 91 the SIGCHI Conference on Human Factors in Computing Systems. New York: ACM, 1991: 189-194.
［12］ SINDRE G, GULLA B, JOKSTAD H G. Onion graphs: aesthetics and layout ［C］∥ Proceedings of IEEE Symposium on Visual Languages. Los Alamitos: IEEE, 1993: 287-291．
［13］ EADES P. A heuristic for graph drawing ［J］. Congressus Nutnerantiunt, 1984, 42(11): 149-160．
［14］ KAMADA T, KAWAI S. An algorithm for drawing general undirected graphs ［J］. Information Processing Letters (Elsevier), 1989, 31(1): 7-15．
［15］ FRUCHTERMAN T M J, REINGLOD E M. Graph drawing by forcedirected placement ［J］. Software-Practice and Experience (Wiley), 1991, 21(11):1129-1164．
［16］ CHAN D S M, CHUA K S, LECKIE C, et al. Visualization of powerlaw network topologies ［C］∥ Proceedings of the 11th IEEE International Conference on Networks. Los Alamitos: IEEE, 2003: 69-74．
［17］ 吴鹏. 基于本体论的社会关系网络信息可视化研究［D］. 长沙：国防科学技术大学,2011．
WU Peng. Research on Ontology based information visualization of social network \
[D\]. Changsha: National University of Defense Technology, 2011.
［18］ HUA J, HUANG M L, HUANG W D, et al. Forcedirected graph visualization with pre-positioning: improving convergence time and quality of layout ［C］∥2012 16th International Conference on Information Visualization (IV). Los Alamitos: IEEE, 2012: 124-129.
［19］ TAKAYUKI I, CHRIS M, MA K L, et al. A hybrid space-filling and force-directed layout method for visualizing multiplecategory graphs ［C］∥Proceedings of IEEE Pacific Visualization 2009 Symposium. Los Alamitos: IEEE, 2009: 121-128．
［20］ HENRY N, FEKETE J D. MatrixExplorer: a dual-representation system to explore social networks ［J］. IEEE Transactions on Visualization and Computer Graphics, 2006, 12(5): 677-684．
［21］ HENRY N, FEKETE J D, MCGUFFIN M J. NodeTrix: a hybrid visualization of social networks ［J］. IEEE Transactions on Visualization and Computer Graphics, 2007, 13(6): 1302-1309．