If you use the code, please kindly cite the following paper:
Yankai Lin, Zhiyuan Liu, Maosong Sun, Yang Liu, Xuan Zhu. Learning Entity and Relation Embeddings for Knowledge Graph Completion. The 29th AAAI Conference on Artificial Intelligence (AAAI'15).
So, a while ago, I’ve decided to code a library to plot some information I had. The idea was to create simple graphics in a way they would be easy to create, beautiful and good to present to people with no or few backgrounds on math and computers.
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.
What else is there to say? This code is available under the gpl, so follow those terms. Send back improvements, extensions, and contributions to code@creativesynthesis.net. Otherwise start by modifying the simple.xml file and using this html page.
I. Hubner, E. Deeds, and E. Shakhnovich. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 103 (47):
17747-17752(November 2006)
D. Eppstein, and J. Wang. Symposium on Discrete Algorithms: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, 7 (09):
228--229(2001)
W. Bielecki, T. Klimek, and K. Trifunovic. Electronic Notes in Discrete Mathematics, (2009)International Conference on Graph Theory and its Applications.