Data structures for maintaining set partitions
Identifieur interne : 001550 ( Main/Exploration ); précédent : 001549; suivant : 001551Data structures for maintaining set partitions
Auteurs : Michael A. Bender [États-Unis] ; Saurabh Sethia [États-Unis] ; Steven S. Skiena [États-Unis]Source :
- Random Structures & Algorithms [ 1042-9832 ] ; 2004-08.
English descriptors
- KwdEn :
Abstract
Efficiently maintaining the partition induced by a set of features is an important problem in building decision‐tree classifiers. In order to identify a small set of discriminating features, we need the capability of efficiently adding and removing specific features and determining the effect of these changes on the induced classification or partition. In this paper we introduce a variety of randomized and deterministic data structures to support these operations on both general and geometrically induced set partitions. We give both Monte Carlo and Las Vegas data structures that realize near‐optimal time bounds and are practical to implement. We then provide a faster solution to this problem in the geometric setting. Finally, we present a data structure that efficiently estimates the number of partitions separating elements. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004
Url:
DOI: 10.1002/rsa.20025
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001B50
- to stream Istex, to step Curation: 001A40
- to stream Istex, to step Checkpoint: 000D85
- to stream Main, to step Merge: 001601
- to stream Main, to step Curation: 001550
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Data structures for maintaining set partitions</title><author><name sortKey="Bender, Michael A" sort="Bender, Michael A" uniqKey="Bender M" first="Michael A." last="Bender">Michael A. Bender</name></author><author><name sortKey="Sethia, Saurabh" sort="Sethia, Saurabh" uniqKey="Sethia S" first="Saurabh" last="Sethia">Saurabh Sethia</name></author><author><name sortKey="Skiena, Steven S" sort="Skiena, Steven S" uniqKey="Skiena S" first="Steven S." last="Skiena">Steven S. Skiena</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:BA69EAF270DCB71BC1E0FE77B303F93AADC74156</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1002/rsa.20025</idno><idno type="url">https://api.istex.fr/document/BA69EAF270DCB71BC1E0FE77B303F93AADC74156/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001B50</idno><idno type="wicri:Area/Istex/Curation">001A40</idno><idno type="wicri:Area/Istex/Checkpoint">000D85</idno><idno type="wicri:doubleKey">1042-9832:2004:Bender M:data:structures:for</idno><idno type="wicri:Area/Main/Merge">001601</idno><idno type="wicri:Area/Main/Curation">001550</idno><idno type="wicri:Area/Main/Exploration">001550</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Data structures for maintaining set partitions</title><author><name sortKey="Bender, Michael A" sort="Bender, Michael A" uniqKey="Bender M" first="Michael A." last="Bender">Michael A. Bender</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">État de New York</region></placeName><wicri:cityArea>Department of Computer Science, SUNY Stony Brook, Stony Brook</wicri:cityArea></affiliation></author><author><name sortKey="Sethia, Saurabh" sort="Sethia, Saurabh" uniqKey="Sethia S" first="Saurabh" last="Sethia">Saurabh Sethia</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Oregon</region></placeName><wicri:cityArea>School of Electrical Engineering and Computer Science, Oregon State University, Corvallis</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Skiena, Steven S" sort="Skiena, Steven S" uniqKey="Skiena S" first="Steven S." last="Skiena">Steven S. Skiena</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">État de New York</region></placeName><wicri:cityArea>Department of Computer Science, SUNY Stony Brook, Stony Brook</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Random Structures & Algorithms</title><title level="j" type="abbrev">Random Struct. Alg.</title><idno type="ISSN">1042-9832</idno><idno type="eISSN">1098-2418</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>Hoboken</pubPlace><date type="published" when="2004-08">2004-08</date><biblScope unit="volume">25</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="43">43</biblScope><biblScope unit="page" to="67">67</biblScope></imprint><idno type="ISSN">1042-9832</idno></series><idno type="istex">BA69EAF270DCB71BC1E0FE77B303F93AADC74156</idno><idno type="DOI">10.1002/rsa.20025</idno><idno type="ArticleID">RSA20025</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1042-9832</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>approximation algorithms</term><term>data structures</term><term>decision trees</term><term>random walks</term><term>randomized algorithms</term><term>set partitions</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Efficiently maintaining the partition induced by a set of features is an important problem in building decision‐tree classifiers. In order to identify a small set of discriminating features, we need the capability of efficiently adding and removing specific features and determining the effect of these changes on the induced classification or partition. In this paper we introduce a variety of randomized and deterministic data structures to support these operations on both general and geometrically induced set partitions. We give both Monte Carlo and Las Vegas data structures that realize near‐optimal time bounds and are practical to implement. We then provide a faster solution to this problem in the geometric setting. Finally, we present a data structure that efficiently estimates the number of partitions separating elements. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Oregon</li><li>État de New York</li></region></list><tree><country name="États-Unis"><region name="État de New York"><name sortKey="Bender, Michael A" sort="Bender, Michael A" uniqKey="Bender M" first="Michael A." last="Bender">Michael A. Bender</name></region><name sortKey="Sethia, Saurabh" sort="Sethia, Saurabh" uniqKey="Sethia S" first="Saurabh" last="Sethia">Saurabh Sethia</name><name sortKey="Sethia, Saurabh" sort="Sethia, Saurabh" uniqKey="Sethia S" first="Saurabh" last="Sethia">Saurabh Sethia</name><name sortKey="Skiena, Steven S" sort="Skiena, Steven S" uniqKey="Skiena S" first="Steven S." last="Skiena">Steven S. Skiena</name><name sortKey="Skiena, Steven S" sort="Skiena, Steven S" uniqKey="Skiena S" first="Steven S." last="Skiena">Steven S. Skiena</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001550 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001550 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:BA69EAF270DCB71BC1E0FE77B303F93AADC74156
|texte= Data structures for maintaining set partitions
}}
| This area was generated with Dilib version V0.6.32. |  |