نتایج جستجو برای: compromise ranking
تعداد نتایج: 59323 فیلتر نتایج به سال:
This paper describes the approaches and results of our system for the NTCIR-10 INTENT task. We present some methods for Subtopic Mining subtask and Document Ranking subtask. In the Subtopic Mining subtask, we employ a voting method to rank candidate subtopics and semantic resource HowNet was used to merge those candidate subtopics which may impact diversity. In the Document Ranking Subtask, we ...
Van Raan et al. (2010) accepted our critique for the case of journal normalization (previously CPP/JCSm); CWTS has in the meantime adapted its procedures. However, a new indicator was proposed for field normalization (previously CPP/FCSm), called the “mean normalized citation score” (MNCS; cf. Lundberg, 2007). In our opinion, this latter change does not sufficiently resolve the problems. Since ...
In multiple attribute decision making (MADM) problem, a decision maker (DM) has to choose the best alternative that satisfies the evaluation criteria among a set of candidate solutions. It is generally hard to find an alternative that meets all the criteria simultaneously, so a good compromise solution is preferred. The VIKOR method was developed for multi-criteria optimization of complex syste...
In e-learning settings, the evaluation of different alternatives regarding learning paths’ proposals is nowadays crucial, due to the great attention devoted to the construction of learning objects (LO) available through Learning Management Systems (LMS). In this paper, we present a model aiming to support this evaluation process, in presence of multiple attributes and of a panel of experts invo...
Let S be a dataset of n 2-dimensional points. The top-k dominating query aims to report the k points that dominate the most points in S . A point p dominates a point q iff all coordinates of p are smaller than or equal to those of q and at least one of them is strictly smaller. The top-k dominating query combines the dominance concept of maxima queries with the ranking function of top-k queries...
This paper introduces a qualitative ranking function that uses signed integers to describe the surprise associated with the occurrence of events. The measure introduced, κ, is based on the κ calculus but differs from it in that its semantics enable an explicit representation of complements. As a result, the κ is more capable of enforcing probability theory-like constraints to carry on reasoning.
This paper describes our participation in the Intent Mining track of NTCIR-11. We present our methods and results for both document ranking and subtopic mining. Our ranking methods are based on several data fusion techniques with some variations. Our subtopic mining method is a very simple technique that uses query dimensions’ items to form a subtopic
In this paper, we address the problem of finding the simulated system with the best (maximum or minimum) expected performance when the number of alternatives is finite, but large enough that ranking-and-selection (R&S) procedures may require too much computation to be practical. Our approach is to use the data provided by the first stage of sampling in an R&S procedure to screen out alternative...
Value benefit analysis (VBA) is a psychometric instrument for finding the best compromise in forestry multiple-use planning, when the multiple objectives cannot be expressed in the same physical or monetary unit. It insures a systematic assessment of the consequences of proposed alternatives and thoroughly documents the decision process. The method leads to a ranking of alternatives based upon ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید