Header logo is ei

18 results (View BibTeX file of all listed publications)

2016

no image
Analysis of multiparametric MRI using a semi-supervised random forest framework allows the detection of therapy response in ischemic stroke

Castaneda, S., Katiyar, P., Russo, F., Calaminus, C., Disselhorst, J. A., Ziemann, U., Kohlhofer, U., Quintanilla-Martinez, L., Poli, S., Pichler, B. J.

World Molecular Imaging Conference, 2016 (talk)

link (url) [BibTex]

2016

Castaneda, S., Katiyar, P., Russo, F., Calaminus, C., Disselhorst, J. A., Ziemann, U., Kohlhofer, U., Quintanilla-Martinez, L., Poli, S., Pichler, B. J. Analysis of multiparametric MRI using a semi-supervised random forest framework allows the detection of therapy response in ischemic stroke World Molecular Imaging Conference, 2016 (talk)

link (url) [BibTex]

no image
Screening Rules for Convex Problems

Raj, A., Olbrich, J., Gärtner, B., Schölkopf, B., Jaggi, M.

2016 (unpublished) Submitted

[BibTex]

Raj, A., Olbrich, J., Gärtner, B., Schölkopf, B., Jaggi, M. Screening Rules for Convex Problems 2016 (unpublished) Submitted

[BibTex]

no image
Multi-view learning on multiparametric PET/MRI quantifies intratumoral heterogeneity and determines therapy efficacy

Katiyar, P., Divine, M. R., Kohlhofer, U., Quintanilla-Martinez, L., Siegemund, M., Pfizenmaier, K., Kontermann, R., Pichler, B. J., Disselhorst, J. A.

World Molecular Imaging Conference, 2016 (talk)

link (url) [BibTex]

Katiyar, P., Divine, M. R., Kohlhofer, U., Quintanilla-Martinez, L., Siegemund, M., Pfizenmaier, K., Kontermann, R., Pichler, B. J., Disselhorst, J. A. Multi-view learning on multiparametric PET/MRI quantifies intratumoral heterogeneity and determines therapy efficacy World Molecular Imaging Conference, 2016 (talk)

link (url) [BibTex]

2009

no image
Machine Learning for Brain-Computer Interfaces

Hill, NJ.

Mini-Symposia on Assistive Machine Learning for People with Disabilities at NIPS (AMD), December 2009 (talk)

Abstract
Brain-computer interfaces (BCI) aim to be the ultimate in assistive technology: decoding a user‘s intentions directly from brain signals without involving any muscles or peripheral nerves. Thus, some classes of BCI potentially offer hope for users with even the most extreme cases of paralysis, such as in late-stage Amyotrophic Lateral Sclerosis, where nothing else currently allows communication of any kind. Other lines in BCI research aim to restore lost motor function in as natural a way as possible, reconnecting and in some cases re-training motor-cortical areas to control prosthetic, or previously paretic, limbs. Research and development are progressing on both invasive and non-invasive fronts, although BCI has yet to make a breakthrough to widespread clinical application. The high-noise high-dimensional nature of brain-signals, particularly in non-invasive approaches and in patient populations, make robust decoding techniques a necessity. Generally, the approach has been to use relatively simple feature extraction techniques, such as template matching and band-power estimation, coupled to simple linear classifiers. This has led to a prevailing view among applied BCI researchers that (sophisticated) machine-learning is irrelevant since "it doesn‘t matter what classifier you use once you‘ve done your preprocessing right and extracted the right features." I shall show a few examples of how this runs counter to both the empirical reality and the spirit of what needs to be done to bring BCI into clinical application. Along the way I‘ll highlight some of the interesting problems that remain open for machine-learners.

PDF Web Web [BibTex]

2009

Hill, NJ. Machine Learning for Brain-Computer Interfaces Mini-Symposia on Assistive Machine Learning for People with Disabilities at NIPS (AMD), December 2009 (talk)

PDF Web Web [BibTex]

no image
PAC-Bayesian Approach to Formulation of Clustering Objectives

Seldin, Y.

NIPS Workshop on "Clustering: Science or Art? Towards Principled Approaches", December 2009 (talk)

