Subset Selection Algorithms: Randomized vs. Deterministic

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subset Selection Algorithms: Randomized vs. Deterministic

Abstract. Subset selection is a method for selecting a subset of columns from a real matrix, so that the subset represents the entire matrix well and is far from being rank deficient. We begin by extending a deterministic subset selection algorithm to matrices that have more columns than rows. Then we investigate a two-stage subset selection algorithm that utilizes a randomized stage to pick a ...

متن کامل

Messy Genetic Algorithms for Subset Feature Selection

Subset Feature Selection problems can have several attributes which may make Messy Ge netic Algorithms an appropriate optimization method First competitive solutions may of ten use only a small percentage of the total available features this can not only o er an advantage to Messy Genetic Algorithms it may also cause problems for other types of evolutionary algorithms Second the evalu ation of ...

متن کامل

Subset Selection Based on Bio - Inspired Algorithms

Many feature subset selection algorithms have been proposed and discussed for years. However, the problem of finding the optimal feature subset from full data still remains to be a difficult problem. In this paper, we propose novel methods to find the relevant feature subset by using biologically-inspired algorithms such as Genetic Algorithm and Particle Swarm Optimization. We also propose a va...

متن کامل

Genetic Algorithms: Artificial Selection vs Natural Selection

Genetic Algorithms (GAs) are a stochastic searching and optimizing method inspired by the biological mechanism of natural selection and evolution. To improve the searching power of GAs for complicated problems, many deterministic measures, particularly, experience and/or expert knowledge-based heuristic rules, have been studied in the existing literature. This paper proposes a potentially more ...

متن کامل

Error Estimations for Indirect Measurements: Randomized vs. Deterministic Algorithms for “black-box" Programs

In many real-life situations, it is very difficult or even impossible to directly measure the quantity y in which we are interested: e.g., we cannot directly measure a distance to a distant galaxy or the amount of oil in a given well. Since we cannot measure such quantities directly, we can measure them indirectly: by first measuring some relating quantities x1; : : : ; xn, and then by using th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Undergraduate Research Online

سال: 2010

ISSN: 2327-7807

DOI: 10.1137/09s010435