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.
F. Abel, N. Henze, E. Herder, G. Houben, D. Krause, and E. Leonardi. Proceedings of the International Workshop on Architectures and Building Blocks of Web-Based User-Adaptive Systems (WABBWUAS 2010), 609, CEUR-WS.org, (June 2010)
F. Abel, N. Henze, E. Herder, and D. Krause. Proceedings the 6the International Conference on Semantic
Systems, I-SEMANTICS 2010, Graz, Austria, September 1-3,
2010, ACM, (September 2010)
F. Abel, N. Henze, E. Herder, and D. Krause. User Modeling, Adaptation, and Personalization, 18th International
Conference, UMAP 2010, Big Island, HI, USA, June 20-24,
2010. Proceedings, volume 6075 of Lecture Notes in Computer Science, page 16-27. Springer, (2010)
F. Abel, N. Henze, and D. Krause. Proceeding of the 17th ACM conference on Information and knowledge management, page 1429--1430. New York, NY, USA, ACM, (2008)
C. Aggarwal, J. Wolf, K. Wu, and P. Yu. KDD '99: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, page 201--212. New York, NY, USA, ACM, (1999)
H. Aher, P. Shirode, K. Shinde, and A. Jadhav. International Journal on Recent and Innovation Trends in Computing and Communication, 3 (1):
46--51(January 2015)
L. Akoglu, D. Chau, U. Kang, D. Koutra, and C. Faloutsos. Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, page 717--720. New York, NY, USA, ACM, (2012)
R. Andersen, F. Chung, and K. Lang. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, page 475--486. Washington, DC, USA, IEEE Computer Society, (2006)
S. Andrews, and S. Polovina. Proceedings of the 19th International Conference on Conceptual Structures (ICCS 2011), volume 6828 of Lecture Notes in Computer Science, page 63-76. Springer, (2011)
R. Angelova, and G. Weikum. SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, page 485--492. New York, NY, USA, ACM, (2006)
R. Angelova, and G. Weikum. Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, page 485--492. New York, NY, USA, ACM, (2006)
M. Atzmueller, J. Baumeister, and F. Puppe. Proc. of the 19th International Florida Artificial Intelligence Research Society Conference (FLAIRS-2006), pp. 402-407, AAAI Press, USA, (2006)
M. Atzmueller, A. Schmidt, B. Kloepper, and D. Arnu. New Frontiers in Mining Complex Patterns. Postproceedings NFMCP 2016, volume 10312 of LNAI, Berlin/Heidelberg, Germany, Springer Verlag, (2017)
M. Atzmueller, A. Schmidt, B. Kloepper, and D. Arnu. New Frontiers in Mining Complex Patterns. Postproceedings NFMCP 2016, volume 10312 of LNAI, Berlin/Heidelberg, Germany, Springer Verlag, (2017)