Package elki.clustering
Interface ClusteringAlgorithm<C extends Clustering<? extends Model>>
-
- Type Parameters:
C- Clustering type
- All Superinterfaces:
elki.Algorithm
- All Known Subinterfaces:
KMeans<V,M>,KMedoidsClustering<O>,SubspaceClusteringAlgorithm<M>
- All Known Implementing Classes:
AbstractBiclustering,AbstractCutDendrogram,AbstractKMeans,AbstractProjectedClustering,AffinityPropagation,AlternatingKMedoids,AnnulusKMeans,BestOfMultipleKMeans,BetulaGMM,BetulaGMMWeighted,BetulaLeafPreClustering,BetulaLloydKMeans,BIRCHLeafClustering,BIRCHLloydKMeans,BisectingKMeans,ByLabelClustering,ByLabelHierarchicalClustering,ByLabelOrAllInOneClustering,CanopyPreClustering,CFSFDP,ChengAndChurch,CLARA,CLARANS,CLIQUE,ClustersWithNoiseExtraction,CompareMeans,COPAC,CutDendrogramByHeight,CutDendrogramByNumberOfClusters,DBSCAN,DOC,EagerPAM,ElkanKMeans,EM,ERiC,EuclideanSphericalElkanKMeans,EuclideanSphericalHamerlyKMeans,EuclideanSphericalSimplifiedElkanKMeans,ExponionKMeans,ExternalClustering,FastCLARA,FastCLARANS,FastDOC,FasterCLARA,FasterMSC,FasterPAM,FastMSC,FastPAM,FastPAM1,FourC,FuzzyCMeans,GeneralizedDBSCAN,GMeans,GreedyKCenter,GriDBSCAN,HamerlyKMeans,HartiganWongKMeans,HDBSCANHierarchyExtraction,KDTreeEM,KDTreeFilteringKMeans,KDTreePruningKMeans,KMeansMinusMinus,KMediansLloyd,KNNKernelDensityMinimaClustering,Leader,LloydKMeans,LMCLUS,LSDBC,MacQueenKMeans,NaiveMeanShiftClustering,OPTICSXi,ORCLUS,P3C,PAM,PAMMEDSIL,PAMSIL,ParallelGeneralizedDBSCAN,ParallelLloydKMeans,PreDeCon,PROCLUS,ReynoldsPAM,ShallotKMeans,SimplifiedElkanKMeans,SimplifiedHierarchyExtraction,SingleAssignmentKMeans,SingleAssignmentKMedoids,SNNClustering,SortMeans,SphericalElkanKMeans,SphericalHamerlyKMeans,SphericalKMeans,SphericalSimplifiedElkanKMeans,SphericalSimplifiedHamerlyKMeans,SphericalSingleAssignmentKMeans,SUBCLU,TrivialAllInOne,TrivialAllNoise,XMeans,YinYangKMeans
public interface ClusteringAlgorithm<C extends Clustering<? extends Model>> extends elki.AlgorithmInterface for Algorithms that are capable to provide aClusteringas Result. in general, clustering algorithms are supposed to implement theAlgorithm-Interface. The more specialized interfaceClusteringAlgorithmrequires an implementing algorithm to provide a special result class suitable as a partitioning of the database. More relaxed clustering algorithms are allowed to provide a result that is a fuzzy clustering, does not partition the database complete or is in any other sense a relaxed clustering result.- Since:
- 0.1
- Author:
- Arthur Zimek
-
-
Method Summary
All Methods Instance Methods Default Methods Modifier and Type Method Description default Cautorun(elki.database.Database database)
-
-
-
Method Detail
-
autorun
default C autorun(elki.database.Database database)
- Specified by:
autorunin interfaceelki.Algorithm
-
-