Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

BorderFlow Clustering

local graph clustering algorithm
Designing for directed and undirected weighted graphs
Clusters in BorderFlow:
Maximal intra-cluster density
Minimal outer-cluster density
 
‹#›
val lang = Lang.NTRIPLES
val triples = spark.rdf(lang)(input)
val graph = triples.asGraph()
 
val borderflow = algName match {
 case "borderflow" => BorderFlow(spark, graph, output, outputevlsoft, outputevlhard)
 case "firsthardening" => FirstHardeninginBorderFlow(spark, graph, output, outputevlhard)
 case _ =>
 throw new RuntimeException("'" + algName + "' - Not supported, yet.")
 }

Content Tools

Sources

There are currently no sources for this slide.