Parallel rule induction with information theoretic pre-pruning

In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to inducing classification rules, one is the divide and conquer approach, also known as the top down induction of decision trees; the other approach is called the separate and conquer approach. A considerable amount of work has been done on scaling up the divide and conquer approach. However, very little work has been conducted on scaling up the separate and conquer approach.In this work we describe a parallel framework that allows the parallelisation of a certain family of separate and conquer algorithms, the Prism family. Parallelisation helps the Prism family of algorithms to harvest additional computer resources in a network of computers in order to make the induction of classification rules scale better on large datasets. Our framework also incorporates a pre-pruning facility for parallel Prism algorithms.

Non-uniform data distribution for communication-efficient parallel clustering

Global communicationrequirements andloadimbalanceof someparalleldataminingalgorithms arethe major obstacles to exploitthe computational power of large-scale systems. This work investigates how non-uniform data distributions can be exploited to remove the global communication requirement and to reduce the communication costin parallel data mining algorithms and, in particular, in the k-means algorithm for cluster analysis. In the straightforward parallel formulation of the k-means algorithm, data and computation loads are uniformly distributed over the processing nodes. This approach has excellent load balancing characteristics that may suggest it could scale up to large and extreme-scale parallel computing systems. However, at each iteration step the algorithm requires a global reduction operationwhichhinders thescalabilityoftheapproach.Thisworkstudiesadifferentparallelformulation of the algorithm where the requirement of global communication is removed, while maintaining the same deterministic nature ofthe centralised algorithm. The proposed approach exploits a non-uniform data distribution which can be either found in real-world distributed applications or can be induced by means ofmulti-dimensional binary searchtrees. The approachcanalso be extended to accommodate an approximation error which allows a further reduction ofthe communication costs. The effectiveness of the exact and approximate methods has been tested in a parallel computing system with 64 processors and in simulations with 1024 processing element

Diminished neural processing of aversive and rewarding stimuli during selective serotonin reuptake inhibitor treatment

Background Selective serotonin reuptake inhibitors (SSRIs) are popular medications for anxiety and depression, but their effectiveness, particularly in patients with prominent symptoms of loss of motivation and pleasure, has been questioned. There are few studies of the effect of SSRIs on neural reward mechanisms in humans. Methods We studied 45 healthy participants who were randomly allocated to receive the SSRI citalopram, the noradrenaline reuptake inhibitor reboxetine, or placebo for 7 days in a double-blind, parallel group design. We used functional magnetic resonance imaging to measure the neural response to rewarding (sight and/or flavor of chocolate) and aversive stimuli (sight of moldy strawberries and/or an unpleasant strawberry taste) on the final day of drug treatment. Results Citalopram reduced activation to the chocolate stimuli in the ventral striatum and the ventral medial/orbitofrontal cortex. In contrast, reboxetine did not suppress ventral striatal activity and in fact increased neural responses within medial orbitofrontal cortex to reward. Citalopram also decreased neural responses to the aversive stimuli conditions in key “punishment” areas such as the lateral orbitofrontal cortex. Reboxetine produced a similar, although weaker effect. Conclusions Our findings are the first to show that treatment with SSRIs can diminish the neural processing of both rewarding and aversive stimuli. The ability of SSRIs to decrease neural responses to reward might underlie the questioned efficacy of SSRIs in depressive conditions characterized by decreased motivation and anhedonia and could also account for the experience of emotional blunting described by some patients during SSRI treatment.

FAMOUS, faster: using parallel computing techniques to accelerate the FAMOUS/HadCM3 climate model with a focus on the radiative transfer algorithm

