نتایج جستجو برای: ranking and selection

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

2005
Domonkos Tikk Szilveszter Kovács Tamás D. Gedeon Kok Wai Wong

This paper presents a feature ranking method adapted to fuzzy modelling with output from a continuous range. Existing feature selection/ranking techniques are mostly suitable for classification problems, where the range of the output is discrete. These techniques result in a ranking of the input feature (variables). Our approach exploits an arbitrary fuzzy clustering of the model output data. U...

2003
Domonkos Tikk Tamás D. Gedeon Kok Wai Wong

This paper presents a feature ranking method adapted to fuzzy modelling with output from a continuous range. Existing feature selection/ranking techniques are mostly suitable for classification problems, where the range of the output is discrete. These techniques result in a ranking of the input feature (variables). Our approach exploits an arbitrary fuzzy clustering of the model output data. U...

2014
Gupta Amit

Globalization is putting enormous pressure on the business organizations specially manufacturing one to rethink the supply chain in innovative manners. Inventory consumes major portion of total sale revenue. Effective and efficient inventory management plays a vital role for the successful functioning of any organization. Selection of inventory policy is one of the important purchasing activiti...

Alireza Alinezhad, Amir Amini, Golriz Rahnama

The stock selection problem is one of the major issues in the investment industry, which is mainly solved by analyzing financial ratios. However, considering the complexity and imprecise patterns of the stock market, obvious and easy-to-understand investment rules, based on fundamental analysis, are difficult to obtain. Fundamental and technical analyses are two common methods for predicting th...

2015
Chun Guo Xiaozhong Liu

Heterogeneous graph based information recommendation have been proved useful in recent studies. Given a heterogeneous graph scheme, there are many possible meta paths between the query node and the result node, and each meta path addresses a hypothesis-based ranking function. In prior researches, meta paths are manually selected by domain experts. However, when the graph scheme becomes complex,...

Journal: :Theor. Comput. Sci. 2006
Jonathan E. Rowe Michael D. Vose Alden H. Wright

Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, ranking selection, and mutation. A non...

2013
Juliane Siebourg

Stability ranking can be used to obtain variable rankings that are highly reproducible. Such rankings are needed for robust variable selection on univariate data. In most biological experiments several replicate measurement for a variable of interest, e.g. a gene, are available. An obvious way to combine and prioritize these values is to take their average or median. Other procedures like a t-t...

2000
Domonkos Tikk Tamás D. Gedeon

This paper presents a modified feature ranking method on interclass separability based for fuzzy control application. Existing feature selection/ranking techniques are mostly suitable for classification problems. These techniques result in a ranking of the input feature or variables. Our modification exploits an arbitrary fuzzy clustering of the control output data. Using these output clusters ...

A Alinezhad A Makui M Zohrehbandian R Kiani Mavi

Technology selection is an important part of management of technology. Recently Karsak and Ahiska (2005) proposed a novel common weight multiple criteria decision making (MCDM) methodology for selection of the best Advanced Manufacturing Technology (AMT) candidates based on a number of attributes. However, Amin et al. (2006), by means of a numerical example demonstrated the convergence difficul...

2008
Karina Zapien Arreola Thomas Gärtner Gilles Gasso Stéphane Canu

Ranking algorithms are often introduced with the aim of automatically personalising search results. However, most ranking algorithms developed in the machine learning community rely on a careful choice of some regularisation parameter. Building upon work on the regularisation path for kernel methods, we propose a parameter selection algorithm for ranking SVM. Empirical results are promising.

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

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