Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
Lack of labeled training examples is a common problem for many applications. In the same time, there is usually an abundance of labeled data from related tasks. But they have diff...
Xiaoxiao Shi, Qi Liu, Wei Fan, Qiang Yang, Philip ...
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
In this study, we employed our recently developed iterative independent component analysis (iICA) procedure to measure single-trial EPs from auditory N100 recordings of 21 normal ...