Pub Date : 2016-08-01DOI: 10.1109/FSKD.2016.7603406
Jianfeng Li, Conghui Zhu, Sheng Li, T. Zhao, Dequan Zheng
Information Extraction is an important task in Natural Language Processing research. Named Entity Recognition as one of the basic tasks of information extraction, the effect has a great impact on the subsequent tasks such as Relation Extraction. And a major difficulty of NER lies in the unknown word identification. For this issue, method of exploiting Wikipedia external information methods was studied. Wikipedia is a rapid developing online encyclopedia in recent years. In 2016, the number of Chinese entries has reached 860,000. Huge valuable information will be provided to identify unknown words by Exploiting Wikipedia as external knowledge. The Wikipedia entries have been selected, and combined into the Conditional Random Field model of NER as features. The experimental studies demonstrate that this method can improve the effectiveness of NER significantly.
{"title":"Exploiting Wikipedia priori knowledge for Chinese named entity recognition","authors":"Jianfeng Li, Conghui Zhu, Sheng Li, T. Zhao, Dequan Zheng","doi":"10.1109/FSKD.2016.7603406","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603406","url":null,"abstract":"Information Extraction is an important task in Natural Language Processing research. Named Entity Recognition as one of the basic tasks of information extraction, the effect has a great impact on the subsequent tasks such as Relation Extraction. And a major difficulty of NER lies in the unknown word identification. For this issue, method of exploiting Wikipedia external information methods was studied. Wikipedia is a rapid developing online encyclopedia in recent years. In 2016, the number of Chinese entries has reached 860,000. Huge valuable information will be provided to identify unknown words by Exploiting Wikipedia as external knowledge. The Wikipedia entries have been selected, and combined into the Conditional Random Field model of NER as features. The experimental studies demonstrate that this method can improve the effectiveness of NER significantly.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114715479","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-08-01DOI: 10.1109/FSKD.2016.7603210
Lizhi Peng, Bo Yang, Yuehui Chen, Xiaoqing Zhou
With one class outnumbering another, many real classification tasks show imbalanced class distributions, which brings big trouble to standard classification models: they usually intend to recognize a minority instance as a majority one. The data gravitation based classification (DGC) model, a newly developed physical-inspired supervised learning model, has been proven effective for standard supervised learning tasks. However, DGC is not able to get high performances for imbalanced data sets, like most other standard learning algorithms do. Thus, to address the problem, an under-sampling technique, together with an ensemble technique, has been designed to adapt the standard DGC model for imbalanced learning tasks. The new adapted DGC model is called UI-DGC. 22 low imbalanced and 22 high imbalanced data sets are selected for the experimental study. UI-DGC is compared with standard and imbalanced learning algorithms. Empirical studies suggest that the UI-DGC model can get high imbalanced classification performances, especially for high imbalanced tasks.
{"title":"An under-sampling imbalanced learning of data gravitation based classification","authors":"Lizhi Peng, Bo Yang, Yuehui Chen, Xiaoqing Zhou","doi":"10.1109/FSKD.2016.7603210","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603210","url":null,"abstract":"With one class outnumbering another, many real classification tasks show imbalanced class distributions, which brings big trouble to standard classification models: they usually intend to recognize a minority instance as a majority one. The data gravitation based classification (DGC) model, a newly developed physical-inspired supervised learning model, has been proven effective for standard supervised learning tasks. However, DGC is not able to get high performances for imbalanced data sets, like most other standard learning algorithms do. Thus, to address the problem, an under-sampling technique, together with an ensemble technique, has been designed to adapt the standard DGC model for imbalanced learning tasks. The new adapted DGC model is called UI-DGC. 22 low imbalanced and 22 high imbalanced data sets are selected for the experimental study. UI-DGC is compared with standard and imbalanced learning algorithms. Empirical studies suggest that the UI-DGC model can get high imbalanced classification performances, especially for high imbalanced tasks.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124346124","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-08-01DOI: 10.1109/FSKD.2016.7603517
Jin-quan Zhao, L. Fan, Yan Gao, Hao Zhou, Xingxin Guo
The vast majority of nonuniform transmission lines are no analytical solution except for a few special forms of transmission line. Dividing nonuniform transmission line into several equal parts, then each part can be regarded as uniform transmission line approximately. Using the theory of uniform transmission line to analyze nonuniform transmission line's transient response is the commonly used method. Composite Simpson's rule for transient analysis of nonuniform transmission lines is proposed in this paper. The exponential transmission matrix of nonuniform transmission line's equation is transformed into a general algebraic equation, which greatly simplifies the analysis on transient response for nonuniform transmission line. The simulation results illustrate the accuracy of the presented approach with examples.
{"title":"Transient analysis of nonuniform transmission lines with composite Simpson's rule","authors":"Jin-quan Zhao, L. Fan, Yan Gao, Hao Zhou, Xingxin Guo","doi":"10.1109/FSKD.2016.7603517","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603517","url":null,"abstract":"The vast majority of nonuniform transmission lines are no analytical solution except for a few special forms of transmission line. Dividing nonuniform transmission line into several equal parts, then each part can be regarded as uniform transmission line approximately. Using the theory of uniform transmission line to analyze nonuniform transmission line's transient response is the commonly used method. Composite Simpson's rule for transient analysis of nonuniform transmission lines is proposed in this paper. The exponential transmission matrix of nonuniform transmission line's equation is transformed into a general algebraic equation, which greatly simplifies the analysis on transient response for nonuniform transmission line. The simulation results illustrate the accuracy of the presented approach with examples.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124541638","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-08-01DOI: 10.1109/FSKD.2016.7603419
Chengcai Leng, Haipeng Zhang
Spectral graph theory can characterize the global properties and extract structural information of a graph. The normalized Laplacian matrix of a graph has positive or zero eigenvalues, and the largest eigenvalues is less than or equal to 2. In this paper, the internal rules of the eigenvalues of the normalized Laplacian matrix will be proposed. The range of the eigenvalues is further narrowed and the distribution of the eigenvalues is given, so the prediction of eigenvalues will conduct the research of the spectral graph theory. We apply this technique to image registration; the experimental results on image registration are very encouraging.
{"title":"The prediction of eigenvalues of the normalized laplacian matrix for image registration","authors":"Chengcai Leng, Haipeng Zhang","doi":"10.1109/FSKD.2016.7603419","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603419","url":null,"abstract":"Spectral graph theory can characterize the global properties and extract structural information of a graph. The normalized Laplacian matrix of a graph has positive or zero eigenvalues, and the largest eigenvalues is less than or equal to 2. In this paper, the internal rules of the eigenvalues of the normalized Laplacian matrix will be proposed. The range of the eigenvalues is further narrowed and the distribution of the eigenvalues is given, so the prediction of eigenvalues will conduct the research of the spectral graph theory. We apply this technique to image registration; the experimental results on image registration are very encouraging.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121689876","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-08-01DOI: 10.1109/FSKD.2016.7603518
Jianxia Chen, Qin Fang, Yu Cheng, P. Gong, Fang Hao, Ji Ma, Jinyang You, Baoshuai Liu
The information construction plays an essential role in the area of public security. However, the “Information Silo” phenomenon in Public Security Department has become a bottleneck of the development of public security. The paper proposes a novel approach to implement a public security knowledge navigation system, utilizing the information extraction to obtain the ontology for the topic maps of public security cases. And the topic maps integrate useful information to analyze and find relations among cases not only assistant investigators to systematize public security information resources, but also contribute to fully master all of information related to the participates. In particular, the paper proposed a visual navigation for the topic maps which can improve the efficiency and accuracy of public security staffs.
{"title":"A novel public security cases knowledge navigation system based topic maps","authors":"Jianxia Chen, Qin Fang, Yu Cheng, P. Gong, Fang Hao, Ji Ma, Jinyang You, Baoshuai Liu","doi":"10.1109/FSKD.2016.7603518","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603518","url":null,"abstract":"The information construction plays an essential role in the area of public security. However, the “Information Silo” phenomenon in Public Security Department has become a bottleneck of the development of public security. The paper proposes a novel approach to implement a public security knowledge navigation system, utilizing the information extraction to obtain the ontology for the topic maps of public security cases. And the topic maps integrate useful information to analyze and find relations among cases not only assistant investigators to systematize public security information resources, but also contribute to fully master all of information related to the participates. In particular, the paper proposed a visual navigation for the topic maps which can improve the efficiency and accuracy of public security staffs.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115922266","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-08-01DOI: 10.1109/FSKD.2016.7603260
Xinyan She, Xianghua Li, Yuxin Liu, Chao Gao
Locating the source of propagation is a ubiquitous but challenging problem in the field of complex networks. The traditional source location methods based on a set of observers can achieve a high locating accuracy. However, such high accuracy is based on the consistent assumption which means the propagation delays consistently follow a certain distribution in both the infected time calculation process and the source location process. Based on our simulation results and existing researches, we find that the real propagation delays, in some real-world scenarios, often break such consistent assumption and the predication accuracy of existing methods decline significantly in these circumstances. Therefore it raises a critical question: can we locate the infection source without assuming the distribution of propagation delays? In this paper, we first formulate the problem of locating source as inferring the parameters of propagation delays based on a set of observers. Then, we propose a novel reverse propagation strategy to locate infection source. Finally, a comprehensive comparisons are used to provide a quantitative analyses of our method. The results show that our strategy has a higher accuracy than the traditional methods without the consistent assumptions.
{"title":"A novel source locating strategy without consistent assumptions","authors":"Xinyan She, Xianghua Li, Yuxin Liu, Chao Gao","doi":"10.1109/FSKD.2016.7603260","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603260","url":null,"abstract":"Locating the source of propagation is a ubiquitous but challenging problem in the field of complex networks. The traditional source location methods based on a set of observers can achieve a high locating accuracy. However, such high accuracy is based on the consistent assumption which means the propagation delays consistently follow a certain distribution in both the infected time calculation process and the source location process. Based on our simulation results and existing researches, we find that the real propagation delays, in some real-world scenarios, often break such consistent assumption and the predication accuracy of existing methods decline significantly in these circumstances. Therefore it raises a critical question: can we locate the infection source without assuming the distribution of propagation delays? In this paper, we first formulate the problem of locating source as inferring the parameters of propagation delays based on a set of observers. Then, we propose a novel reverse propagation strategy to locate infection source. Finally, a comprehensive comparisons are used to provide a quantitative analyses of our method. The results show that our strategy has a higher accuracy than the traditional methods without the consistent assumptions.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"335 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133830325","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-08-01DOI: 10.1109/FSKD.2016.7603386
Shuangquan Fan, Zaihong He, Huailiang Tan
As the amount of data grows exponentially, active storage was proposed as an alternative solution in order to mitigate the I/O performance problem in distributed cluster system. It moves appropriate computation to the location in which data is stored and hence reduces the amount of data transferred. Prior research has investigated and deployed the concept in different forms. However, balancing the computation load between compute and storage nodes in active storage system according to the current system status has been largely unexplored. In this paper, we propose an active storage system that provides programming interfaces for applications to implement the offload computing algorithm and assignment policy. We have implemented a dynamic task assignment policy that assigns computing tasks between compute and storage nodes according the feedback information of system environment. Our experimental results show that there is a optimal allocation proportion with the considerable impact of system status and characteristics of computation, and the proposed dynamic task assignment policy can make an allocation of computing tasks at a proportion close to the optimal assignment.
{"title":"An active storage system with dynamic task assignment policy","authors":"Shuangquan Fan, Zaihong He, Huailiang Tan","doi":"10.1109/FSKD.2016.7603386","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603386","url":null,"abstract":"As the amount of data grows exponentially, active storage was proposed as an alternative solution in order to mitigate the I/O performance problem in distributed cluster system. It moves appropriate computation to the location in which data is stored and hence reduces the amount of data transferred. Prior research has investigated and deployed the concept in different forms. However, balancing the computation load between compute and storage nodes in active storage system according to the current system status has been largely unexplored. In this paper, we propose an active storage system that provides programming interfaces for applications to implement the offload computing algorithm and assignment policy. We have implemented a dynamic task assignment policy that assigns computing tasks between compute and storage nodes according the feedback information of system environment. Our experimental results show that there is a optimal allocation proportion with the considerable impact of system status and characteristics of computation, and the proposed dynamic task assignment policy can make an allocation of computing tasks at a proportion close to the optimal assignment.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134399047","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-08-01DOI: 10.1109/FSKD.2016.7603495
Leqiang Bai, Yi Liu, Shiguang Qian, Shihong Zhang
To reduce the routing overhead in routing discovery of Ad hoc On-demand Distance Vector junior routing (AODVjr) algorithm and decrease energy consumption of ZigBee network, the improved AODVjr routing algorithm based on node depth in ZigBee network is proposed. Utilizing ZigBee hierarchical structure and the node depth, the proposed algorithm sets the tree routing hops between source node and destination node as maximum transmission hops of the RREQ packets, to control the transmission range of RREQ packets. In order to reduce the number of RREQ packets, the node decides to broadcast or discard RREQ packets according to the tree routing hops between the source and the destination. The experiment results show that the improved algorithm can effectively reduce routing overhead and decrease energy consumption of the network.
{"title":"Improved AODVjr routing algorithm based on node depth in ZigBee network","authors":"Leqiang Bai, Yi Liu, Shiguang Qian, Shihong Zhang","doi":"10.1109/FSKD.2016.7603495","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603495","url":null,"abstract":"To reduce the routing overhead in routing discovery of Ad hoc On-demand Distance Vector junior routing (AODVjr) algorithm and decrease energy consumption of ZigBee network, the improved AODVjr routing algorithm based on node depth in ZigBee network is proposed. Utilizing ZigBee hierarchical structure and the node depth, the proposed algorithm sets the tree routing hops between source node and destination node as maximum transmission hops of the RREQ packets, to control the transmission range of RREQ packets. In order to reduce the number of RREQ packets, the node decides to broadcast or discard RREQ packets according to the tree routing hops between the source and the destination. The experiment results show that the improved algorithm can effectively reduce routing overhead and decrease energy consumption of the network.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132785459","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-08-01DOI: 10.1109/FSKD.2016.7603270
Yu-Jie Wang, T. Han
Enterprises recognize sustainability as an important issue in management. Unfortunately, there are problems of increasing desirable outputs and decreasing undesirable outputs in sustainability measurement. In the past, Hwang et al. developed a radial DEA model that simultaneously evaluated decrease of undesirable outputs and increase of desire outputs with a focus on identifying inefficiency of automobile industry. Practically, a radial DEA model doesn't reflect all efficiency/inefficiency of a decision-making unit(DMU) with numerous inputs and outputs, whereas a non-radial DEA model does. To solve the tie above, we apply non-radial data envelopment analysis(DEA) on undesirable outputs for sustainability in this paper. Our applied non-radial DEA provides measurement to yield the livelihood-efficiency such as the efficiencies number of violent crimes or the eco-efficiency such as the efficiencies of carbon emissions, gas emissions, water pollution and solid wastes, and further improving efficiencies while minimizing the undesirable outputs in sustainability.
{"title":"Applying non-radial DEA on undesirable outputs for sustainability","authors":"Yu-Jie Wang, T. Han","doi":"10.1109/FSKD.2016.7603270","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603270","url":null,"abstract":"Enterprises recognize sustainability as an important issue in management. Unfortunately, there are problems of increasing desirable outputs and decreasing undesirable outputs in sustainability measurement. In the past, Hwang et al. developed a radial DEA model that simultaneously evaluated decrease of undesirable outputs and increase of desire outputs with a focus on identifying inefficiency of automobile industry. Practically, a radial DEA model doesn't reflect all efficiency/inefficiency of a decision-making unit(DMU) with numerous inputs and outputs, whereas a non-radial DEA model does. To solve the tie above, we apply non-radial data envelopment analysis(DEA) on undesirable outputs for sustainability in this paper. Our applied non-radial DEA provides measurement to yield the livelihood-efficiency such as the efficiencies number of violent crimes or the eco-efficiency such as the efficiencies of carbon emissions, gas emissions, water pollution and solid wastes, and further improving efficiencies while minimizing the undesirable outputs in sustainability.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131176728","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-08-01DOI: 10.1109/FSKD.2016.7603319
Chen-Tung Chen, Hui-Ling Cheng, W. Hung
The aim of this paper is attempted to present a systematic decision-making model to deal with the personnel selection effectively and efficiently. At first stage, quantitative information of each applicant is considered in proposed method to reduce number of candidates. For this purpose, the TOPSIS and entropy methods are applied to calculate closeness coefficient of each applicant. In next stage, qualitative information of each suitable candidate is expressed by 2-tuple linguistic variable. Therefore, we combined the PROMETHEE with entropy method to compute the outranking indices of candidates with respect to each qualitative criterion. A comprehensive support index is defined in this paper to determine ranking order of each candidate by considering quantitative and qualitative information simultaneously. An example is implemented to present the computational process of proposed method.
{"title":"A two-phase decision-making method for handling personnel selection problem","authors":"Chen-Tung Chen, Hui-Ling Cheng, W. Hung","doi":"10.1109/FSKD.2016.7603319","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603319","url":null,"abstract":"The aim of this paper is attempted to present a systematic decision-making model to deal with the personnel selection effectively and efficiently. At first stage, quantitative information of each applicant is considered in proposed method to reduce number of candidates. For this purpose, the TOPSIS and entropy methods are applied to calculate closeness coefficient of each applicant. In next stage, qualitative information of each suitable candidate is expressed by 2-tuple linguistic variable. Therefore, we combined the PROMETHEE with entropy method to compute the outranking indices of candidates with respect to each qualitative criterion. A comprehensive support index is defined in this paper to determine ranking order of each candidate by considering quantitative and qualitative information simultaneously. An example is implemented to present the computational process of proposed method.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127069028","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
扫码关注我们
求助内容：
应助结果提醒方式：