Pub Date : 2010-11-29DOI: 10.1109/ICMWI.2010.5648054
W. Djeddi, M. Khadir
Automatic correspondence generation between two ontologies, is of great difficulty due, on one hand, to conceptual and habit differences between ontology development communities. On the other hand, alignment difficulties grew exponentially with the number and volume of the involved data. This work presents a proposition of an alignment algorithm; where the approach originality consists in taking into account the context of the alignment in order to overcome the problem of large size ontologies containing similar classes. Adding to that, we present an automatic approach to learn how to combine the linguistic and structural affinity. The weighted, sum in addition to the sigmoid function, which has to be shifted according to the weight of the linguistic affinity and to fit our input range of [0 to 1] is also used: Finally, the proposed algorithm is implemented as a Protege plug-in, and applied to align ontologies describing a steam turbine. Results are analyzed compared to manual alignment in terms of performances and pre-alignment efforts.
{"title":"XMAP: A novel structural approach for alignment of OWL-Full ontologies","authors":"W. Djeddi, M. Khadir","doi":"10.1109/ICMWI.2010.5648054","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648054","url":null,"abstract":"Automatic correspondence generation between two ontologies, is of great difficulty due, on one hand, to conceptual and habit differences between ontology development communities. On the other hand, alignment difficulties grew exponentially with the number and volume of the involved data. This work presents a proposition of an alignment algorithm; where the approach originality consists in taking into account the context of the alignment in order to overcome the problem of large size ontologies containing similar classes. Adding to that, we present an automatic approach to learn how to combine the linguistic and structural affinity. The weighted, sum in addition to the sigmoid function, which has to be shifted according to the weight of the linguistic affinity and to fit our input range of [0 to 1] is also used: Finally, the proposed algorithm is implemented as a Protege plug-in, and applied to align ontologies describing a steam turbine. Results are analyzed compared to manual alignment in terms of performances and pre-alignment efforts.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130549003","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5648149
Abdelhafid Chadli, E. Tranvouez, F. Bendella
In this paper we present an agent based evaluation mechanism in a context of multi-agent participatory simulation applied to rodent control. Our training environment is based on (1) an agent based ecosystems simulation as well as actor's avatar interacting with the simulation; and (2) a negotiation based skill evaluation of the actors' behaviors during the simulation. This paper highlights how the combination of these two approaches can help improving rodent control efficiency.
{"title":"Cooperative skills evaluation and participative multiagent simulation for rodent control training","authors":"Abdelhafid Chadli, E. Tranvouez, F. Bendella","doi":"10.1109/ICMWI.2010.5648149","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648149","url":null,"abstract":"In this paper we present an agent based evaluation mechanism in a context of multi-agent participatory simulation applied to rodent control. Our training environment is based on (1) an agent based ecosystems simulation as well as actor's avatar interacting with the simulation; and (2) a negotiation based skill evaluation of the actors' behaviors during the simulation. This paper highlights how the combination of these two approaches can help improving rodent control efficiency.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116424682","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5648063
Rouba Baroudi, Nait Bahloul Safia
The researches in the multicriteria classification fields focus on the assignment of objects into predefined classes. Nevertheless, the construction of multicriteria clusters is not enough studied in the field of research. To deal with this problem, we propose a new clustering approach based on the definition of a new distance which takes into account the multicriteria nature of the problem. This distance uses the preference relations of the Promethee method and the Sokal and Michener index so widely used in the classification field. The approach generates, according to the preference relations 4 clustering. Each clustering expresses a way of grouping objects according to a preference relation. To get the final optimal clustering, an aggregation procedure, based on the minimization of the disagreements between the four clustering, is used.
{"title":"Towards multicriteria analysis: A new clustering approach","authors":"Rouba Baroudi, Nait Bahloul Safia","doi":"10.1109/ICMWI.2010.5648063","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648063","url":null,"abstract":"The researches in the multicriteria classification fields focus on the assignment of objects into predefined classes. Nevertheless, the construction of multicriteria clusters is not enough studied in the field of research. To deal with this problem, we propose a new clustering approach based on the definition of a new distance which takes into account the multicriteria nature of the problem. This distance uses the preference relations of the Promethee method and the Sokal and Michener index so widely used in the classification field. The approach generates, according to the preference relations 4 clustering. Each clustering expresses a way of grouping objects according to a preference relation. To get the final optimal clustering, an aggregation procedure, based on the minimization of the disagreements between the four clustering, is used.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128049792","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5647984
D. Mokeddem, H. Belbachir
Associative classification algorithms have been successfully used to construct classification systems. The major strength of such techniques is that they are able to use the most accurate rules among an exhaustive list of class-association rules. This explains their good performance in general, but to the detriment of an expensive computing cost, inherited from association rules discovery algorithms. We address this issue by proposing a distributed methodology based on FP-growth algorithm. In a shared nothing architecture, subsets of classification rules are generated in parallel from several data partitions. An inter-processor communication is established in order to make global decisions. This exchange is made only in the first level of recursion, allowing each machine to subsequently process all its assigned tasks independently. The final classifier is built by a majority vote. This approach is illustrated by a detailed example, and an analysis of communication cost.
{"title":"Distributed classification using class-association rules mining algorithm","authors":"D. Mokeddem, H. Belbachir","doi":"10.1109/ICMWI.2010.5647984","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5647984","url":null,"abstract":"Associative classification algorithms have been successfully used to construct classification systems. The major strength of such techniques is that they are able to use the most accurate rules among an exhaustive list of class-association rules. This explains their good performance in general, but to the detriment of an expensive computing cost, inherited from association rules discovery algorithms. We address this issue by proposing a distributed methodology based on FP-growth algorithm. In a shared nothing architecture, subsets of classification rules are generated in parallel from several data partitions. An inter-processor communication is established in order to make global decisions. This exchange is made only in the first level of recursion, allowing each machine to subsequently process all its assigned tasks independently. The final classifier is built by a majority vote. This approach is illustrated by a detailed example, and an analysis of communication cost.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126984500","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5647872
Salima Nebti, Abdellah Boukerram
Co-evolutionary algorithms are a class of adaptive search meta-heuristics inspired from the mechanism of reciprocal benefits between species in nature. The present work proposes a cooperative co-evolutionary algorithm to improve the performance of a radial basis function neural network (RBFNN) when it is applied to recognition of handwritten Arabic digits. This work is in fact a combination of ten RBFNNs where each of them is considered as an expert classifier in distinguishing one digit from the others; each RBFNN classifier adapts its input features and its structure including the number of centres and their positions based on a symbiotic approach. The set of characteristic features and RBF centres have been considered as dissimilar species where each of them can benefit from the other, imitating in a simplified way the symbiotic interaction of species in nature. Co-evolution is founded on saving the best weights and centres that give the maximum improvement on the sum of squared error of each RBFNN after a number of learning iterations. The results quality has been estimated and compared to other experiments. Results on extracted handwritten digits from the MNIST database show that the co-evolutionary approach is the best.
{"title":"An improved radial basis function neural network based on a cooperative coevolutionary algorithm for handwritten digits recognition","authors":"Salima Nebti, Abdellah Boukerram","doi":"10.1109/ICMWI.2010.5647872","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5647872","url":null,"abstract":"Co-evolutionary algorithms are a class of adaptive search meta-heuristics inspired from the mechanism of reciprocal benefits between species in nature. The present work proposes a cooperative co-evolutionary algorithm to improve the performance of a radial basis function neural network (RBFNN) when it is applied to recognition of handwritten Arabic digits. This work is in fact a combination of ten RBFNNs where each of them is considered as an expert classifier in distinguishing one digit from the others; each RBFNN classifier adapts its input features and its structure including the number of centres and their positions based on a symbiotic approach. The set of characteristic features and RBF centres have been considered as dissimilar species where each of them can benefit from the other, imitating in a simplified way the symbiotic interaction of species in nature. Co-evolution is founded on saving the best weights and centres that give the maximum improvement on the sum of squared error of each RBFNN after a number of learning iterations. The results quality has been estimated and compared to other experiments. Results on extracted handwritten digits from the MNIST database show that the co-evolutionary approach is the best.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126428951","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5647967
Hanane Cheriet, N. Bounour
Developing software of large size is a difficult task. To maintain them and to make them evolve during numerous years is more difficult again. In the absence of a global vision, the software structure aim to be destroyed naturally with the progression of the modifications. Understanding the software is then more and more difficult. Several works attempted to capture software evolution from different perspectives. In this paper, we suggest a comparative classification of these works by presenting the most recent models of software evolution in every class.
{"title":"Software evolution: Models and challenges","authors":"Hanane Cheriet, N. Bounour","doi":"10.1109/ICMWI.2010.5647967","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5647967","url":null,"abstract":"Developing software of large size is a difficult task. To maintain them and to make them evolve during numerous years is more difficult again. In the absence of a global vision, the software structure aim to be destroyed naturally with the progression of the modifications. Understanding the software is then more and more difficult. Several works attempted to capture software evolution from different perspectives. In this paper, we suggest a comparative classification of these works by presenting the most recent models of software evolution in every class.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125343660","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5647860
Kadda Beghdad Bey, F. Benhammadi, A. Mokhtari, Z. Guessoum
Tasks scheduling in heterogeneous computing environments is one of the most challenging problems in distributed computing. The optimally mapping of independent tasks onto heterogeneous distributed computing systems is known to be NP complete problem. This paper addresses a two-stage methodology for solving the independent task scheduling problems in heterogeneous distributed computing. The scheduler aims to minimize the total completion time using the task reassignment strategy. This later uses a new Makespan Refinery Approach (MRA) to improve our initial task scheduling solution by reducing the maximum completion time. The effectiveness of the proposed scheduling method has been tested and evaluated using simulations. The experiment results show the behaviour of the scheduling method for the short completion time of a set of tasks.
{"title":"Independent task scheduling in heterogeneous environment via makespan refinery approach","authors":"Kadda Beghdad Bey, F. Benhammadi, A. Mokhtari, Z. Guessoum","doi":"10.1109/ICMWI.2010.5647860","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5647860","url":null,"abstract":"Tasks scheduling in heterogeneous computing environments is one of the most challenging problems in distributed computing. The optimally mapping of independent tasks onto heterogeneous distributed computing systems is known to be NP complete problem. This paper addresses a two-stage methodology for solving the independent task scheduling problems in heterogeneous distributed computing. The scheduler aims to minimize the total completion time using the task reassignment strategy. This later uses a new Makespan Refinery Approach (MRA) to improve our initial task scheduling solution by reducing the maximum completion time. The effectiveness of the proposed scheduling method has been tested and evaluated using simulations. The experiment results show the behaviour of the scheduling method for the short completion time of a set of tasks.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133400301","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5648073
A. Meraoumia, S. Chitroub, A. Bouridane
Automatic personal identification using biometric information is playing a more and more important role in applications such as public security, access control, banking, etc. Palmprint identification is a subcategory of biometrics identification, which can efficiently used to identify the people. It is for this reason that palmprint-based identification is becoming increasingly popularity in recent years. In this paper, we present a novel scheme for palmprint identification using the multi-variate Gaussian Probability Density Function (GPDF) and two-dimensional Block based Discrete Cosine Transform (2D-BDCT). In this method, a palmprint is firstly divided into overlapping and equal-sized blocks, and then, applies the discrete cosine transform over each block. By using zigzag scan order (starting at the top-left) each transform block is reordered to produce the observation vector. Subsequently, we use the Gaussian probability density function for modeling the feature vector of each palmprint. Finally, Log-likelihood scores are used for palmprint matching. The proposed scheme is validated for their efficacy on PolyU palmprint database of 100 users. Our experimental results show the effectiveness and reliability of the proposed approach, which brings both high identification accuracy rate.
{"title":"Gaussian modeling and Discrete Cosine Transform for efficient and automatic palmprint identification","authors":"A. Meraoumia, S. Chitroub, A. Bouridane","doi":"10.1109/ICMWI.2010.5648073","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648073","url":null,"abstract":"Automatic personal identification using biometric information is playing a more and more important role in applications such as public security, access control, banking, etc. Palmprint identification is a subcategory of biometrics identification, which can efficiently used to identify the people. It is for this reason that palmprint-based identification is becoming increasingly popularity in recent years. In this paper, we present a novel scheme for palmprint identification using the multi-variate Gaussian Probability Density Function (GPDF) and two-dimensional Block based Discrete Cosine Transform (2D-BDCT). In this method, a palmprint is firstly divided into overlapping and equal-sized blocks, and then, applies the discrete cosine transform over each block. By using zigzag scan order (starting at the top-left) each transform block is reordered to produce the observation vector. Subsequently, we use the Gaussian probability density function for modeling the feature vector of each palmprint. Finally, Log-likelihood scores are used for palmprint matching. The proposed scheme is validated for their efficacy on PolyU palmprint database of 100 users. Our experimental results show the effectiveness and reliability of the proposed approach, which brings both high identification accuracy rate.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134408730","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5648168
Majda Maâtallah, H. Seridi
Recommender Systems (RSs) are largely used nowadays to generate interest items or products for web users. This paper proposed a novel recommendation technique based on fuzzy logic that combines a collaborative filtering and taxonomic based filtering together to make better quality recommendations as well as alleviate Stability/ Plasticity problem in RSs. Empirical evaluations are conducted, results are promising and they shown that the proposed technique is feasible and effective.
{"title":"A fuzzy hybrid recommender system","authors":"Majda Maâtallah, H. Seridi","doi":"10.1109/ICMWI.2010.5648168","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648168","url":null,"abstract":"Recommender Systems (RSs) are largely used nowadays to generate interest items or products for web users. This paper proposed a novel recommendation technique based on fuzzy logic that combines a collaborative filtering and taxonomic based filtering together to make better quality recommendations as well as alleviate Stability/ Plasticity problem in RSs. Empirical evaluations are conducted, results are promising and they shown that the proposed technique is feasible and effective.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121458541","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5648144
A. Kermi, Sofia Marniche-Kermi, M. Laskri
The aim of facial reconstruction is to estimate the face of an unknown individual from the shape of his/her skull to aid in recognition and identification. In this paper a 3D computerized facial reconstruction method from 3D-MRI of human heads is presented. It based on a model deformable approach constrained by the knowledge of soft tissues thicknesses, at a certain number of characteristic landmarks. The facial reconstruction process is divided into two main stages. An automatic initialization step of the deformable model is based on a non-linear registration technique guided by B-Spline Free-Form Deformations (FFD) model. In the second step, the initial skin, resulting from the transformation computed previously, is refined by means of a 3D deform-able model based on simplexes meshes that is attracted by some characteristic landmarks previously computed by a calculation of Mean and Gaussian curvatures. The evolution of the deformable model is done according to different internal and external forces among which the Gradient Vectors Flow force (GVF) and a balloon force. This method has been tested on thirteen sets of skull/skin data, extracted from 3D-MRI of individual heads of children and adults.
{"title":"3D-Computerized facial reconstructions from 3D-MRI of human heads using deformable model approach","authors":"A. Kermi, Sofia Marniche-Kermi, M. Laskri","doi":"10.1109/ICMWI.2010.5648144","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648144","url":null,"abstract":"The aim of facial reconstruction is to estimate the face of an unknown individual from the shape of his/her skull to aid in recognition and identification. In this paper a 3D computerized facial reconstruction method from 3D-MRI of human heads is presented. It based on a model deformable approach constrained by the knowledge of soft tissues thicknesses, at a certain number of characteristic landmarks. The facial reconstruction process is divided into two main stages. An automatic initialization step of the deformable model is based on a non-linear registration technique guided by B-Spline Free-Form Deformations (FFD) model. In the second step, the initial skin, resulting from the transformation computed previously, is refined by means of a 3D deform-able model based on simplexes meshes that is attracted by some characteristic landmarks previously computed by a calculation of Mean and Gaussian curvatures. The evolution of the deformable model is done according to different internal and external forces among which the Gradient Vectors Flow force (GVF) and a balloon force. This method has been tested on thirteen sets of skull/skin data, extracted from 3D-MRI of individual heads of children and adults.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124182811","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
扫码关注我们
求助内容：
应助结果提醒方式：