A pre-relational databases datamodel. "Preceeded" by the relational model since the flexibility of this makes it hard to work with. Now re-invented in RDF :)
Graph mining refers to extracting knowledge from massive graphs. The data sets of telephone calls we see at AT&T can be viewed as a single graph, with several hundred million phone numbers as nodes, and calls between phone numbers as edges. It is a giant social network, like an internet connections graph or a rich citation network.
Gephi is an open-source software for visualizing and analyzing large networks graphs. Gephi uses a 3D render engine to display graphs in real-time and speed up the exploration. Use Gephi to explore, analyse, spatialise, filter, cluterize, manipulate and export all types of graphs.
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.
Gephi is an open-source software for visualizing and analyzing large networks graphs. Gephi uses a 3D render engine to display graphs in real-time and speed up the exploration. Use Gephi to explore, analyse, spatialise, filter, cluterize, manipulate and export all types of graphs.
D. Liben-Nowell, and J. Kleinberg. CIKM '03: Proceedings of the twelfth international conference on Information and knowledge management, page 556--559. New York, NY, USA, ACM Press, (2003)
N. Peng, H. Poon, C. Quirk, K. Toutanova, and W. Yih. ACL, (2017)cite arxiv:1708.03743Comment: Conditional accepted by TACL in December 2016; published in April 2017; presented at ACL in August 2017.