An algorithm to generate a class of Boolean classification rules is described. The algorithm is implemented in search partition analysis software (SPAN), a program designed to find an optimal binary data partition. Some comments on the relationship of the procedure with tree-based search procedures are discussed.

We study the complexity of approximately evaluating the Ising and Tutte partition functions with complex parameters. Our results are motivated by the study of the quantum complexity classes BQP and IQP. Recent results show how to encode quantum computations as evaluations of partition functions. These results rely on interesting and deep results about quantum computation in order to obtain hard...

Background and aims: A selective and sensitive high performance liquid chromatography-electrospray ionization mass spectrometry method has been established for determination of methotrexate in human plasma. Methods: Methotrexate was extracted from plasma with acetonitrile. The mobile phase consisted of acetonitrile-water-formic acid 74: 25: 1(v/v). Twenty...

Classification is an important data mining task, and decision trees have emerged as a popular classifier due to their simplicity and relatively low computational complexity. However, as datasets get extremely large, the time required to build a decision tree still becomes intractable. Hence, there is an increasing need for more efficient tree-building algorithms. One approach to this problem in...

Service is defined as a provider-to-client co-production that creates and captures value while sharing risks. Value plays a central position in the lifecycle of services, for example, new values are defined in service mode, designing service models to support the proposed values, and developing service systems to deliver values to customers and providers. It is also necessary to make clear what...

We derive the Atkin–Swinnerton–Dyer partition congruences for the modulus 11 by use of Winquist’s identity. Classification: 11P83

Classification is one of the main tasks in machine learning, data mining, and pattern recognition. A granular computing model is suggested for learning two basic issues of concept formation and concept relationship identification. A classification problem can be considered as a search for suitable granules organized under a partial order. The structures of search space, solutions to a consisten...

One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This classification is based on a beautiful connection to the so-called uniqueness phase transition from statistical physics on the infinite ∆-regular tree. Our objec...

AIMS We sought to evaluate whether left ventricular (LV) mass (M) determined by M-mode echocardiography is overestimated compared with LVM calculated by three-dimensional (3D) echocardiography (E) in patients with normal LV shape. METHODS AND RESULTS A total of 112 studies in 56 patients (60+/-13 years) with hypertension (n=25) or aortic stenosis (n=31) and 30 control subjects (57+/-14 years)...