Dissertation/Thesis
Efficient Techniques for a Very Accurate Measurement of Dissimilarities Between Cyclic Patterns
| Τίτλος: | Efficient Techniques for a Very Accurate Measurement of Dissimilarities Between Cyclic Patterns |
|---|---|
| Συγγραφείς: | R. A. Mollineda, E. Vidal, F. Casacuberta |
| Συνεισφορές: | The Pennsylvania State University CiteSeerX Archives |
| Πηγή: | http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/2000/Mollineda00c.ps.gz. |
| Έτος έκδοσης: | 2000 |
| Συλλογή: | CiteSeerX |
| Θεματικοί όροι: | Cyclic patterns, cyclic strings, approximate string matching, structural pattern analysis, 2D shape recognition |
| Περιγραφή: | Two efficient approximate techniques for measuring dissimilarities of cyclic patterns are presented. They are inspired on the quadratic time algorithm proposed by Bunke and Bühler. The first technique completes pseudoalignments built by the Bunke and Bühler algorithm (BBA), obtaining full alignments between cyclic patterns. The edit cost of the minimum-cost alignment is given as an upper-bound estimation of the exact cyclic edit distance, which results in a more accurate bound than the lower one obtained by BBA. The second technique uses both bounds to compute a weighted average, achieving even more accurate solutions. Weights come from. |
| Τύπος εγγράφου: | Thesis |
| Περιγραφή αρχείου: | application/postscript |
| Γλώσσα: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4526 |
| Διαθεσιμότητα: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4526 http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/2000/Mollineda00c.ps.gz |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Αριθμός Καταχώρησης: | edsbas.C5DA952 |
| Βάση Δεδομένων: | BASE |
| FullText | Text: Availability: 0 CustomLinks: – Url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4526# Name: EDS - BASE (ns324271) Category: fullText Text: View record from BASE |
|---|---|
| Header | DbId: edsbas DbLabel: BASE An: edsbas.C5DA952 RelevancyScore: 748 AccessLevel: 3 PubType: Dissertation/Thesis PubTypeId: unknown PreciseRelevancyScore: 748.449523925781 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Efficient Techniques for a Very Accurate Measurement of Dissimilarities Between Cyclic Patterns – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22R%2E+A%2E+Mollineda%22">R. A. Mollineda</searchLink><br /><searchLink fieldCode="AR" term="%22E%2E+Vidal%22">E. Vidal</searchLink><br /><searchLink fieldCode="AR" term="%22F%2E+Casacuberta%22">F. Casacuberta</searchLink> – Name: Author Label: Contributors Group: Au Data: The Pennsylvania State University CiteSeerX Archives – Name: TitleSource Label: Source Group: Src Data: <i>http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/2000/Mollineda00c.ps.gz</i>. – Name: DatePubCY Label: Publication Year Group: Date Data: 2000 – Name: Subset Label: Collection Group: HoldingsInfo Data: CiteSeerX – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Cyclic+patterns%22">Cyclic patterns</searchLink><br /><searchLink fieldCode="DE" term="%22cyclic+strings%22">cyclic strings</searchLink><br /><searchLink fieldCode="DE" term="%22approximate+string+matching%22">approximate string matching</searchLink><br /><searchLink fieldCode="DE" term="%22structural+pattern+analysis%22">structural pattern analysis</searchLink><br /><searchLink fieldCode="DE" term="%222D+shape+recognition%22">2D shape recognition</searchLink> – Name: Abstract Label: Description Group: Ab Data: Two efficient approximate techniques for measuring dissimilarities of cyclic patterns are presented. They are inspired on the quadratic time algorithm proposed by Bunke and Bühler. The first technique completes pseudoalignments built by the Bunke and Bühler algorithm (BBA), obtaining full alignments between cyclic patterns. The edit cost of the minimum-cost alignment is given as an upper-bound estimation of the exact cyclic edit distance, which results in a more accurate bound than the lower one obtained by BBA. The second technique uses both bounds to compute a weighted average, achieving even more accurate solutions. Weights come from. – Name: TypeDocument Label: Document Type Group: TypDoc Data: Thesis – Name: Format Label: File Description Group: SrcInfo Data: application/postscript – Name: Language Label: Language Group: Lang Data: English – Name: NoteTitleSource Label: Relation Group: SrcInfo Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4526 – Name: URL Label: Availability Group: URL Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4526<br />http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/2000/Mollineda00c.ps.gz – Name: Copyright Label: Rights Group: Cpyrght Data: Metadata may be used without restrictions as long as the oai identifier remains attached to it. – Name: AN Label: Accession Number Group: ID Data: edsbas.C5DA952 |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.C5DA952 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English Subjects: – SubjectFull: Cyclic patterns Type: general – SubjectFull: cyclic strings Type: general – SubjectFull: approximate string matching Type: general – SubjectFull: structural pattern analysis Type: general – SubjectFull: 2D shape recognition Type: general Titles: – TitleFull: Efficient Techniques for a Very Accurate Measurement of Dissimilarities Between Cyclic Patterns Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: R. A. Mollineda – PersonEntity: Name: NameFull: E. Vidal – PersonEntity: Name: NameFull: F. Casacuberta – PersonEntity: Name: NameFull: The Pennsylvania State University CiteSeerX Archives IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2000 Identifiers: – Type: issn-locals Value: edsbas – Type: issn-locals Value: edsbas.oa Titles: – TitleFull: http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/2000/Mollineda00c.ps.gz Type: main |
| ResultId | 1 |