An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Beyond streams and graphs: dynamic tensor analysis
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
SCAN: a structural clustering algorithm for networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A scalable pattern mining approach to web graph compression with communities
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Summarizing dynamic Social Tagging Systems
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Getting an overview of a large online social net-work and deciding which communities to join is a challenging task for a new user. We propose a method that maps a large network into a smaller graph with two kinds of nodes: a node of the first kind is representative of a community, a node of the second kind is neighbor to a representative and rejects the semantics of that community. Our approach encompasses a learning and ranking algorithm that derives this smaller graph from the original one, and a visualization algorithm that returns a graph layout to the observer. We report on our results on inspecting the network of a folksonomy.