CFinder offers a fast and efficient method for clustering data represented by large graphs, such as genetic or social networks and microarray data. CFinder is a free software for finding overlapping dense groups of nodes in networks, based on the Clique Percolation Method, CPM, of Palla et. al. Nature (2005).
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...
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.
G. Flake, S. Lawrence, and C. Giles. Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD \textquotesingle00, ACM Press, (2000)
J. Leskovec, K. Lang, and M. Mahoney. Proceedings of the 19th international conference on World wide web, page 631--640. New York, NY, USA, ACM, (2010)
N. Du, B. Wang, B. Wu, and Y. Wang. Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology-Volume 01, page 176--179. IEEE Computer Society, (2008)