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.
[1]
Paul M. B. Vitányi,et al.
Universal similarity
,
2005,
IEEE Information Theory Workshop, 2005..
[2]
Bin Ma,et al.
The similarity metric
,
2001,
IEEE Transactions on Information Theory.
[3]
Christos Faloutsos,et al.
Efficient Similarity Search In Sequence Databases
,
1993,
FODO.
[4]
Brian Everitt,et al.
Cluster analysis
,
1974
.
[5]
Ali S. Hadi,et al.
Finding Groups in Data: An Introduction to Chster Analysis
,
1991
.
[6]
R. Fisher.
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
,
1936
.