Distance Based Binary Matching

J. D. Tubbs
Additional contact information
J. D. Tubbs: University of Arkansas, Department of Mathematical Sciences

A chapter in Computing Science and Statistics, 1992, pp 548-550 from Springer

Abstract: Abstract A probabilistic procedure for weighting matches in a binary template matching problem is considered where the underlying distribution on the set of all possible binary lists of length n is not necessarily uniform. The procedure uses the Mallow’s model found in the ranking literature along with some modifications as proposed by Fligner and Verducci.

Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2856-1_97

Ordering information: This item can be ordered from
http://www.springer.com/9781461228561

DOI: 10.1007/978-1-4612-2856-1_97

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().