A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set
From MaRDI portal
Publication:3155347
DOI10.1081/STA-120037266zbMath1135.62346MaRDI QIDQ3155347
No author found.
Publication date: 14 January 2005
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Statistical inference for multinomial populations based on a double index family of test statistics ⋮ Hot spot identification method based on Andrews curves: an application on the COVID-19 crisis effects on caregiver distress in neurocognitive disorder ⋮ MCS: A method for finding the number of clusters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- On binomial distributions of order k
- On the number of clusters
- Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
- Runs, scans and urn model distributions: A unified Markov chain approach
- An introduction to wavelets with applications to Andrews' plots
- Variations of Andrews' Plots
- Distribution Theory of Runs: A Markov Chain Approach
- On a Test Whether Two Samples are from the Same Population
- The Distribution Theory of Runs
- Andrews plots for multivariate data: Some new suggestions and applications
This page was built for publication: A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set
