Skip to search formSkip to main contentSkip to account menu

Complete-linkage clustering

Known as: CLC, Complete linkage clustering 
Complete-linkage clustering is one of several methods of agglomerative hierarchical clustering. At the beginning of the process, each element is in a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
DendrogramHierarchical clusteringList of algorithmsNearest-neighbor chain algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
An overview of multilevel converter topologies for grid connected applications
This paper provides an overview of multilevel converter topologies for grid connected applications. Different converter… 
2012
2012
Speaker linking using complete-linkage clustering
Speaker diarization determines instances of the same speaker within a recording. Extending this task to a collection of… 
Highly Cited
2012
Highly Cited
2012
Action Recognition Using Context-Constrained Linear Coding
Although traditional bag-of-words model has shown promising results for action recognition, it takes no consideration of the… 
2012
2012
Colloidal particles at the interface between an isotropic liquid and a chiral liquid crystal
We create an interface between a cholesteric liquid crystal (CLC) and an isotropic liquid (silicone oil) at which homeotropic… 
Review
2008
Review
2008
CHEMICAL-LOOPING COMBUSTION - STATUS OF DEVELOPMENT
Chemical-looping combustion (CLC) is a combustion technology with inherent separation of the greenhouse gas CO 2. The technique… 
2006
2006
A New Binary Classifier: Clustering-Launched Classification
One of the powerful classifiers is Support Vector Machine (SVM), which has been successfully applied to many fields. Despite its… 
2005
2005
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since… 
2004
2004
A developed algorithm of apriori based on association analysis
A method for mining frequent itemsets by evaluating their probability of supports based on association analysis is presented… 
2003
2003
The Concept of Accountability in World Politics and the Use of Force
1998
1998
Fast Algorithms for Complete Linkage Clustering
Abstract. It is shown that the complete linkage clustering of n points can be computed in O(n log2 n) time. Furthermore, it is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)