Abstract
Clustering is a widely used tool for exploratory data analysis. However, the theoretical understanding of clustering is very limited. We still do not have a well-founded answer to the seemingly simple question of "how many clusters are present in the data?", and furthermore a formal comparison of clusterings based on different optimization objectives is far beyond our abilities. The lack of good theoretical support gives rise to multiple heuristics that confuse the practitioners and stall development of the field. We suggest that the ill-posed nature of clustering problems is caused by the fact that clustering is often taken out of its subsequent application context. We argue that one does not cluster the data just for the sake of clustering it, but rather to facilitate the solution of some higher level task. By evaluation of the clustering‘s contribution to the solution of the higher level task it is possible to compare different clusterings, even those obtained by different optimization objectives. In the preceding work it was shown that such an approach can be applied to evaluation and design of co-clustering solutions. Here we suggest that this approach can be extended to other settings, where clustering is applied.

PDF Web Web [BibTex]

Seldin, Y. PAC-Bayesian Approach to Formulation of Clustering Objectives NIPS Workshop on "Clustering: Science or Art? Towards Principled Approaches", December 2009 (talk)

PDF Web Web [BibTex]

no image
Semi-supervised Kernel Canonical Correlation Analysis of Human Functional Magnetic Resonance Imaging Data

Shelton, JA.

Women in Machine Learning Workshop (WiML), December 2009 (talk)

Abstract
Kernel Canonical Correlation Analysis (KCCA) is a general technique for subspace learning that incorporates principal components analysis (PCA) and Fisher linear discriminant analysis (LDA) as special cases. By finding directions that maximize correlation, KCCA learns representations tied more closely to underlying process generating the the data and can ignore high-variance noise directions. However, for data where acquisition in a given modality is expensive or otherwise limited, KCCA may suffer from small sample effects. We propose to use semi-supervised Laplacian regularization to utilize data that are present in only one modality. This manifold learning approach is able to find highly correlated directions that also lie along the data manifold, resulting in a more robust estimate of correlated subspaces. Functional magnetic resonance imaging (fMRI) acquired data are naturally amenable to subspace techniques as data are well aligned and such data of the human brain are a particularly interesting candidate. In this study we implemented various supervised and semi-supervised versions of KCCA on human fMRI data, with regression to single and multivariate labels (corresponding to video content subjects viewed during the image acquisition). In each variate condition, Laplacian regularization improved performance whereas the semi-supervised variants of KCCA yielded the best performance. We additionally analyze the weights learned by the regression in order to infer brain regions that are important during different types of visual processing.

PDF Web [BibTex]

no image
Methods for feature selection in a learning machine

Weston, J., Elisseeff, A., Schölkopf, B., Pérez-Cruz, F.

United States Patent, No 7624074, November 2009 (patent)

[BibTex]

Weston, J., Elisseeff, A., Schölkopf, B., Pérez-Cruz, F. Methods for feature selection in a learning machine United States Patent, No 7624074, November 2009 (patent)

[BibTex]

no image
Event-Related Potentials in Brain-Computer Interfacing

Hill, NJ.

Invited lecture on the bachelor & masters course "Introduction to Brain-Computer Interfacing", October 2009 (talk)

Abstract
An introduction to event-related potentials with specific reference to their use in brain-computer interfacing applications and research.

PDF [BibTex]

Hill, NJ. Event-Related Potentials in Brain-Computer Interfacing Invited lecture on the bachelor & masters course "Introduction to Brain-Computer Interfacing", October 2009 (talk)

PDF [BibTex]

no image
BCI2000 and Python

Hill, NJ.

Invited lecture at the 5th International BCI2000 Workshop, October 2009 (talk)

Abstract
A tutorial, with exercises, on how to integrate your own Python code with the BCI2000 software package.

PDF [BibTex]

Hill, NJ. BCI2000 and Python Invited lecture at the 5th International BCI2000 Workshop, October 2009 (talk)

PDF [BibTex]

no image
Implementing a Signal Processing Filter in BCI2000 Using C++

Hill, NJ., Mellinger, J.

Invited lecture at the 5th International BCI2000 Workshop, October 2009 (talk)

Abstract
This tutorial shows how the functionality of the BCI2000 software package can be extended with one‘s own code, using BCI2000‘s C++ API.

PDF [BibTex]

Hill, NJ., Mellinger, J. Implementing a Signal Processing Filter in BCI2000 Using C++ Invited lecture at the 5th International BCI2000 Workshop, October 2009 (talk)

PDF [BibTex]

no image
Randomized algorithms for statistical image analysis based on percolation theory

Davies, P., Langovoy, M., Wittich, O.

27th European Meeting of Statisticians (EMS), July 2009 (talk)

