org.gephi.statistics.plugin.Hits Maven / Gradle / Ivy
The newest version!
/*
Copyright 2008-2011 Gephi
Authors : Patick J. McSweeney , Sebastien Heymann
Website : http://www.gephi.org
This file is part of Gephi.
DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
Copyright 2011 Gephi Consortium. All rights reserved.
The contents of this file are subject to the terms of either the GNU
General Public License Version 3 only ("GPL") or the Common
Development and Distribution License("CDDL") (collectively, the
"License"). You may not use this file except in compliance with the
License. You can obtain a copy of the License at
http://gephi.org/about/legal/license-notice/
or /cddl-1.0.txt and /gpl-3.0.txt. See the License for the
specific language governing permissions and limitations under the
License. When distributing the software, include this License Header
Notice in each file and include the License files at
/cddl-1.0.txt and /gpl-3.0.txt. If applicable, add the following below the
License Header, with the fields enclosed by brackets [] replaced by
your own identifying information:
"Portions Copyrighted [year] [name of copyright owner]"
If you wish your version of this file to be governed by only the CDDL
or only the GPL Version 3, indicate your decision by adding
"[Contributor] elects to include this software in this distribution
under the [CDDL or GPL Version 3] license." If you do not indicate a
single choice of license, a recipient has the option to distribute
your version of this file under either the CDDL, the GPL Version 3 or
to extend the choice of license to its licensees as provided above.
However, if you add GPL Version 3 code and therefore, elected the GPL
Version 3 license, then the option applies only if the new code is
made subject to such option by the copyright holder.
Contributor(s):
Portions Copyrighted 2011 Gephi Consortium.
*/
package org.gephi.statistics.plugin;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import org.gephi.graph.api.DirectedGraph;
import org.gephi.graph.api.Edge;
import org.gephi.graph.api.EdgeIterable;
import org.gephi.graph.api.Graph;
import org.gephi.graph.api.GraphController;
import org.gephi.graph.api.GraphModel;
import org.gephi.graph.api.Node;
import org.gephi.graph.api.Table;
import org.gephi.statistics.spi.Statistics;
import org.gephi.utils.longtask.spi.LongTask;
import org.gephi.utils.progress.Progress;
import org.gephi.utils.progress.ProgressTicket;
import org.jfree.chart.ChartFactory;
import org.jfree.chart.JFreeChart;
import org.jfree.chart.plot.PlotOrientation;
import org.jfree.data.xy.XYSeries;
import org.jfree.data.xy.XYSeriesCollection;
import org.openide.util.Lookup;
/**
* Ref: Jon M. Kleinberg, Authoritative Sources in a Hyperlinked Environment, in Journal of the ACM 46 (5): 604–632 (1999)
*
* @author pjmcswee
*/
public class Hits implements Statistics, LongTask {
public static final String AUTHORITY = "authority";
public static final String HUB = "hub";
private boolean isCanceled;
private ProgressTicket progress;
private double[] authority;
private double[] hubs;
private boolean useUndirected;
private double epsilon = 0.0001;
public Hits() {
GraphController graphController = Lookup.getDefault().lookup(GraphController.class);
if (graphController != null && graphController.getGraphModel() != null) {
useUndirected = graphController.getGraphModel().isUndirected();
}
}
/**
* @return
*/
public boolean getUndirected() {
return useUndirected;
}
public void setUndirected(boolean pUndirected) {
useUndirected = pUndirected;
}
@Override
public void execute(GraphModel graphModel) {
final Graph graph;
if (useUndirected) {
graph = graphModel.getUndirectedGraphVisible();
} else {
graph = graphModel.getDirectedGraphVisible();
}
execute(graph);
}
public void execute(Graph graph) {
initializeAttributeColunms(graph.getModel());
graph.readLock();
try {
int N = graph.getNodeCount();
authority = new double[N];
hubs = new double[N];
Map indices = createIndicesMap(graph);
calculateHits(graph, hubs, authority, indices, !useUndirected, epsilon);
saveCalculatedValues(indices, authority, hubs);
} finally {
graph.readUnlockAll();
}
}
public void calculateHits(Graph graph, double[] hubValues, double[] authorityValues, Map indices,
boolean isDirected, double eps) {
int N = graph.getNodeCount();
double[] temp_authority = new double[N];
double[] temp_hubs = new double[N];
initializeStartValues(hubValues, authorityValues);
Progress.start(progress);
while (true) {
updateAutorithy(graph, temp_authority, hubValues, isDirected, indices);
updateHub(graph, temp_hubs, temp_authority, isDirected, indices);
boolean done = checkDiff(authorityValues, temp_authority, eps) && checkDiff(hubValues, temp_hubs, eps);
System.arraycopy(temp_authority, 0, authorityValues, 0, N);
System.arraycopy(temp_hubs, 0, hubValues, 0, N);
if ((done) || (isCanceled)) {
break;
}
}
}
private void initializeAttributeColunms(GraphModel graphModel) {
Table nodeTable = graphModel.getNodeTable();
ColumnUtils.cleanUpColumns(nodeTable, new String[] {AUTHORITY, HUB}, Float.class);
if (!nodeTable.hasColumn(AUTHORITY)) {
nodeTable.addColumn(AUTHORITY, "Authority", Float.class, new Float(0));
}
if (!nodeTable.hasColumn(HUB)) {
nodeTable.addColumn(HUB, "Hub", Float.class, new Float(0));
}
}
private void initializeStartValues(double[] hubValues, double[] authorityValues) {
Arrays.fill(authorityValues, 1.0);
Arrays.fill(hubValues, 1.0);
}
void updateAutorithy(Graph graph, double[] newValues, double[] hubValues, boolean isDirected,
Map indices) {
double norm = 0;
for (Node q : indices.keySet()) {
double auth = 0;
EdgeIterable edge_iter;
if (isDirected) {
edge_iter = ((DirectedGraph) graph).getInEdges(q);
} else {
edge_iter = graph.getEdges(q);
}
for (Edge edge : edge_iter) {
if (!edge.isSelfLoop()) {
Node p = graph.getOpposite(q, edge);
auth += hubValues[indices.get(p)];
}
}
newValues[indices.get(q)] = auth;
norm += auth * auth;
if (isCanceled) {
return;
}
}
norm = Math.sqrt(norm);
if (norm > 0) {
for (int i = 0; i < newValues.length; i++) {
newValues[i] = newValues[i] / norm;
}
}
}
void updateHub(Graph graph, double[] newValues, double[] authValues, boolean isDirected,
Map indices) {
double norm = 0;
for (Node p : indices.keySet()) {
double hub = 0;
EdgeIterable edge_iter;
if (isDirected) {
edge_iter = ((DirectedGraph) graph).getOutEdges(p);
} else {
edge_iter = graph.getEdges(p);
}
for (Edge edge : edge_iter) {
if (!edge.isSelfLoop()) {
Node r = graph.getOpposite(p, edge);
hub += authValues[indices.get(r)];
}
}
newValues[indices.get(p)] = hub;
norm += hub * hub;
if (isCanceled) {
return;
}
}
norm = Math.sqrt(norm);
if (norm > 0) {
for (int i = 0; i < newValues.length; i++) {
newValues[i] = newValues[i] / norm;
}
}
}
private boolean checkDiff(double[] oldValues, double[] newValues, double epsilon) {
for (int i = 0; i < oldValues.length; i++) {
if (oldValues[i] > 0 && Math.abs((newValues[i] - oldValues[i]) / oldValues[i]) >= epsilon) {
return false;
}
}
return true;
}
private void saveCalculatedValues(Map indices, double[] nodeAuthority, double[] nodeHubs) {
for (Node n : indices.keySet()) {
int index = indices.get(n);
n.setAttribute(AUTHORITY, (float) nodeAuthority[index]);
n.setAttribute(HUB, (float) nodeHubs[index]);
}
}
public HashMap createIndicesMap(Graph graph) {
HashMap newIndices = new HashMap<>();
int index = 0;
for (Node s : graph.getNodes()) {
newIndices.put(s, index);
index++;
}
return newIndices;
}
/**
* @return
*/
@Override
public String getReport() {
//distribution of hub values
Map distHubs = new HashMap<>();
for (int i = 0; i < hubs.length; i++) {
Double d = hubs[i];
if (distHubs.containsKey(d)) {
Integer v = distHubs.get(d);
distHubs.put(d, v + 1);
} else {
distHubs.put(d, 1);
}
}
//distribution of authority values
Map distAuthorities = new HashMap<>();
for (int i = 0; i < authority.length; i++) {
Double d = authority[i];
if (distAuthorities.containsKey(d)) {
Integer v = distAuthorities.get(d);
distAuthorities.put(d, v + 1);
} else {
distAuthorities.put(d, 1);
}
}
//Distribution of hub series
XYSeries dHubsSeries = ChartUtils.createXYSeries(distHubs, "Hubs");
//Distribution of authority series
XYSeries dAuthsSeries = ChartUtils.createXYSeries(distAuthorities, "Authority");
XYSeriesCollection datasetHubs = new XYSeriesCollection();
datasetHubs.addSeries(dHubsSeries);
XYSeriesCollection datasetAuths = new XYSeriesCollection();
datasetAuths.addSeries(dAuthsSeries);
JFreeChart chart = ChartFactory.createXYLineChart(
"Hubs Distribution",
"Score",
"Count",
datasetHubs,
PlotOrientation.VERTICAL,
true,
false,
false);
chart.removeLegend();
ChartUtils.decorateChart(chart);
ChartUtils.scaleChart(chart, dHubsSeries, true);
String imageFile1 = ChartUtils.renderChart(chart, "hubs.png");
JFreeChart chart2 = ChartFactory.createXYLineChart(
"Authority Distribution",
"Score",
"Count",
datasetAuths,
PlotOrientation.VERTICAL,
true,
false,
false);
chart2.removeLegend();
ChartUtils.decorateChart(chart2);
ChartUtils.scaleChart(chart2, dAuthsSeries, true);
String imageFile2 = ChartUtils.renderChart(chart2, "authorities.png");
String report = " HITS Metric Report
"
+ "
"
+ "
"
+ " Parameters:
Ε = " + this.epsilon
+ "
Results:
"
+ imageFile1 + "
" + imageFile2
+ "
" + " Algorithm:
"
+
"Jon M. Kleinberg, Authoritative Sources in a Hyperlinked Environment, in Journal of the ACM 46 (5): 604–632 (1999)
"
+ " ";
return report;
}
/**
* @return
*/
@Override
public boolean cancel() {
isCanceled = true;
return true;
}
/**
* @param progressTicket
*/
@Override
public void setProgressTicket(ProgressTicket progressTicket) {
progress = progressTicket;
}
/**
* @return
*/
public double getEpsilon() {
return epsilon;
}
/**
* @param eps
*/
public void setEpsilon(double eps) {
epsilon = eps;
}
}