@article {Ajallouda2022440,
	title = {Automatic Key-Phrase Extraction: Empirical Study of Graph-Based Methods},
	journal = {Lecture Notes in Networks and Systems},
	volume = {489 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {440-456},
	abstract = {Key-phrases in a document are phrases that provide a high-level description of its content without reading it completely. In some research articles, authors specify key-phrases in the articles they have written. However, the vast majority of books, articles, and web pages published every day, lack key-phrases. The manual extraction of these phrases is a tedious task and takes a long time. For this reason, automatic key-phrase extraction (AKE), which is an area of Text Mining, remains the best solution to overcome these difficulties. Because they are used in many Natural Language Processing (NLP) applications, such as text summarization and text classification. This article presents a comparison of some methods of extracting key-phrases from documents. Especially the graph-based approaches. These approaches are evaluated by their abilities to extract key-phrases. Our work focuses on the study of the performance of these methods in extracting key-phrases, whether from short or long texts, with the aim of providing information that contributes to improving their efficiency. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-07969-6_33},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135019633\&doi=10.1007\%2f978-3-031-07969-6_33\&partnerID=40\&md5=399dd65be1f33d58c24c1d31777d2b87},
	author = {Ajallouda, L. and Fagroud, F.Z. and Zellou, A. and Benlahmar, E.H.}
}
@conference {Mohammed2022,
	title = {Current Research Trends in Fake News Areas: A Systematic Mapping Study},
	booktitle = {2022 2nd International Conference on Innovative Research in Applied Science, Engineering and Technology, IRASET 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {Nowadays, online news plays an important role in people{\textquoteright}s decisions and behaviors. Some of this news shared on the web may contain deceptive in-formation to mislead those peoples which may cause uncertainty and confusion such in election choices and purchasing decision. Thereafter, fake news is becoming a trending area of research. However, fake news can be differentiated into several subcategories, such as fake reviews, Propaganda, Ru-mor, spams etc. In this paper, fake news studies are analyzed and classified based on their focus areas, this helps to understand that which fake news areas have higher concentrations of research efforts and which area requires the research attention. The systematic study is conducted by planning the mapping protocol defining the search process that planned to be executed using set of inclusion and exclusion criteria on two bibliographic databases (Scopus and IEEE explore) which aims to include relevant papers related to our work in order to identify what the research trends in fake news are. {\textcopyright} 2022 IEEE.},
	keywords = {{\textquoteright}current, Deceptive information, Disinformation, Fake news, Information services, Mapping, Misinformation, Online news, Purchasing decisions, Research trends, Systematic mapping studies, Uncertainty},
	doi = {10.1109/IRASET52964.2022.9737869},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85141118886\&doi=10.1109\%2fIRASET52964.2022.9737869\&partnerID=40\&md5=2ab3889a7ccff7952519e091ca8cf217},
	author = {Mohammed, E. and Zellou, A.}
}
@conference {Ajallouda2022,
	title = {Doc2Vec, SBERT, InferSent, and USE Which embedding technique for noun phrases?},
	booktitle = {2022 2nd International Conference on Innovative Research in Applied Science, Engineering and Technology, IRASET 2022},
	year = {2022},
	note = {cited By 4},
	abstract = {Phrase embedding is a technique of representing phrases in vector space. A very high effort has been made to develop this technique to improve tasking in various natural language processing (NLP) applications. The evaluation of phrase embedding has been presented in many studies, but most of them focused on the intrinsic or extrinsic evaluation process regardless of the type of the phrase (noun phrases, Verb phrases...). In the literature, there is no study evaluating the embedding of noun phrases, knowing that this type is used by many NLP applications, such as automatic key-phrase extraction (AKE), information retrieval, and question answering. In this article, we will present an empirical study to compare the most common phrase embedding techniques, to determine the most suitable for representing noun phrases. Dataset used in the comparison process consists of the noun phrases from the Inspec and SemEval2010 datasets, to which we have added their manually defined synonyms. {\textcopyright} 2022 IEEE.},
	keywords = {Embedding technique, Embeddings, Empirical studies, Key-phrases extractions, Natural language processing applications, Natural language processing systems, Noun phrase, Phrase embedding technique, Question Answering, Vector spaces},
	doi = {10.1109/IRASET52964.2022.9738300},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127985676\&doi=10.1109\%2fIRASET52964.2022.9738300\&partnerID=40\&md5=f274393a28334ba6d338a5dc4e3b5f79},
	author = {Ajallouda, L. and Najmani, K. and Zellou, A. and Benlahmar, E.H.}
}
@article {Rassam2022387,
	title = {Empirical Study: What is the Best N-Gram Graphical Indexing Technique},
	journal = {Lecture Notes in Networks and Systems},
	volume = {489 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {387-398},
	abstract = {Recent research shows that indexing techniques, such as n-gram models, are useful at a wide variety of software engineering tasks, e.g., data extraction, document indexing, etc. However, these models require some numerous parameters. Moreover, the different ways one can extract data essentially yield different models. In this paper, we focus on n-gram models and evaluate how the use different set of methods and n values impact the predicting ability of these models. Thus, we compare the use of multiple techniques and sets of different parameters (n values character gram and word gram) with the aim of identifying the most appropriate indexing technique. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-07969-6_29},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135074852\&doi=10.1007\%2f978-3-031-07969-6_29\&partnerID=40\&md5=76e738e6a8c5330d57d78e968047e57f},
	author = {Rassam, L. and Zellou, A. and Rachad, T.}
}
@conference {Rassam202278,
	title = {Fuzzy Logic-based N-gram Graph Technique for Evaluating Textual Documents Indexes},
	booktitle = {2022 4th International Conference on Computer Communication and the Internet, ICCCI 2022},
	year = {2022},
	note = {cited By 0},
	pages = {78-82},
	abstract = {Fuzzy logic is a term that is used more and more often by researchers specialized in information retrieval and indexing. It is supposed to fill the gaps of the current domain by adding meaning to the information. In this article, the main goal is introducing the fuzzy logic approach in the field of the representation of a corpus of documents, more precisely in the proposal of a new method based on fuzzy functions that allow the evaluation of the generated indexes of a specific corpus.The evaluation is based on calculating the degrees of relevance of a term in relation to another whether it is in the same document of the corpus or in two or more completely different documents of the same corpus. {\textcopyright} 2022 IEEE.},
	keywords = {{\textquoteright}current, Computer circuits, Degree of relevance, Fuzzy function, Fuzzy logic, Fuzzy logic approach, Fuzzy-Logic, Graph technique, Indexing, Indexing (of information), N-grams, Textual documents},
	doi = {10.1109/ICCCI55554.2022.9850268},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85137083735\&doi=10.1109\%2fICCCI55554.2022.9850268\&partnerID=40\&md5=3d771186a1a254dd249e3647a64918b2},
	author = {Rassam, L. and Aldiebesghanem, C. and Zellou, A. and Lahmar, E.B.}
}
@article {Najmani2022556,
	title = {The Impact of the k-Nearest Neighbor Parameters in Collaborative Filtering Recommender Systems},
	journal = {Lecture Notes in Networks and Systems},
	volume = {489 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {556-567},
	abstract = {Recommender Systems (RS) have become very important recently, they are a main component of many applications in different fields. They aim to give beneficial information according to the profile of each user among the huge existing online information. RS are based on several approaches to provide the best results and give satisfaction to the active user. Collaborative filtering is one of these approaches. It helps to choose a product according to the consumer{\textquoteright}s preference from many and various choices. It uses the k-Nearest Neighbor (kNN) technique for the extraction of similar users from the group of users. In this paper, we will study the effect of the parameters of the kNN algorithm on the obtained results. For that, we have varied the value of k, then we have measured for each value the prediction accuracy, using the Root Mean Square Error (RMSE), and the Mean Absolute Error (MAE) metrics. The experiments are carried out also to find the value of k which gives good results in both metrics. Then we have calculated also the RMSE and MAE metrics for different similarities in order to find the similarity which gives good results compared to others. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-07969-6_42},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135066110\&doi=10.1007\%2f978-3-031-07969-6_42\&partnerID=40\&md5=c48c9d53d83b702abcc99c35254e6b72},
	author = {Najmani, K. and Ajallouda, L. and Benlahmar, E.H. and Sael, N. and Zellou, A.}
}
@article {Ajallouda2022283,
	title = {KP-USE: An Unsupervised Approach for Key-Phrases Extraction from Documents},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {13},
	number = {4},
	year = {2022},
	note = {cited By 4},
	pages = {283-289},
	abstract = {Automatic key-phrase extraction (AKE) is one of the most popular research topics in the field of natural language processing (NLP). Several techniques were used to extract the key-phrases: statistical, graph-based, classification algorithms, deep learning, and embedding techniques. AKE approaches that use embedding techniques are based on calculating the semantic similarity between a vector representing the document and the vectors representing the candidate phrases. However, most of these methods only give acceptable results in short texts such as abstracts paper, but on the other hand, their performance remains weak in long documents because it is represented by a single vector. Generally, the key phrases of a document are often expressed in certain parts of the document as, the title, the summary, and to a lesser extent in the introduction and the conclusion, and not of the entire document. For this reason, we propose in this paper KP-USE. A method extracts key-phrases from long documents based on the semantic similarity of candidate phrases to parts of the document containing keyphrases. KP-USE makes use of the Universal Sentence Encoder (USE) as an embedding method for text representation. We evaluated the performance of the proposed method on three datasets containing long papers, namely, NUS, Krapivin2009, and SemEval2010, where the results showed its performance outperforms recent AKE methods which are based on embedding techniques. {\textcopyright} 2022. All Rights Reserved.},
	keywords = {Deep learning, Embedding technique, Embeddings, Extraction, Graph-based classifications, Graphic methods, Key-phrase, Key-phrases extractions, Natural language processing systems, Performance, Research topics, Semantic similarity, Semantics, Signal encoding, Statistical graphs, Universal sentence encoder, Unsupervised approaches},
	doi = {10.14569/IJACSA.2022.0130433},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129921696\&doi=10.14569\%2fIJACSA.2022.0130433\&partnerID=40\&md5=880d07ce539281dced3a51a82de6a16c},
	author = {Ajallouda, L. and Fagroud, F.Z. and Zellou, A. and Lahmar, E.B.}
}
@article {Benabbes202261,
	title = {New Automatic Hybrid Approach for Tracking Learner Comprehension Progress in the LMS},
	journal = {International Journal of Interactive Mobile Technologies},
	volume = {16},
	number = {19},
	year = {2022},
	note = {cited By 0},
	pages = {61-80},
	abstract = {Learning style is a significant learner-difference factor. Each learner has a preferred learning style and a different way of processing and understanding the novelty. In this paper, a new approach that automatically identifies learners learning styles based on their interaction with the Learning Management System (LMS) is introduced. To implement this approach, the traces of 920 enrolled learners in three agronomy courses were exploited using an unsupervised clustering method to group learners according to their degree of engagement. The decision tree classification algorithm relies on the decision rules construction, which is widely adopted to identify the accurate learning style. As the lack of good decision rules would lead to learning style misclassification, the Felder-Silverman Learning Style Model (FSLSM) is used as it is among the most adopted models in the technology of quality improvement process. The results of this research highlight that most learners prefer the global learning style {\textcopyright} 2022, International Journal of Interactive Mobile Technologies.All Rights Reserved.},
	doi = {10.3991/ijim.v16i19.33733},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85140748669\&doi=10.3991\%2fijim.v16i19.33733\&partnerID=40\&md5=4c17d51043684f46667ce010388153ce},
	author = {Benabbes, K. and Hmedna, B. and Housni, K. and Zellou, A. and El Mezouary, A.}
}
@conference {Najmani2022,
	title = {Offline and Online Evaluation for Recommender Systems},
	booktitle = {2022 International Conference on Intelligent Systems and Computer Vision, ISCV 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {Recommender systems aim to facilitate decision making for users by offering them information according to their preferences, they are now popular in several application domains. The evaluation of recommender systems is very important to have an effective application in practice. In addition, it focuses to find better algorithms and evaluate their performance. However, researchers did not give much attention to it in this field. There are various ways to evaluate a recommender system. In this paper, we will discuss the main types of evaluations in this domain, which are offline and online evaluation, we will start with an overview of recommender systems, then we will present each type of evaluation, and we will compare the offline and the online evaluation for recommender systems. We will base on ten factors which are, the reproducibility, the reliability of the results of each type of evaluation, the preparation cost, the evaluation, the stability, the possibility of extensibility that{\textquoteright}s mean if we can add new metrics or not, the scalability, the passed time, deep analysis, and the sparsity metric. Finally, we will discuss the factors which are presented in the comparison. {\textcopyright} 2022 IEEE.},
	keywords = {Applications domains, Decision making, Decisions makings, It focus, Offline, Offline evaluation, On-line evaluation, Online systems, Performance, Recommender Systems, Reliability analysis, Reproducibilities},
	doi = {10.1109/ISCV54655.2022.9806059},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85134293509\&doi=10.1109\%2fISCV54655.2022.9806059\&partnerID=40\&md5=31b11e740c58602df2b12bf3260a1ec9},
	author = {Najmani, K. and Ajallouda, L. and Benlahmar, E.H. and Sael, N. and Zellou, A.}
}
@article {Ajallouda20221601,
	title = {Present and absent keyphrases extraction: an approach based on sentence embedding},
	journal = {Indonesian Journal of Electrical Engineering and Computer Science},
	volume = {28},
	number = {3},
	year = {2022},
	note = {cited By 0},
	pages = {1601-1612},
	abstract = {The automatic keyphrases extraction (AKE) of a document is any expression by which we can learn its content without having to read it. Keyphrases are exploited in natural language processing (NLP) applications. These phrases are often mentioned in the document but there may be some keyphrases that are not mentioned. In the field of AKE, researchers have exploited many techniques, such as statistical calculation, deep learning algorithms, graph representation, and sentence embedding techniques. Approaches that exploit embedding techniques calculate the similarity between a document and a candidate keyphrase, where similar phrases to the document are considered as keyphrases. Representing the document by a single vector makes its performance poor, especially in long documents. This is in addition to the inability of these methods to generate absent keyphrases. In order to overcome these problems, our paper proposes an unsupervised approach to AKE, based on the universal sentence encoder (USE) to represent candidate keyphrases and parts of the document probably containing keyphrases. Our method also generates keyphrases not mentioned in the text. We compared the performance of the proposed approach with other methods based on embedding techniques, where the results showed the superiority of our approach especially in long documents. {\textcopyright} 2022 Institute of Advanced Engineering and Science. All rights reserved.},
	doi = {10.11591/ijeecs.v28.i3.pp1601-1612},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85140265191\&doi=10.11591\%2fijeecs.v28.i3.pp1601-1612\&partnerID=40\&md5=b9dbdcf5c9109b2737938f306a2aee4f},
	author = {Ajallouda, L. and Zellou, A.}
}
@article {Benabbes20221017,
	title = {Recommendation System Issues, Approaches and Challenges Based on User Reviews},
	journal = {Journal of Web Engineering},
	volume = {21},
	number = {4},
	year = {2022},
	note = {cited By 0},
	pages = {1017-1054},
	abstract = {With the ever-increasing volume of online information, recommender systems have been effective as a strategy to overcome information overload. They have a wide range of applications in many fields, including e-learning, e-commerce, e-government and scientific research. Recommender systems are search engines that are based on the user{\textquoteright}s browsing history to suggest a product that expresses their interests. Being usually in the form of textual comments and ratings, such reviews are a valuable source of information about users{\textquoteright} perceptions. Recommender systems (RSs) apply various approaches to predict users{\textquoteright} interest on information, products and services among a huge amount of available items. In this paper, we will describe the recommender system, discuss ongoing research in this field, and address the challenges, limitations and the techniques adopted. This paper also discusses how review texts are interpreted to solve some of the major problems with traditional recommendation techniques. To assess the value of a recommender system, qualitative evaluation measures are discussed as well in this research. Based on a series of selected articles published between 2008 and 2020, the study allowed us to conclude that the efficiency of RSs is strongly centered on the control of information context, the operated exploration algorithm, the method, and the type of processed data in addition to the information on users{\textquoteright} trust. {\textcopyright} 2022 River Publishers. All rights reserved.},
	doi = {10.13052/jwe1540-9589.2143},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85131073458\&doi=10.13052\%2fjwe1540-9589.2143\&partnerID=40\&md5=56b7da2c9aa6d4c44328fa667db5ef0a},
	author = {Benabbes, K. and Housni, K. and El Mezouary, A. and Zellou, A.}
}
@conference {Reda2022,
	title = {SMDQM-Social Media Data Quality Assessment Model},
	booktitle = {2022 2nd International Conference on Innovative Research in Applied Science, Engineering and Technology, IRASET 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {Social media has taken a dominant place in people{\textquoteright}s lives since it become more than just a mode of communication between individuals. They regularly share their daily activities, experiences, and exchange interests and opinions on social media sites, leading to a flood of information that can be used by consumers. However, the reduced posting barriers, no operational costs and easy-to-use interactive interfaces have combined to create a variety of data quality issues in social media, making it difficult to obtain relevant, timely and accurate data. Given the increasing use of social media by users to obtain news and information first hand, they are required to filter a significant volume of data to reach the most satisfying to their request, therefore we can say that the process is more qualitative than quantitative. This paper proposes a new classification of data quality dimensions towards a social media data quality model called SMDQM(Social Media Data Quality Model), for this the quality of social media data is discussed, then we present the steps involved to create our model SMDQM. This attempt will be established by considering and discussing a state of the art in the field of social media and data quality. {\textcopyright} 2022 IEEE.},
	keywords = {Assessment, Daily activity, data quality, Data quality assessment, Data quality models, Data reduction, Interactive interfaces, Quality assessment model, Quality modeling, social media, Social media datum, Social networking (online)},
	doi = {10.1109/IRASET52964.2022.9738330},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127964567\&doi=10.1109\%2fIRASET52964.2022.9738330\&partnerID=40\&md5=566d4361e0b4742bd3c69530f2eaf99f},
	author = {Reda, O. and Zellou, A.}
}
@article {Ajallouda202231,
	title = {A Systematic Literature Review of Keyphrases Extraction Approaches},
	journal = {International Journal of Interactive Mobile Technologies},
	volume = {16},
	number = {16},
	year = {2022},
	note = {cited By 0},
	pages = {31-58},
	abstract = {The keyphrases of a document are the textual units that characterize its content such as the topics it addresses, its ideas, their field, etc. Thousands of books, articles and web pages are published every day. Manually extracting keyphrases is a tedious task and takes a lot of time. Automatic keyphrases extraction is an area of text mining that aims to identify the most useful and important phrases that give meaning to the content of a document. Keyphrases can be used in many Natural Language Processing (NLP) applications, such as text summarization, text clustering and text classification. This article provides a Systematic Literature Review (SLR) to investigate, analyze, and discuss existing relevant contributions and efforts that use new concepts and tools to improve keyphrase extraction. We have studied the supervised and unsupervised approaches to extracting keyphrases published in the period 2015{\textendash}2022. We have also identified the steps most commonly used by the different approaches. Additionally, we looked at the criteria that should be evaluated to improve the accuracy of keyphrases extraction. Each selected approach was evaluated for its ability to extract keyphrases. Our findings highlight the importance of keyphrase extraction, and provide researchers and practitioners with information about proposed solutions and their limitations, which contributes to extract keyphrases in a powerful and meaningful way effective {\textcopyright} 2022, International Journal of Interactive Mobile Technologies.All Rights Reserved.},
	doi = {10.3991/ijim.v16i16.33081},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85137632849\&doi=10.3991\%2fijim.v16i16.33081\&partnerID=40\&md5=cf158a54305193c3291a26b2c49d765f},
	author = {Ajallouda, L. and Fagroud, F.Z. and Zellou, A. and Benlahmar, E.H.}
}
@article {Ajallouda2022466,
	title = {Toward a New Process for Candidate Key-Phrases Extraction},
	journal = {Lecture Notes in Networks and Systems},
	volume = {455 LNNS},
	year = {2022},
	note = {cited By 3},
	pages = {466-474},
	abstract = {Key-phrases in a document are the terms that allow us to have or know an idea of its content without having to read it. They can be used in many Natural Language Processing (NLP) applications, such as text summarization, machine translation, and text classification. These phrases are selected from a set of terms in the document called candidate key-phrases. Thus, any flaws that may arise during the selection of candidate phrases may affect the automatic key-phrase extraction (AKE). Despite the importance of identifying candidate key-phrases in the AKE process, we found a very limited number of researchers interested in identifying their features in the document. In this paper, we will present the features that will allow the identification of candidate key-phrases, based on the study and analysis of the features of 60,000 key-phrases manually selected from five different datasets. To improve the performance of AKE approaches. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-02447-4_48},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85130348254\&doi=10.1007\%2f978-3-031-02447-4_48\&partnerID=40\&md5=7bc1168842009b4c70c8fea6cc905514},
	author = {Ajallouda, L. and Hourrane, O. and Zellou, A. and Benlahmar, E.H.}
}
@article {Fagroud2021335,
	title = {A Brief Survey on Internet of Things (IoT)},
	journal = {Lecture Notes in Networks and Systems},
	volume = {211 LNNS},
	year = {2021},
	note = {cited By 5},
	pages = {335-344},
	abstract = {Today it be a necessity to setting off past the thought that IT as a cost center and seeing it as a benefit center, on backing of the improvement and method of the organization. Internet of things can be defined as a propelled standard which make straightforward gadget a shrewdly gadgets which allow transferring simple device an intelligent devices capable of exchanging data over a network without human interaction. It represent a technology that interest research and industry, also serve on transform the way to think, and work. This paper present an overview on Internet of things (IoT), its application areas and its challenges in the aim to give a guideline to future researchers. {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-030-73882-2_31},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85111331935\&doi=10.1007\%2f978-3-030-73882-2_31\&partnerID=40\&md5=5c90aac71bfc8656430ff23c2e19c367},
	author = {Fagroud, F.Z. and Ajallouda, L. and Lahmar, E.H.B. and Toumi, H. and Zellou, A. and El Filali, S.}
}
@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 {ElHafidy2021,
	title = {Gamified mobile applications for improving driving behavior: A systematic mapping study},
	journal = {Mobile Information Systems},
	volume = {2021},
	year = {2021},
	note = {cited By 4},
	abstract = {Many research works and official reports approve that irresponsible driving behavior on the road is the main cause of accidents. Consequently, responsible driving behavior can significantly reduce accidents{\textquoteright} number and severity. Therefore, in the research area as well as in the industrial area, mobile technologies are widely exploited in assisting drivers in reducing accident rates and preventing accidents. For instance, several mobile apps are provided to assist drivers in improving their driving behavior. Recently and thanks to mobile cloud computing, smartphones can benefit from the computing power of servers in the cloud for executing machine learning algorithms. Therefore, many mobile applications of driving assistance and control are based on machine learning techniques to adjust their functioning automatically to driver history, context, and profile. Additionally, gamification is a key element in the design of these mobile applications that allow drivers to develop their engagement and motivation to improve their driving behavior. To have an overview concerning existing mobile apps that improve driving behavior, we have chosen to conduct a systematic mapping study about driving behavior mobile apps that exist in the most common mobile apps repositories or that were published as research works in digital libraries. In particular, we should explore their functionalities, the kinds of collected data, the used gamification elements, and the used machine learning techniques and algorithms. We have successfully identified 220 mobile apps that help to improve driving behavior. In this work, we will extract all the data that seem to be useful for the classification and analysis of the functionalities offered by these applications. {\textcopyright} 2021 Abderrahim El hafidy et al.},
	keywords = {Accidents, Computing power, Digital libraries, Driving assistance, Driving behavior, Gamification, Industrial area, Industrial research, Learning algorithms, Machine learning, Machine learning techniques, Mapping, Mobile applications, Mobile cloud computing, Mobile computing, Mobile Technology, Systematic mapping studies},
	doi = {10.1155/2021/6677075},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85114117887\&doi=10.1155\%2f2021\%2f6677075\&partnerID=40\&md5=6ad1b624deabb49917039716eb133f13},
	author = {El Hafidy, A. and Rachad, T. and Idri, A. 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 {Yousfi2020155,
	title = {HASSO: A highly-automated source selection and ordering system based on data quality factors},
	booktitle = {2020 International Conference on Advanced Computer Science and Information Systems, ICACSIS 2020},
	year = {2020},
	note = {cited By 0},
	pages = {155-164},
	abstract = {Big data integration gives access to a large number of data sources through a unified user interface. Answers include high-quality data, medium-quality data, and low-quality data. Selecting a subset of high accurate and consistent data sources and ordering them appropriately is critical to obtain as many high-quality answers as possible right after querying few data sources. However, the process of selecting and ordering data sources can be quite complicated and can present several challenges. The main challenge faced during that process is identifying the most adequate data quality factors to consider. In this paper, we present HASSO, a Highly-Automated Source Selection and Ordering System based on data quality factors. To produce consistent and high accurate answers, HASSO identifies, for each data source, its domain, data consistency and data accuracy using the schema matches. To maximize the total number of complete and non-redundant answers returned right after querying a small number of data sources, HASSO orders data sources in terms of their data overlap and in a decreasing order of their overall coverage. Experimental results in real-world domains show that HASSO produces high-quality answers at high speed. {\textcopyright} 2020 IEEE.},
	keywords = {Data accuracy, Data consistency, Data integration, High quality data, Information systems, Information use, Low quality datum, Number of datum, Order systems, Real world domain, Source selection, User interfaces},
	doi = {10.1109/ICACSIS51025.2020.9263243},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85099753285\&doi=10.1109\%2fICACSIS51025.2020.9263243\&partnerID=40\&md5=b3fbfb1a2a633f6f2b8dce8ca9bc392f},
	author = {Yousfi, A. and Yazidi, M.H.E. and Zellou, A.}
}
@conference {Ajallouda2020169,
	title = {K-means hac and fcm which clustering approach for arabic text?},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2020},
	note = {cited By 0},
	pages = {169-174},
	abstract = {Today we are witnessing rapid growth in Web resources that allow Internet users to express and share their ideas opinions and judgments on a variety of issues. Several classification approaches have been proposed to classify textual data. But all these approaches require us to label the clusters we want to obtain. Which in reality is not available because we do not know in advance the information that can be proposed through these opinions. To overcome this constraint clustering approaches such as K-mean HAC or FCM can be exploited. In this paper we present and compare these approaches. And to show the importance of exploiting clustering algorithms to classify and analyze textual data in Arabic. By applying them to a real case that has created a great debate in Morocco which is the case of teachers contracting with academies. {\textcopyright} 2020 ACM.},
	keywords = {Arabic texts, Classification (of information), Classification approach, Clustering approach, Intelligent systems, Internet users, K-means clustering, Rapid growth, Real case, Textual data, Web resources},
	doi = {10.1145/3419604.3419779},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096415898\&doi=10.1145\%2f3419604.3419779\&partnerID=40\&md5=8aca383d8f485d15b3da191f03c5bf62},
	author = {Ajallouda, L. and Fagroud, F.Z. and Zellou, A. and Benlahmar, E.H.}
}
@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 {Idrissi2020,
	title = {A systematic literature review of sparsity issues in recommender systems},
	journal = {Social Network Analysis and Mining},
	volume = {10},
	number = {1},
	year = {2020},
	note = {cited By 36},
	abstract = {The tremendous expansion of information available on the web voraciously bombards users, leaving them unable to make decisions and having no way of stepping back to process it all. Recommender systems have emerged in this context as a solution to assist users by providing them with choices of appropriate and relevant items according to their preferences and interests. However, despite their success in many fields and application domains, they still suffer from the main limitation, known as the sparsity problem. The latter refers to the situation where insufficient transactional and feedback data are available for inferring specific user{\textquoteright}s similarities, which affects the accuracy and performance of the recommender system. This paper provides a systematic literature review to investigate, analyze, and discuss the existing relevant contributions and efforts that use new concepts and tools to alleviate the sparsity issues. We have investigated the contributed similarity measures and have uncovered proposed approaches in different types of recommender systems. We have also identified the types of side information more commonly employed by recommender systems. Furthermore, we have examined the criteria that should be valued to enhance recommendation accuracy on sparse data. Each selected article was evaluated for its ability to mitigate the sparsity impediment. Our findings emphasize and accentuate the importance of sparsity in recommender systems and provide researchers and practitioners with insights on proposed solutions and their limitations, which contributes to the development of more powerful systems that can significantly solve the sparsity hurdle and thus enhance further the accuracy and efficiency of recommendations. {\textcopyright} 2020, Springer-Verlag GmbH Austria, part of Springer Nature.},
	keywords = {Collaborative filtering, Powerful systems, Recommendation accuracy, Recommender Systems, Side information, Similarity measure, Sparsity, Sparsity problems, Stepping back, Systematic literature review},
	doi = {10.1007/s13278-020-0626-2},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079359447\&doi=10.1007\%2fs13278-020-0626-2\&partnerID=40\&md5=742624a91b29d333d839a4cc18b46ced},
	author = {Idrissi, N. and Zellou, A.}
}
@conference {Reda202091,
	title = {Towards a data quality assessment in big data},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2020},
	note = {cited By 4},
	pages = {91-96},
	abstract = {In recent years, as more and more data sources have become available and the volumes of data potentially accessible have increased, the assessment of data quality has taken a central role whether at the academic, professional or any other sector. Given that users are often concerned with the need to filter a large amount of data to better satisfy their requirements and needs, and that data analysis can be based on inaccurate, incomplete, ambiguous, duplicated and of poor quality, it makes everyone wonder what the results of these analyses will really be like. However, there is a very complex process involved in the identification of new, valid, potentially useful and meaningful data from a large data collection and various information systems, and is critically dependent on a number of measures to be developed to ensure data quality. To this end, the main objective of this paper is to introduce a general study on data quality related with big data, by providing what other researchers came up with on that subject. The paper will be finalized by a comparative study between the different existing data quality models. {\textcopyright} 2020 ACM.},
	keywords = {Big data, Comparative studies, Complex Processes, data quality, Data quality assessment, Data quality models, Data reduction, Data-sources, Intelligent systems, Large amounts, Large data},
	doi = {10.1145/3419604.3419803},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096426287\&doi=10.1145\%2f3419604.3419803\&partnerID=40\&md5=7542ef0e44f4d94b808c64ce466a5eca},
	author = {Reda, O. and Sassi, I. and Zellou, A. and Anter, S.}
}
@article {Yousfi20203,
	title = {Towards a Holistic Schema Matching Approach Designed for Large-Scale Schemas},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12496 LNAI},
	year = {2020},
	note = {cited By 0},
	pages = {3-15},
	abstract = {Holistic schema matching is a fundamental challenge in the big data integration domain. Ideally, clusters of semantically corresponding elements are created and are updated as more schemas are matched. Developing a high-quality holistic schema matching approach is critical for two main reasons. First, identifying as many accurate and holistic semantic correspondences as possible right from the beginning. Second, reducing considerably the search space. Nevertheless, this problem is challenging since overlapping schema elements are not available. Identifying schema overlaps is further complicated for two main reasons: (1) there is a large number of schemas; and (2) overlaps vary for different schemas. In this paper we present HMO, a Holistic schema Matching approach based on schema Overlaps and designed for large-scale schemas. HMO can balance the search space and the quality of the holistic semantic correspondences. To narrow down the search space, HMO matches schemas based on their overlaps. To obtain high-accuracy, HMO uses an existing high-quality semantic similarity measure. Experimental results on four real-world domains show effectiveness and scalability of our matching approach. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Artificial intelligence, Data integration, High quality, High-accuracy, Holistic schema matching, Real world domain, Search spaces, Semantic correspondence, Semantic similarity measures, Semantics},
	doi = {10.1007/978-3-030-63007-2_1},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097530171\&doi=10.1007\%2f978-3-030-63007-2_1\&partnerID=40\&md5=aed75e2b584acebebdce7bf0dc2cc076},
	author = {Yousfi, A. and Yazidi, M.H.E. 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.}
}
@article {Yousfi201864,
	title = {Assessing the performance of a new semantic similarity measure designed for schema matching for mediation systems},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {11055 LNAI},
	year = {2018},
	pages = {64-74},
	doi = {10.1007/978-3-319-98443-8_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053199922\&doi=10.1007\%2f978-3-319-98443-8_7\&partnerID=40\&md5=18d7047f60af1c46cb3beaeb2b8d7e9a},
	author = {Yousfi, A. and Elyazidi, M.H. and Zellou, A.}
}
@conference {Mimouni20181,
	title = {The impact of query precision on returned data precision criterion},
	booktitle = {2017 International Conference on Electrical and Computing Technologies and Applications, ICECTA 2017},
	volume = {2018-January},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/ICECTA.2017.8252061},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045990243\&doi=10.1109\%2fICECTA.2017.8252061\&partnerID=40\&md5=553344ed3926f1d6f3b01b121907b491},
	author = {Mimouni, L. and Zellou, A. and Idri, A.}
}
@conference {Mimouni2018319,
	title = {MDQM: Mediation data quality model aligned data quality model for mediation systems},
	booktitle = {IC3K 2018 - Proceedings of the 10th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management},
	volume = {2},
	year = {2018},
	pages = {319-326},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85059040350\&partnerID=40\&md5=c41fc36d4914e0611e070779b607b7e1},
	author = {Mimouni, L. and Zellou, A. and Idri, A.}
}
@conference {Saissi2018111,
	title = {A new clustering approach to identify the values to query the deep web access forms},
	booktitle = {2018 4th International Conference on Computer and Technology Applications, ICCTA 2018},
	year = {2018},
	pages = {111-116},
	doi = {10.1109/CATA.2018.8398666},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050215563\&doi=10.1109\%2fCATA.2018.8398666\&partnerID=40\&md5=9301955ef076b676312ef8b2d6fa454a},
	author = {Saissi, Y. and Zellou, A. and Idri, A.}
}
@conference {Selma2018212,
	title = {A New Mapping Approach between XML Schemas in a P2P Environment},
	booktitle = {Proceedings - International Conference on Developments in eSystems Engineering, DeSE},
	year = {2018},
	pages = {212-217},
	doi = {10.1109/DeSE.2017.16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85056190704\&doi=10.1109\%2fDeSE.2017.16\&partnerID=40\&md5=9968d6ce7b4ae7d6fb9f91cb21c0281a},
	author = {Selma, E.Y.E.I. and Zellou, A. and Idri, A.}
}
@conference {Saissi201794,
	title = {Towards XML schema extraction from deep web},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	year = {2017},
	note = {cited By 0},
	pages = {94-99},
	abstract = {Today, not all the web is fully accessible by the web search engines. There is a hidden and inaccessible part of the web called the deep web. Many methods exist in the literature to access and to integrate the huge structured data contained in the deep web. In this paper, we propose our approach to extract the XML schema describing a selected deep web source. Our approach is based on the static and the dynamic analysis of the HTML forms giving access to the selected deep web source. Our approach uses two knowledge database during its process: our proprietary identification tables and Wordnet. The XML schema extracted will be used to integrate the associated deep web source into a mediation system without extracting all its information. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/CIST.2016.7805022},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010190133\&doi=10.1109\%2fCIST.2016.7805022\&partnerID=40\&md5=0c383caab22e43a339e6b52acca8947b},
	author = {Saissi, Y. and Zellou, A. and Idri, A.}
}
@conference {Saissi201794,
	title = {Towards XML schema extraction from deep web},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	year = {2017},
	note = {cited By 0},
	pages = {94-99},
	abstract = {Today, not all the web is fully accessible by the web search engines. There is a hidden and inaccessible part of the web called the deep web. Many methods exist in the literature to access and to integrate the huge structured data contained in the deep web. In this paper, we propose our approach to extract the XML schema describing a selected deep web source. Our approach is based on the static and the dynamic analysis of the HTML forms giving access to the selected deep web source. Our approach uses two knowledge database during its process: our proprietary identification tables and Wordnet. The XML schema extracted will be used to integrate the associated deep web source into a mediation system without extracting all its information. {\"\i}{\textquestiondown}{\textonehalf} 2016 IEEE.},
	doi = {10.1109/CIST.2016.7805022},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010190133\&doi=10.1109\%2fCIST.2016.7805022\&partnerID=40\&md5=0c383caab22e43a339e6b52acca8947b},
	author = {Saissi, Y. and Zellou, A. and Idri, A.}
}
@conference {Anter2016,
	title = {Nk-schemas: A novel algorithm for creating the view{\textquoteright} schemas to materialize in hybrid mediator},
	booktitle = {Proceedings of IEEE/ACS International Conference on Computer Systems and Applications, AICCSA},
	volume = {2016-July},
	year = {2016},
	note = {cited By 0},
	abstract = {The explosion of information and telecommunications technologies, has made easy the access and production of information. Thus, a very large mass of the latter has generated. This situation has made the integration systems an immediate necessity. Among these systems, there is the hybrid mediator. The latter interrogates one part of data on demand as in the virtual approach, while charging, filtering and storing the second part, as views, in a local database. The creation of this second part is a critical task. We propose in this paper, a new algorithm for creating views{\textquoteright} schemas to materialize in the hybrid integration system. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/AICCSA.2015.7507200},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84980416133\&doi=10.1109\%2fAICCSA.2015.7507200\&partnerID=40\&md5=1412e0fe0867141a2f0ec5a2e0034ebb},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@article {Anter20162128,
	title = {Retrieving and materializing data in hybrid mediators},
	journal = {International Journal of Applied Engineering Research},
	volume = {11},
	number = {3},
	year = {2016},
	note = {cited By 0},
	pages = {2128-2134},
	abstract = {With the emergence of the new generation of information technologies and telecommunications, the mass of information produced by individuals and enterprises has increased in a considerable manner. Thus, and in order to manage this diversity of information, the integration systems were proposed. Among these, we find the hybrid information integration systems. They allow materializing a part of data in a local database, while integrating virtually the other part. As these materialized one is organized as views, it becomes necessary to propose algorithms for this objective. Among the most interesting ones, there is k-schema. It allows organize the attributes into a set of views, while affecting an attribute to a single view. This choice causes the not loading some of data that are highly requested by users, and at the same time, it loads other that are rarely requested. In this paper, we propose a new algorithm in this end. In this latter, it is authorized to assign a same attribute to several views. We also proposed new functions for calculating the dependencies between attributes. {\textcopyright} Research India Publications.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84973470278\&partnerID=40\&md5=140f0f35ca53260f11d97b5958f6ee8c},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@conference {Anter2016,
	title = {Towards a generic model of a user profile},
	booktitle = {SITA 2016 - 11th International Conference on Intelligent Systems: Theories and Applications},
	year = {2016},
	note = {cited By 0},
	abstract = {User modelling is an old research discipline. The main concern of this discipline is to improve the quality of human-computer interaction predictive goals, preferences and context. Thus, adaptation and personalization of a document or an application for a particular user need to have information on the latter. It often referred to as {\textquoteright}user profile{\textquoteright}. A user profile modelling process must be done in two stages. These can be expressed by two questions: (1) {\textquoteright}what data?{\textquoteright} and (2) {\textquoteright}In what form will they be organized?{\textquoteright} The answer to the first question will determine all relevant information that best represents the interests and needs of the user. As for the second, it will determine the logical structure in which a profile will be modelled. This paper aims to provide answers to both questions. To do this, we begin with a presentation of different areas where the user profile can make a major contribution. In the second step, we define all the information to be included in the user profile as well as a generic model that we can adapt to different areas. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/SITA.2016.7772265},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010301085\&doi=10.1109\%2fSITA.2016.7772265\&partnerID=40\&md5=2f2efa11599627d6b4c5ad967869851f},
	author = {Anter, S. and Yazidi, M.H.E. and Zellou, A. and Idri, A.}
}
@conference {ElIdrissiSelma2015,
	title = {Mapping discovery methodology in a pure P2P mediation system for XML schemas},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {The exponential development of information exchange today has updated the difficulties to find the relevant information wished by an end user. Indeed, the information is represented and stored in a multitude of information sources in a very heterogeneous way. The type of these information sources can be varied (textual data, relational, multimedia, semi structured ...) and their very different storage systems (file system, DBMS, applications). It is thus necessary to offer an information sources integration system, while assuring the transparency to the distribution and the heterogeneousness. In this work, we focus to integration of information sources via the mediation approach in a pur P2P environment. We are particularly interested to the Mapping discovery in this type of system integration. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358380},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962376117\&doi=10.1109\%2fSITA.2015.7358380\&partnerID=40\&md5=cdb3cd7ca4bce869b36a15714aae4901},
	author = {El Idrissi Selma, E.Y. and Zellou, A. and Idri, 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 {Anter2015,
	title = {Nk-schemas: A novel algorithm for creating the views{\textquoteright} sch{\'e}mas to materialize in hybrid mediator},
	booktitle = {Proceedings of 2015 IEEE World Conference on Complex Systems, WCCS 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {The explosion of information and telecommunications technologies, has made easy the access and production of information. Thus, a very large mass of the latter has generated. This situation has made the integration systems an immediate necessity. Among these systems, there is the hybrid mediator. The latter interrogates one part of data on demand as in the virtual approach, while charging, filtering and storing the second part, as views, in a local database. The creation of this second part is a critical task. We propose in this paper, a new algorithm for creating views{\textquoteright} schemas to materialize in the hybrid integration system. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ICoCS.2015.7483282},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978397930\&doi=10.1109\%2fICoCS.2015.7483282\&partnerID=40\&md5=c2f29f0e70dec9947e07f07a38190ec7},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@conference {Mimouni2015,
	title = {Quality of Data in mediation systems},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Quality of Data (QoD) became a major concern which more and more considers necessary to evolve the satisfaction of final users. In this work, we are approaching a methodology which consists of classifying and listing factors impacting Data Quality in Data Integration Systems, and more literally these which influence mediation systems and which will constitute our long-term research axis. Moreover, we shall propose in this work a contribution in the form of an attempt to define main factors impacting Quality of Data. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358375},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962456193\&doi=10.1109\%2fSITA.2015.7358375\&partnerID=40\&md5=aa9e5c23e4b0cc19331495a5ca6e9a5c},
	author = {Mimouni, L. and Zellou, A. and Idri, A.}
}
@conference {Ouaftouh2015,
	title = {User profile model: A user dimension based classification},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {As the amount of information offered by information systems is increasing exponentially, the need of personalized approaches for information access increases. This work discusses user profiles designed for providing personalized information access. We first present a general classification of research directions on adaptive systems, followed by a state-of-the-art study about user profiling. We propose then a new classification approach of user profile model. This classification is based on the user dimensions considered to build the user profile. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358378},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962408714\&doi=10.1109\%2fSITA.2015.7358378\&partnerID=40\&md5=ca06e7ab84ba76c5e6dfa5355f6faed2},
	author = {Ouaftouh, S. and Zellou, A. and Idri, A.}
}
@conference {Saissi2014178,
	title = {Extraction of relational schema from deep web sources: A form driven approach},
	booktitle = {2014 2nd World Conference on Complex Systems, WCCS 2014},
	year = {2014},
	note = {cited By 5},
	pages = {178-182},
	abstract = {The deep web is the biggest unexplored part of the web and we need to access directly to its entire data web sources without using any crawling or surfacing method. For this, we choose to use a virtual web integration system. However, the deep web virtual integration methods existing today, focuses only on the integration of the query interfaces giving access to the deep web. These query interfaces are integrated to build a global query interface able to query all the deep web sources. The objective of our work is to propose another vision of a deep web virtual integration system that uses a mediated schema built with a relational schema describing each deep web source. This paper proposes our approach to extract a relational schema describing a deep web source. The key idea underlying our approach is to analyze two structured information: the HTML Form and the HTML Table extracted from the deep web source to discover its data structure and to allow us to build a relational schema describing it. We use also a knowledge table to take profit of our learning experience on extracting relational schema from deep web source. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICoCS.2014.7060888},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84929193260\&doi=10.1109\%2fICoCS.2014.7060888\&partnerID=40\&md5=19d19e00ed72fa7b4c9eeae768e3b02e},
	author = {Saissi, Y. and Zellou, A. and Idri, A.}
}
@conference {Saissi2014,
	title = {Form driven web source integration},
	booktitle = {2014 9th International Conference on Intelligent Systems: Theories and Applications, SITA 2014},
	year = {2014},
	note = {cited By 0},
	abstract = {The web sources contain a huge amount of data that we need to integrate and to use. The integration of the web source requires to know its source description. In general, the web sources contain a structured data like HTML form and HTML table. This paper proposes our approach to extract a relational schema, describing the web source, and using its structured information. The key idea underlying our approach is to extract the relational data structure of the HTML forms contained in the web source. And thanks to the features of the HTML form, the relational data structure extracted will not only describe the HTML form but also the web source associated. After, we propose to query the HTML forms extracted to generate interesting HTML table results. The data structure of the resulting HTML tables will be used to enhance the relational data structure of the associated HTML form. Finally, with all the relational data structure extracted from all the HTML forms and HTML tables, we build the relational schema describing the associated web source. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/SITA.2014.6847288},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904632763\&doi=10.1109\%2fSITA.2014.6847288\&partnerID=40\&md5=900e69a0f5f601e9d9f86ec1fe81bd55},
	author = {Saissi, Y. and Zellou, A. and Idri, A.}
}
@article {ElIdrissi2014261,
	title = {MDPM: An algorithm for mapping discovery in P2P mediation system},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {63},
	number = {2},
	year = {2014},
	note = {cited By 0},
	pages = {261-273},
	abstract = {The information integration systems consist in offering a uniform interface, to provide access to a set of autonomous and distributed information sources. The most important advantage of an information integration system is that allows users to specify what they want, rather than thinking about how to get the responses. The studies in this field have aimed at developing tools allowing a transparent access to data sources disseminated on a network. In particular, there are two major classes of integration systems: the mediation systems based on the paradigm mediator/Wrapper and peer to peer systems (P2P). Recently, other integration systems have emerged as P2P mediation systems. In these systems, the correspondence problem between schemas is a crucial problem. Especially as to integrate different sources requires the identification of the elements which can be dependent between the various diagrams. This is called correspondences or mapping between schemas. In this paper, we study this problem of mappings discovery and we present an approach of automatic correspondences discovery in a Pure Peer-to-Peer mediation system. {\textcopyright} 2005 - 2014 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84901297255\&partnerID=40\&md5=727988fcc4f07295ec2f81aef5ccbc2a},
	author = {El Idrissi, S.E.Y. and Zellou, A. and Idri, A.}
}
@conference {Hadi2013248,
	title = {Fulvis: New approach for selecting views to materialize in hybrid information integration},
	booktitle = {2013 5th International Conference on Computer Science and Information Technology, CSIT 2013 - Proceedings},
	year = {2013},
	note = {cited By 0},
	pages = {248-255},
	abstract = {The most important disadvantage of the hybrid approach of information integration is the complexity of selecting the data to materialize, in particular if the data sources are changing and numerous. Several approaches have been proposed to make this task easier. In this paper, we show the shortcomings of the existing ones and we propose to cure this by offering a new flexible approach, we named Fulvis, based on fuzzy logic. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/CSIT.2013.6588788},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884966295\&doi=10.1109\%2fCSIT.2013.6588788\&partnerID=40\&md5=925b6fbdf8e08181bbe621665960b1e6},
	author = {Hadi, W. and Zellou, A. and Bounabat, B.}
}
@article {Hadi2013489,
	title = {A fuzzy logic based method for selecting information to materialize in hybrid information integration system},
	journal = {International Review on Computers and Software},
	volume = {8},
	number = {2},
	year = {2013},
	note = {cited By 3},
	pages = {489-499},
	abstract = {The virtual approach of information integration, called mediation, suffers from the slowness response to user queries and the risk of sources unavailability. To cure these problems, some information may be stored at the mediator level. However, the success of this solution depends on selecting the right set of information to materialize. This task should be automated when the collection of data sources is large and evolving. Existing methods for the selection of information to materialize have some drawbacks and do not always give feasible or optimal results. Therefore, we propose a new approach based on fuzzy logic, which we call FULVIS. {\textcopyright} 2013 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84877313961\&partnerID=40\&md5=a400492f4866ce7ca21892765d7e9433},
	author = {Hadi, W. and Zellou, A. and Bounabat, B.}
}
@conference {Anter2013201,
	title = {The hybrid integration system Towards a new approach for creating candidate views for materialization},
	booktitle = {2013 5th International Conference on Computer Science and Information Technology, CSIT 2013 - Proceedings},
	year = {2013},
	note = {cited By 0},
	pages = {201-209},
	abstract = {The vulgarization of information technologies and telecommunications has generated an enormous amount of information. This information is generally heterogeneous, stored in autonomous and distributed sources. Thus, it becomes necessary to introduce the information integration systems. These systems must ensure an optimal query response time, and the freshness of data. Using a virtual approach cannot answer these questions. On the one hand, the query response time is very important. Indeed, the mediator must access, every time, to the sources for load the relevant information. On the other hand, the sources are not always available. The establishment of a hybrid integration system, where a portion of information is materialized in the mediator and the other portion remains in the sources and are extracted at query time, is an effective solution to these problem, provided that the materialized part has carefully chosen. Based on the distribution of user queries, we present in this paper an approach to select the information most requested by users and organize it as candidate views for materialization in the mediator. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/CSIT.2013.6588780},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884866157\&doi=10.1109\%2fCSIT.2013.6588780\&partnerID=40\&md5=901ef3c27b658be16f920570e0dd9cce},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@article {Anter2013158,
	title = {K-Schema: A new approach, based on the distribution of user queries, to create views to materialize in a hybrid integration system},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {47},
	number = {1},
	year = {2013},
	note = {cited By 2},
	pages = {158-170},
	abstract = {The explosion of information technologies and telecommunications has made easy the access and production of information. That is how a very large mass of the latter has generated. This situation has made the integration systems a major need. Among these systems, there is the hybrid mediator. The latter interrogates one part of data on demand as in the virtual approach while charging, filtering and storing the second part, as views, in a local database. The choice of this second part is a critical task. This paper presents a selective approach, which based, essentially, to create these views, on the queries previously posed on the system. Based on the distribution of previous user queries, our approach extract all data most queried by users. The obtained data are classified as candidate views for materialization. Then selecting which one to materialize among all those created in the first step. {\textcopyright} 2005 - 2013 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84872374571\&partnerID=40\&md5=c84d7e37d38a4f230cdf4c3a43c22954},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@article {Anter2013816,
	title = {MATHIS: A new approach for creating views to materialize in a hybrid integration system},
	journal = {International Review on Computers and Software},
	volume = {8},
	number = {3},
	year = {2013},
	note = {cited By 2},
	pages = {816-825},
	abstract = {The vulgarization of information and telecommunications technologies has made the integration systems an immediate necessity. Among the latter, there are the hybrid integration systems. These offer a local database where it stores a part of data while integrating the other part virtually. This in the objective to increases system performance while ensuring a tradeoff between query response time and data freshness. The approach that has proposed a complete solution is one that creates the candidate views for materialization before selecting among them those that will be materialized. To do this, it selects the attributes most requested by users. Calling the algorithm k-schema, these attributes are organized in schemas, on which we based to build the candidate views for materialization. This approach suffers from a defect. It is because in the phase of the extraction of attributes of interest, we based only on their frequencies of appearance in the user queries. This will select some attributes, even if they do not respond to any selection criterion. Thus, they cause the elimination, in the selection phase, of views to which they were assigned. In this paper, we propose a new approach, which eliminates all attributes that do not respond to the selection criteria prior to the creation of views to materialize. We also propose a new solution to calculate the values of attributes relative to different criteria. {\textcopyright} 2013 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84881501064\&partnerID=40\&md5=5b529bb907d58895a51faec2468f9a6c},
	author = {Anter, S. 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.}
}
@conference {ElIdrissi2013134,
	title = {Towards a dynamic mapping in P2P mediation system},
	booktitle = {2013 5th International Conference on Computer Science and Information Technology, CSIT 2013 - Proceedings},
	year = {2013},
	note = {cited By 0},
	pages = {134-141},
	abstract = {The data sources integration, disseminated on a network is a major preoccupation in many sectors. Problems due to share and to integrate information Interests a lot of researcher{\textquoteright}s communities since last years. Works were carried to develop tools and techniques for transparent access to data sources available in a network. In this context, two types of integration systems are distinguished: the virtual integration based on mediation systems and the integration based on Peer to Peer systems (P2P). In this paper, we are interested to the correspondence discovery problem, or Mappings, between global schema in a third type of architecture such as the mediation systems based on P2P architecture. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/CSIT.2013.6588771},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884899567\&doi=10.1109\%2fCSIT.2013.6588771\&partnerID=40\&md5=f694b43a6730e442a9f28c5c4d562a85},
	author = {El Idrissi, S.E.Y. and Zellou, A. and Idri, A.}
}
@conference {Zellou2013,
	title = {Towards a framework for knowledge management in a virtual information integration},
	booktitle = {2013 3rd International Symposium ISKO-Maghreb},
	year = {2013},
	note = {cited By 0},
	abstract = {The main objective of this paper is to present an approach allowing equipping the virtual information integration systems by mechanisms of knowledge management in order to return better responses to user demands. These mechanisms will help the integration systems to take into account the user logic (for the requested information treatment) and the information production logic (the logic of the information itself). {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ISKO-Maghreb.2013.6728196},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894151898\&doi=10.1109\%2fISKO-Maghreb.2013.6728196\&partnerID=40\&md5=e54c8044a9c00a0f872acec24b59886b},
	author = {Zellou, 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.}
}
@conference {Anter2012,
	title = {Personalization of a hybrid integration system: Creation of views to materialize based on the distribution of user queries},
	booktitle = {Proceedings of 2012 International Conference on Complex Systems, ICCS 2012},
	year = {2012},
	note = {cited By 0},
	doi = {10.1109/ICoCS.2012.6458566},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874493599\&doi=10.1109\%2fICoCS.2012.6458566\&partnerID=40\&md5=8cb54118f3a51aadd4afa9789ecdcc3a},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@conference {Yazidi2012,
	title = {Towards a fuzzy mapping for mediation systems},
	booktitle = {Proceedings of 2012 International Conference on Complex Systems, ICCS 2012},
	year = {2012},
	note = {cited By 0},
	doi = {10.1109/ICoCS.2012.6458573},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874494252\&doi=10.1109\%2fICoCS.2012.6458573\&partnerID=40\&md5=f777377bdfd9a344347799d38e97941d},
	author = {Yazidi, M.H.E. and Zellou, A. and Idri, A.}
}
