2015
DOI: 10.1016/j.patcog.2014.10.003
|View full text |Cite
|
Sign up to set email alerts
|

Cluster validity measure and merging system for hierarchical clustering considering outliers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 27 publications
(12 citation statements)
references
References 55 publications
0
12
0
Order By: Relevance
“…The tree is called a Dendrogram. In this research, the single-link divisive clustering algorithm [23] is employed. It is one of the oldest and simplest clustering methods, known as the nearest neighbor method.…”
Section: Hierarchical Clusteringmentioning
confidence: 99%
“…The tree is called a Dendrogram. In this research, the single-link divisive clustering algorithm [23] is employed. It is one of the oldest and simplest clustering methods, known as the nearest neighbor method.…”
Section: Hierarchical Clusteringmentioning
confidence: 99%
“…Starczewski (2015)) has been defined as the product of two components which determine changes of compactness and separability of clusters during a clustering process. De Morsier et al, (2015) quantify the clustering performance of hierarchical algorithms that handle overlapping clusters in presence of outliers. A set of validation techniques based on the clusters' negentropy is discussed in (Lago-Fernandez et al, (2014)).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Specifically, the probability density function (pdf) of the data provided by annotators is modeled as a mixture of an unknown number of Gaussian components plus a uniformly distributed random variable (rv), which models the annotators' isolated errors as outliers. Unlike previous works for clustering, e.g., [14,15,16,17], the proposed EM-based clustering algorithm not only estimates the number of Gaussian components and the parameters of the Gaussian plus non-Gaussian mixture density, but also annotators' reliability. In the detection stage, a decision is made, on each cluster identified in the clustering step, on whether it corresponds to one of the desired structures or not, taking into account annotators' reliability.…”
Section: Introductionmentioning
confidence: 99%