ClusterViz is a software to visualize the clustering process using the family of k-means algorithms. The program is free software under the GNU General Public License (GPL). ClusterViz allows to cluster data while visualizing an up to three dimensional projection. The clustering process is visualized using OpenGL. As clustering algorithms the family of k-means algorithms is implemented, including mixture models.
Neo4j is a graph database. It is an embedded, disk-based, fully transactional Java persistence engine that stores data structured in graphs rather than in tables. A graph (mathematical lingo for a network) is a flexible data structure that allows a more agile and rapid style of development.
You can think of Neo4j as a high-performance graph engine with all the features of a mature and robust database. The programmer works with an object-oriented, flexible network structure rather than with strict and static tables — yet enjoys all the benefits of a fully transactional, enterprise-strength database.
Neo4j is released under a dual free software/commercial license model (which basically means that it’s “open source” but if you’re interested in using it in commercially, then you must buy a commercial license).
Neo4j has been in commercial development for 8 years and in production for over 5 years. It is a mature and robust graph database that provides:
* an intuitive graph-oriented model for data representation. Instead of static and rigid tables, rows and columns, you work with a flexible graph network consisting of nodes, relationships and properties.
* a disk-based, native storage manager completely optimized for storing graph structures for maximum performance and scalability.
* massive scalability. Neo4j can handle graphs of several billion nodes/relationships/properties on a single machine and can be sharded to scale out across multiple machines.
* a powerful traversal framework for high-speed traversals in the node space.
* a small footprint. Neo4j is a single <500k jar with one dependency (the Java Transaction API).
* a simple and convenient object-oriented API.
* optional layers to expose Neo4j as an RDF store, i.e. easily inject / extract data as RDF, express meta model semantics using OWL and query the node space using SPARQL. When it comes to scalability numbers, remember that several triples are usually mapped to a single node. (currently being developed under the umbrella of the OpenMetadir project)
JUNG — the Java Universal Network/Graph Framework--is a software library that provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network. It is written in Java, which allows JUNG-based applications to make use of the extensive built-in capabilities of the Java API, as well as those of other existing third-party Java libraries.
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...
Der Herkules ist eine Kupferstatue des antiken Herakles (lat. Hercules, eingedeutscht Herkules) im Bergpark Wilhelmshöhe in Kassel (Nordhessen, Deutschland). Die Statue, die als ein Wahrzeichen der Stadt Kassel gilt, befindet sich an der Spitze einer Pyramide, die auf dem Oktogon, dem Riesenschloss steht. Heute steht der Name „Herkules“ nicht nur für das Standbild, sondern das gesamte Bauwerk, welches auch den Ausgangspunkt der sommerlichen Wasserspiele im Bergpark bildet. Das Oktogon und der
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.
This monograph is an intertwined tale of eigenvalues and their use in unlocking a thousand secrets about graphs. The stories will be told --- how the spectrum reveals fundamental properties of a graph, how spectral graph theory links the discrete universe to the continuous one through geometric, analytic and algebraic techniques, and how, through eigenvalues, theory and applications in communications and computer science come together in symbiotic harmony....
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.