Ontology type: schema:ScholarlyArticle Open Access: True
2012-09
AUTHORS ABSTRACTIn ranked-set sampling (RSS), the ranker must give a complete ranking of the units in each set. In this paper, we consider a modification of RSS that allows the ranker to declare ties. Our sampling method is simply to break the ties at random so that we obtain a standard ranked-set sample, but also to record the tie structure for use in estimation. We propose several different nonparametric mean estimators that incorporate the tie information, and we show that the best of these estimators is substantially more efficient than estimators that ignore the ties. As part of our comparison of estimators, we develop new results about models for ties in rankings. We also show that there are settings where, to achieve more efficient estimation, ties should be declared not just when the ranker is actually unsure about how units rank, but also when the ranker is sure about the ranking, but believes that the units are close. More... »
PAGES309-326
http://scigraph.springernature.com/pub.10.1007/s10651-012-0188-1
DOIhttp://dx.doi.org/10.1007/s10651-012-0188-1
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1038751357
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0104",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Statistics",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Mathematical Sciences",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Villanova University",
"id": "https://www.grid.ac/institutes/grid.267871.d",
"name": [
"Department of Mathematics and Statistics, Villanova University, 19085, Villanova, PA, USA"
],
"type": "Organization"
},
"familyName": "Frey",
"givenName": "Jesse",
"id": "sg:person.011065637437.99",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011065637437.99"
],
"type": "Person"
}
],
"citation": [
{
"id": "https://doi.org/10.1111/j.0006-341x.2004.00144.x",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1000288773"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1111/j.0006-341x.2004.00144.x",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1000288773"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1198/1085711032156",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1006879529",
"https://doi.org/10.1198/1085711032156"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/bf00569358",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1012567782",
"https://doi.org/10.1007/bf00569358"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/j.jspi.2010.08.002",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1016033860"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/s10651-010-0161-9",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1020025152",
"https://doi.org/10.1007/s10651-010-0161-9"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1071/ar9520385",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1024491920"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/j.jspi.2006.02.013",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1025085088"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1002/sim.2158",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1032210417"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1002/sim.2158",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1032210417"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1111/j.1541-0420.2007.00900.x",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1038685876"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1080/10485250701437232",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1048488722"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1080/01621459.1994.10476458",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1058304592"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1198/000313005x54180",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1064197149"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1198/016214506000000410",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1064198511"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.2307/2556166",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1069991898"
],
"type": "CreativeWork"
}
],
"datePublished": "2012-09",
"datePublishedReg": "2012-09-01",
"description": "In ranked-set sampling (RSS), the ranker must give a complete ranking of the units in each set. In this paper, we consider a modification of RSS that allows the ranker to declare ties. Our sampling method is simply to break the ties at random so that we obtain a standard ranked-set sample, but also to record the tie structure for use in estimation. We propose several different nonparametric mean estimators that incorporate the tie information, and we show that the best of these estimators is substantially more efficient than estimators that ignore the ties. As part of our comparison of estimators, we develop new results about models for ties in rankings. We also show that there are settings where, to achieve more efficient estimation, ties should be declared not just when the ranker is actually unsure about how units rank, but also when the ranker is sure about the ranking, but believes that the units are close.",
"genre": "research_article",
"id": "sg:pub.10.1007/s10651-012-0188-1",
"inLanguage": [
"en"
],
"isAccessibleForFree": true,
"isPartOf": [
{
"id": "sg:journal.1356907",
"issn": [
"1573-3009",
"1352-8505"
],
"name": "Environmental and Ecological Statistics",
"type": "Periodical"
},
{
"issueNumber": "3",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "19"
}
],
"name": "Nonparametric mean estimation using partially ordered sets",
"pagination": "309-326",
"productId": [
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"b8986dbc28c09eafccf25c35aeac211ebdafad6f5505c900c604073f8fad35bf"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/s10651-012-0188-1"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1038751357"
]
}
],
"sameAs": [
"https://doi.org/10.1007/s10651-012-0188-1",
"https://app.dimensions.ai/details/publication/pub.1038751357"
],
"sdDataset": "articles",
"sdDatePublished": "2019-04-10T17:32",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8672_00000514.jsonl",
"type": "ScholarlyArticle",
"url": "http://link.springer.com/10.1007%2Fs10651-012-0188-1"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s10651-012-0188-1'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s10651-012-0188-1'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10651-012-0188-1'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10651-012-0188-1'
This table displays all metadata directly associated to this object as RDF triples.
106 TRIPLES
21 PREDICATES
41 URIs
19 LITERALS
7 BLANK NODES