نتایج جستجو برای: weighting method

تعداد نتایج: 1642876  

2008
Shouhua Yuan Xiao Liu Yiliu Tu Deyi Xue

Data envelopment analysis (DEA) has been widely applied in evaluating multicriteria decision making problems, which have multi-input and multi-output. However, the traditional DEA method does neither take the decision maker’s subjective preferences to the individual criteria into consideration nor rank the selected options or decision making units (DMUs). On the other hand, Satty’s analytical h...

Journal: :Information Fusion 2009
Roland Hu Robert I. Damper

A new method is proposed to estimate the optimal weighting parameter for combining audio (speech) and visual (face) information in person identification, based on estimating probability density functions (pdf’s) for classifier scores under Gaussian assumptions. Performance comparisons with real and simulated data indicate that this method has advantages in reducing bias and variance of the esti...

Journal: :IEEE Trans. Knowl. Data Eng. 2002
Kai Ming Ting

ÐWe introduce an instance-weighting method to induce cost-sensitive trees. It is a generalization of the standard tree induction process where only the initial instance weights determine the type of tree to be inducedÐminimum error trees or minimum high cost error trees. We demonstrate that it can be easily adapted to an existing tree learning algorithm. Previous research provides insufficient ...

Journal: :Symmetry 2022

Road haulage solutions are incredibly adaptable, having the capacity to link domestically and internationally. transportation offers a greener, more efficient, safer future through sophisticated technology. Symmetry asymmetry exist widely in industrial applications, logistics supply chains no exception. The multi-criteria decision-making (MCDM) model is considered as complexity tool balance sym...

Journal: :International Journal of Geographical Information Science 2000

2014
Anant Dhayal Jayalal Sarma Saurabh Sawlani

For a graph G(V,E) and a vertex s ∈ V , a weighting scheme (w : E → N) is called a min-unique (resp. max-unique) weighting scheme, if for any vertex v of the graph G, there is a unique path of minimum(resp. maximum) weight1 from s to v. Instead, if the number of paths of minimum(resp. maximum) weight is bounded by n for some constant c, then the weighting scheme is called a min-poly (resp. max-...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید