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.

The role of integrated information acquisition and management in the analysis of coastal ecosystem change

This book chapter represents a synthesis of the work which started in my PhD and which has been the conceptual basis for all of my research since 1993. The chapter presents a method for scientists and managers to use for selecting the type of remotely sensed data to use to meet their information needs associated with a mapping, monitoring or modelling application. The work draws on results from several of my ARC projects, CRC Rainforest and Coastal projects and theses of P.Scarth , K.Joyce and C.Roelfsema.