Abstract
We propose a novel probabilistic method for detection of signals and reconstruction of images in the presence of random noise. The method uses results from percolation and random graph theories (see Grimmett (1999)). We address the problem of detection and estimation of signals in situations where the signal-to-noise ratio is particularly low. We present an algorithm that allows to detect objects of various shapes in noisy images. The algorithm has linear complexity and exponential accuracy. Our algorithm substantially di ers from wavelets-based algorithms (see Arias-Castro et.al. (2005)). Moreover, we present an algorithm that produces a crude estimate of an object based on the noisy picture. This algorithm also has linear complexity and is appropriate for real-time systems. We prove results on consistency and algorithmic complexity of our procedures.

Web PDF [BibTex]

Davies, P., Langovoy, M., Wittich, O. Randomized algorithms for statistical image analysis based on percolation theory 27th European Meeting of Statisticians (EMS), July 2009 (talk)

Web PDF [BibTex]

no image
Acquiring web page information without commitment to downloading the web page

Heilbron, L., Platt, J. C., Simard, P. Y., Schölkopf, B.

United States Patent, No 7565409, July 2009 (patent)

[BibTex]

Heilbron, L., Platt, J. C., Simard, P. Y., Schölkopf, B. Acquiring web page information without commitment to downloading the web page United States Patent, No 7565409, July 2009 (patent)

[BibTex]

no image
Learning Motor Primitives for Robotics

Kober, J., Peters, J., Oztop, E.

Advanced Telecommunications Research Center ATR, June 2009 (talk)

Abstract
The acquisition and self-improvement of novel motor skills is among the most important problems in robotics. Motor primitives offer one of the most promising frameworks for the application of machine learning techniques in this context. Employing the Dynamic Systems Motor primitives originally introduced by Ijspeert et al. (2003), appropriate learning algorithms for a concerted approach of both imitation and reinforcement learning are presented. Using these algorithms new motor skills, i.e., Ball-in-a-Cup, Ball-Paddling and Dart-Throwing, are learned.

[BibTex]

Kober, J., Peters, J., Oztop, E. Learning Motor Primitives for Robotics Advanced Telecommunications Research Center ATR, June 2009 (talk)

[BibTex]

no image
Learning To Detect Unseen Object Classes by Between-Class Attribute Transfer

Lampert, C.

IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), June 2009 (talk)

Web [BibTex]

Lampert, C. Learning To Detect Unseen Object Classes by Between-Class Attribute Transfer IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), June 2009 (talk)

Web [BibTex]

no image
Pre−processed feature ranking for a support vector machine

Weston, J., Elisseeff, A., Schölkopf, B., Pérez-Cruz, F., Guyon, I.

United States Patent, No. 7475048, January 2009 (patent)

[BibTex]

Weston, J., Elisseeff, A., Schölkopf, B., Pérez-Cruz, F., Guyon, I. Pre−processed feature ranking for a support vector machine United States Patent, No. 7475048, January 2009 (patent)

[BibTex]

2002

no image
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond

Schölkopf, B., Smola, A.

pages: 644, Adaptive Computation and Machine Learning, MIT Press, Cambridge, MA, USA, December 2002, Parts of this book, including an introduction to kernel methods, can be downloaded here. (book)

Abstract
In the 1990s, a new type of learning algorithm was developed, based on results from statistical learning theory: the Support Vector Machine (SVM). This gave rise to a new class of theoretically elegant learning machines that use a central concept of SVMs-kernels—for a number of learning tasks. Kernel machines provide a modular framework that can be adapted to different tasks and domains by the choice of the kernel function and the base algorithm. They are replacing neural networks in a variety of fields, including engineering, information retrieval, and bioinformatics. Learning with Kernels provides an introduction to SVMs and related kernel methods. Although the book begins with the basics, it also includes the latest research. It provides all of the concepts necessary to enable a reader equipped with some basic mathematical knowledge to enter the world of machine learning using theoretically well-founded yet easy-to-use kernel algorithms and to understand and apply the powerful algorithms that have been developed over the last few years.

Web [BibTex]

2002

Schölkopf, B., Smola, A. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond pages: 644, Adaptive Computation and Machine Learning, MIT Press, Cambridge, MA, USA, December 2002, Parts of this book, including an introduction to kernel methods, can be downloaded here. (book)

Web [BibTex]

1997

no image
Support vector learning

Schölkopf, B.

pages: 173, Oldenbourg, München, Germany, 1997, Zugl.: Berlin, Techn. Univ., Diss., 1997 (book)

PDF GZIP [BibTex]

1997

Schölkopf, B. Support vector learning pages: 173, Oldenbourg, München, Germany, 1997, Zugl.: Berlin, Techn. Univ., Diss., 1997 (book)

PDF GZIP [BibTex]