ISOETRP clustering algorithm and its application to tree classifier design
Identifieur interne : 003E74 ( Main/Merge ); précédent : 003E73; suivant : 003E75ISOETRP clustering algorithm and its application to tree classifier design
Auteurs : Qingren Wang [République populaire de Chine]Source :
- Journal of Computer Science and Technology [ 1000-9000 ] ; 1986-03-01.
Abstract
Abstract: A new clustering algorithm ISOETRP has been developed. Several new objectives have been introduced to make ISOETRP particularly suitable to hierarchical pattern classification. These objectives are: a) minimizing overlap between pattern class groups, b) maximizing entropy reduction, and c) keeping balance between these groups. The overall objective to be optimized is GAIN=Entropy Reduction/(Overlap+1). Balance is controlled by maximizing the GAIN. An interactive version of ISOETRP has also been developed by means of an overlap table. It has been shown that ISOETRP gives much better results than other existing algorithms in optimizing the above objectives. ISOETRP has played an important role in designing many large tree classifiers, where the tree performance was improved by optimizing GAIN value.
Url:
DOI: 10.1007/BF02943303
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002E35
- to stream Istex, to step Curation: 002C07
- to stream Istex, to step Checkpoint: 002E43
Links to Exploration step
ISTEX:861E54931535C7A5AA5FC20FD1681FDC64EC8CFALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">ISOETRP clustering algorithm and its application to tree classifier design</title><author><name sortKey="Wang, Qingren" sort="Wang, Qingren" uniqKey="Wang Q" first="Qingren" last="Wang">Qingren Wang</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:861E54931535C7A5AA5FC20FD1681FDC64EC8CFA</idno><date when="1986" year="1986">1986</date><idno type="doi">10.1007/BF02943303</idno><idno type="url">https://api.istex.fr/document/861E54931535C7A5AA5FC20FD1681FDC64EC8CFA/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002E35</idno><idno type="wicri:Area/Istex/Curation">002C07</idno><idno type="wicri:Area/Istex/Checkpoint">002E43</idno><idno type="wicri:doubleKey">1000-9000:1986:Wang Q:isoetrp:clustering:algorithm</idno><idno type="wicri:Area/Main/Merge">003E74</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">ISOETRP clustering algorithm and its application to tree classifier design</title><author><name sortKey="Wang, Qingren" sort="Wang, Qingren" uniqKey="Wang Q" first="Qingren" last="Wang">Qingren Wang</name><affiliation wicri:level="3"><country>République populaire de Chine</country><placeName><settlement type="city">Tianjin</settlement></placeName><wicri:orgArea>Nankai University</wicri:orgArea></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Computer Science and Technology</title><title level="j" type="abbrev">J. of Compt. Sci. & Technol.</title><idno type="ISSN">1000-9000</idno><idno type="eISSN">1860-4749</idno><imprint><publisher>Science Press</publisher><pubPlace>Beijing</pubPlace><date type="published" when="1986-03-01">1986-03-01</date><biblScope unit="volume">1</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="70">70</biblScope><biblScope unit="page" to="85">85</biblScope></imprint><idno type="ISSN">1000-9000</idno></series><idno type="istex">861E54931535C7A5AA5FC20FD1681FDC64EC8CFA</idno><idno type="DOI">10.1007/BF02943303</idno><idno type="ArticleID">BF02943303</idno><idno type="ArticleID">Art10</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1000-9000</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A new clustering algorithm ISOETRP has been developed. Several new objectives have been introduced to make ISOETRP particularly suitable to hierarchical pattern classification. These objectives are: a) minimizing overlap between pattern class groups, b) maximizing entropy reduction, and c) keeping balance between these groups. The overall objective to be optimized is GAIN=Entropy Reduction/(Overlap+1). Balance is controlled by maximizing the GAIN. An interactive version of ISOETRP has also been developed by means of an overlap table. It has been shown that ISOETRP gives much better results than other existing algorithms in optimizing the above objectives. ISOETRP has played an important role in designing many large tree classifiers, where the tree performance was improved by optimizing GAIN value.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003E74 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 003E74 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:861E54931535C7A5AA5FC20FD1681FDC64EC8CFA
|texte= ISOETRP clustering algorithm and its application to tree classifier design
}}
| This area was generated with Dilib version V0.6.32. |  |