Line 1: | Line 1: | ||
= Rhea Graph Analytic Tool = | = Rhea Graph Analytic Tool = | ||
− | This program is for [[Analysis_Bounty|Analysis Bounty]]. | + | This program is for [[Analysis_Bounty|Analysis Bounty]]. This is a Java program that analyzes the data of a [http://www.mediawiki.org/wiki/MediaWiki MediaWiki] database. More specifically, it constructs the author network that can be represented as a graph. The vertices of a graph are authors and the edge exists between two authors if they wrote the same page. This program shows the up-to-date information because it instantaneously analyzes the database when the program is launched. In addition, this program has functionalities that can randomly generate several types of graph and import the user-generated graphs. |
== How to run? == | == How to run? == | ||
This program uses Java Web Start. Thus, it is required to install Java. You can check whether Java is working on my computer or not on [http://www.java.com/en/download/help/testvm.xml here]. If you can use [[About Assimi|Assimi]], then there must be no problem. | This program uses Java Web Start. Thus, it is required to install Java. You can check whether Java is working on my computer or not on [http://www.java.com/en/download/help/testvm.xml here]. If you can use [[About Assimi|Assimi]], then there must be no problem. | ||
− | |||
− | [ | + | Please click [https://www.projectrhea.org/rhea/extensions/rhea_softwares/anaytics/dist/launch.jnlp here] to launch the program. It takes time to load the program at first. Please wait until the analysis of Rhea is finished and represented in visual components; chats and graph. |
+ | |||
+ | == Source code == | ||
+ | You can download the complete source code [https://www.projectrhea.org/rhea/extensions/rhea_softwares/anaytics/SocialNetworkWebStart.rar here]. | ||
+ | |||
+ | Note that Rhea Graph Analytic Tool is licensed under the terms of the [http://www.gnu.org/licenses/gpl.html GPL version 3]. | ||
== How to use? == | == How to use? == | ||
− | This program is based on coauthor network. The nodes of a graph | + | This program is based on coauthor network. The nodes of a graph are authors and the edges of a graph is an occurrence of writing same page. There are six tabs; Summary for Graph, Graph, Summary for Component, Charts for Component, Matrix for Component, and Growth of Rhea. |
* Component Selection: select the component to show the result of analysis. | * Component Selection: select the component to show the result of analysis. |
Revision as of 04:59, 21 March 2011
Contents
Rhea Graph Analytic Tool
This program is for Analysis Bounty. This is a Java program that analyzes the data of a MediaWiki database. More specifically, it constructs the author network that can be represented as a graph. The vertices of a graph are authors and the edge exists between two authors if they wrote the same page. This program shows the up-to-date information because it instantaneously analyzes the database when the program is launched. In addition, this program has functionalities that can randomly generate several types of graph and import the user-generated graphs.
How to run?
This program uses Java Web Start. Thus, it is required to install Java. You can check whether Java is working on my computer or not on here. If you can use Assimi, then there must be no problem.
Please click here to launch the program. It takes time to load the program at first. Please wait until the analysis of Rhea is finished and represented in visual components; chats and graph.
Source code
You can download the complete source code here.
Note that Rhea Graph Analytic Tool is licensed under the terms of the GPL version 3.
How to use?
This program is based on coauthor network. The nodes of a graph are authors and the edges of a graph is an occurrence of writing same page. There are six tabs; Summary for Graph, Graph, Summary for Component, Charts for Component, Matrix for Component, and Growth of Rhea.
- Component Selection: select the component to show the result of analysis.
- The number in the parenthesis is the order of a component.
- This is used for three tabs; Summary for Component, Charts for Component, and Matrix for Component.
- (Tab) Summary for Graph
- Order: the number of nodes in the graph
- Size: the number of edges in the graph
- # of isolated node: the number of nodes that has no edge
- (Tab) Graph
- Redraw: redraw the graph
- Graph Layout
- Random: place nodes randomly
- Organic
- Circle
- Partition
- Stack
- +: Zoom in
- -: Zoom out
- (Tab) Summary for Component
- Order: the number of nodes in the component
- Size: the number of edges in the component
- Radius: the minimum eccentricity
- Diameter: the maximum eccentricity
- Average distance
- Max degree
- Min degree
- Average degree
- Coeff(degree, avg distance)
- Coeff(degree, eccentricity)
- Coeff(avg degree, eccentricity)
- (Tab) Charts for Component
- (Tab) Matrix for Component
- The scrollbars may not appear at first. By resizing the window, you can make use scrollbars.
- (Tab) Growth of Rhea
- It is recommended to use a "month" as a time interval for cumulative charts because of performance issue.
- Operation ---> Reconnect to Rhea
- Operation ---> Open File
- File: file name to open
- Year: the time of interest
- <=: less than or equal to "Year" (if not, equal to "Year")
- Example File: the first column is for the first node, the second column is for the second node, and the third column is for the "Year"
4 7 0 8 7 0 12 7 0 8 1 0 6 4 0 4 14 0
- Simulation ---> G(n,m)
- Simulation ---> G(n,p)
- Simulation ---> Random Regular
- Simulation ---> Preferential attachment
Questions or Comments
- Write a question or a comment here
- answer will be written here
- write another question or a comment here
- answer will be written here.