An application of array grammars to clustering analysis for syntactic patterns
Identifieur interne : 004076 ( Main/Merge ); précédent : 004075; suivant : 004077An application of array grammars to clustering analysis for syntactic patterns
Auteurs : Patrick Shen-Pei Wang [États-Unis]Source :
- Pattern Recognition [ 0031-3203 ] ; 1983.
Abstract
A new syntactic approach for clustering analysis using array grammars is introduced. The distance between an array and a core grammar characterizing a class of patterns is defined. It turns out this definition of distance is more satisfactory than a direct measurement between two arrays through error transformations. A 2-pass clustering procedure is proposed. This procedure does not require 2-dimensional arrays to be encoded into 1-dimensional strings and it can obtain less confusion and more accurate results than some other methods in the literature. An example of classifying a set of English handwritten characters is illustrated. Finally, several interesting future research topics and open problems are discussed.
Url:
DOI: 10.1016/0031-3203(84)90073-6
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002A43
- to stream Istex, to step Curation: 002835
- to stream Istex, to step Checkpoint: 003034
Links to Exploration step
ISTEX:49BD017140FEED09B332B3A04E26B9E7032C7397Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>An application of array grammars to clustering analysis for syntactic patterns</title><author><name sortKey="Wang, Patrick Shen Pei" sort="Wang, Patrick Shen Pei" uniqKey="Wang P" first="Patrick Shen-Pei" last="Wang">Patrick Shen-Pei Wang</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:49BD017140FEED09B332B3A04E26B9E7032C7397</idno><date when="1984" year="1984">1984</date><idno type="doi">10.1016/0031-3203(84)90073-6</idno><idno type="url">https://api.istex.fr/document/49BD017140FEED09B332B3A04E26B9E7032C7397/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002A43</idno><idno type="wicri:Area/Istex/Curation">002835</idno><idno type="wicri:Area/Istex/Checkpoint">003034</idno><idno type="wicri:doubleKey">0031-3203:1984:Wang P:an:application:of</idno><idno type="wicri:Area/Main/Merge">004076</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">An application of array grammars to clustering analysis for syntactic patterns</title><author><name sortKey="Wang, Patrick Shen Pei" sort="Wang, Patrick Shen Pei" uniqKey="Wang P" first="Patrick Shen-Pei" last="Wang">Patrick Shen-Pei Wang</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>College of Computer Science, Northeastern University, Boston, MA 02115</wicri:regionArea><placeName><region type="state">Massachusetts</region></placeName></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="1983">1983</date><biblScope unit="volume">17</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="441">441</biblScope><biblScope unit="page" to="451">451</biblScope></imprint><idno type="ISSN">0031-3203</idno></series><idno type="istex">49BD017140FEED09B332B3A04E26B9E7032C7397</idno><idno type="DOI">10.1016/0031-3203(84)90073-6</idno><idno type="PII">0031-3203(84)90073-6</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">A new syntactic approach for clustering analysis using array grammars is introduced. The distance between an array and a core grammar characterizing a class of patterns is defined. It turns out this definition of distance is more satisfactory than a direct measurement between two arrays through error transformations. A 2-pass clustering procedure is proposed. This procedure does not require 2-dimensional arrays to be encoded into 1-dimensional strings and it can obtain less confusion and more accurate results than some other methods in the literature. An example of classifying a set of English handwritten characters is illustrated. Finally, several interesting future research topics and open problems are discussed.</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 004076 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 004076 | 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:49BD017140FEED09B332B3A04E26B9E7032C7397
|texte= An application of array grammars to clustering analysis for syntactic patterns
}}
| This area was generated with Dilib version V0.6.32. |  |