The site presents a hierarchical organization for Wikipedia articles with respect to their semantic similarity and provides search and navigation facilities over the hierarchy. The hierarchy is constructed as a recursive division of the English Wikipedia graph into dense subgraphs (graph communities) and can be considered as an extension to the Wikipedia category structure. Unlike Wikipedia categories that are primarily authored by humans, the community hierarchy is fully automatic, purely link-based and reflects the global link structure of Wikipedia.
Visualization of graph data is incredibly challenging, particularly when it comes to extremely large, scale-free graphs and social networks. A few simple searches on the Web and you will find some mesmerizing and very cool images. Perhaps the most cited...
C. Tantipathananandh, T. Berger-Wolf, and D. Kempe. KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, page 717--726. New York, NY, USA, ACM, (2007)
H. Kim, J. Choi, D. Choi, H. Choi, and P. Kim. Proceedings of the 2012 ACM Research in Applied Computation Symposium, page 310--315. New York, NY, USA, ACM, (2012)
P. Symeonidis, A. Nanopoulos, and Y. Manolopoulos. RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems, page 43--50. New York, NY, USA, ACM, (2008)
A. Lancichinetti, and S. Fortunato. (2009)cite arxiv:0908.1062
Comment: 12 pages, 8 figures. The software to compute the values of our
general normalized mutual information will be soon available at
http://santo.fortunato.googlepages.com/inthepress2.