Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945781
Soumoud Fkaier, M. Romdhani, M. Khalgui, Georg Frey
Current industrial systems need to interact with the surrounding environment in order to provide more efficiency. In such systems, used software applications must be strong enough to answer run-time needs. Context-aware applications seem to be an appropriate solution that can satisfy adaptation to the continuous changes. Safe reconfigurations require the respect of tasks deadlines and the avoidance of blocking. However, existing solutions are still insufficient and lack many important services. In this paper, we propose a new context-aware framework for developing control applications in dynamically changing environment. We focus on respecting real-time as well as functional constraints. The proposed framework structure provides simple reconfiguration handling and boosts the awareness of applications. This paper describes the definition of the proposed framework and its design. To prove the validation of the new approach, we have performed a case study and simulations.
{"title":"Enabling reconfiguration of adaptive control systems using real-time context-aware framework","authors":"Soumoud Fkaier, M. Romdhani, M. Khalgui, Georg Frey","doi":"10.1109/AICCSA.2016.7945781","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945781","url":null,"abstract":"Current industrial systems need to interact with the surrounding environment in order to provide more efficiency. In such systems, used software applications must be strong enough to answer run-time needs. Context-aware applications seem to be an appropriate solution that can satisfy adaptation to the continuous changes. Safe reconfigurations require the respect of tasks deadlines and the avoidance of blocking. However, existing solutions are still insufficient and lack many important services. In this paper, we propose a new context-aware framework for developing control applications in dynamically changing environment. We focus on respecting real-time as well as functional constraints. The proposed framework structure provides simple reconfiguration handling and boosts the awareness of applications. This paper describes the definition of the proposed framework and its design. To prove the validation of the new approach, we have performed a case study and simulations.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121023734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945768
M. Frikha, M. Mhiri, Mounir Zarai, F. Gargouri
Medical tourism is a domain rich of data that are stored in many hundreds of data sources. Many of these sources should be used during the development of tourism information systems. That is why, it is very important to create a referential model that represents the medical tourism in Tunisia. The e-tourism ontology provides a way to achieve integration and interoperability through the use of shared vocabulary and meanings for terms with respect to other terms. In this paper, we will create an ontology as a very expressive hierarchy of categories, populating with information from Tunisian medical tourism providers' services that represent all concepts and relations of the medical tourism in Tunisia. This ontology will be integrated in a trust based recommender system to deal with the lack of semantic information in personalized recommendation in tourism domain.
{"title":"Using TMT ontology in trust based medical tourism recommender system","authors":"M. Frikha, M. Mhiri, Mounir Zarai, F. Gargouri","doi":"10.1109/AICCSA.2016.7945768","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945768","url":null,"abstract":"Medical tourism is a domain rich of data that are stored in many hundreds of data sources. Many of these sources should be used during the development of tourism information systems. That is why, it is very important to create a referential model that represents the medical tourism in Tunisia. The e-tourism ontology provides a way to achieve integration and interoperability through the use of shared vocabulary and meanings for terms with respect to other terms. In this paper, we will create an ontology as a very expressive hierarchy of categories, populating with information from Tunisian medical tourism providers' services that represent all concepts and relations of the medical tourism in Tunisia. This ontology will be integrated in a trust based recommender system to deal with the lack of semantic information in personalized recommendation in tourism domain.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126347240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945637
Clícia Pinto, Marcos E. Barreto, M. Boratto
The increasing need for computing power today justifies the continuous search for techniques that decrease the time to answer usual computational problems. To take advantage of new hybrid parallel architectures composed by multithreading and multiprocessor hardware, our current efforts involve the design and validation of highly parallel algorithms that efficently explore the characteristics of such architectures. In this paper, we propose an automatic tuning methodology to easily exploit multicore, multi-GPU and coprocessor systems. We present an optimization of an algorithm for solving triangular systems (TRSM), based on block decomposition and asynchronous task assignment, and discuss some results.
{"title":"Auto-tuning TRSM with an asynchronous task assignment model on multicore, multi-GPU and coprocessor systems","authors":"Clícia Pinto, Marcos E. Barreto, M. Boratto","doi":"10.1109/AICCSA.2016.7945637","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945637","url":null,"abstract":"The increasing need for computing power today justifies the continuous search for techniques that decrease the time to answer usual computational problems. To take advantage of new hybrid parallel architectures composed by multithreading and multiprocessor hardware, our current efforts involve the design and validation of highly parallel algorithms that efficently explore the characteristics of such architectures. In this paper, we propose an automatic tuning methodology to easily exploit multicore, multi-GPU and coprocessor systems. We present an optimization of an algorithm for solving triangular systems (TRSM), based on block decomposition and asynchronous task assignment, and discuss some results.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123071645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945623
Ashraf Elnagar
Arabic language has very rich vocabulary. It is manifested in different forms. The formal, Modern Standard Arabic (MSA), and the informal, colloquial or dialects. Dialectical languages become important as a result of the proliferation of social networks which resulted in the vast unstructured dialectical text available on the web. Unique properties of modern standard Arabic and dialects present major challenges to build sentiment analysis systems by adopting similar models designed for the English language. In this paper, we present a supervised Arabic sentiment analysis using a bag-of-words feature. We further examine using a set of key words (lexicon) for better polarity classification. The testing of the system is carried out on the freely-available Arabic books' reviews (LABR) dataset. LABR includes both modern standard Arabic and Egyptian dialectal reviews. We used both balanced and unbalanced datasets. Clearly, the balanced data set is small in size and, henceforth, a large-scale balanced dataset is required for training of the classifier model. Further, we compared the computed predicted sentiments against the actual reviews for a specific book. Findings, by annotators, had indicated ambiguity between a review and its rating when verified alongside the predicted sentiment, which provided a more reasonable result. Moreover, working with dialects and sarcasm is exceedingly exciting. Experimental results on the adopted logistic classifier model and LABR are encouraging and promising. However, a key prerequisite is the availability of rich and well represented datasets in order to develop robust and efficient Arabic sentiment analyzers.
{"title":"Investigation on sentiment analysis for Arabic reviews","authors":"Ashraf Elnagar","doi":"10.1109/AICCSA.2016.7945623","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945623","url":null,"abstract":"Arabic language has very rich vocabulary. It is manifested in different forms. The formal, Modern Standard Arabic (MSA), and the informal, colloquial or dialects. Dialectical languages become important as a result of the proliferation of social networks which resulted in the vast unstructured dialectical text available on the web. Unique properties of modern standard Arabic and dialects present major challenges to build sentiment analysis systems by adopting similar models designed for the English language. In this paper, we present a supervised Arabic sentiment analysis using a bag-of-words feature. We further examine using a set of key words (lexicon) for better polarity classification. The testing of the system is carried out on the freely-available Arabic books' reviews (LABR) dataset. LABR includes both modern standard Arabic and Egyptian dialectal reviews. We used both balanced and unbalanced datasets. Clearly, the balanced data set is small in size and, henceforth, a large-scale balanced dataset is required for training of the classifier model. Further, we compared the computed predicted sentiments against the actual reviews for a specific book. Findings, by annotators, had indicated ambiguity between a review and its rating when verified alongside the predicted sentiment, which provided a more reasonable result. Moreover, working with dialects and sarcasm is exceedingly exciting. Experimental results on the adopted logistic classifier model and LABR are encouraging and promising. However, a key prerequisite is the availability of rich and well represented datasets in order to develop robust and efficient Arabic sentiment analyzers.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122489848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945656
Hela Marouane, Achraf Makni, R. Bouaziz, Claude Duvallet, B. Sadeg
A design pattern describes a general solution to a design problem occurring repeatedly in many systems. Indeed, software designers adapt the pattern solution to their specific applications. Therefore, its design must show the variations points which will be adopted for certain systems. Hence, the expression of the variability when modeling the pattern is crucial. The design pattern is usually modeled using the Unified Modeling Language (UML). However, the latter is not enough expressive to represent the variability. Thus, the UML was semantically and syntactically extended with profiles by providing three extension mechanisms: stereotypes, tagged values and constraints. The expression of variability using stereotypes makes the pattern more expressive and facilitates its instantiation. But, it can generate some inconsistencies inside UML diagrams. Accordingly, in order to overcome this drawback, we propose delimiting the impact of the variable elements through the definition of Object Constraint Language (OCL) over stereotypes. To specify these constraints, we propose stereotypes expressing the fundamental elements and the variable ones. Furthermore, we present, in this work, the checking of each pattern diagram consistency using the proposed OCL constraints.
{"title":"Defining a UML profile for the consistency of design patterns","authors":"Hela Marouane, Achraf Makni, R. Bouaziz, Claude Duvallet, B. Sadeg","doi":"10.1109/AICCSA.2016.7945656","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945656","url":null,"abstract":"A design pattern describes a general solution to a design problem occurring repeatedly in many systems. Indeed, software designers adapt the pattern solution to their specific applications. Therefore, its design must show the variations points which will be adopted for certain systems. Hence, the expression of the variability when modeling the pattern is crucial. The design pattern is usually modeled using the Unified Modeling Language (UML). However, the latter is not enough expressive to represent the variability. Thus, the UML was semantically and syntactically extended with profiles by providing three extension mechanisms: stereotypes, tagged values and constraints. The expression of variability using stereotypes makes the pattern more expressive and facilitates its instantiation. But, it can generate some inconsistencies inside UML diagrams. Accordingly, in order to overcome this drawback, we propose delimiting the impact of the variable elements through the definition of Object Constraint Language (OCL) over stereotypes. To specify these constraints, we propose stereotypes expressing the fundamental elements and the variable ones. Furthermore, we present, in this work, the checking of each pattern diagram consistency using the proposed OCL constraints.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128560539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945660
I. Assayad, Lamia Eljadiri, A. Zakari, Tarik Nahhal
We present an approach for formal modelling of SystemC programs build uppon the “Behavior, Interactions and Priority” framework. Produced automata interactions are restricted only by using priorities rather than cutting their interactions. Produced models have thus the advantages of being composable — with other futur programs — without any change, except for the priorities. Furthermore automata are reduced by (1) collapsing all transitions inside a SystemC delta-step into a single transition before composing the automata, and (2) cuttting some interactions of private signals whitout any loss in program composability. Produced models sizes can thus be much smaller than non-reduced ones and verification speed of their properties may be much faster. We show the feasibility of the approach through the modeling, and verification of a set of SystemC benchmarks.
{"title":"The “Behavior, interaction and priority” framework applied to SystemC-based embedded systems","authors":"I. Assayad, Lamia Eljadiri, A. Zakari, Tarik Nahhal","doi":"10.1109/AICCSA.2016.7945660","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945660","url":null,"abstract":"We present an approach for formal modelling of SystemC programs build uppon the “Behavior, Interactions and Priority” framework. Produced automata interactions are restricted only by using priorities rather than cutting their interactions. Produced models have thus the advantages of being composable — with other futur programs — without any change, except for the priorities. Furthermore automata are reduced by (1) collapsing all transitions inside a SystemC delta-step into a single transition before composing the automata, and (2) cuttting some interactions of private signals whitout any loss in program composability. Produced models sizes can thus be much smaller than non-reduced ones and verification speed of their properties may be much faster. We show the feasibility of the approach through the modeling, and verification of a set of SystemC benchmarks.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128570341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945621
Mounira Chkiwa, A. Jedidi, F. Gargouri
In this paper, we present a new variant to show results of information retrieval process. Search results proposed here are in the form of textual abstract instead of returning a list of links pointing to relevant web documents. Our current work materializes collaboration between two independent axes: Semantic Web and Fuzzy Logic. The automatic abstract generation represents an extension of our previous works aimed to create an information retrieval system dedicated for kids.
{"title":"Abstracts generation as information retrieval results","authors":"Mounira Chkiwa, A. Jedidi, F. Gargouri","doi":"10.1109/AICCSA.2016.7945621","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945621","url":null,"abstract":"In this paper, we present a new variant to show results of information retrieval process. Search results proposed here are in the form of textual abstract instead of returning a list of links pointing to relevant web documents. Our current work materializes collaboration between two independent axes: Semantic Web and Fuzzy Logic. The automatic abstract generation represents an extension of our previous works aimed to create an information retrieval system dedicated for kids.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128619146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945661
A. A. Aliane, H. Aliane, M. Ziane, Nacéra Bensaou
With the recently increasing interest for opinion mining from different research communities, there is an evolving body of work on Arabic Sentiment Analysis. There are few available polarity annotated datasets for this language, so most existing works use these datasets to test the best known supervised algorithms for their objectives. Naïve Bayes and SVM are the best reported algorithms in the Arabic sentiment analysis literature. The work described in this paper shows that using a genetic algorithm to select features and enhancing the quality of the training dataset improve significantly the accuracy of the learning algorithm. We use the LABR dataset of book reviews and compare our results with LABR's authors' results.
{"title":"A genetic algorithm feature selection based approach for Arabic Sentiment Classification","authors":"A. A. Aliane, H. Aliane, M. Ziane, Nacéra Bensaou","doi":"10.1109/AICCSA.2016.7945661","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945661","url":null,"abstract":"With the recently increasing interest for opinion mining from different research communities, there is an evolving body of work on Arabic Sentiment Analysis. There are few available polarity annotated datasets for this language, so most existing works use these datasets to test the best known supervised algorithms for their objectives. Naïve Bayes and SVM are the best reported algorithms in the Arabic sentiment analysis literature. The work described in this paper shows that using a genetic algorithm to select features and enhancing the quality of the training dataset improve significantly the accuracy of the learning algorithm. We use the LABR dataset of book reviews and compare our results with LABR's authors' results.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128428332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945807
Bacem Mbarek, A. Meddeb, Wafa Ben Jaballah, M. Mosbah
Broadcast authentication has been widely investigated in the context of wireless sensor networks, Internet, RFIDs, and other scenarios. With the emergence of the Internet of Things that allows to connect different wireless technologies to provide services, broadcast authentication is crucial. Broadcast authentication aims to confirm that the sender of the message is the pretended source. In this direction, different state of the art proposals address this problem either by reducing the communication and overhead burden of security solutions, or by reducing the impact of attacks that aim to jeopordize the effectiveness of the service. In this paper, we propose an improved authentication scheme that is efficient for resource constrained devices. In particular, we shed the light into the security vulnerabilities of lightweight authentication mechanisms and their inability to tackle memory DoS attacks. Hence, we propose an improved scheme derived from the streamlined μTESLA, referred to as X-μTESLA. We demonstrate through our analytical and simulation results that X-μTESLA reduces communication overhead and yields a better performance in terms of energy consumption, memory overhead, and authentication delay than its previous counterparts.
{"title":"A broadcast authentication scheme in IoT environments","authors":"Bacem Mbarek, A. Meddeb, Wafa Ben Jaballah, M. Mosbah","doi":"10.1109/AICCSA.2016.7945807","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945807","url":null,"abstract":"Broadcast authentication has been widely investigated in the context of wireless sensor networks, Internet, RFIDs, and other scenarios. With the emergence of the Internet of Things that allows to connect different wireless technologies to provide services, broadcast authentication is crucial. Broadcast authentication aims to confirm that the sender of the message is the pretended source. In this direction, different state of the art proposals address this problem either by reducing the communication and overhead burden of security solutions, or by reducing the impact of attacks that aim to jeopordize the effectiveness of the service. In this paper, we propose an improved authentication scheme that is efficient for resource constrained devices. In particular, we shed the light into the security vulnerabilities of lightweight authentication mechanisms and their inability to tackle memory DoS attacks. Hence, we propose an improved scheme derived from the streamlined μTESLA, referred to as X-μTESLA. We demonstrate through our analytical and simulation results that X-μTESLA reduces communication overhead and yields a better performance in terms of energy consumption, memory overhead, and authentication delay than its previous counterparts.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128451846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945733
Abir Amami, Zied Elouedi, A. Hadjali
Queries posed by a user over a database do not always return the desired responses. It may sometimes result an empty set of answers especially when data are pervaded with uncertainty and imprecision. Thus, to address this problem, we propose an approach for relaxing a failing query in the context of evidential databases. The uncertainty in such databases is expressed within the belief function theory. The key idea of our approach is to use a machine learning method more precisely the belief K-modes clustering technique to relax the failing queries by modifying the constraints in order to provide successful alternatives which may be of interest to the user.
{"title":"A clustering based approach for query relaxation in evidential databases","authors":"Abir Amami, Zied Elouedi, A. Hadjali","doi":"10.1109/AICCSA.2016.7945733","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945733","url":null,"abstract":"Queries posed by a user over a database do not always return the desired responses. It may sometimes result an empty set of answers especially when data are pervaded with uncertainty and imprecision. Thus, to address this problem, we propose an approach for relaxing a failing query in the context of evidential databases. The uncertainty in such databases is expressed within the belief function theory. The key idea of our approach is to use a machine learning method more precisely the belief K-modes clustering technique to relax the failing queries by modifying the constraints in order to provide successful alternatives which may be of interest to the user.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125882409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：