未验证 提交 8ce9436f 编写于 作者: M Mathieu Bastian 提交者: GitHub

Merge pull request #2431 from gephi/statistical-inference

Add new community detection algorithm: Statistical inference
......@@ -176,6 +176,8 @@ public class StatisticsPanel extends JPanel {
Map<String, StatisticsCategory> cats = new LinkedHashMap<>();
cats.put(StatisticsUI.CATEGORY_NETWORK_OVERVIEW,
new StatisticsCategory(StatisticsUI.CATEGORY_NETWORK_OVERVIEW, 100));
cats.put(StatisticsUI.CATEGORY_COMMUNITY_DETECTION,
new StatisticsCategory(StatisticsUI.CATEGORY_COMMUNITY_DETECTION, 150));
cats.put(StatisticsUI.CATEGORY_NODE_OVERVIEW, new StatisticsCategory(StatisticsUI.CATEGORY_NODE_OVERVIEW, 200));
cats.put(StatisticsUI.CATEGORY_EDGE_OVERVIEW, new StatisticsCategory(StatisticsUI.CATEGORY_EDGE_OVERVIEW, 300));
cats.put(StatisticsUI.CATEGORY_DYNAMIC, new StatisticsCategory(StatisticsUI.CATEGORY_DYNAMIC, 400));
......
......@@ -64,6 +64,8 @@ public interface StatisticsUI {
String CATEGORY_NETWORK_OVERVIEW =
NbBundle.getMessage(StatisticsUI.class, "StatisticsUI.category.networkOverview");
String CATEGORY_COMMUNITY_DETECTION =
NbBundle.getMessage(StatisticsUI.class, "StatisticsUI.category.communityDetection");
String CATEGORY_NODE_OVERVIEW =
NbBundle.getMessage(StatisticsUI.class, "StatisticsUI.category.nodeOverview");
String CATEGORY_EDGE_OVERVIEW =
......@@ -128,6 +130,7 @@ public interface StatisticsUI {
* <li>{@link StatisticsUI#CATEGORY_NODE_OVERVIEW}</li>
* <li>{@link StatisticsUI#CATEGORY_EDGE_OVERVIEW}</li>
* <li>{@link StatisticsUI#CATEGORY_DYNAMIC}</li></ul>
* <li>{@link StatisticsUI#CATEGORY_COMMUNITY_DETECTION}</li></ul>
* Returns a custom String for defining a new category.
*
* @return this statistics' category
......
StatisticsUI.category.networkOverview= Network Overview
StatisticsUI.category.nodeOverview = Node Overview
StatisticsUI.category.edgeOverview = Edge Overview
StatisticsUI.category.dynamic = Dynamic
\ No newline at end of file
StatisticsUI.category.dynamic = Dynamic
StatisticsUI.category.communityDetection = Community Detection
\ No newline at end of file
/*
Copyright 2008-2011 Gephi
Authors : Mathieu Jacomy, Tiago Peixoto
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.builder;
import org.gephi.statistics.plugin.StatisticalInferenceClustering;
import org.gephi.statistics.spi.Statistics;
import org.gephi.statistics.spi.StatisticsBuilder;
import org.openide.util.NbBundle;
import org.openide.util.lookup.ServiceProvider;
/**
* @author Mathieu Jacomy & Tiago Peixoto
*/
@ServiceProvider(service = StatisticsBuilder.class)
public class StatisticalInferenceBuilder implements StatisticsBuilder {
@Override
public String getName() {
return NbBundle.getMessage(StatisticalInferenceBuilder.class, "StatisticalInference.name");
}
@Override
public Statistics getStatistics() {
return new StatisticalInferenceClustering();
}
@Override
public Class<? extends Statistics> getStatisticsClass() {
return StatisticalInferenceClustering.class;
}
}
......@@ -3,6 +3,7 @@ ClusteringCoefficent.name=Clustering Coefficient
GraphDistance.name=Graph Distance
DegreeDistribution.name=Degree Distribution
Modularity.name=Modularity
StatisticalInference.name=Stat. Inference Clustering
PageRank.name=Page Rank
Hits.name=HITS
InOutDegree.name=InOut Degree
......
<?xml version="1.0" encoding="UTF-8"?>
<graphml xmlns="http://graphml.graphdrawing.org/xmlns"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://graphml.graphdrawing.org/xmlns http://graphml.graphdrawing.org/xmlns/1.0/graphml.xsd">
<!-- property keys -->
<key id="key0" for="graph" attr.name="dl" attr.type="float" />
<key id="key1" for="node" attr.name="partition" attr.type="int" />
<graph id="G" edgedefault="undirected" parse.nodeids="canonical" parse.edgeids="canonical" parse.order="nodesfirst">
<!-- graph properties -->
<data key="key0">150.10880360418344</data>
<!-- vertices -->
<node id="n0">
<data key="key1">0</data>
</node>
<node id="n1">
<data key="key1">0</data>
</node>
<node id="n2">
<data key="key1">0</data>
</node>
<node id="n3">
<data key="key1">0</data>
</node>
<node id="n4">
<data key="key1">0</data>
</node>
<node id="n5">
<data key="key1">1</data>
</node>
<node id="n6">
<data key="key1">1</data>
</node>
<node id="n7">
<data key="key1">1</data>
</node>
<node id="n8">
<data key="key1">1</data>
</node>
<node id="n9">
<data key="key1">1</data>
</node>
<node id="n10">
<data key="key1">2</data>
</node>
<node id="n11">
<data key="key1">2</data>
</node>
<node id="n12">
<data key="key1">2</data>
</node>
<node id="n13">
<data key="key1">2</data>
</node>
<node id="n14">
<data key="key1">2</data>
</node>
<node id="n15">
<data key="key1">3</data>
</node>
<node id="n16">
<data key="key1">3</data>
</node>
<node id="n17">
<data key="key1">3</data>
</node>
<node id="n18">
<data key="key1">3</data>
</node>
<node id="n19">
<data key="key1">3</data>
</node>
<node id="n20">
<data key="key1">4</data>
</node>
<node id="n21">
<data key="key1">4</data>
</node>
<node id="n22">
<data key="key1">4</data>
</node>
<node id="n23">
<data key="key1">4</data>
</node>
<node id="n24">
<data key="key1">4</data>
</node>
<!-- edges -->
<edge id="e0" source="n0" target="n1">
</edge>
<edge id="e1" source="n0" target="n2">
</edge>
<edge id="e2" source="n0" target="n3">
</edge>
<edge id="e3" source="n0" target="n4">
</edge>
<edge id="e4" source="n0" target="n5">
</edge>
<edge id="e5" source="n1" target="n2">
</edge>
<edge id="e6" source="n1" target="n3">
</edge>
<edge id="e7" source="n1" target="n4">
</edge>
<edge id="e8" source="n2" target="n3">
</edge>
<edge id="e9" source="n2" target="n4">
</edge>
<edge id="e10" source="n3" target="n4">
</edge>
<edge id="e11" source="n5" target="n6">
</edge>
<edge id="e12" source="n5" target="n7">
</edge>
<edge id="e13" source="n5" target="n8">
</edge>
<edge id="e14" source="n5" target="n9">
</edge>
<edge id="e15" source="n5" target="n10">
</edge>
<edge id="e16" source="n6" target="n7">
</edge>
<edge id="e17" source="n6" target="n8">
</edge>
<edge id="e18" source="n6" target="n9">
</edge>
<edge id="e19" source="n7" target="n8">
</edge>
<edge id="e20" source="n7" target="n9">
</edge>
<edge id="e21" source="n8" target="n9">
</edge>
<edge id="e22" source="n10" target="n11">
</edge>
<edge id="e23" source="n10" target="n12">
</edge>
<edge id="e24" source="n10" target="n13">
</edge>
<edge id="e25" source="n10" target="n14">
</edge>
<edge id="e26" source="n10" target="n15">
</edge>
<edge id="e27" source="n11" target="n12">
</edge>
<edge id="e28" source="n11" target="n13">
</edge>
<edge id="e29" source="n11" target="n14">
</edge>
<edge id="e30" source="n12" target="n13">
</edge>
<edge id="e31" source="n12" target="n14">
</edge>
<edge id="e32" source="n13" target="n14">
</edge>
<edge id="e33" source="n15" target="n16">
</edge>
<edge id="e34" source="n15" target="n17">
</edge>
<edge id="e35" source="n15" target="n18">
</edge>
<edge id="e36" source="n15" target="n19">
</edge>
<edge id="e37" source="n15" target="n20">
</edge>
<edge id="e38" source="n16" target="n17">
</edge>
<edge id="e39" source="n16" target="n18">
</edge>
<edge id="e40" source="n16" target="n19">
</edge>
<edge id="e41" source="n17" target="n18">
</edge>
<edge id="e42" source="n17" target="n19">
</edge>
<edge id="e43" source="n18" target="n19">
</edge>
<edge id="e44" source="n20" target="n21">
</edge>
<edge id="e45" source="n20" target="n22">
</edge>
<edge id="e46" source="n20" target="n23">
</edge>
<edge id="e47" source="n20" target="n24">
</edge>
<edge id="e48" source="n21" target="n22">
</edge>
<edge id="e49" source="n21" target="n23">
</edge>
<edge id="e50" source="n21" target="n24">
</edge>
<edge id="e51" source="n22" target="n23">
</edge>
<edge id="e52" source="n22" target="n24">
</edge>
<edge id="e53" source="n23" target="n24">
</edge>
</graph>
</graphml>
<?xml version="1.0" encoding="UTF-8"?>
<graphml xmlns="http://graphml.graphdrawing.org/xmlns"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://graphml.graphdrawing.org/xmlns http://graphml.graphdrawing.org/xmlns/1.0/graphml.xsd">
<!-- property keys -->
<key id="key0" for="graph" attr.name="dl" attr.type="float" />
<key id="key1" for="node" attr.name="partition" attr.type="int" />
<graph id="G" edgedefault="undirected" parse.nodeids="canonical" parse.edgeids="canonical" parse.order="nodesfirst">
<!-- graph properties -->
<data key="key0">229.04187438186472</data>
<!-- vertices -->
<node id="n0">
<data key="key1">1</data>
</node>
<node id="n1">
<data key="key1">1</data>
</node>
<node id="n2">
<data key="key1">1</data>
</node>
<node id="n3">
<data key="key1">0</data>
</node>
<node id="n4">
<data key="key1">2</data>
</node>
<node id="n5">
<data key="key1">0</data>
</node>
<node id="n6">
<data key="key1">1</data>
</node>
<node id="n7">
<data key="key1">0</data>
</node>
<node id="n8">
<data key="key1">1</data>
</node>
<node id="n9">
<data key="key1">2</data>
</node>
<node id="n10">
<data key="key1">2</data>
</node>
<node id="n11">
<data key="key1">0</data>
</node>
<node id="n12">
<data key="key1">1</data>
</node>
<node id="n13">
<data key="key1">1</data>
</node>
<node id="n14">
<data key="key1">3</data>
</node>
<node id="n15">
<data key="key1">0</data>
</node>
<node id="n16">
<data key="key1">0</data>
</node>
<node id="n17">
<data key="key1">2</data>
</node>
<node id="n18">
<data key="key1">2</data>
</node>
<node id="n19">
<data key="key1">1</data>
</node>
<node id="n20">
<data key="key1">0</data>
</node>
<node id="n21">
<data key="key1">1</data>
</node>
<node id="n22">
<data key="key1">2</data>
</node>
<node id="n23">
<data key="key1">0</data>
</node>
<node id="n24">
<data key="key1">2</data>
</node>
<node id="n25">
<data key="key1">0</data>
</node>
<node id="n26">
<data key="key1">0</data>
</node>
<!-- edges -->
<edge id="e0" source="n0" target="n6">
</edge>
<edge id="e1" source="n0" target="n13">
</edge>
<edge id="e2" source="n0" target="n1">
</edge>
<edge id="e3" source="n0" target="n2">
</edge>
<edge id="e4" source="n0" target="n8">
</edge>
<edge id="e5" source="n0" target="n14">
</edge>
<edge id="e6" source="n0" target="n19">
</edge>
<edge id="e7" source="n1" target="n2">
</edge>
<edge id="e8" source="n1" target="n6">
</edge>
<edge id="e9" source="n1" target="n12">
</edge>
<edge id="e10" source="n1" target="n13">
</edge>
<edge id="e11" source="n1" target="n14">
</edge>
<edge id="e12" source="n1" target="n8">
</edge>
<edge id="e13" source="n1" target="n19">
</edge>
<edge id="e14" source="n2" target="n6">
</edge>
<edge id="e15" source="n2" target="n13">
</edge>
<edge id="e16" source="n2" target="n8">
</edge>
<edge id="e17" source="n2" target="n14">
</edge>
<edge id="e18" source="n2" target="n19">
</edge>
<edge id="e19" source="n3" target="n5">
</edge>
<edge id="e20" source="n3" target="n15">
</edge>
<edge id="e21" source="n3" target="n26">
</edge>
<edge id="e22" source="n3" target="n7">
</edge>
<edge id="e23" source="n3" target="n11">
</edge>
<edge id="e24" source="n4" target="n7">
</edge>
<edge id="e25" source="n4" target="n9">
</edge>
<edge id="e26" source="n4" target="n10">
</edge>
<edge id="e27" source="n4" target="n14">
</edge>
<edge id="e28" source="n4" target="n17">
</edge>
<edge id="e29" source="n4" target="n22">
</edge>
<edge id="e30" source="n4" target="n24">
</edge>
<edge id="e31" source="n4" target="n18">
</edge>
<edge id="e32" source="n5" target="n7">
</edge>
<edge id="e33" source="n5" target="n14">
</edge>
<edge id="e34" source="n5" target="n23">
</edge>
<edge id="e35" source="n5" target="n25">
</edge>
<edge id="e36" source="n5" target="n11">
</edge>
<edge id="e37" source="n5" target="n15">
</edge>
<edge id="e38" source="n5" target="n26">
</edge>
<edge id="e39" source="n6" target="n13">
</edge>
<edge id="e40" source="n6" target="n8">
</edge>
<edge id="e41" source="n6" target="n14">
</edge>
<edge id="e42" source="n6" target="n19">
</edge>
<edge id="e43" source="n7" target="n9">
</edge>
<edge id="e44" source="n7" target="n10">
</edge>
<edge id="e45" source="n7" target="n14">
</edge>
<edge id="e46" source="n7" target="n15">
</edge>
<edge id="e47" source="n7" target="n16">
</edge>
<edge id="e48" source="n7" target="n17">
</edge>
<edge id="e49" source="n7" target="n20">
</edge>
<edge id="e50" source="n7" target="n22">
</edge>
<edge id="e51" source="n7" target="n25">
</edge>
<edge id="e52" source="n7" target="n26">
</edge>
<edge id="e53" source="n7" target="n8">
</edge>
<edge id="e54" source="n7" target="n11">
</edge>
<edge id="e55" source="n7" target="n12">
</edge>
<edge id="e56" source="n7" target="n18">
</edge>
<edge id="e57" source="n7" target="n19">
</edge>
<edge id="e58" source="n7" target="n21">
</edge>
<edge id="e59" source="n7" target="n23">
</edge>
<edge id="e60" source="n7" target="n24">
</edge>
<edge id="e61" source="n8" target="n12">
</edge>
<edge id="e62" source="n8" target="n13">
</edge>
<edge id="e63" source="n8" target="n14">
</edge>
<edge id="e64" source="n8" target="n19">
</edge>
<edge id="e65" source="n8" target="n21">
</edge>
<edge id="e66" source="n9" target="n10">
</edge>
<edge id="e67" source="n9" target="n17">
</edge>
<edge id="e68" source="n9" target="n22">
</edge>
<edge id="e69" source="n9" target="n14">
</edge>
<edge id="e70" source="n9" target="n18">
</edge>
<edge id="e71" source="n9" target="n24">
</edge>
<edge id="e72" source="n10" target="n17">
</edge>
<edge id="e73" source="n10" target="n22">
</edge>
<edge id="e74" source="n10" target="n14">
</edge>
<edge id="e75" source="n10" target="n18">
</edge>
<edge id="e76" source="n10" target="n24">
</edge>
<edge id="e77" source="n11" target="n15">
</edge>
<edge id="e78" source="n11" target="n16">
</edge>
<edge id="e79" source="n11" target="n20">
</edge>
<edge id="e80" source="n11" target="n26">
</edge>
<edge id="e81" source="n12" target="n19">
</edge>
<edge id="e82" source="n12" target="n21">
</edge>
<edge id="e83" source="n13" target="n14">
</edge>
<edge id="e84" source="n13" target="n19">
</edge>
<edge id="e85" source="n14" target="n17">
</edge>
<edge id="e86" source="n14" target="n22">
</edge>
<edge id="e87" source="n14" target="n25">
</edge>
<edge id="e88" source="n14" target="n18">
</edge>
<edge id="e89" source="n14" target="n19">
</edge>
<edge id="e90" source="n14" target="n23">
</edge>
<edge id="e91" source="n14" target="n24">
</edge>
<edge id="e92" source="n15" target="n26">
</edge>
<edge id="e93" source="n16" target="n20">
</edge>
<edge id="e94" source="n17" target="n18">
</edge>
<edge id="e95" source="n17" target="n22">
</edge>
<edge id="e96" source="n17" target="n24">
</edge>
<edge id="e97" source="n18" target="n22">
</edge>
<edge id="e98" source="n18" target="n24">
</edge>
<edge id="e99" source="n19" target="n21">
</edge>
<edge id="e100" source="n22" target="n24">
</edge>
<edge id="e101" source="n23" target="n25">
</edge>
</graph>
</graphml>
<?xml version="1.0" encoding="UTF-8"?>
<graphml xmlns="http://graphml.graphdrawing.org/xmlns"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://graphml.graphdrawing.org/xmlns http://graphml.graphdrawing.org/xmlns/1.0/graphml.xsd">
<!-- property keys -->
<key id="key0" for="graph" attr.name="dl" attr.type="float" />
<key id="key1" for="node" attr.name="partition" attr.type="int" />
<graph id="G" edgedefault="undirected" parse.nodeids="canonical" parse.edgeids="canonical" parse.order="nodesfirst">
<!-- graph properties -->
<data key="key0">43.479327707987835</data>
<!-- vertices -->
<node id="n0">
<data key="key1">0</data>
</node>
<node id="n1">
<data key="key1">0</data>
</node>
<node id="n2">
<data key="key1">0</data>
</node>
<node id="n3">
<data key="key1">0</data>
</node>
<node id="n4">
<data key="key1">0</data>
</node>
<node id="n5">
<data key="key1">1</data>
</node>
<node id="n6">
<data key="key1">1</data>
</node>
<node id="n7">
<data key="key1">1</data>
</node>
<node id="n8">
<data key="key1">1</data>
</node>
<node id="n9">
<data key="key1">1</data>
</node>
<!-- edges -->
<edge id="e0" source="n0" target="n1">
</edge>
<edge id="e1" source="n0" target="n2">
</edge>
<edge id="e2" source="n0" target="n3">
</edge>
<edge id="e3" source="n0" target="n4">
</edge>
<edge id="e4" source="n1" target="n2">
</edge>
<edge id="e5" source="n1" target="n3">
</edge>
<edge id="e6" source="n1" target="n4">
</edge>
<edge id="e7" source="n2" target="n3">
</edge>
<edge id="e8" source="n2" target="n4">
</edge>
<edge id="e9" source="n3" target="n4">
</edge>
<edge id="e10" source="n5" target="n6">
</edge>
<edge id="e11" source="n5" target="n7">
</edge>
<edge id="e12" source="n5" target="n8">
</edge>
<edge id="e13" source="n5" target="n9">
</edge>
<edge id="e14" source="n6" target="n7">
</edge>
<edge id="e15" source="n6" target="n8">
</edge>
<edge id="e16" source="n6" target="n9">
</edge>
<edge id="e17" source="n7" target="n8">
</edge>
<edge id="e18" source="n7" target="n9">
</edge>
<edge id="e19" source="n8" target="n9">
</edge>
</graph>
</graphml>
......@@ -104,7 +104,7 @@ public class ModularityUI implements StatisticsUI {
@Override
public String getCategory() {
return StatisticsUI.CATEGORY_NETWORK_OVERVIEW;
return StatisticsUI.CATEGORY_COMMUNITY_DETECTION;
}
@Override
......
/*
Copyright 2008-2010 Gephi
Authors : Mathieu Bastian <mathieu.bastian@gephi.org>
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.ui.statistics.plugin;
import java.text.DecimalFormat;
import javax.swing.JPanel;
import org.gephi.statistics.plugin.StatisticalInferenceClustering;
import org.gephi.statistics.spi.Statistics;
import org.gephi.statistics.spi.StatisticsUI;
import org.openide.util.NbBundle;
import org.openide.util.lookup.ServiceProvider;
@ServiceProvider(service = StatisticsUI.class)
public class StatisticalInferenceClusteringUI implements StatisticsUI {
StatisticalInferenceClustering descriptionLength;
@Override
public JPanel getSettingsPanel() {
return null;
}
@Override
public void setup(Statistics statistics) {
this.descriptionLength = (StatisticalInferenceClustering) statistics;
}
@Override
public void unsetup() {
descriptionLength = null;
}
@Override
public Class<? extends Statistics> getStatisticsClass() {
return StatisticalInferenceClustering.class;
}
@Override
public String getValue() {
DecimalFormat df = new DecimalFormat("###.###");
return "" + df.format(descriptionLength.getDescriptionLength());
}
@Override
public String getDisplayName() {
return NbBundle.getMessage(getClass(), "StatisticalInferenceClusteringUI.name");
}
@Override
public String getCategory() {
return StatisticsUI.CATEGORY_COMMUNITY_DETECTION;
}
@Override
public int getPosition() {
return 600;
}
@Override
public String getShortDescription() {
return NbBundle.getMessage(getClass(), "StatisticalInferenceClusteringUI.shortDescription");
}
}
......@@ -78,6 +78,8 @@ InOutDegreeUI.name=Average Degree
InOutDegreeUI.shortDescription=Average Degree
ModularityUI.name=Modularity
ModularityUI.shortDescription=Community detection algorithm.
StatisticalInferenceClusteringUI.name=Statistical Inference
StatisticalInferenceClusteringUI.shortDescription=Community detection algorithm.
PageRankUI.name=PageRank
PageRankUI.shortDescription=Ranks nodes "pages" according to how often a user following links will non-randomly reach the node "page".
PathLengthUI.name=Avg. Path Length
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册