Clone this wiki locally
Gephi Student Program is an inititive to propose various tasks adapted to computer science students and help them to create Gephi plugins. Proposals amount of work fit to a semester or a quartile and can be achieved during official lectures hours or as free-time projects. Graphs and networks are at the heart in variety of problems, for instance Network Science, Sociology, Data Mining, Statistics, HCI (Human-Computer Interaction) and more. The ability to visualize and manipulate graph structures in a simple way is central to understand these problems.
Gephi is programmed in Java and can be easily extensible by plugins. The possibility of applications and interaction with other tools are infinite. For instance:
- Get graph data from any web API and push streamed graph in real-time
- Try out a new algorithm or metrics
- Build any type of graph from any type of data (words, friends, web-pages, cells, software code, ideas, companies, routers, cities, etc.)
- Try out a new visualization or interaction technique
- Design original user interface
Please add your ideas here
Build a set of text-mining methods to extract graph of words from a speech. Edges are computed when words are present in the same sentence. Optionnaly use NGrams instead of words only.
Integrate TreeMap visualization for hierarchical graphs.
Minimaps help to navigate inside an image or a graph. One existed in Gephi 0.6 but has never been set for 0.7. Adding it would be very useful, especially on handling large graphs.
Mediawiki, Dokuwiki and Drupal Vizualization
Integrate Gephi with Drupal (drupal.org) and/or Mediawiki (mediawiki.org) and/or Dokuwiki (see this thread).
Create small and dynamic bar chart widget in full Java Swing. Bar chart are for instance used in 'range' filters to show the range of values and how much the filter is covering with alpha. A more detailed bar chart is required and could be displayed for instance, if user stay 2 seconds on the small bar chart. This bigger chart would have scroll support and selection of the scale, as well as mouse over on values.
Tools manipulate visually the graph and play with its position, color, size and other visual properties. Tools receives events about mouse movement or node selection and react on it.
Local force-vector: Execute locally a layout algorithm
Selection items on graph with a lasso.
When a graph is loaded without (X, Y) positions for nodes, the position is set as random in a range (-1000, 1000) for both axis. Layout algorithms are predictable - from similar starting positions, a layout algorithm will result in (slightly) the same position at the end. The issue is with a random positioning at the beginning, several layout execution bring different results. For improving structures mental map, it would be interesting to develop a pseudo-random initial positioning algorithm. The algorithm would take nodes identifiers (string) as input and calculate a unique hash key, convertible as (X, Y) positions.
Integrate Web Browser
Try Mondrian integration
Test how possible is the integration of Mondrian components in Gephi, for instance ScatterPlot.
Overlapping Community Detection
Implementation of a clustering method which allows for overlapping communities The clique percolation method is great, see http://cfinder.org and the underlying paper. And http://sites.google.com/site/linegraphs/
Interoperability in formats
Interested in data formats? Work on file formats implementations in Gephi (import and export) to increase stability and interoperability with other tools. Build unit tests to test how robust importers are. Figure out common mistakes in formatting and implement automatic error detection/corrections.
A module dedicated to scientometrics / bibliometrics. The user could provide a file with data formatted in a bibliometric format (say, BibTeX, or ISI) and Gephi would import it and offer a menu of networks to create from it. See Network WorkBench for features inspiration.
- network of co-authors
- network of co-citations
- co-word analysis from the abstracts, or from the titles, etc.
Semantic Analysis Plugin
Many libraries already exists in the Java world. See possibilities to use them to bring direct Semantic networks creation in Gephi. Ideas of features: - to remove stop-words - to identify time-stamps and use them to generate a dynamic graph - to include / exclude languages from the analysis (based on tags) - to compute statistics (frequency of words, frequency of lemmes, burst analysis, etc.)
Gremlin is a graph-based programming language. Create a connector between Gremlin and Gephi by adding an interface to Gephi inside Blueprints.
New clustering algorithm
Implement Link communities in complex networks. link.
The current visualization allows only to have text on a single line. Add the multi-line feature:
- Be able to sets lines manually
- Automatically create lines from a text, find '\n'
- Code for lines positioning. Some code already exists at 'org.gephi.visualization.opengl.text.TextUtils.reflow()'
Implement Hierarchical Clustering: with for example this code. A better dendrograms display could also be done, as the current one is not satisfactory.
Gephi's Ranking module has a set of embedded palette, it would be nice to let user save their own. Inspiration: ColorBrewer
Curved edges arrow
The preview module currently doesn't display arrows for curved edges, only for straight. Adding arrows for curved edges would require a little bit of geometry and integrate the new setting in the current API.
Linear Network Visualization
Implement the new Linear Network Visualization technique in Gephi. You'll be mentored by Martin Krzywinski, the mind behind this idea to implement it in the best way in Gephi. Specifications for version 0.1:
- three axes
- node to axis mapping by connectivity (not user configurable)
- directional graphs: in, out, in/out
- nondirectional graphs: degree 1, 2, >2
- node position on axis by degree, in ascending order outward
- node position can be rank ordered
- axis length can be normalized
Follow the HowTo write a layout tutorial to nicely integrate it in Gephi.
Labeling is essential for graph visualization. But labeling can be quite complex, probably the reason why only simplistic labeling mechanisms are applied most of the time. Gephi should consider implementing better labeling. A possible solution could be to integrate the labeling by Luboschik et al., 2008 (link). Moreover, particularly the interactive graph view of Gephi would benefit from a kind of focus+context labeling. The idea is to show detail labels in the focus (e.g., in the center of the window or directly at the mouse cursor) and to show only a few aggregated labels for the context. Labeling could also be made zoom-dependent, meaning that only few aggregated labels are shown for overviews, and more and more detailed labels fade in as soon as the user zooms into the graph. This way heavy cluttering of labels could be avoided.
Main Flow of Ideas, Analysis of a Network of Citations
Method for analyzing a network of citations, a network derived from a set of patents or scientific papers. The methodology could be find in Verspagen (2005), Mapping Tecnological Trajectories as Patent Citation Networks. A Study on the History of Fuel Cell Research (link) starting from page 99-103. This method construct a main path corresponding to the main flow of ideas.
Layout on GPU
Implement a layout algorithm using GPU.
Given a set of points, draw the alpha shape in Preview. Alpha shapes are better than convex hulls. Example: http://vis4.net/labs/184