SingleCross-clustering: an algorithm for finding elongated clusters with automatic estimation of outliers and number of clusters
From MaRDI portal
Publication:5082985
DOI10.1080/03610918.2019.1697449OpenAlexW2996085951WikidataQ126529429 ScholiaQ126529429MaRDI QIDQ5082985
Publication date: 21 June 2022
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2019.1697449
outliersnumber of clustersoutliers detectionclustering aggregationpartial clusteringclassification clustering algorithmelongated clustershierarichical agglomertion
Uses Software
Cites Work
- Algorithm AS 136: A K-Means Clustering Algorithm
- Hierarchical Clustering With Prototypes via Minimax Linkage
- Outlier identification in model-based cluster analysis
- A Look at Some Data on the Old Faithful Geyser
- Bicriterion Cluster Analysis
- Consistency of Single Linkage for High-Density Clusters
- Finding Groups in Data
- Model-Based Gaussian and Non-Gaussian Clustering
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Sur la liaison et la division des points d'un ensemble fini
- Aggregating inconsistent information
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: SingleCross-clustering: an algorithm for finding elongated clusters with automatic estimation of outliers and number of clusters