Skip to search formSkip to main contentSkip to account menu

Single-linkage clustering

Known as: Nearest neighbor clustering, Singlelinkage clustering, Single linkage clustering 
In statistics, single-linkage clustering is one of several methods of hierarchical clustering. It is based on grouping clusters in bottom-up fashion… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Cluster analysisComplete-linkage clusteringDendrogramEnvironment for DeveLoping KDD-Applications Supported by Index-Structures

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Yelp Food Recommendation System
We apply principles and techniques of recommendation systems to develop a predictive model of customers’ restaurant ratings… 
Review
2013
Review
2013
Skew detection of scanned document images
 Abstract—Skewing of the scanned image is an inevitable process and its detection is an important issue for document recognition… 
Highly Cited
2012
Highly Cited
2012
Analysis of Different Similarity Measure Functions and their Impacts on Shared Nearest Neighbor Clustering Approach
Clustering is a technique of grouping data with analogous data content. In recent years, Density based clustering algorithms… 
2012
2012
Skew Estimation of Sparsely Inscribed Document Fragments
Document analysis is done to analyze entire forms (e.g. intelligent form analysis, table detection) or to describe the layout… 
2008
2008
A Classification Approach for Selecting Forecasting Techniques for Intermittent Demand
The intermittent demand forecasting problem involves the forecasting of demand series that are charact erized by the time between… 
2004
2004
On the Two-level Hybrid Clustering Algorithm
In this paper, we design the hybrid clustering algorithms, which involve two level clustering. At each of the levels, users can… 
2004
2004
Multi-attribute scoring method for mobile telecommunication subscribers
Review
2002
Review
2002
HAL: A Faster Match Algorithm
Existing match algorithms treat the matching process like the querying process of relational databases. Owing to the… 
Highly Cited
1998
Highly Cited
1998
A new cluster algorithm for graphs
A new cluster algorithm for graphs called the \emph{Markov Cluster algorithm} ($MCL$ algorithm) is introduced. The graphs may be… 
1983
1983
On the determination of optimal levels in phytosociological classification
A method is introduced to compare results of a clustering technique at different levels of abstraction, or of different… 
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)