Assessing Dimensionality by Maximizing H Coefficient–Based Objective Functions
نویسندگان
چکیده
منابع مشابه
Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms
Many combinatorial optimization problems have underlying goal functions that are submodular. The classical goal is to find a good solution for a given submodular function f under a given set of constraints. In this paper, we investigate the runtime of a multi-objective evolutionary algorithm called GSEMO until it has obtained a good approximation for submodular functions. For the case of monoto...
متن کاملMaximizing Non-monotone/Non-submodular Functions by Multi-objective Evolutionary Algorithms
Evolutionary algorithms (EAs) are a kind of nature-inspired general-purpose optimization algorithm, and have shown empirically good performance in solving various real-word optimization problems. However, due to the highly randomized and complex behavior, the theoretical analysis of EAs is difficult and is an ongoing challenge, which has attracted a lot of research attentions. During the last t...
متن کاملMaximizing General Set Functions by Submodular Decomposition
We present a branch and bound method for maximizing an arbitrary set function V : 2 θ → R . By decomposing θ as f-δ , where f is a submodular function and δ is the cut function of a (simple, undirected) graph G with vertex set V, our original problem is reduced to a sequence of submodular maximization problems. We characterize a class of submodular functions, which when maximized in the subprob...
متن کاملOn Maximizing Functions by Fibonacci Search
The search for a local maximum of a function f(x) involves a sequence of function evaluations, i.e.s observations of the value of f(x) for a fixed value of x. A sequential search scheme allows us to evaluate the function at different points, one after the other, using information from earlier evaluations to decide where to locate the next ones. At each stage, the smallest interval in which a ma...
متن کاملTuning evaluation functions by maximizing concordance
Heuristic search effectiveness depends directly upon the quality of heuristic evaluations of states in a search space. Given the large amount of research effort devoted to computer chess throughout the past half-century, insufficient attention has been paid to the issue of determining if a proposed change to an evaluation function is beneficial. We argue that the mapping of an evaluation functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Psychological Measurement
سال: 2007
ISSN: 0146-6216,1552-3497
DOI: 10.1177/0146621606295196