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 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.

The increasing problem of hepatitis C virus infection

The widespread incidence of hepatitis C (HCV) infection throughout the community is of concern. Although many of those infected will not suffer significantly from their infection, up to one-third will have liver disease, fatigue and oral health problems. General dental practitioners need to be aware of the precautions necessary in treating people with severe liver disease. This paper discusses the issues associated with treating patients who have HCV infection including the importance of preventive programs to reduce dental pathology and maximise oral health.

Hemiplegic shoulder pain: defining the problem and its management

Purpose: Hemiplegic shoulder pain can affect up to 70% of stroke patients and can have an adverse impact on rehabilitation outcomes. This article aims to review the literature on the suggested causes of hemiplegic shoulder pain and the therapeutic techniques that can be used to prevent or treat it. On the basis of this review, the components of an optimal management programme for hemiplegic shoulder pain are explored. Method: English language articles in the CINAHL and MEDLINE databases between 1990 and 2000 were reviewed. These were supplemented by citation tracking and manual searches. Results: A management programme for hemiplegic shoulder pain could comprise the following components: provision of an external support for the affected upper limb when the patient is seated, careful positioning in bed, daily static positional stretches, motor retraining and strapping of the scapula to maintain postural tone and symmetry. Conclusions: Research is required to evaluate the effectiveness of the components of the proposed management programme for the prevention and treatment of hemiplegic shoulder pain and to determine in what combination they achieve the best outcomes.