• 1996 scaled tree-based classifiers to very large data sets. A fundamental challenge in data mining is to mine data sets that are so large that they do not fit into a computer’s memory. This is important for a wide variety of applications ranging from homeland defense to identifying fraudulent credit card transactions. One of the most accurate techniques in data mining is tree-based classifier...

In this chapter we focus on methods for injecting prior knowledge (represented in the form of nite automata) into adaptive recurrent networks. Several algorithms and architectures are described, including rst-order, second-order, and RBF-based recurrent neural nets.

Increasing evidence over the past decade suggests that vision is not simply a passive, feed-forward process in which cortical areas relay progressively more abstract information to those higher up in the visual hierarchy, but rather an inferential process with top-down processes actively guiding and shaping perception. However, one major question that persists is whether such processes can be i...

F-H. Lin Martinos Center for Biomedical Imaging, Massachusetts General Hospital, Charlestown, MA, United States Introduction An auto-calibration scan (ACS) can help to improve the reconstructions in k-space based parallel MRI, such as GRAPPA [1]. Usually ACS is acquired at the center of k-space for higher SNR, thus constituting of full-FOV low-resolution prior images in the channels of an RF co...

We describe a modiication to the AdaBoost algorithm that permits the incorporation of prior human knowledge as a means of compensating for a shortage of training data. We give a convergence result for the algorithm. We describe experiments on four datasets showing that prior knowledge can substantially improve performance.

We investigate two approaches to constructing compatible prior laws over alternative models: ‘projection’ and ‘conditioning’. Each of these is shown to require additional inputs. We suggest that these can be chosen in a natural way in each case, leading to ‘Kullback-Leibler projection’ and ‘Jeffreys conditioning’. We recommend the former for the case of coexisting models, and the latter for com...

It has long been claimed that attended stimuli are perceived prior to unattended stimuli--doctrine of prior entry. Most, if not all, studies on which such claims have been based, however, are open to a nonattentional interpretation involving response bias, leading some researchers to assert that prior entry may not exist. Given this controversy, we introduce a novel methodology to minimize the ...

The present paper considers the existing research in cybertherapy, which is psychological therapy carried out with the use of a mediated environment, and examines the way in which the users’ sense of presence in the mediated environment can be of relevance for the validation of the intervention. With this purpose, a collection of 41 papers reporting the measurement of presence in the context of...

Assuming that there is an a priori agreement between processes on the names of shared memory locations, as done in almost all the publications on shared memory algorithms, is tantamount to assuming that agreement has already been solved at the lower-level. From a theoretical point of view, it is intriguing to €gure out how coordination can be achieved without relying on such lower-level agreeme...