We have optimised the atmospheric radiation algorithm of the FAMOUS climate model on several hardware platforms. The optimisation involved translating the Fortran code to C and restructuring the algorithm around the computation of a single air column. Instead of the existing MPI-based domain decomposition, we used a task queue and a thread pool to schedule the computation of individual columns on the available processors. Finally, four air columns are packed together in a single data structure and computed simultaneously using Single Instruction Multiple Data operations. The modified algorithm runs more than 50 times faster on the CELL’s Synergistic Processing Elements than on its main PowerPC processing element. On Intel-compatible processors, the new radiation code runs 4 times faster. On the tested graphics processor, using OpenCL, we find a speed-up of more than 2.5 times as compared to the original code on the main CPU. Because the radiation code takes more than 60% of the total CPU time, FAMOUS executes more than twice as fast. Our version of the algorithm returns bit-wise identical results, which demonstrates the robustness of our approach. We estimate that this project required around two and a half man-years of work.

Dynamic group communication for large-scale parallel data mining

Exascale systems are the next frontier in high-performance computing and are expected to deliver a performance of the order of 10^18 operations per second using massive multicore processors. Very large- and extreme-scale parallel systems pose critical algorithmic challenges, especially related to concurrency, locality and the need to avoid global communication patterns. This work investigates a novel protocol for dynamic group communication that can be used to remove the global communication requirement and to reduce the communication cost in parallel formulations of iterative data mining algorithms. The protocol is used to provide a communication-efficient parallel formulation of the k-means algorithm for cluster analysis. The approach is based on a collective communication operation for dynamic groups of processes and exploits non-uniform data distributions. Non-uniform data distributions can be either found in real-world distributed applications or induced by means of multidimensional binary search trees. The analysis of the proposed dynamic group communication protocol has shown that it does not introduce significant communication overhead. The parallel clustering algorithm has also been extended to accommodate an approximation error, which allows a further reduction of the communication costs. The effectiveness of the exact and approximate methods has been tested in a parallel computing system with 64 processors and in simulations with 1024 processing elements.

Median architecture by accumulative parallel counters

The time to process each of W/B processing blocks of a median calculation method on a set of N W-bit integers is improved here by a factor of three compared to the literature. Parallelism uncovered in blocks containing B-bit slices are exploited by independent accumulative parallel counters so that the median is calculated faster than any known previous method for any N, W values. The improvements to the method are discussed in the context of calculating the median for a moving set of N integers for which a pipelined architecture is developed. An extra benefit of smaller area for the architecture is also reported.

The D2 antagonist sulpiride modulates the neural processing of both rewarding and aversive stimuli in healthy volunteers.

Rationale: Animal studies indicate that dopamine pathways in the ventral striatum code for the motivational salience of both rewarding and aversive stimuli, but evidence for this mechanism in humans is less established. We have developed a functional magnetic resonance imaging (fMRI) model which permits examination of the neural processing of both rewarding and aversive stimuli. Objectives: The aim of the study was to determine the effect of the dopamine receptor antagonist, sulpiride, on the neural processing of rewarding and aversive stimuli in healthy volunteers. Methods: We studied 30 healthy participants who were randomly allocated to receive a single dose of sulpiride (400 mg) or placebo, in a double-blind, parallel-group design. We used fMRI to measure the neural response to rewarding (taste or sight of chocolate) and aversive stimuli (sight of mouldy strawberries or unpleasant strawberry taste) 4 h after drug treatment. Results: Relative to placebo, sulpiride reduced blood oxygenation level-dependent responses to chocolate stimuli in the striatum (ventral striatum) and anterior cingulate cortex. Sulpiride also reduced lateral orbitofrontal cortex and insula activations to the taste and sight of the aversive condition. Conclusions: These results suggest that acute dopamine receptor blockade modulates mesolimbic and mesocortical neural activations in response to both rewarding and aversive stimuli in healthy volunteers. This effect may be relevant to the effects of dopamine receptor antagonists in the treatment of psychosis and may also have implications for the possible antidepressant properties of sulpiride.

A parallel formulation for the simulation of a generic branch predictor

A parallel formulation for the simulation of a branch prediction algorithm is presented. This parallel formulation identifies independent tasks in the algorithm which can be executed concurrently. The parallel implementation is based on the multithreading model and two parallel programming platforms: pthreads and Cilk++. Improvement in execution performance by up to 7 times is observed for a generic 2-bit predictor in a 12-core multiprocessor system.