Pub Date : 2016-12-01DOI: 10.1109/SSCI.2016.7849887
Chao-Hui Huang, E. Kalaw
We present an AdaBoost-based Ensemble Learning for supporting automated Gleason grading of prostate adenocarcinoma (PRCA). The method is able to differentiate Gleason patterns 4–5 from patterns 1–3 as the patterns 4–5 are correlated to more aggressive disease while patterns 1–3 tend to reflect more favorable patient outcome. This method is based on various feature descriptors and classifiers for multiple color channels, including color channels of red, green and blue, as well as the optical intensity of hematoxylin and eosin stainings. The AdaBoost-based Ensemble Learning method integrates the color channels, feature descriptors and classifiers, and finally constructs a strong classifier. We tested our method on the histopathological images and the corresponding medical reports obtained from The Cancer Genome Atlas (TCGA) using 10-fold cross validation, the accuracy achieved 97.8%. As a result, this method can be used to support the diagnosis on prostate cancer.
{"title":"Automated classification for pathological prostate images using AdaBoost-based Ensemble Learning","authors":"Chao-Hui Huang, E. Kalaw","doi":"10.1109/SSCI.2016.7849887","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7849887","url":null,"abstract":"We present an AdaBoost-based Ensemble Learning for supporting automated Gleason grading of prostate adenocarcinoma (PRCA). The method is able to differentiate Gleason patterns 4–5 from patterns 1–3 as the patterns 4–5 are correlated to more aggressive disease while patterns 1–3 tend to reflect more favorable patient outcome. This method is based on various feature descriptors and classifiers for multiple color channels, including color channels of red, green and blue, as well as the optical intensity of hematoxylin and eosin stainings. The AdaBoost-based Ensemble Learning method integrates the color channels, feature descriptors and classifiers, and finally constructs a strong classifier. We tested our method on the histopathological images and the corresponding medical reports obtained from The Cancer Genome Atlas (TCGA) using 10-fold cross validation, the accuracy achieved 97.8%. As a result, this method can be used to support the diagnosis on prostate cancer.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128356118","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-12-01DOI: 10.1109/SSCI.2016.7850188
S. Ntalampiras, M. Roveri
This paper proposes an incremental mechanism for the automatic recognition of physical activities performed by humans. The specific research field has become quite relevant as it may offer important information to areas such as ambient intelligence, pervasive computing, and assistive technologies. The works in the related literature so far assume the a-priori availability of the dictionary of activities to be recognised. This work is focused on relaxing that assumption by learning and recognizing the human activities in an incremental manner based on the acquired datastreams. To this end, we designed a learning mechanism based on hidden Markov models for recognising human activities among those of a dictionary. The major novelty of the proposed mechanism is its ability to detect the occurrence of new activities and update the dictionary accordingly. We conducted experiments on a publicly available dataset of six human activities, i.e. walking, walking upstairs, walking downstairs, sitting, standing, and laying, where the efficiency of the proposed algorithm is demonstrated.
{"title":"An incremental learning mechanism for human activity recognition","authors":"S. Ntalampiras, M. Roveri","doi":"10.1109/SSCI.2016.7850188","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7850188","url":null,"abstract":"This paper proposes an incremental mechanism for the automatic recognition of physical activities performed by humans. The specific research field has become quite relevant as it may offer important information to areas such as ambient intelligence, pervasive computing, and assistive technologies. The works in the related literature so far assume the a-priori availability of the dictionary of activities to be recognised. This work is focused on relaxing that assumption by learning and recognizing the human activities in an incremental manner based on the acquired datastreams. To this end, we designed a learning mechanism based on hidden Markov models for recognising human activities among those of a dictionary. The major novelty of the proposed mechanism is its ability to detect the occurrence of new activities and update the dictionary accordingly. We conducted experiments on a publicly available dataset of six human activities, i.e. walking, walking upstairs, walking downstairs, sitting, standing, and laying, where the efficiency of the proposed algorithm is demonstrated.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128369742","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-12-01DOI: 10.1109/SSCI.2016.7850126
Bing Xue, M. C. Lane, Ivy Liu, Mengjie Zhang
Dimension reduction is a preprocessing step in many classification tasks, but reducing dimensionality and finding the optimal set of features or attributes are challenging because of the big search space and interactions between attributes. This paper proposes a new dimension reduction method by using a statistical variable grouping method that groups similar attributes into a group by considering interaction between attributes and using particle swarm optimisation as a search technique to adopt the discovered statistical grouping information to search optimal attribute subsets. Two types of approaches are developed, where the first aims to select one attribute from each group to reduce the dimensionality, and the second allows the selection of multiple attributes from one group to further improve the classification performance. Experiments on ten datasets of varying difficulties show that all the two approaches can successfully address dimension reduction tasks to decrease the number of attributes, and achieve the similar of better classification performance. The first approach selects a smaller number of attributes than the second approach while the second approach achieves better classification performance. The proposed new algorithms outperform other recent dimension reduction algorithms in terms of the classification performance, or further reduce the number of attributes while maintaining the classification performance.
{"title":"Dimension reduction in classification using particle swarm optimisation and statistical variable grouping information","authors":"Bing Xue, M. C. Lane, Ivy Liu, Mengjie Zhang","doi":"10.1109/SSCI.2016.7850126","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7850126","url":null,"abstract":"Dimension reduction is a preprocessing step in many classification tasks, but reducing dimensionality and finding the optimal set of features or attributes are challenging because of the big search space and interactions between attributes. This paper proposes a new dimension reduction method by using a statistical variable grouping method that groups similar attributes into a group by considering interaction between attributes and using particle swarm optimisation as a search technique to adopt the discovered statistical grouping information to search optimal attribute subsets. Two types of approaches are developed, where the first aims to select one attribute from each group to reduce the dimensionality, and the second allows the selection of multiple attributes from one group to further improve the classification performance. Experiments on ten datasets of varying difficulties show that all the two approaches can successfully address dimension reduction tasks to decrease the number of attributes, and achieve the similar of better classification performance. The first approach selects a smaller number of attributes than the second approach while the second approach achieves better classification performance. The proposed new algorithms outperform other recent dimension reduction algorithms in terms of the classification performance, or further reduce the number of attributes while maintaining the classification performance.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128710969","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-12-01DOI: 10.1109/SSCI.2016.7850071
Fred Ma, S. Wesolkowski
Nations will always experience conflicting pressures to reduce both (i) the funding of militaries and (ii) the probability that they will not be able to respond to scenarios that may arise. We develop a multiobjective evolutionary algorithm (MOEA) to generate force mix options that trade-off between lower bounds for objective (i) versus objective (ii). A set of military assets or force mix is evaluated against multiple instances of the future, each composed of a mix of stochastically generated realistic scenarios based on historically derived parameters. Scenario success is evaluated by matching each occurrence with a course of action (CoA) whose force element (FE) demands can be met. The lower bound on (i) comes from the assumption that a nation has complete flexibility to engage in scenarios at times that minimize simultaneous demand on FEs. The results are compared with the results from Tyche, a discrete event Simulator, which provides an more realistic, though pessimistic, point estimate of objective (ii). Results confirm the expected relative behavior of both models.
{"title":"Estimating force mix lower bounds using a multi-objective evolutionary algorithm","authors":"Fred Ma, S. Wesolkowski","doi":"10.1109/SSCI.2016.7850071","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7850071","url":null,"abstract":"Nations will always experience conflicting pressures to reduce both (i) the funding of militaries and (ii) the probability that they will not be able to respond to scenarios that may arise. We develop a multiobjective evolutionary algorithm (MOEA) to generate force mix options that trade-off between lower bounds for objective (i) versus objective (ii). A set of military assets or force mix is evaluated against multiple instances of the future, each composed of a mix of stochastically generated realistic scenarios based on historically derived parameters. Scenario success is evaluated by matching each occurrence with a course of action (CoA) whose force element (FE) demands can be met. The lower bound on (i) comes from the assumption that a nation has complete flexibility to engage in scenarios at times that minimize simultaneous demand on FEs. The results are compared with the results from Tyche, a discrete event Simulator, which provides an more realistic, though pessimistic, point estimate of objective (ii). Results confirm the expected relative behavior of both models.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128604100","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-12-01DOI: 10.1109/SSCI.2016.7850203
D. Kapsoulis, K. Tsiakas, V. Asouti, K. Giannakoglou
Two techniques to further enhance the efficiency of Evolutionary Algorithms (EAs), even those which have already been accelerated by implementing surrogate evaluation models or metamodels to overcome a great amount of costly evaluations, are presented. Both rely upon the use of a Kernel Principal Component Analysis (Kernel PCA or KPCA) of the design space, as this reflects upon the offspring population in each generation. The PCA determines a feature space where the evolution operators should preferably be applied. In addition, in Metamodel-Assisted EA (MAEAs), the PCA can reduce the number of sensory units of metamodels. Due to the latter, the metamodels yield better approximations to the objective function value. This paper extends previous work by the authors which was based on Linear PCA, used for the same purposes. In the present paper, the superiority of using the Kernel (rather than the Linear) PCA, especially in real-world applications, is demonstrated. The proposed methods are assessed in single- and two-objective mathematical optimization problems and, finally, showcased in aerodynamic shape optimization problems with computationally expensive evaluation software.
{"title":"The use of Kernel PCA in evolutionary optimization for computationally demanding engineering applications","authors":"D. Kapsoulis, K. Tsiakas, V. Asouti, K. Giannakoglou","doi":"10.1109/SSCI.2016.7850203","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7850203","url":null,"abstract":"Two techniques to further enhance the efficiency of Evolutionary Algorithms (EAs), even those which have already been accelerated by implementing surrogate evaluation models or metamodels to overcome a great amount of costly evaluations, are presented. Both rely upon the use of a Kernel Principal Component Analysis (Kernel PCA or KPCA) of the design space, as this reflects upon the offspring population in each generation. The PCA determines a feature space where the evolution operators should preferably be applied. In addition, in Metamodel-Assisted EA (MAEAs), the PCA can reduce the number of sensory units of metamodels. Due to the latter, the metamodels yield better approximations to the objective function value. This paper extends previous work by the authors which was based on Linear PCA, used for the same purposes. In the present paper, the superiority of using the Kernel (rather than the Linear) PCA, especially in real-world applications, is demonstrated. The proposed methods are assessed in single- and two-objective mathematical optimization problems and, finally, showcased in aerodynamic shape optimization problems with computationally expensive evaluation software.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127186492","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-12-01DOI: 10.1109/SSCI.2016.7850144
A. M. Durán-Rosal, J. C. Fernández, Pedro Antonio Gutiérrez, C. Hervás‐Martínez
This work proposes a hybrid methodology for the detection and prediction of Extreme Significant Wave Height (ESWH) periods in oceans. In a first step, wave height time series is approximated by a labeled sequence of segments, which is obtained using a genetic algorithm in combination with a likelihood-based segmentation (GA+LS). Then, an artificial neural network classifier with hybrid basis functions is trained with a multiobjetive evolutionary algorithm (MOEA) in order to predict the occurrence of future ESWH segments based on past values. The methodology is applied to a buoy in the Gulf of Alaska and another one in Puerto Rico. The results show that the GA+LS is able to segment and group the ESWH values, and the neural network models, obtained by the MOEA, make good predictions maintaining a balance between global accuracy and minimum sensitivity for the detection of ESWH events. Moreover, hybrid neural networks are shown to lead to better results than pure models.
{"title":"Hybridization of neural network models for the prediction of Extreme Significant Wave Height segments","authors":"A. M. Durán-Rosal, J. C. Fernández, Pedro Antonio Gutiérrez, C. Hervás‐Martínez","doi":"10.1109/SSCI.2016.7850144","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7850144","url":null,"abstract":"This work proposes a hybrid methodology for the detection and prediction of Extreme Significant Wave Height (ESWH) periods in oceans. In a first step, wave height time series is approximated by a labeled sequence of segments, which is obtained using a genetic algorithm in combination with a likelihood-based segmentation (GA+LS). Then, an artificial neural network classifier with hybrid basis functions is trained with a multiobjetive evolutionary algorithm (MOEA) in order to predict the occurrence of future ESWH segments based on past values. The methodology is applied to a buoy in the Gulf of Alaska and another one in Puerto Rico. The results show that the GA+LS is able to segment and group the ESWH values, and the neural network models, obtained by the MOEA, make good predictions maintaining a balance between global accuracy and minimum sensitivity for the detection of ESWH events. Moreover, hybrid neural networks are shown to lead to better results than pure models.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129989223","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-12-01DOI: 10.1109/SSCI.2016.7849922
Ibtissam Abnane, A. Idri
Missing Data (MD) is a widespread problem that can affect the ability to use data to construct effective software development effort prediction systems. This paper investigates the use of missing data (MD) techniques with Fuzzy Analogy. More specifically, this study analyze the predictive performance of this analogy-based technique when using toleration, deletion or k-nearest neighbors (KNN) imputation techniques using the Pred(0.25) accuracy criterion and thereafter compares the results with the findings when using the Standardized Accuracy (SA) measure. A total of 756 experiments were conducted involving seven data sets, three MD techniques (toleration, deletion and KNN imputation), three missingness mechanisms (MCAR: missing completely at random, MAR: missing at random, NIM: non-ignorable missing), and MD percentages from 10 percent to 90 percent. The results of accuracy measured in terms of Pred(0.25) confirm the findings of a study which used the SA measure. Moreover, we found that SA and Pred(0.25) measure different aspects of technique performance. Hence, SA is not sufficient to conclude about the technique accuracy and it should be used with other metrics, especially Pred(0.25).
{"title":"Evaluating Fuzzy Analogy on incomplete software projects data","authors":"Ibtissam Abnane, A. Idri","doi":"10.1109/SSCI.2016.7849922","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7849922","url":null,"abstract":"Missing Data (MD) is a widespread problem that can affect the ability to use data to construct effective software development effort prediction systems. This paper investigates the use of missing data (MD) techniques with Fuzzy Analogy. More specifically, this study analyze the predictive performance of this analogy-based technique when using toleration, deletion or k-nearest neighbors (KNN) imputation techniques using the Pred(0.25) accuracy criterion and thereafter compares the results with the findings when using the Standardized Accuracy (SA) measure. A total of 756 experiments were conducted involving seven data sets, three MD techniques (toleration, deletion and KNN imputation), three missingness mechanisms (MCAR: missing completely at random, MAR: missing at random, NIM: non-ignorable missing), and MD percentages from 10 percent to 90 percent. The results of accuracy measured in terms of Pred(0.25) confirm the findings of a study which used the SA measure. Moreover, we found that SA and Pred(0.25) measure different aspects of technique performance. Hence, SA is not sufficient to conclude about the technique accuracy and it should be used with other metrics, especially Pred(0.25).","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130160192","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-12-01DOI: 10.1109/SSCI.2016.7850204
Fergal Lane, R. Muhammad, Atif Azad, C. Ryan, Ireland Email, Fergal Lane, Ie
Configuring an Evolutionary Algorithm (EA) can be a haphazard and inefficient process. An EA practitioner may have to choose between a plethora of search operator types and other parameter settings. In contrast, the goal of EA principled design is a more streamlined and systematic design methodology, which first seeks to better understand the problem domain, and only then uses such acquired insights to guide the choice of parameters and operators.
{"title":"Principled Evolutionary Algorithm search operator design and the kernel trick","authors":"Fergal Lane, R. Muhammad, Atif Azad, C. Ryan, Ireland Email, Fergal Lane, Ie","doi":"10.1109/SSCI.2016.7850204","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7850204","url":null,"abstract":"Configuring an Evolutionary Algorithm (EA) can be a haphazard and inefficient process. An EA practitioner may have to choose between a plethora of search operator types and other parameter settings. In contrast, the goal of EA principled design is a more streamlined and systematic design methodology, which first seeks to better understand the problem domain, and only then uses such acquired insights to guide the choice of parameters and operators.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129106461","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-12-01DOI: 10.1109/SSCI.2016.7849997
Bruno Cunha, A. Madureira, J. Pereira, I. Pereira
The ability to adjust itself to users' profile is imperative in modern system, given that many people interact with a lot of information in different ways. The creation of adaptive systems is a complex domain that requires very specific methods and the integration of several intelligent techniques, from an intelligent systems development perspective. Designing an adaptive system requires planning and training of user modelling techniques combined with existing system components. Based on the architecture for user modelling on Intelligent and Adaptive Scheduling Systems, this paper presents an analysis of using the mentioned architecture to characterize user's behaviours and a case study comparing the employment of different user classifiers. Bayesian and Artificial Neural Networks were selected as the elements of the computational study and this paper presents a description on how to prepare them to deal with user information.
{"title":"Evaluating the effectiveness of Bayesian and Neural Networks for Adaptive Schedulling Systems","authors":"Bruno Cunha, A. Madureira, J. Pereira, I. Pereira","doi":"10.1109/SSCI.2016.7849997","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7849997","url":null,"abstract":"The ability to adjust itself to users' profile is imperative in modern system, given that many people interact with a lot of information in different ways. The creation of adaptive systems is a complex domain that requires very specific methods and the integration of several intelligent techniques, from an intelligent systems development perspective. Designing an adaptive system requires planning and training of user modelling techniques combined with existing system components. Based on the architecture for user modelling on Intelligent and Adaptive Scheduling Systems, this paper presents an analysis of using the mentioned architecture to characterize user's behaviours and a case study comparing the employment of different user classifiers. Bayesian and Artificial Neural Networks were selected as the elements of the computational study and this paper presents a description on how to prepare them to deal with user information.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131035918","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-12-01DOI: 10.1109/SSCI.2016.7849973
Jiangnan Qiu, Wenjing Gu, Q. Kong, Qiuyan Zhong, Jilei Hu
In order to solve the emergency decision management problem with uncertainty, an Emergency Bayesian decision network (EBDN) model is used in this paper. By computing the probability of each node, the EBDN can solve the uncertainty of different response measures. Using Gray system theory to determine the weight of all kinds of emergency losses. And then use genetic algorithm to search the best combination measure by comparing the value of output loss. For illustration, a typhoon example is utilized to show the feasibility of EBDN model. Empirical results show that the EBDN model can combine expert's knowledge and historic data to predict expected effects under different combinations of response measures, and then choose the best one. The proposed EBDN model can combine the decision process into a diagrammatic form, and thus the uncertainty of emergency events in solving emergency dynamic decision making is solved.
{"title":"The emergency response management based on Bayesian decision network","authors":"Jiangnan Qiu, Wenjing Gu, Q. Kong, Qiuyan Zhong, Jilei Hu","doi":"10.1109/SSCI.2016.7849973","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7849973","url":null,"abstract":"In order to solve the emergency decision management problem with uncertainty, an Emergency Bayesian decision network (EBDN) model is used in this paper. By computing the probability of each node, the EBDN can solve the uncertainty of different response measures. Using Gray system theory to determine the weight of all kinds of emergency losses. And then use genetic algorithm to search the best combination measure by comparing the value of output loss. For illustration, a typhoon example is utilized to show the feasibility of EBDN model. Empirical results show that the EBDN model can combine expert's knowledge and historic data to predict expected effects under different combinations of response measures, and then choose the best one. The proposed EBDN model can combine the decision process into a diagrammatic form, and thus the uncertainty of emergency events in solving emergency dynamic decision making is solved.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130537903","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
扫码关注我们
求助内容：
应助结果提醒方式：