Comparison between normal weights and conditional Bays weights in Iterative principal component estimators
نویسندگان
چکیده
منابع مشابه
Weights in block iterative methods
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...
متن کاملweights in block iterative methods
in this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.when the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. additionally for linear feasibil...
متن کاملOrgan Weights of Normal Rabbits
In November, 1921, a systematic study of normal rabbits was undertaken as a part of a more general investigation dealing with the subject of the animal organism in relation to disease. The present paper on organ weights is based on results obtained from a study of 350 male rabbits killed and examined between January 1, 1922, and July 1, 1924. Methods of conducting the experiments are described ...
متن کاملUsing Arc Weights to Improve Iterative Repair
One of the surprising findings from the study of CNF satisfiability in the 1990’s has been the success of iterative repair techniques, and in particular of weighted iterative repair. However, attempts to improve weighted iterative repair have either produced marginal benefits or rely on domain specific heuristics. This paper introduces a new extension of constraint weighting called Arc Weightin...
متن کاملIterative Partitioning with Varying Node Weights
The balanced partitioning problem divides the nodes of a [hyper]graph into groups of approximately equal weight (i.e., satisfying balance constraints) while minimizing the number of [hyper]edges that are cut (i.e., adjacent to nodes in di erent groups). Classic iterative algorithms use the pass paradigm [24] in performing single-node moves [16, 13] to improve the initial solution. To satisfy pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economics and Administrative Sciences
سال: 2018
ISSN: 2227-703X,2518-5764
DOI: 10.33095/jeas.v24i109.1566