Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/513431Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Kamsuriah Ahmad, Assoc. Prof. Dr. | - |
| dc.contributor.author | Said Mohammad Ahmad Altahat (P56198) | - |
| dc.date.accessioned | 2023-10-16T04:36:36Z | - |
| dc.date.available | 2023-10-16T04:36:36Z | - |
| dc.date.issued | 2020-12-06 | - |
| dc.identifier.other | ukmvital:130618 | - |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/513431 | - |
| dc.description | Solving the semantic ambiguities and identifying the meanings of schema labels plays an important role in the process of schema matching among various data sources. Semantic ambiguity, if undetected, can cause confusion in the interpretation of the name of schema attributes, and increases the number of the wrongly matched candidates, which negatively affects the accuracy of semantic correspondence. and thus requires dedicated semantic analysis and sense disambiguation processes to assign well-defined meanings to the ambiguous word. Therefore, there is a need to propose a new schema matching approach that can effectively deal with the semantic ambiguity problems so as to improve semantic correspondence accuracy. In this study, The proposed semantic schema-based matching (SSBM) approach exploits the fact that starting from the "intended meaning" associated with schema labels, it is possible to discover accurate semantic correspondences among the elements of different schemata. Additionally, such intended meaning can be detected using the Word Sense Disambiguation (WSD) algorithm. Researchers have explored semantic ambiguity over the years, and questionable accuracy for manual, semi-automatic, automatic and/or a combination of either existing Word Sense Disambiguation (WSD) algorithm have been shown. In addition, the existing WSD approaches typically focus on wellformed texts with grammatically correct sentences and standards, In well-formed texts, several features have to be employed to ascertain the fitting context for WSD. These features include surrounding words, discourse, collocations, parts of speech and syntactic features. Unfortunately, these features are not available in the database schema, where the schema label is represented by a single word, and most of the words in the schemata belong to the noun syntactic category. And as a consequence, a few algorithms can work well on semi-structured data (short text) with low accuracy, and thus show several limitations. Most existing approaches perform semantic disambiguation on all schema elements labeled rather than only processing those elements which are most ambiguous, which is time consuming and sometimes needless. Moreover, there are cases where the existing approaches assign to a term more than one meaning. Therefore, it is difficult and time consuming for a domain expert designer to select only one meaning for a term as correct for each element manually. Therefore, this study aims to propose a new Concept knowledge-based Disambiguation (CKBD) algorithm to overcome this limitation. The CKBD algorithm is designed for short texts(database schema) instead of well-formed texts and sentences , applicable to discover and represent, in a non-redundant way, the intended meaning of words. Finally, the proposed Semantic Schema-based Matching (SSBM), that involves CKBD, is then developed to test their effectiveness. The proposed( SSBM) is deeply grounded in the ability to solve semantic ambiguities and enhance the accuracy of semantic correspondence, which is also a factor that motivated this study. The validity of the proposed approaches has been supported by two experiments. In the first experiment, the performance of CKBD was evaluated in terms of accuracy, by comparing the CKBD results with the results produced by the standard baseline WordNet First Sense (WNFS). Further, the second experiment evaluated and compared the proposed (SSBM) with the well-known schema matching system in terms of accuracy. The results of both experiments reveal the feasibility of the proposed approaches and its potential use to overcome the limitations imposed by the inherent heterogeneity of the current database schema.,Ph.D | - |
| 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 | Universiti Kebangsaan Malaysia -- Dissertations | - |
| dc.subject | Dissertations, Academic -- Malaysia | - |
| dc.subject | Semantic ambiguities | - |
| dc.subject | Semantics | - |
| dc.subject | Wireless sensor networks | - |
| dc.title | Semantic schema-based matching approach for database schema matching | - |
| dc.type | Theses | - |
| dc.format.pages | 192 | - |
| dc.identifier.barcode | 005884(2021)(PL2) | - |
| Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_130618+Source01+Source010.PDF Restricted Access | 2.24 MB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.