An efficient algorithm for generalized random sampling

Amihood Amir; Doron Mintz

doi:10.1016/0167-8655(91)90005-7

An efficient algorithm for generalized random sampling

Amihood Amir, Doron Mintz

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

An efficient algorithm for selecting s different m-element subsets of {1, ..., k} is presented. The lower bound for this problem is Ω(sm). The two previously known solutions are of time complexity O(sm² log k) and O(s(k + m)). Our method is ranking the lexicographic order of m-tuples and then generating an s-element random sample. The time complexity is O(sm²).

Original language	English
Pages (from-to)	683-686
Number of pages	4
Journal	Pattern Recognition Letters
Volume	12
Issue number	11
DOIs	https://doi.org/10.1016/0167-8655(91)90005-7
State	Published - Nov 1991
Externally published	Yes

Bibliographical note

Funding Information:
* Partially supported by NSF grant CCR-880364 and a University of Maryland General Research Board Full Year Award. ** The support of NSF grant DCR-86-03723 is gratefully acknowledged.

Funding

* Partially supported by NSF grant CCR-880364 and a University of Maryland General Research Board Full Year Award. ** The support of NSF grant DCR-86-03723 is gratefully acknowledged.

Funders	Funder number
University of Maryland General Research Board	DCR-86-03723
National Science Foundation	CCR-880364

Access to Document

10.1016/0167-8655(91)90005-7

Cite this

@article{ce95e10562f1430a9d54a92e0893650a,

title = "An efficient algorithm for generalized random sampling",

abstract = "An efficient algorithm for selecting s different m-element subsets of {1, ..., k} is presented. The lower bound for this problem is Ω(sm). The two previously known solutions are of time complexity O(sm2 log k) and O(s(k + m)). Our method is ranking the lexicographic order of m-tuples and then generating an s-element random sample. The time complexity is O(sm2).",

author = "Amihood Amir and Doron Mintz",

note = "Funding Information: * Partially supported by NSF grant CCR-880364 and a University of Maryland General Research Board Full Year Award. ** The support of NSF grant DCR-86-03723 is gratefully acknowledged.",

year = "1991",

month = nov,

doi = "10.1016/0167-8655(91)90005-7",

language = "אנגלית",

volume = "12",

pages = "683--686",

journal = "Pattern Recognition Letters",

issn = "0167-8655",

publisher = "Elsevier",

number = "11",

}

TY - JOUR

T1 - An efficient algorithm for generalized random sampling

AU - Amir, Amihood

AU - Mintz, Doron

N1 - Funding Information: * Partially supported by NSF grant CCR-880364 and a University of Maryland General Research Board Full Year Award. ** The support of NSF grant DCR-86-03723 is gratefully acknowledged.

PY - 1991/11

Y1 - 1991/11

N2 - An efficient algorithm for selecting s different m-element subsets of {1, ..., k} is presented. The lower bound for this problem is Ω(sm). The two previously known solutions are of time complexity O(sm2 log k) and O(s(k + m)). Our method is ranking the lexicographic order of m-tuples and then generating an s-element random sample. The time complexity is O(sm2).

AB - An efficient algorithm for selecting s different m-element subsets of {1, ..., k} is presented. The lower bound for this problem is Ω(sm). The two previously known solutions are of time complexity O(sm2 log k) and O(s(k + m)). Our method is ranking the lexicographic order of m-tuples and then generating an s-element random sample. The time complexity is O(sm2).

UR - http://www.scopus.com/inward/record.url?scp=0041305383&partnerID=8YFLogxK

U2 - 10.1016/0167-8655(91)90005-7

DO - 10.1016/0167-8655(91)90005-7

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0041305383

SN - 0167-8655

VL - 12

SP - 683

EP - 686

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

IS - 11

ER -

An efficient algorithm for generalized random sampling

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this