Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/476155Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Sabrina Tiun, Dr. | |
| dc.contributor.author | Ahmed Mounaf Mahdi al-Musaw (P 65620) | |
| dc.date.accessioned | 2023-10-06T09:14:07Z | - |
| dc.date.available | 2023-10-06T09:14:07Z | - |
| dc.date.issued | 2014-03-14 | |
| dc.identifier.other | ukmvital:74635 | |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/476155 | - |
| dc.description | Instance-based matching is the process of finding the correspondence of schema elements by comparing the data from different data sources. It is used as an alternative when the match between schema elements fails. Instance-based matching is applied in many application areas such as website creation and management, schema evolution and migration, data warehousing, database design, and data integration. Sometimes the schema information such as (element name, description, data type, schema structure, etc) is unavailable or is unable to get the correct match especially when the element name is abbreviation, therefore, if the schema matching failed, the next step is to focus on values stored in the schemas. For these reasons, many recent approaches focus on instance-based matching. In this proposed research, we propose an approach that combines the strength of pattern recognition utilizing regular expressions for numerical domain as well with WordNet for string domain by getting the similarity coefficient in the range of [0,1]. In previous approach, the regular expression is achieved with a good accuracy for numerical instances only and is not implemented on string instances because we need to know the meaning of string to decide if there is a match or not. The use of WordNet-based measures for string instances should guarantee to improve the effectiveness in terms of Precision (P), Recall (R) and f-measure (F). This approach is evaluated with real datasets and the results are found better than using just equality measure for string especially if the schemas are disjoint. The approach achieved 95.3% to 100% of f-measure (F).,Master/Sarjana | |
| dc.language.iso | eng | |
| dc.publisher | UKM, Bangi | |
| dc.relation | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
| dc.rights | UKM | |
| dc.subject | Wordnet | |
| dc.subject | Regular expressions | |
| dc.subject | Instance-based schema matching | |
| dc.title | Wordnet and regular expressions for instance-based schema matching | |
| dc.type | theses | |
| dc.format.pages | 78 | |
| Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_74635+Source01+Source010.PDF Restricted Access | 950.72 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.