Rank-based dimension reduction for many-criteria populations

Copyright © 2011 ACM13th annual conference on Genetic and Evolutionary Computation (GECCO '11), Dublin, Ireland, 12-16 July 2011Interpreting individuals described by a set of criteria can be a difficult task when the number of criteria is large. Such individuals can be ranked, for instance in terms of their average rank across criteria as well as by each distinct criterion. We therefore investigate criteria selection methods which aim to preserve the average rank of individuals but with fewer criteria. Our experiments show that these methods perform effectively, identifying and removing redundancies within the data, and that they are best incorporated into a multi-objective algorithm

Event-based graphical monitoring in the EpochX genetic programming framework

EpochX is a genetic programming framework with provision for event management – similar to the Java event model – allowing the notification of particular actions during the lifecycle of the evolutionary algorithm. It also provides a flexible Stats system to gather statistics measures. This paper introduces a graphical interface to the EpochX genetic programming framework, taking full advantage of EpochX's event management. A set of representation-independent and tree-dependent GUI components are presented, showing how statistic information can be presented in a rich format using the information provided by EpochX's Stats system

Partitioning networks into cliques: a randomized heuristic approach

In the context of community detection in social networks, the term community can be grounded in the strict way that simply everybody should know each other within the community. We consider the corresponding community detection problem. We search for a partitioning of a network into the minimum number of non-overlapping cliques, such that the cliques cover all vertices. This problem is called the clique covering problem (CCP) and is one of the classical NP-hard problems. For CCP, we propose a randomized heuristic approach. To construct a high quality solution to CCP, we present an iterated greedy (IG) algorithm. IG can also be combined with a heuristic used to determine how far the algorithm is from the optimum in the worst case. Randomized local search (RLS) for maximum independent set was proposed to find such a bound. The experimental results of IG and the bounds obtained by RLS indicate that IG is a very suitable technique for solving CCP in real-world graphs. In addition, we summarize our basic rigorous results, which were developed for analysis of IG and understanding of its behavior on several relevant graph classes

Circulating vitamin D concentration and risk of seven cancers: Mendelian randomisation study

Objective To determine if circulating concentrations of vitamin D are causally associated with risk of cancer.Design Mendelian randomisation study.Setting Large genetic epidemiology networks (the Genetic Associations and Mechanisms in Oncology (GAME-ON), the Genetic and Epidemiology of Colorectal Cancer Consortium (GECCO), and the Prostate Cancer Association Group to Investigate Cancer Associated Alterations in the Genome (PRACTICAL) consortiums, and the MR-Base platform).Participants 70 563 cases of cancer (22 898 prostate cancer, 15 748 breast cancer, 12 537 lung cancer, 11 488 colorectal cancer, 4369 ovarian cancer, 1896 pancreatic cancer, and 1627 neuroblastoma) and 84 418 controls.Exposures Four single nucleotide polymorphisms (rs2282679, rs10741657, rs12785878 and rs6013897) associated with vitamin D were used to define a multi-polymorphism score for circulating 25-hydroxyvitamin D (25(OH)D) concentrations.Main outcomes measures The primary outcomes were the risk of incident colorectal, breast, prostate, ovarian, lung, and pancreatic cancer and neuroblastoma, which was evaluated with an inverse variance weighted average of the associations with specific polymorphisms and a likelihood based approach. Secondary outcomes based on cancer subtypes by sex, anatomic location, stage, and histology were also examined.Results There was little evidence that the multi-polymorphism score of 25(OH)D was associated with risk of any of the seven cancers or their subtypes. Specifically, the odds ratios per 25 nmol/L increase in genetically determined 25(OH)D concentrations were 0.92 (95% confidence interval 0.76 to 1.10) for colorectal cancer, 1.05 (0.89 to 1.24) for breast cancer, 0.89 (0.77 to 1.02) for prostate cancer, and 1.03 (0.87 to 1.23) for lung cancer. The results were consistent with the two different analytical approaches, and the study was powered to detect relative effect sizes of moderate magnitude (for example, 1.20-1.50 per 25 nmol/L decrease in 25(OH)D for most primary cancer outcomes. The Mendelian randomisation assumptions did not seem to be violated.Conclusions There is little evidence for a linear causal association between circulating vitamin D concentration and risk of various types of cancer, though the existence of causal clinically relevant effects of low magnitude cannot be ruled out. These results, in combination with previous literature, provide evidence that population-wide screening for vitamin D deficiency and subsequent widespread vitamin D supplementation should not currently be recommended as a strategy for primary cancer prevention

Investigating the Viability of Existing Exploratory Landscape Analysis Features for Mixed-Integer Problems

Exploratory landscape analysis has been at the forefront of characterizing single-objective continuous optimization problems. Other variants, which can be summarized under the term landscape analysis, have been used in the domain of combinatorial problems. However, none to little has been done in this research area for mixed-integer problems. In this work, we evaluate the current state of existing exploratory landscape analysis features and their applicability on a subset of mixed-integer problems.</p

Circulating vitamin D concentrations and risk of breast and prostate cancer: a Mendelian randomization study.

BACKGROUND: Observational studies have suggested an association between circulating vitamin D concentrations [25(OH)D] and risk of breast and prostate cancer, which was not supported by a recent Mendelian randomization (MR) analysis comprising 15 748 breast and 22 898 prostate-cancer cases. Demonstrating causality has proven challenging and one common limitation of MR studies is insufficient power. METHODS: We aimed to determine whether circulating concentrations of vitamin D are causally associated with the risk of breast and prostate cancer, by using summary-level data from the largest ever genome-wide association studies conducted on vitamin D (N = 73 699), breast cancer (Ncase = 122 977) and prostate cancer (Ncase = 79 148). We constructed a stronger instrument using six common genetic variants (compared with the previous four variants) and applied several two-sample MR methods. RESULTS: We found no evidence to support a causal association between 25(OH)D and risk of breast cancer [OR per 25 nmol/L increase, 1.02 (95% confidence interval: 0.97-1.08), P = 0.47], oestrogen receptor (ER)+ [1.00 (0.94-1.07), P = 0.99] or ER- [1.02 (0.90-1.16), P = 0.75] subsets, prostate cancer [1.00 (0.93-1.07), P = 0.99] or the advanced subtype [1.02 (0.90-1.16), P = 0.72] using the inverse-variance-weighted method. Sensitivity analyses did not reveal any sign of directional pleiotropy. CONCLUSIONS: Despite its almost five-fold augmented sample size and substantially improved statistical power, our MR analysis does not support a causal effect of circulating 25(OH)D concentrations on breast- or prostate-cancer risk. However, we can still not exclude a modest or non-linear effect of vitamin D. Future studies may be designed to understand the effect of vitamin D in subpopulations with a profound deficiency

Sequential Symbolic Regression with Genetic Programming

This chapter describes the Sequential Symbolic Regression (SSR) method, a new strategy for function approximation in symbolic regression. The SSR method is inspired by the sequential covering strategy from machine learning, but instead of sequentially reducing the size of the problem being solved, it sequentially transforms the original problem into potentially simpler problems. This transformation is performed according to the semantic distances between the desired and obtained outputs and a geometric semantic operator. The rationale behind SSR is that, after generating a suboptimal function f via symbolic regression, the output errors can be approximated by another function in a subsequent iteration. The method was tested in eight polynomial functions, and compared with canonical genetic programming (GP) and geometric semantic genetic programming (SGP). Results showed that SSR significantly outperforms SGP and presents no statistical difference to GP. More importantly, they show the potential of the proposed strategy: an effective way of applying geometric semantic operators to combine different (partial) solutions, avoiding the exponential growth problem arising from the use of these operators

Searching for invariants using genetic programming and mutation testing

Invariants are concise and useful descriptions of a program's behaviour. As most programs are not annotated with invariants, previous research has attempted to automatically generate them from source code. In this paper, we propose a new approach to invariant generation using search. We reuse the trace generation front-end of existing tool Daikon and integrate it with genetic programming and a mutation testing tool. We demonstrate that our system can find the same invariants through search that Daikon produces via template instantiation, and we also find useful invariants that Daikon does not. We then present a method of ranking invariants such that we can identify those that are most interesting, through a novel application of program mutation

An Investigation into the Merger of Stochastic Diffusion Search and Particle Swarm Optimisation

This study reports early research aimed at applying the powerful resource allocation mechanism deployed in Stochastic Diffusion Search (SDS) to the Particle Swarm Optimiser (PSO) metaheuristic, effectively merging the two swarm intelligence algorithms. The results reported herein suggest that the hybrid algorithm, exploiting information sharing between particles, has the potential to improve the optimisation capability of conventional PSOs