Clustering 4️⃣ Ever Download Maven Central

Welcome to Big Data Clustering Library gathering clustering algorithms and quality indices as immutabely as possible. Don't hesitate to check our Wiki, ask questions or make recommendations in our Gitter.

API documentation

Include it in your project

Add following line in your build.sbt :

  • "org.clustering4ever" % "clustering4ever_2.11" % "0.9.3" to your libraryDependencies

Eventually add one of these resolvers :

  • resolvers += Resolver.bintrayRepo("clustering4ever", "C4E")
  • resolvers += "mvnrepository" at "http://mvnrepository.com/artifact/"

You can also take specifics parts :

  • Core Download
  • Scala Clustering Download
  • Spark Clustering Download

Available algorithms

  • emphasized algorithms are in scala.
  • bold algorithms are implemented in spark.
  • They can be available in both versions

Clustering algorithms

  • Jenks Natural Breaks
  • Epsilon Proximity *
    • Scalar Epsilon Proximity *
    • Binary Epsilon Proximity *
    • Mixed Epsilon Proximity *
    • Any Object Epsilon Proximity *
  • K-Centers *
    • K-Means *
    • K-Modes *
    • K-Prototypes *
    • Any Object K-Centers *
  • Self Organizing Maps (Original project)
  • G-Stream (Original project)
  • PatchWork (Original project)
  • Random Local Area *
  • Clusterwize
  • Tensor Biclustering algorithms (Original project)
    • Folding-Spectral
    • Unfolding-Spectral
    • Thresholding Sum Of Squared Trajectory Length
    • Thresholding Individuals Trajectory Length
    • Recursive Biclustering
    • Multiple Biclustering

Algorithm followed with a * implement ClusteringAlgorithm trait and can be run by benchmarking classes.

Preprocessing

  • Gradient Ascent (Mean-Shift related)
    • Scalar Gradient Ascent
    • Binary Gradient Ascent
    • Mixed Gradient Ascent
    • Any Object Gradient Ascent
  • Rough Set Features Selection

Quality Indices

Classes ClustersIndicesAnalysisLocal and ClustersIndicesAnalysisDistributed allow you to test following indices on every realized clustering.

  • External Indices
    • Mutual Information
    • Normalized Mutual Information
  • Internal Indices
    • Davies Bouldin
    • Ball Hall
    • Silhouette

Clustering benchmarking and analysis

Using classes ClusteringChainingLocal, BigDataClusteringChaining, DistributedClusteringChaining, and ChainingOneAlgorithm descendants you have the possibility to run multiple clustering algorithms respectively locally and parallely, in a sequentially distributed way, and parallely on a distributed system, locally and parallely, generate many different vectorizations of the data whilst keeping active information on each clustering including used vectorization, clustering model, clustering number and clustering arguments.

Classes ClustersIndicesAnalysisLocal and ClustersIndicesAnalysisDistributed are devoted for clustering indices analysis.

Classes ClustersAnalysisLocal and ClustersAnalysisDistributed will be use to describe obtained clustering in term of distributions, proportions of categorical features...

Incoming soon

  • Gaussian Mixture Models
  • Meta heuristic
  • More clustering indices

Citation

If you publish material based on informations obtained from this repository, then, in your acknowledgements, please note the assistance you received by using this community work. This will help others to obtain the same informations and replicate your experiments, because having results is cool but being able to compare to others is better. Citation: @misc{C4E, url = “https://github.com/Clustering4Ever/Clustering4Ever“, institution = “Paris 13 University, LIPN UMR CNRS 7030”}

C4E-Notebook examples

Basic usages of implemented algorithms are exposed with SparkNotebooks in Spark-Clustering-Notebook organization.

Miscellaneous

Helper functions to generate Clusterizable collections

You can easily generate your collections with basic Clusterizable using helpers in org.clustering4ever.util.{ArrayAndSeqTowardGVectorImplicit, ScalaCollectionImplicits, SparkImplicits} or explore Clusterizable and EasyClusterizable for more advanced usages.

References

What data structures are recommended for best performances

  • ArrayBuffer as vector are a good start
  • ArrayBuffer, ParArray or ParSeq as vector containers are recommended