@article {Yousfi2021588,
	title = {An Efficient Holistic Schema Matching Approach},
	journal = {Communications in Computer and Information Science},
	volume = {1350},
	year = {2021},
	note = {cited By 0},
	pages = {588-601},
	abstract = {Schema matching allows a certain way of communication between heterogeneous, autonomous and distributed data sources. We choose the matching approach depending on the number of sources we wish to integrate: pairwise matching approaches for a small to a medium total number of data sources, and holistic matching approaches for a big to a huge number of data sources. Nevertheless, current matching approaches were proven to achieve a very moderate matching accuracy. Moreover, holistic matching approaches operate in a series of two-way matching steps. In this paper, we present hMatcher, an efficient holistic schema matching approach. To execute holistic schema matching, hMatcher captures frequent schema elements in the given domain prior to any matching operation. To achieve high matching accuracy, hMatcher uses a context-based semantic similarity measure. Experimental results on real-world domain show that hMatcher performs holistic schema matching properly, and outperforms current matching approaches in terms of matching accuracy. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Computer science, Computers, Context-based semantics, Current matching, Distributed data sources, Holistic schema matching, Number of sources, Pairwise matching, Real world domain, Schema matching, Semantics},
	doi = {10.1007/978-3-030-69143-1_45},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85102749207\&doi=10.1007\%2f978-3-030-69143-1_45\&partnerID=40\&md5=d28b470cb44f6ca89c012259c51ec4f6},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@article {Yousfi2021129,
	title = {SBP: Preparation of Schema Elements to~Schema Matching},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {733 LNEE},
	year = {2021},
	note = {cited By 0},
	pages = {129-144},
	abstract = {Schema pre-matching is very critical for having schema elements fully ready for schema matching. Ideally, words are first extracted from the schema elements{\textquoteright} labels, and then the semantically corresponding elements are generated accordingly. Searching for the sense of words based on their vertical and horizontal contexts, and before performing schema matching is very crucial to obtain high matching accuracy and as a result increase the amount of accurate matches and reduce the number of inaccurate matches and missed matches. Nonetheless, this problem is much more challenging than it seems. This is because complete and precise information about the meaning behind each element is often unavailable. This paper presents SBP, a Sense-Based Pre-matching approach designed for hierarchical data representations. SBP consists of two main components. First, the words sets generator generates, from each element, a set of words that fully describes its meaning. Second, the words qualifier identifies the senses of words based on both their vertical and horizontal contexts. Experimental results on real-world domains show high matching accuracy obtained when using the SBP approach. {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.},
	keywords = {Electrical engineering, Hierarchical data, Mathematical techniques, Pre-matching, Real world domain, Schema matching},
	doi = {10.1007/978-981-33-4909-4_10},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85107373285\&doi=10.1007\%2f978-981-33-4909-4_10\&partnerID=40\&md5=8abeb96c3db9e0d4b54e753de8bc994e},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@conference {Yousfi2020,
	title = {CSSM: A context-based semantic similarity measure},
	booktitle = {2020 IEEE 2nd International Conference on Electronics, Control, Optimization and Computer Science, ICECOCS 2020},
	year = {2020},
	note = {cited By 1},
	abstract = {Semantic similarity is very critical in applications that manipulate data across heterogeneous, autonomous and distributed data sources. It helps connect these data sources. Nevertheless, current semantic similarity approaches were proven to achieve a very moderate accuracy. Furthermore, they are merely applicable when we wish to determine the semantic similarity between words. In this paper, we present CSSM, a Context-based Semantic Similarity Measure. Experimental results on Miller Charles benchmark dataset show that CSSM performs semantic similarity comparisons properly, and obtains high accuracy. {\textcopyright} 2020 IEEE.},
	keywords = {Benchmark datasets, Computer science, Computers, Context-based semantics, Control engineering, Data-sources, Distributed data sources, Electronics engineering, Electronics industry, High-accuracy, Semantic similarity, Semantic similarity approaches, Semantics},
	doi = {10.1109/ICECOCS50124.2020.9314376},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100120972\&doi=10.1109\%2fICECOCS50124.2020.9314376\&partnerID=40\&md5=3191da8d69fa40844c69e41c268c5a17},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@conference {Yousfi202085,
	title = {Spm: Preparing hierarchical data structures for schema matching},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2020},
	note = {cited By 0},
	pages = {85-90},
	abstract = {Schema pre-matching approaches prepare different schema elements for the matching step. Ideally words are extracted from schema elements{\textquoteright} labels and the semantic correspondences are generated. Identifying the sense of words based on their contexts and before schema matching is critical for increasing the total amount of true matches and decreasing significantly the total amount of both missed matches and false matches. However this problem is very challenging since we often do not have complete and precise information about the meaning behind each element. In this paper we present SPM a Sense-based Pre-Matching approach. SPM has two key modules. First the Sets of Words Generator module generates from every schema element a set of words that describes its meaning. Second the Sense Identifier module selects the most appropriate meaning of words based on their contexts. Experimental results on real-world datasets show high effectiveness achieved by SPM. {\textcopyright} 2020 ACM.},
	keywords = {False matches, Hierarchical data structure, Intelligent systems, Pre-matching, Real-world datasets, Schema matching, Semantic correspondence, Semantics},
	doi = {10.1145/3419604.3419782},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096412741\&doi=10.1145\%2f3419604.3419782\&partnerID=40\&md5=0ace2c18d2f9dd1d741d0d08acb83cfa},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@article {Yousfi2020655,
	title = {xMatcher: Matching extensible markup language schemas using semantic-based techniques},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {11},
	number = {8},
	year = {2020},
	note = {cited By 8},
	pages = {655-665},
	abstract = {Schema matching is a critical step in data integration systems. Most recent schema matching systems require a manual double-check of the matching results to add missed matches and remove incorrect matches. Manual correction is labor-intensive and time-consuming, however without it the results accuracy is significantly lower. In this paper, we present xMatcher, an approach to automatically match XML schemas. Given two schemas S and S2, xMatcher identifies semantically similar schema elements between S and S2. To obtain correct matches, xMatcher first transforms S and S2 into sets of words; then, it uses a context-based measure to identify the meanings of words in their contexts; next, it captures semantic relatedness between sets of words in different schemas; finally, it uses WordNet information to calculate the similarity values between semantically related sets and matches the pairs of sets whose similarity values are greater than or equal to 0:8. The results show that xMatcher provides superior matching accuracy compared to the state of the art matching systems. Overall, our proposal can be a stepping stone towards decreasing human assistance and overcoming the weaknesses of current matching initiatives in terms of matching accuracy. {\textcopyright} 2020, Science and Information Organization.},
	keywords = {Critical steps, Data integration, Data integration system, Hypertext systems, Labor time, Matching accuracy, Matching system, Matchings, Ontology, Schema matching, Semantic relatedness, Semantic similarity, Semantics, Wordnet, XML},
	doi = {10.14569/IJACSA.2020.0110880},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091018595\&doi=10.14569\%2fIJACSA.2020.0110880\&partnerID=40\&md5=dff26b18d541472b808a6d6c85f08039},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@conference {ElYazidi2015,
	title = {Mapping in GAV context},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Mediation is an approach that allows integrating different heterogeneous, distributed and scalable data sources. The objective of our paper is to define an approach of mapping, one of the essential operations that can describe and define the set of links between the two levels of mediation system: mediator schema (global) and schemas of sources to be integrated (local). Our approach allows to define the mapping for systems with complex schemas (schemas with complexes elements) and this by using functions developed that taking into account two aspects: syntactic and semantic. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358376},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962421014\&doi=10.1109\%2fSITA.2015.7358376\&partnerID=40\&md5=44fa100d239873e3ce44cc7228d15aa7},
	author = {El Yazidi, M.H. and Zellou, A. and Idri, A.}
}
@conference {ElYazidi2013,
	title = {A new approach of mapping},
	booktitle = {2013 3rd International Symposium ISKO-Maghreb},
	year = {2013},
	note = {cited By 0},
	abstract = {Data integration involves combining data residing in different sources, and providing the user a unified view of this data. The problem of designing data integration systems is important in current applications of the real world, and the question which arises at the mapping is how to link the global schema and the set of local schemas of sources. In this paper, we present our approach of mapping for mediation systems, a new approach that focuses on two main aspects, the syntactic aspect that takes into account the structure and shape of the elements of schemas, and semantic aspect related to the meaning of the elements of schemas. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ISKO-Maghreb.2013.6728197},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894137287\&doi=10.1109\%2fISKO-Maghreb.2013.6728197\&partnerID=40\&md5=e43d0431faff27e488fadb9353329892},
	author = {El Yazidi, M.H. and Zellou, A. and Idri, A.}
}
@article {ElYazidi20131650,
	title = {Towards a fuzzy mapping for virtual integration system},
	journal = {International Review on Computers and Software},
	volume = {8},
	number = {7},
	year = {2013},
	note = {cited By 1},
	pages = {1650-1657},
	abstract = {To access a unified way to different information sources while hiding the user autonomy, heterogeneity, distribution and evolution of these sources, we thought to integrate its different sources of information, one of the existing integration approaches appear mediation as virtual approach. The integration approach mediation is performed using a global schema, and a set of mapping (links) associating schemas of sources to integrate with the global schema. The problem arises in creating the set of correspondences between the elements of the schema global and all the elements of local schemas, in this paper we present our approach: A New Fuzzy Mapping Approach for Mediation Systems, a new approach based on fundamental principles of the theory of fuzzy sets. Our approach is to define and associate to each link between two elements a weight that reflects the degree of its existence, it is present in an analysis using two components: syntactic and semantic. {\textcopyright} 2013 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884268047\&partnerID=40\&md5=475d3b48645e8a3f8406303d28193d1a},
	author = {El Yazidi, M.H. and Zellou, A. and Idri, A.}
}
