This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Extremes in the Complexity of Computing Metric Distances Between Partitions
January 1984 (vol. 6 no. 1)
pp. 69-73
William H. E. Day, Department of Computer Science, Memorial University of Newfoundland, St. John's, Nfld., Canada A1C 5S7.
Robert S. Wells, Structural Analysis Division, Statistics Canada, Ottawa, Ont., Canada K1A 0T6.
Day [3] describes an analytical model of minimum-length sequence (MLS) metrics measuring distances between partitions of a set. By selecting suitable values of model coordinates, a user may identify within the model that metric most appropriate to his classification application. Users should understand that within the model similar metrics may nevertheless exhibit extreme differences in their computational complexities. For example, the asymptotic time complexities of two MLS metrics are known to be linear in the number of objects being partitioned; yet we establish below that the computational problem for a closely related MLS metric is NP-complete.
Citation:
William H. E. Day, Robert S. Wells, "Extremes in the Complexity of Computing Metric Distances Between Partitions," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 1, pp. 69-73, Jan. 1984, doi:10.1109/TPAMI.1984.4767476
Usage of this product signifies your acceptance of the Terms of Use.