Search

Abstract: In a recent paper by Toloo et al. [Toloo, M., Sohrabi, B., & Nalchigar, S. (2009). A new method for ranking discovered rules from data mining by DEA. Expert Systems with Applications, 36, 8503–8508], they proposed a new integrated data envelopment analysis model to find most efficient association rule in data mining. Then, utilizing this model, an algorithm is developed for ranking association rules by considering multiple criteria. In this paper, we show that their model only selects one efficient association rule by chance and is totally depended on the solution method or software is used for solving the problem. In addition, it is shown that their proposed algorithm can only rank efficient rules randomly and will fail to rank inefficient DMUs. We also refer to some other drawbacks in that paper and propose another approach to set up a full ranking of the association rules. A numerical example illustrates some contents of the paper. [Copyright &y& Elsevier]

Abstract: Weapon System Capability Assessment (WSCA) is the initial point of quantification of capabilities in the military capability planning (MCP). WSCA is often a multiple criteria decision making (MCDM) problem with both quantitative and qualitative information under uncertain environment. In this paper, the analysis process and algorithm for WSCA problem is proposed on the basis of belief structure (BS) model and evidential reasoning (ER) approach which were developed to deal with various types of uncertainties such as ignorance and subjectiveness. First of all, the WSCA criteria hierarchy is built by analyzing how the capability is measured. Secondly, a weapon system capability model is formulated using BS. Thirdly, both qualitative and quantitative information involved in capability measure are transformed into BSs by the data transformation algorithm based on rules. Then, the analytical ER approach is used to aggregate the capability measurement information from sub-capability criteria to top-capability criterion, and the assessed weapon systems are ranked and analyzed according to utility intervals. Finally, a case study of real Main Battle Tank capability assessment is explored to show the proposed process for WSCA. [Copyright &y& Elsevier]

Abstract: Although all university majors are prominent, and the necessity of their presence is of no question, they might not have the same priority basis considering different resources and strategies that could be spotted for a country. Their priorities likely change as the time goes by; that is, different majors are desirable at different time. If the government is informed of which majors could tackle today existing problems of world and its country, it surely more esteems those majors. This paper considers the problem of clustering and ranking university majors in Iran. To do so, a model is presented to clarify the procedure. Eight different criteria are determined, and 177 existing university majors are compared on these criteria. First, by k-means algorithm, university majors are clustered based on similarities and differences. Then, by AHP algorithm, we rank university majors. [Copyright &y& Elsevier]

Abstract: It is crucial to obtain automatically and efficiently a well-distributed set of Pareto optimal solutions in multiobjective evolutionary algorithms (MOEAs). Many studies have proposed different evolutionary algorithms that can progress toward the Pareto front with a widely spread distribution of solutions. However, most theoretically, convergent MOEAs necessitate certain prior knowledge about the Pareto front in order to efficiently maintain widespread solutions. In this paper, we propose, based on the new E-dominance concept, an Adaptive Rectangle Archiving (ARA) strategy that overcomes this important problem. The MOEA with this archiving technique provably converges to well-distributed Pareto optimal solutions without prior knowledge about the Pareto front. ARA complements the existing archiving techniques and is useful to both researchers and practitioners. [ABSTRACT FROM AUTHOR]

To deal with complex problems, structuring them through graphical representations and analyzing causal influences can aid in illuminating complex issues, systems, or concepts. The DEMATEL method is a methodology which can confirm interdependence among variables and aid in the development of a chart to reflect interrelationships between variables, and can be used for researching and solving complicated and intertwined problem groups. The end product of the DEMATEL process is a visual representation—the impact-relations map—by which respondents organize their own actions in the world. In order to obtain a suitable impact-relations map, an appropriate threshold value is needed to obtain adequate information for further analysis and decision-making. In the existing literature, the threshold value has been determined through interviews with respondents or judged by the researcher. In most cases, it is hard and time-consuming to aggregate the respondents and make a consistent decision. In addition, in order to avoid subjective judgments, a theoretical method to select the threshold value is necessary. In this paper, we propose a method based on the entropy approach, the maximum mean de-entropy algorithm, to achieve this purpose. Using a real case to find the interrelationships between the services of a Semiconductor Intellectual Property Mall as an example, we will compare the results obtained from the respondents and from our method, and show that the impact-relations maps from these two methods could be the same. [Copyright &y& Elsevier]