The Choice of Metrics for Clustering Algorithms
DOI:
https://doi.org/10.17770/etr2011vol2.973Keywords:
metric, clustering algorithmsAbstract
Methods of data analysis and automatic processing are treated as knowledge discovery. In many cases it is necessary to classify data in some way or find regularities in the data. That is why the notion of similarity is becoming more and more important in the context of intelligent data processing systems. It is frequently required to ascertain how the data are interrelated, how various data differ or agree with each other, and what the measure of their comparison is. An important part in detection of similarity in clustering algorithms plays the accuracy in the choice of metrics and the correctness of the clustering algorithms operation.Downloads
Download data is not yet available.
References
Agrawal R., Faloutsos C., Swami A. Efficient similarity search in sequence databases. Proc. 4th Int. Conf. On Foundations of Data Organizations and Algorithms, 1993. – Chicago. pp. 69-84.
Li M., Chen X., Ma B., Vitanyi P. The similarity metric. IEEE Transactions on Information Theory, 2004, vol.50, No. 12, pp.3250-3264.
Vitanyi P. Universal similarity, ITW2005, Rotorua, New Zealand, 2005.
Kaufman L., Rousseeuw P.J. Finding groups in data. An introduction to cluster analysis. – John Wiley & Sons, 2005.
Xu R., Wunch D.C. Clustering. – John Wiley & Sons, 2009, 358 p.
Everitt B.S. (1993). Cluster analysis. Edward Arnold, London, 170 p.
Fisher R.A. The use of multiple measurements in taxonomic problems. Ann. Eugenics, 1936,7(2), p.179-188.
Downloads
Published
2015-08-05
Issue
Section
IV Computer Science
How to Cite
[1]
P. Grabusts, “The Choice of Metrics for Clustering Algorithms”, ETR, vol. 2, pp. 70–76, Aug. 2015, doi: 10.17770/etr2011vol2.973.
