docs/algo/sona/slpa_sona_en.md
SLPA (Speaker-listener Label Propagation Algorithm) was proposed by Jierui Xie et al. in 2011. It is an overlapping community discovery algorithm, which involves an important threshold parameter r, which can be degenerated into a non-overlapping type through proper selection of r. . It is an extension of the LPA algorithm (label propagation algorithm). The discovery of the SLAP overlapping community mainly believes that each node has not only one label, but one label is added for each iteration, and finally a certain strategy is used to filter.
0 1 0.3
2 1 0.5
3 1 0.1
3 2 0.7
4 1 0.3
Among them, the meanings of the three columns of data from left to right are the source node ID, the end node ID, and the edge weight (it can be empty if there is no weight)
tab, space, etc.input=hdfs://my-hdfs/data
output=hdfs://my-hdfs/output
source ./spark-on-angel-env.sh
$SPARK_HOME/bin/spark-submit \
--master yarn-cluster\
--conf spark.ps.instances=1 \
--conf spark.ps.cores=1 \
--conf spark.ps.jars=$SONA_ANGEL_JARS \
--conf spark.ps.memory=10g \
--name "slpa angel" \
--jars $SONA_SPARK_JARS \
--driver-memory 5g \
--num-executors 1 \
--executor-cores 4 \
--executor-memory 10g \
--class com.tencent.angel.spark.examples.cluster.SLPAExample \
../lib/spark-on-angel-examples-3.3.0.jar
input:$input output:$output \
sep:tab storageLevel:MEMORY_ONLY useBalancePartition:true maxIteration:10\
partitionNum:4 psPartitionNum:1 numMaxCommunities:3 needReplicateEdge:true