1986
DOI: 10.1002/bimj.4710280207
|View full text |Cite
|
Sign up to set email alerts
|

Späth, H.: Cluster dissection and analysis: theory, FORTRAN programs, examples. (Translator: Johannes Goldschmidt.) Ellis Horwood Ltd Wiley, Chichester 1985. 226 pp. £25

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 0 publications
0
6
0
Order By: Relevance
“…Single-particle data from the CCSEM-EDX analysis were imported into MATLAB R2010a (MathWorks, Inc.) for analysis. Particles were analyzed through queries on particle composition (Fe > 2%) and clustering using the k-means algorithm in the MATLAB toolbox. , Clustering algorithms have been applied to CCSEM-EDX data for over 20 years, with the most commonly used algorithm being adaptive resonance theory 2a (ART2a). , In more recent years, the use of clustering for real-time single-particle mass spectrometry analysis has shown that k-means is as effective as ART2a and is considerably simpler and faster to run . Further discussion of the application of clustering and error reduction is given in the Supporting Information.…”
Section: Discussionmentioning
confidence: 99%
“…Single-particle data from the CCSEM-EDX analysis were imported into MATLAB R2010a (MathWorks, Inc.) for analysis. Particles were analyzed through queries on particle composition (Fe > 2%) and clustering using the k-means algorithm in the MATLAB toolbox. , Clustering algorithms have been applied to CCSEM-EDX data for over 20 years, with the most commonly used algorithm being adaptive resonance theory 2a (ART2a). , In more recent years, the use of clustering for real-time single-particle mass spectrometry analysis has shown that k-means is as effective as ART2a and is considerably simpler and faster to run . Further discussion of the application of clustering and error reduction is given in the Supporting Information.…”
Section: Discussionmentioning
confidence: 99%
“…In this study, we used L1 distance with 100 times replications and random centroid position initialization. We adopted the 'kmeans' function incorporated in Matlab (Mucha, 1986).…”
Section: Kmeans Clusteringmentioning
confidence: 99%
“…In this study, we used L1 distance with 100 times replications and random centroid positions initialization. We adopted the 'kmeans' function incorporated in Matlab (Mucha, 1986).…”
Section: Kmeans Clusteringmentioning
confidence: 99%