Data classification based on tolerant rough set
Identifieur interne : 001B35 ( Main/Merge ); précédent : 001B34; suivant : 001B36Data classification based on tolerant rough set
Auteurs : Daijin Kim [Corée du Sud]Source :
- Pattern Recognition [ 0031-3203 ] ; 2000.
Abstract
This paper proposes a new data classification method based on the tolerant rough set that extends the existing equivalent rough set. Similarity measure between two data is described by a distance function of all constituent attributes and they are defined to be tolerant when their similarity measure exceeds a similarity threshold value. The determination of optimal similarity threshold value is very important for the accurate classification. So, we determine it optimally by using the genetic algorithm (GA), where the goal of evolution is to balance two requirements such that (1) some tolerant objects are required to be included in the same class as many as possible and (2) some objects in the same class are required to be tolerable as much as possible. After finding the optimal similarity threshold value, a tolerant set of each object is obtained and the data set is grouped into the lower and upper approximation set depending on the coincidence of their classes. We propose a two-stage classification method that all data are classified by using the lower approximation at the first stage and then the non-classified data at the first stage are classified again by using the rough membership functions obtained from the upper approximation set. The validity of the proposed classification method is tested by applying it to the IRIS data classification and its classification performance and processing time are compared with those of other classification methods such as BPNN, OFUNN, and FCM.
Url:
DOI: 10.1016/S0031-3203(00)00057-1
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002707
- to stream Istex, to step Curation: 002525
- to stream Istex, to step Checkpoint: 001096
Links to Exploration step
ISTEX:5BE297BDF32B180991D6F5BE9507F9B78EB0C9F3Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Data classification based on tolerant rough set</title><author><name sortKey="Kim, Daijin" sort="Kim, Daijin" uniqKey="Kim D" first="Daijin" last="Kim">Daijin Kim</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5BE297BDF32B180991D6F5BE9507F9B78EB0C9F3</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1016/S0031-3203(00)00057-1</idno><idno type="url">https://api.istex.fr/document/5BE297BDF32B180991D6F5BE9507F9B78EB0C9F3/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002707</idno><idno type="wicri:Area/Istex/Curation">002525</idno><idno type="wicri:Area/Istex/Checkpoint">001096</idno><idno type="wicri:doubleKey">0031-3203:2001:Kim D:data:classification:based</idno><idno type="wicri:Area/Main/Merge">001B35</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Data classification based on tolerant rough set</title><author><name sortKey="Kim, Daijin" sort="Kim, Daijin" uniqKey="Kim D" first="Daijin" last="Kim">Daijin Kim</name><affiliation wicri:level="1"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Department of Computer Science and Engineering, POSTECH, San 31, Hyoja-Dong, Nam-Gu, Pohang 790-784</wicri:regionArea><wicri:noRegion>Pohang 790-784</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Corée du Sud</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Pattern Recognition</title><title level="j" type="abbrev">PR</title><idno type="ISSN">0031-3203</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="2000">2000</date><biblScope unit="volume">34</biblScope><biblScope unit="issue">8</biblScope><biblScope unit="page" from="1613">1613</biblScope><biblScope unit="page" to="1624">1624</biblScope></imprint><idno type="ISSN">0031-3203</idno></series><idno type="istex">5BE297BDF32B180991D6F5BE9507F9B78EB0C9F3</idno><idno type="DOI">10.1016/S0031-3203(00)00057-1</idno><idno type="PII">S0031-3203(00)00057-1</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0031-3203</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This paper proposes a new data classification method based on the tolerant rough set that extends the existing equivalent rough set. Similarity measure between two data is described by a distance function of all constituent attributes and they are defined to be tolerant when their similarity measure exceeds a similarity threshold value. The determination of optimal similarity threshold value is very important for the accurate classification. So, we determine it optimally by using the genetic algorithm (GA), where the goal of evolution is to balance two requirements such that (1) some tolerant objects are required to be included in the same class as many as possible and (2) some objects in the same class are required to be tolerable as much as possible. After finding the optimal similarity threshold value, a tolerant set of each object is obtained and the data set is grouped into the lower and upper approximation set depending on the coincidence of their classes. We propose a two-stage classification method that all data are classified by using the lower approximation at the first stage and then the non-classified data at the first stage are classified again by using the rough membership functions obtained from the upper approximation set. The validity of the proposed classification method is tested by applying it to the IRIS data classification and its classification performance and processing time are compared with those of other classification methods such as BPNN, OFUNN, and FCM.</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 001B35 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001B35 | 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:5BE297BDF32B180991D6F5BE9507F9B78EB0C9F3
|texte= Data classification based on tolerant rough set
}}
| This area was generated with Dilib version V0.6.32. |  |