Thresholded consensus for n-trees
Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, t...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Barthélemy, Jean-Pierre [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1988 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag New York Inc. 1988 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of classification - Springer-Verlag, 1984, 5(1988), 2 vom: Sept., Seite 229-236 |
|---|---|
| Übergeordnetes Werk: |
volume:5 ; year:1988 ; number:2 ; month:09 ; pages:229-236 |
| Links: |
|---|
| DOI / URN: |
10.1007/BF01897165 |
|---|
| Katalog-ID: |
OLC2062458878 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2062458878 | ||
| 003 | DE-627 | ||
| 005 | 20230331141115.0 | ||
| 007 | tu | ||
| 008 | 200819s1988 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/BF01897165 |2 doi | |
| 035 | |a (DE-627)OLC2062458878 | ||
| 035 | |a (DE-He213)BF01897165-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 150 |a 510 |a 600 |q VZ |
| 084 | |a 24,1 |2 ssgn | ||
| 100 | 1 | |a Barthélemy, Jean-Pierre |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Thresholded consensus for n-trees |
| 264 | 1 | |c 1988 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag New York Inc. 1988 | ||
| 520 | |a Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided. | ||
| 650 | 4 | |a Consensus | |
| 650 | 4 | |a n-trees | |
| 650 | 4 | |a Hierarchical clustering | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of classification |d Springer-Verlag, 1984 |g 5(1988), 2 vom: Sept., Seite 229-236 |w (DE-627)129337323 |w (DE-600)142885-8 |w (DE-576)014642832 |x 0176-4268 |7 nnns |
| 773 | 1 | 8 | |g volume:5 |g year:1988 |g number:2 |g month:09 |g pages:229-236 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/BF01897165 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-PHY | ||
| 912 | |a SSG-OLC-CHE | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-BUB | ||
| 912 | |a SSG-OPC-BBI | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_11 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_147 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2012 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_2088 | ||
| 912 | |a GBV_ILN_4012 | ||
| 912 | |a GBV_ILN_4103 | ||
| 912 | |a GBV_ILN_4125 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4310 | ||
| 912 | |a GBV_ILN_4324 | ||
| 912 | |a GBV_ILN_4334 | ||
| 951 | |a AR | ||
| 952 | |d 5 |j 1988 |e 2 |c 09 |h 229-236 | ||
| author_variant |
j p b jpb |
|---|---|
| matchkey_str |
article:01764268:1988----::hehlecness |
| hierarchy_sort_str |
1988 |
| publishDate |
1988 |
| allfields |
10.1007/BF01897165 doi (DE-627)OLC2062458878 (DE-He213)BF01897165-p DE-627 ger DE-627 rakwb eng 150 510 600 VZ 24,1 ssgn Barthélemy, Jean-Pierre verfasserin aut Thresholded consensus for n-trees 1988 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1988 Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided. Consensus n-trees Hierarchical clustering Enthalten in Journal of classification Springer-Verlag, 1984 5(1988), 2 vom: Sept., Seite 229-236 (DE-627)129337323 (DE-600)142885-8 (DE-576)014642832 0176-4268 nnns volume:5 year:1988 number:2 month:09 pages:229-236 https://doi.org/10.1007/BF01897165 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-CHE SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_11 GBV_ILN_40 GBV_ILN_70 GBV_ILN_147 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4310 GBV_ILN_4324 GBV_ILN_4334 AR 5 1988 2 09 229-236 |
| spelling |
10.1007/BF01897165 doi (DE-627)OLC2062458878 (DE-He213)BF01897165-p DE-627 ger DE-627 rakwb eng 150 510 600 VZ 24,1 ssgn Barthélemy, Jean-Pierre verfasserin aut Thresholded consensus for n-trees 1988 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1988 Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided. Consensus n-trees Hierarchical clustering Enthalten in Journal of classification Springer-Verlag, 1984 5(1988), 2 vom: Sept., Seite 229-236 (DE-627)129337323 (DE-600)142885-8 (DE-576)014642832 0176-4268 nnns volume:5 year:1988 number:2 month:09 pages:229-236 https://doi.org/10.1007/BF01897165 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-CHE SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_11 GBV_ILN_40 GBV_ILN_70 GBV_ILN_147 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4310 GBV_ILN_4324 GBV_ILN_4334 AR 5 1988 2 09 229-236 |
| allfields_unstemmed |
10.1007/BF01897165 doi (DE-627)OLC2062458878 (DE-He213)BF01897165-p DE-627 ger DE-627 rakwb eng 150 510 600 VZ 24,1 ssgn Barthélemy, Jean-Pierre verfasserin aut Thresholded consensus for n-trees 1988 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1988 Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided. Consensus n-trees Hierarchical clustering Enthalten in Journal of classification Springer-Verlag, 1984 5(1988), 2 vom: Sept., Seite 229-236 (DE-627)129337323 (DE-600)142885-8 (DE-576)014642832 0176-4268 nnns volume:5 year:1988 number:2 month:09 pages:229-236 https://doi.org/10.1007/BF01897165 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-CHE SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_11 GBV_ILN_40 GBV_ILN_70 GBV_ILN_147 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4310 GBV_ILN_4324 GBV_ILN_4334 AR 5 1988 2 09 229-236 |
| allfieldsGer |
10.1007/BF01897165 doi (DE-627)OLC2062458878 (DE-He213)BF01897165-p DE-627 ger DE-627 rakwb eng 150 510 600 VZ 24,1 ssgn Barthélemy, Jean-Pierre verfasserin aut Thresholded consensus for n-trees 1988 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1988 Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided. Consensus n-trees Hierarchical clustering Enthalten in Journal of classification Springer-Verlag, 1984 5(1988), 2 vom: Sept., Seite 229-236 (DE-627)129337323 (DE-600)142885-8 (DE-576)014642832 0176-4268 nnns volume:5 year:1988 number:2 month:09 pages:229-236 https://doi.org/10.1007/BF01897165 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-CHE SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_11 GBV_ILN_40 GBV_ILN_70 GBV_ILN_147 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4310 GBV_ILN_4324 GBV_ILN_4334 AR 5 1988 2 09 229-236 |
| allfieldsSound |
10.1007/BF01897165 doi (DE-627)OLC2062458878 (DE-He213)BF01897165-p DE-627 ger DE-627 rakwb eng 150 510 600 VZ 24,1 ssgn Barthélemy, Jean-Pierre verfasserin aut Thresholded consensus for n-trees 1988 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1988 Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided. Consensus n-trees Hierarchical clustering Enthalten in Journal of classification Springer-Verlag, 1984 5(1988), 2 vom: Sept., Seite 229-236 (DE-627)129337323 (DE-600)142885-8 (DE-576)014642832 0176-4268 nnns volume:5 year:1988 number:2 month:09 pages:229-236 https://doi.org/10.1007/BF01897165 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-CHE SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_11 GBV_ILN_40 GBV_ILN_70 GBV_ILN_147 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4310 GBV_ILN_4324 GBV_ILN_4334 AR 5 1988 2 09 229-236 |
| language |
English |
| source |
Enthalten in Journal of classification 5(1988), 2 vom: Sept., Seite 229-236 volume:5 year:1988 number:2 month:09 pages:229-236 |
| sourceStr |
Enthalten in Journal of classification 5(1988), 2 vom: Sept., Seite 229-236 volume:5 year:1988 number:2 month:09 pages:229-236 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Consensus n-trees Hierarchical clustering |
| dewey-raw |
150 |
| isfreeaccess_bool |
false |
| container_title |
Journal of classification |
| authorswithroles_txt_mv |
Barthélemy, Jean-Pierre @@aut@@ |
| publishDateDaySort_date |
1988-09-01T00:00:00Z |
| hierarchy_top_id |
129337323 |
| dewey-sort |
3150 |
| id |
OLC2062458878 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2062458878</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331141115.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1988 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF01897165</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2062458878</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF01897165-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">150</subfield><subfield code="a">510</subfield><subfield code="a">600</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">24,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Barthélemy, Jean-Pierre</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Thresholded consensus for n-trees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1988</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag New York Inc. 1988</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Consensus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">n-trees</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hierarchical clustering</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of classification</subfield><subfield code="d">Springer-Verlag, 1984</subfield><subfield code="g">5(1988), 2 vom: Sept., Seite 229-236</subfield><subfield code="w">(DE-627)129337323</subfield><subfield code="w">(DE-600)142885-8</subfield><subfield code="w">(DE-576)014642832</subfield><subfield code="x">0176-4268</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:5</subfield><subfield code="g">year:1988</subfield><subfield code="g">number:2</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:229-236</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF01897165</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-CHE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4103</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">5</subfield><subfield code="j">1988</subfield><subfield code="e">2</subfield><subfield code="c">09</subfield><subfield code="h">229-236</subfield></datafield></record></collection>
|
| author |
Barthélemy, Jean-Pierre |
| spellingShingle |
Barthélemy, Jean-Pierre ddc 150 ssgn 24,1 misc Consensus misc n-trees misc Hierarchical clustering Thresholded consensus for n-trees |
| authorStr |
Barthélemy, Jean-Pierre |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129337323 |
| format |
Article |
| dewey-ones |
150 - Psychology 510 - Mathematics 600 - Technology |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0176-4268 |
| topic_title |
150 510 600 VZ 24,1 ssgn Thresholded consensus for n-trees Consensus n-trees Hierarchical clustering |
| topic |
ddc 150 ssgn 24,1 misc Consensus misc n-trees misc Hierarchical clustering |
| topic_unstemmed |
ddc 150 ssgn 24,1 misc Consensus misc n-trees misc Hierarchical clustering |
| topic_browse |
ddc 150 ssgn 24,1 misc Consensus misc n-trees misc Hierarchical clustering |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of classification |
| hierarchy_parent_id |
129337323 |
| dewey-tens |
150 - Psychology 510 - Mathematics 600 - Technology |
| hierarchy_top_title |
Journal of classification |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129337323 (DE-600)142885-8 (DE-576)014642832 |
| title |
Thresholded consensus for n-trees |
| ctrlnum |
(DE-627)OLC2062458878 (DE-He213)BF01897165-p |
| title_full |
Thresholded consensus for n-trees |
| author_sort |
Barthélemy, Jean-Pierre |
| journal |
Journal of classification |
| journalStr |
Journal of classification |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
100 - Philosophy & psychology 500 - Science 600 - Technology |
| recordtype |
marc |
| publishDateSort |
1988 |
| contenttype_str_mv |
txt |
| container_start_page |
229 |
| author_browse |
Barthélemy, Jean-Pierre |
| container_volume |
5 |
| class |
150 510 600 VZ 24,1 ssgn |
| format_se |
Aufsätze |
| author-letter |
Barthélemy, Jean-Pierre |
| doi_str_mv |
10.1007/BF01897165 |
| dewey-full |
150 510 600 |
| title_sort |
thresholded consensus for n-trees |
| title_auth |
Thresholded consensus for n-trees |
| abstract |
Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided. © Springer-Verlag New York Inc. 1988 |
| abstractGer |
Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided. © Springer-Verlag New York Inc. 1988 |
| abstract_unstemmed |
Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided. © Springer-Verlag New York Inc. 1988 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-CHE SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_11 GBV_ILN_40 GBV_ILN_70 GBV_ILN_147 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4310 GBV_ILN_4324 GBV_ILN_4334 |
| container_issue |
2 |
| title_short |
Thresholded consensus for n-trees |
| url |
https://doi.org/10.1007/BF01897165 |
| remote_bool |
false |
| ppnlink |
129337323 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/BF01897165 |
| up_date |
2024-07-03T15:08:48.949Z |
| _version_ |
1803570987872026624 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2062458878</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331141115.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1988 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF01897165</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2062458878</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF01897165-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">150</subfield><subfield code="a">510</subfield><subfield code="a">600</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">24,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Barthélemy, Jean-Pierre</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Thresholded consensus for n-trees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1988</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag New York Inc. 1988</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we get two numbersm andm′ such that: If a clusterX occurs ink n-trees of a profileP, withk ≥m′, then it occurs in every consensus n-tree ofP. IfX occurs ink′ n-trees ofP, withm ≤k <m′, then it may, or may not, belong to a consensus n-tree ofP. IfX occurs ink″ n-trees ofP, withk″ <m then it cannot occur in any consensus n-tree ofP. If these conditions are satisfied, the multiconsensus function is said to be thresholded by the pair (m,m′). Two results are obtained. The first one characterizes the pairs of numbers that can be viewed as thresholds for some consensus function. The second one provides a characterization of thresholded consensus methods. As an application a characterization of the quota rules is provided.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Consensus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">n-trees</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hierarchical clustering</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of classification</subfield><subfield code="d">Springer-Verlag, 1984</subfield><subfield code="g">5(1988), 2 vom: Sept., Seite 229-236</subfield><subfield code="w">(DE-627)129337323</subfield><subfield code="w">(DE-600)142885-8</subfield><subfield code="w">(DE-576)014642832</subfield><subfield code="x">0176-4268</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:5</subfield><subfield code="g">year:1988</subfield><subfield code="g">number:2</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:229-236</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF01897165</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-CHE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4103</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">5</subfield><subfield code="j">1988</subfield><subfield code="e">2</subfield><subfield code="c">09</subfield><subfield code="h">229-236</subfield></datafield></record></collection>
|
| score |
7.3993683 |