The application of adaptive partitioned random search in feature selection problem

Feature selection is one of important and frequently used techniques in data preprocessing. It can improve the efficiency and the effectiveness of data mining by reducing the dimensions of feature space and removing the irrelevant and redundant information. Feature selection can be viewed as a global optimization problem of finding a minimum set of M relevant features that describes the dataset as well as the original N attributes. In this paper, we apply the adaptive partitioned random search strategy into our feature selection algorithm. Under this search strategy, the partition structure and evaluation function is proposed for feature selection problem. This algorithm ensures the global optimal solution in theory and avoids complete randomness in search direction. The good property of our algorithm is shown through the theoretical analysis.

Modelling basin level allocation of water in the Murray-Darling Basin in a world of uncertainty, Murray-Darling Program Working Papers WPM05-1, Risk and Sustainable Management Group, 8 February 2005

Abstract: The Murray-Darling Basin comprises over 1 million km2; it lies within four states and one territory; and over 12, 800 GL of irrigation water is used to produce over 40% of the nation's gross value of agricultural production. This production is used by a diverse collection of some-times mutually exclusive commodities (e.g. pasture; stone fruit; grapes; cotton and field crops). The supply of water for irrigation is subject to climatic and policy uncertainty. Variable inflows mean that water property rights do not provide a guaranteed supply. With increasing public scrutiny and environmental issues facing irrigators, greater pressure is being placed on this finite resource. The uncertainty of the water supply, water quality (salinity), combined with where water is utilised, while attempting to maximising return for investment makes for an interesting research field. The utilisation and comparison of a GAMS and Excel based modelling approach has been used to ask: where should we allocate water?; amongst what commodities?; and how does this affect both the quantity of water and the quality of water along the Murray-Darling river system?

The mu-way intersection problem for m-cycle systems

An m-cycle system of order upsilon is a partition of the edge-set of a complete graph of order upsilon into m-cycles. The mu -way intersection problem for m-cycle systems involves taking mu systems, based on the same vertex set, and determining the possible number of cycles which can be common to all mu systems. General results for arbitrary m are obtained, and detailed intersection values for (mu, m) = (3, 4), (4, 5),(4, 6), (4, 7), (8, 8), (8, 9). (For the case (mu, m)= (2, m), see Billington (J. Combin. Des. 1 (1993) 435); for the case (Cc,m)=(3,3), see Milici and Quattrochi (Ars Combin. A 24 (1987) 175. (C) 2001 Elsevier Science B.V. All rights reserved.

On the intersection problem for 1-factorizations and near 1-factorizations of K-v

The number of 1-factors (near 1-factors) that mu 1-factorizations (near 1-factorizations) of the complete graph K-v, v even (v odd), can have in common, is studied. The problem is completely settled for mu = 2 and mu = 3.

On the Oberwolfach problem with two similar length cycles

For all in greater than or equal to 3, the Oberwolfach problem is solved for the case where the 2-factors consist of two cycles of lengths in and m + 1, and for the case where the 2-factors consist of two cycles of lengths m and m + 2.