다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Machine learning

Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

List of Figures. List of Tables. Preface. Foreword. 1. Basic Concepts. 2. Evolutionary Algorithm MOP Approaches. 3. MOEA Test Suites. 4. MOEA Testing and Analysis. 5. MOEA Theory and Issues. 3. MOEA Theoretical Issues. 6. Applications. 7. MOEA Parallelization. 8. Multi-Criteria Decision Making. 9. Special Topics. 10. Epilog. Appendix A: MOEA Classification and Technique Analysis. Appendix B: MOPs in the Literature. Appendix C: Ptrue & PFtrue for Selected Numeric MOPs. Appendix D: Ptrue & PFtrue for Side-Constrained MOPs. Appendix E: MOEA Software Availability. Appendix F: MOEA-Related Information. Index. References.

/pdf/evolutionary-algorithms-for-solving-multi-objective-problems-2txxk4mqci.pdf

Evolutionary algorithms for solving multi-objective problems

A unified view of metaheuristics This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling. It presents the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code. Throughout the book, the key search components of metaheuristics are considered as a toolbox for: Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems Designing efficient metaheuristics for multi-objective optimization problems Designing hybrid, parallel, and distributed metaheuristics Implementing metaheuristics on sequential and parallel machines Using many case studies and treating design and implementation independently, this book gives readers the skills necessary to solve large-scale optimization problems quickly and efficiently. It is a valuable reference for practicing engineers and researchers from diverse areas dealing with optimization or machine learning; and graduate students in computer science, operations research, control, engineering, business and management, and applied mathematics.

/pdf/metaheuristics-from-design-to-implementation-1vqdfv8nk9.pdf

Metaheuristics: From Design to Implementation

Multi-objective optimization methods are essential to resolve real-world problems as most involve several types of objects. Several multi-objective genetic algorithms have been proposed. Among them, SPEA2 and NSGA-II are the most successful. In the present study, two new mechanisms were added to SPEA2 to improve its searching ability a more effective crossover mechanism and an archive mechanism to maintain diversity of the solutions in the objective and variable spaces. The new SPEA2 with these two mechanisms was named SPEA2+. To clarify the characteristics and effectiveness of the proposed method, SPEA2+ was applied to several test functions. In the comparison of SPEA2+ with SPEA2 and NSGA-II, SPEA2+ showed good results and the effects of the new mechanism were clarified. From these results, it was concluded that SPEA2+ is a good algorithm for multi-objective optimization problems.

SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2

SPEA2+: Improving the performance of the strength pareto evolutionary algorithm 2

In this paper, a new genetic algorithm for multi-objective optimization problems is introduced. That is called ”Neighborhood Cultivation GA (NCGA)”. In the recent studies such as SPEA2 or NSGA-II, it is demonstrated that some mechanisms are important; the mechanisms of placement in an archive of the excellent solutions, sharing without parameters, assign of fitness, selection and reflection the archived solutions to the search population. NCGA includes not only these mechanisms but also the neighborhood crossover. The comparison of NCGA with SPEA2 and NSGA-II by some test functions shows that NCGA is a robust algorithm to find Pareto-optimum solutions. Through the comparison between the case of using neighborhood crossover and the case of using normal crossover in NCGA, the effect of neighborhood crossover is made clear.

/pdf/ncga-neighborhood-cultivation-genetic-algorithm-for-multi-jqkvn7dhp9.pdf

NCGA : Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems

Proposes a divided-range multi-objective genetic algorithm (DRMOGA), which is a model for the parallel processing of genetic algorithms (GAs) for multi-objective problems. In the DRMOGA, the population of GAs is sorted with respect to the values of the objective function and divided into sub-populations. In each sub-population, a simple GA for multi-objective problems is performed. After some generations, all the individuals are gathered and they are sorted again. In this model, the Pareto-optimal solutions which are close to each other are collected into one sub-population. Therefore, this algorithm increases the calculation efficiency and a neighborhood search can be performed. Through numerical examples, the following facts become clear: (i) the DRMOGA is a very suitable GA model for parallel processing, and (ii) in some cases it can derive better solutions compared to both the single-population model and the distributed model.

The new model of parallel genetic algorithm in multi-objective optimization problems - divided range multi-objective genetic algorithm

Introduces an alternative approach to relieving the task of choosing optimal mutation and crossover rates by using a parallel and distributed GA with distributed environments. It is shown that the best mutation and crossover rates depend on the population sizes and the problems, and those are different between a single and multiple populations. The proposed distributed environment GA uses various combination of the parameters as the fixed values in the subpopulations. The excellent performance of the new scheme is experimentally recognized for a standard test function. It is concluded that the distributed environment GA is the fastest way to gain a good solution under the given population size and uncertainty of the appropriate crossover and mutation rates.

/pdf/a-parallel-genetic-algorithm-with-distributed-environment-58zv65rfaf.pdf

Tomoyuki Hiroyasu

Papers

SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2

SPEA2+: Improving the performance of the strength pareto evolutionary algorithm 2

NCGA : Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems

The new model of parallel genetic algorithm in multi-objective optimization problems - divided range multi-objective genetic algorithm

A parallel genetic algorithm with distributed environment scheme