Header logo is


2017


no image
Stability of Controllers for Gaussian Process Dynamics

Vinogradska, J., Bischoff, B., Nguyen-Tuong, D., Peters, J.

Journal of Machine Learning Research, 18(100):1-37, 2017 (article)

ei

link (url) Project Page [BibTex]

2017


link (url) Project Page [BibTex]


no image
Two-sample tests for large random graphs using network statistics

Ghoshdastidar, D., Gutzeit, M., Carpentier, A., von Luxburg, U.

In Conference on Computational Learning Theory (COLT), Conference on Computational Learning Theory (COLT), 2017 (inproceedings)

slt

Project Page [BibTex]

Project Page [BibTex]


no image
SUV-quantification of physiological lung tissue in an integrated PET/MR-system: Impact of lung density and bone tissue

Seith, F., Schmidt, H., Gatidis, S., Bezrukov, I., Schraml, C., Pfannenberg, C., la Fougère, C., Nikolaou, K., Schwenzer, N.

PLOS ONE, 12(5):1-13, 2017 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Corrosion-protected hybrid nanoparticles

Jeong, H., Alarcón-Correa, M., Mark, A. G., Son, K., Lee, T., Fischer, P.

{Advanced Science}, 4(12), Wiley-VCH, Weinheim, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Investigation of the Dzyaloshinskii-Moriya interaction and room temperature skyrmions in W/CoFeB/MgO thin films and microwires

Jaiswal, S., Litzius, K., Lemesh, I., Büttner, F., Finizio, S., Raabe, J., Weigand, M., Lee, K., Langer, J., Ocker, B., Jakob, G., Beach, G. S. D., Kläui, M.

{Applied Physics Letters}, 111(2), American Institute of Physics, Melville, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Ultrafast demagnetization after femtosecond laser pulses: Transfer of angular momentum from the electronic system to magnetoelastic spin-phonon modes

Fähnle, M., Tsatsoulis, T., Illg, C., Haag, M., Müller, B. Y., Zhang, L.

{Journal of Superconductivity and Novel Magnetism}, 30(5):1381-1387, Springer Science + Business Media B.V., New York, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Magnetic behavior of single chain magnets in metal organic frameworks CPO-27-Co

Son, K., Goering, E., Hirscher, M., Oh, H.

{Journal of Nanoscience and Nanotechnology}, 17(10):7541-7546, American Scientific Publishers, Stevenson Ranch, Calif., 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Switching by domain-wall automotion in asymmetric ferromagnetic rings

Mawass, M., Richter, K., Bisig, A., Reeve, R. M., Krüger, B., Weigand, M., Stoll, H., Krone, A., Kronast, F., Schütz, G., Kläui, M.

{Physical Review Applied}, 7(4), American Physical Society, College Park, Md. [u.a.], 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Pattern Generation for Walking on Slippery Terrains

Khadiv, M., Moosavian, S. A. A., Herzog, A., Righetti, L.

In 2017 5th International Conference on Robotics and Mechatronics (ICROM), Iran, August 2017 (inproceedings)

Abstract
In this paper, we extend state of the art Model Predictive Control (MPC) approaches to generate safe bipedal walking on slippery surfaces. In this setting, we formulate walking as a trade off between realizing a desired walking velocity and preserving robust foot-ground contact. Exploiting this for- mulation inside MPC, we show that safe walking on various flat terrains can be achieved by compromising three main attributes, i. e. walking velocity tracking, the Zero Moment Point (ZMP) modulation, and the Required Coefficient of Friction (RCoF) regulation. Simulation results show that increasing the walking velocity increases the possibility of slippage, while reducing the slippage possibility conflicts with reducing the tip-over possibility of the contact and vice versa.

mg

link (url) [BibTex]

link (url) [BibTex]


no image
A neutral atom moving in an external magnetic field does not feel a Lorentz force

Fähnle, M.

{American Journal of Modern Physics}, 6(6):153-155, Science Publishing Group, New York, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Temperature-dependent first-order reversal curve measurements on unusually hard magnetic low-temperature phase of MnBi

Muralidhar, S., Gräfe, J., Chen, Y., Etter, M., Gregori, G., Ener, S., Sawatzki, S., Hono, K., Gutfleisch, O., Kronmüller, H., Schütz, G., Goering, E. J.

{Physical Review B}, 95(2), American Physical Society, Woodbury, NY, 2017 (article)

mms

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Smooth and rapid microwave synthesis of MIL-53(Fe) including superparamagnetic \textlessgamma\textgreater-Fe2O3 nanoparticles

Wengert, S., Albrecht, J., Ruoß, S., Stahl, C., Schütz, G., Schäfer, R.

{Journal of Magnetism and Magnetic Materials}, 444, pages: 168-172, NH, Elsevier, Amsterdam, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Characterization and differentiation of rock varnish types from different environments by microanalytical techniques

Macholdt, D. S., Jochum, K. P., Pöhlker, C., Arangio, A., Förster, J., Stoll, B., Weis, U., Weber, B., Müller, M., Kappl, M., Shiraiwa, M., Kilcoyne, A. L. D., Weigand, M., Scholz, D., Haug, G. H., Al-Amri, A., Andreae, M. O.

{Chemical Geology}, 459, pages: 91-118, Elsevier, Amsterdam, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Skyrmion Hall effect revealed by direct time-resolved X-ray microscopy

Litzius, K., Lemesh, I., Krüger, B., Bassirian, P., Caretta, L., Richter, K., Büttner, F., Sato, K., Tretiakov, O. A., Förster, J., Reeve, R. M., Weigand, M., Bykova, I., Stoll, H., Schütz, G., Beach, G. S. D., Kläui, M.

{Nature Physics}, 13(2):170-175, Nature Pub. Group, London, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Is Growing Good for Learning?

Heim, Steve, Spröwitz, Alexander

In Proceedings of the 8th International Symposium on Adaptive Motion of Animals and Machines AMAM2017, Hokkaido, Japan, 2017 (inproceedings)

[BibTex]

[BibTex]


no image
Comment on magnonic black holes

Fähnle, M., Schütz, G.

{Journal of Magnetism and Magnetic Materials}, 444, pages: 146-146, NH, Elsevier, Amsterdam, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Cr-Substitution in Ba2In2O5 \mbox⋅ (H2O)x (x \textequals 0.16, 0.74)

Yoon, S., Son, K., Hagemann, H., Widenmeyer, M., Weidenkaff, A.

{Solid State Sciences}, 73, pages: 1-6, Elsevier Masson SAS, Paris, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Exploiting diffusion barrier and chemical affinity of metal-organic frameworks for efficient hydrogen isotope separation

Kim, J. Y., Balderas-Xicohténcatl, R., Zhang, L., Kang, S. G., Hirscher, M., Oh, H., Moon, H. R.

{Journal of the American Chemical Society}, 139(42):15135-15141, American Chemical Society, Washington, DC, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Facile fabrication of mesoporous silica micro-jets with multi-functionalities

Vilela, D., Hortelao, A. C., Balderas-Xicohténcatl, R., Hirscher, M., Hahn, K., Ma, X., Sánchez, S.

{Nanoscale}, 9(37):13990-13997, Royal Society of Chemistry, Cambridge, UK, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Comment on half-integer quantum numbers for the total angular momentum of photons in light beams with finite lateral extensions

Fähnle, M.

{American Journal of Modern Physics}, 6(5):88-90, Science Publishing Group, New York, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Selective hydrogen isotope separation via breathing transition in MIL-53(Al)

Kim, J. Y., Zhang, L., Balderas-Xicohténcatl, R., Park, J., Hirscher, M., Moon, H. R., Oh, H.

{Journal of the American Chemical Society}, 139(49):17743-17746, American Chemical Society, Washington, DC, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Advanced magneto-optical Kerr effect measurements of superconductors at low temperatures

Stahl, C., Gräfe, J., Ruoß, S., Zahn, P., Bayer, J., Simmendinger, J., Schütz, G., Albrecht, J.

{AIP Advances}, 7(10), 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Efficient synthesis for large-scale production and characterization for hydrogen storage of ligand exchanged MOF-74/174/184-M (M\textequalsMg2+, Ni2+)

Oh, H., Maurer, S., Balderas-Xicohténcatl, R., Arnold, L., Magdysyuk, O. V., Schütz, G., Müller, U., Hirscher, M.

{International Journal of Hydrogen Energy}, 42(2):1027-1035, Elsevier, Amsterdam, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Unifying ultrafast demagnetization and intrinsic Gilbert damping in Co/Ni bilayers with electronic relaxation near the Fermi surface

Zhang, W., He, W., Zhang, X.-Q., Cheng, Z.-H., Teng, J., Fähnle, M.

{Physical Review B}, 96(22), American Physical Society, Woodbury, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Influence of the skin barrier on the penetration of topically-applied dexamethasone probed by soft X-ray spectromicroscopy

Yamamoto, K., Klossek, A., Flesch, R., Rancan, F., Weigand, M., Bykova, I., Bechtel, M., Ahlberg, S., Vogt, A., Blume-Peytavi, U., Schrade, P., Bachmann, S., Hedtrich, S., Schäfer-Korting, M., Rühl, E.

{European Journal of Pharmaceutics and Biopharmaceutics}, 118, pages: 30-37, Elsevier, Amsterdam, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Capture of heavy hydrogen isotopes in a metal-organic framework with active Cu(I) sites

Weinrauch, I., Savchenko, I., Denysenko, D., Souliou, S. M., Kim, H., Le Tacon, M., Daemen, L. L., Cheng, Y., Mavrandonakis, A., Ramirez-Cuesta, A. J., Volkmer, D., Schütz, G., Hirscher, M., Heine, T.

{Nature Communications}, 8, Nature Publishing Group, London, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Multiscale simulations of topological transformations in magnetic-skyrmion spin structures

De Lucia, A., Litzius, K., Krüger, B., Tretiakov, O. A., Kläui, M.

{Physical Review B}, 96(2), American Physical Society, Woodbury, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Unexpectedly marginal effect of electronic correlations on ultrafast demagnetization after femtosecond laser-pulse excitation

Weng, W., Huang, Haonan, Briones Paz, J. Z., Teeny, N., Müller, B. Y., Haag, M., Kuhn, T., Fähnle, M.

{Physical Review B}, 95(22), American Physical Society, Woodbury, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Black manganese-rich crusts on a Gothic cathedral

Macholdt, D. S., Herrmann, S., Jochum, K. P., Kilcoyne, A. L. D., Laubscher, T., Pfisterer, H. K., Pöhlker, C., Schwager, B., Weber, B., Weigand, M., Domke, K. F., Andreae, M. O.

{Atmospheric Environment}, 171, pages: 205-220, Elsevier, Amsterdam [u.a.], 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]

2005


no image
Kernel Methods for Measuring Independence

Gretton, A., Herbrich, R., Smola, A., Bousquet, O., Schölkopf, B.

Journal of Machine Learning Research, 6, pages: 2075-2129, December 2005 (article)

Abstract
We introduce two new functionals, the constrained covariance and the kernel mutual information, to measure the degree of independence of random variables. These quantities are both based on the covariance between functions of the random variables in reproducing kernel Hilbert spaces (RKHSs). We prove that when the RKHSs are universal, both functionals are zero if and only if the random variables are pairwise independent. We also show that the kernel mutual information is an upper bound near independence on the Parzen window estimate of the mutual information. Analogous results apply for two correlation-based dependence functionals introduced earlier: we show the kernel canonical correlation and the kernel generalised variance to be independence measures for universal kernels, and prove the latter to be an upper bound on the mutual information near independence. The performance of the kernel dependence functionals in measuring independence is verified in the context of independent component analysis.

ei

PDF PostScript PDF [BibTex]

2005


PDF PostScript PDF [BibTex]


no image
Kernel ICA for Large Scale Problems

Jegelka, S., Gretton, A., Achlioptas, D.

In pages: -, NIPS Workshop on Large Scale Kernel Machines, December 2005 (inproceedings)

ei

Web [BibTex]

Web [BibTex]


no image
A Unifying View of Sparse Approximate Gaussian Process Regression

Quinonero Candela, J., Rasmussen, C.

Journal of Machine Learning Research, 6, pages: 1935-1959, December 2005 (article)

Abstract
We provide a new unifying view, including all existing proper probabilistic sparse approximations for Gaussian process regression. Our approach relies on expressing the effective prior which the methods are using. This allows new insights to be gained, and highlights the relationship between existing methods. It also allows for a clear theoretically justified ranking of the closeness of the known approximations to the corresponding full GPs. Finally we point directly to designs of new better sparse approximations, combining the best of the existing strategies, within attractive computational constraints.

ei

PDF [BibTex]

PDF [BibTex]


no image
Training Support Vector Machines with Multiple Equality Constraints

Kienzle, W., Schölkopf, B.

In Proceedings of the 16th European Conference on Machine Learning, Lecture Notes in Computer Science, Vol. 3720, pages: 182-193, (Editors: JG Carbonell and J Siekmann), Springer, Berlin, Germany, ECML, November 2005 (inproceedings)

Abstract
In this paper we present a primal-dual decomposition algorithm for support vector machine training. As with existing methods that use very small working sets (such as Sequential Minimal Optimization (SMO), Successive Over-Relaxation (SOR) or the Kernel Adatron (KA)), our method scales well, is straightforward to implement, and does not require an external QP solver. Unlike SMO, SOR and KA, the method is applicable to a large number of SVM formulations regardless of the number of equality constraints involved. The effectiveness of our algorithm is demonstrated on a more difficult SVM variant in this respect, namely semi-parametric support vector regression.

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Measuring Statistical Dependence with Hilbert-Schmidt Norms

Gretton, A., Bousquet, O., Smola, A., Schoelkopf, B.

In Algorithmic Learning Theory, Lecture Notes in Computer Science, Vol. 3734, pages: 63-78, (Editors: S Jain and H-U Simon and E Tomita), Springer, Berlin, Germany, 16th International Conference ALT, October 2005 (inproceedings)

Abstract
We propose an independence criterion based on the eigenspectrum of covariance operators in reproducing kernel Hilbert spaces (RKHSs), consisting of an empirical estimate of the Hilbert-Schmidt norm of the cross-covariance operator (we term this a Hilbert-Schmidt Independence Criterion, or HSIC). This approach has several advantages, compared with previous kernel-based independence criteria. First, the empirical estimate is simpler than any other kernel dependence test, and requires no user-defined regularisation. Second, there is a clearly defined population quantity which the empirical estimate approaches in the large sample limit, with exponential convergence guaranteed between the two: this ensures that independence tests based on {methodname} do not suffer from slow learning rates. Finally, we show in the context of independent component analysis (ICA) that the performance of HSIC is competitive with that of previously published kernel-based criteria, and of other recently published ICA methods.

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Maximal Margin Classification for Metric Spaces

Hein, M., Bousquet, O., Schölkopf, B.

Journal of Computer and System Sciences, 71(3):333-359, October 2005 (article)

Abstract
In order to apply the maximum margin method in arbitrary metric spaces, we suggest to embed the metric space into a Banach or Hilbert space and to perform linear classification in this space. We propose several embeddings and recall that an isometric embedding in a Banach space is always possible while an isometric embedding in a Hilbert space is only possible for certain metric spaces. As a result, we obtain a general maximum margin classification algorithm for arbitrary metric spaces (whose solution is approximated by an algorithm of Graepel. Interestingly enough, the embedding approach, when applied to a metric which can be embedded into a Hilbert space, yields the SVM algorithm, which emphasizes the fact that its solution depends on the metric and not on the kernel. Furthermore we give upper bounds of the capacity of the function classes corresponding to both embeddings in terms of Rademacher averages. Finally we compare the capacities of these function classes directly.

ei

PDF PDF DOI [BibTex]

PDF PDF DOI [BibTex]


no image
An Analysis of the Anti-Learning Phenomenon for the Class Symmetric Polyhedron

Kowalczyk, A., Chapelle, O.

In Algorithmic Learning Theory: 16th International Conference, pages: 78-92, Algorithmic Learning Theory, October 2005 (inproceedings)

Abstract
This paper deals with an unusual phenomenon where most machine learning algorithms yield good performance on the training set but systematically worse than random performance on the test set. This has been observed so far for some natural data sets and demonstrated for some synthetic data sets when the classification rule is learned from a small set of training samples drawn from some high dimensional space. The initial analysis presented in this paper shows that anti-learning is a property of data sets and is quite distinct from overfitting of a training data. Moreover, the analysis leads to a specification of some machine learning procedures which can overcome anti-learning and generate ma- chines able to classify training and test data consistently.

ei

PDF [BibTex]

PDF [BibTex]


no image
Selective integration of multiple biological data for supervised network inference

Kato, T., Tsuda, K., Asai, K.

Bioinformatics, 21(10):2488 , October 2005 (article)

ei

PDF [BibTex]

PDF [BibTex]


no image
Assessing Approximate Inference for Binary Gaussian Process Classification

Kuss, M., Rasmussen, C.

Journal of Machine Learning Research, 6, pages: 1679 , October 2005 (article)

Abstract
Gaussian process priors can be used to define flexible, probabilistic classification models. Unfortunately exact Bayesian inference is analytically intractable and various approximation techniques have been proposed. In this work we review and compare Laplace‘s method and Expectation Propagation for approximate Bayesian inference in the binary Gaussian process classification model. We present a comprehensive comparison of the approximations, their predictive performance and marginal likelihood estimates to results obtained by MCMC sampling. We explain theoretically and corroborate empirically the advantages of Expectation Propagation compared to Laplace‘s method.

ei

PDF PDF [BibTex]

PDF PDF [BibTex]


no image
Clustering on the Unit Hypersphere using von Mises-Fisher Distributions

Banerjee, A., Dhillon, I., Ghosh, J., Sra, S.

Journal of Machine Learning Research, 6, pages: 1345-1382, September 2005 (article)

Abstract
Several large scale data mining applications, such as text categorization and gene expression analysis, involve high-dimensional data that is also inherently directional in nature. Often such data is L2 normalized so that it lies on the surface of a unit hypersphere. Popular models such as (mixtures of) multi-variate Gaussians are inadequate for characterizing such data. This paper proposes a generative mixture-model approach to clustering directional data based on the von Mises-Fisher (vMF) distribution, which arises naturally for data distributed on the unit hypersphere. In particular, we derive and analyze two variants of the Expectation Maximization (EM) framework for estimating the mean and concentration parameters of this mixture. Numerical estimation of the concentration parameters is non-trivial in high dimensions since it involves functional inversion of ratios of Bessel functions. We also formulate two clustering algorithms corresponding to the variants of EM that we derive. Our approach provides a theoretical basis for the use of cosine similarity that has been widely employed by the information retrieval community, and obtains the spherical kmeans algorithm (kmeans with cosine similarity) as a special case of both variants. Empirical results on clustering of high-dimensional text and gene-expression data based on a mixture of vMF distributions show that the ability to estimate the concentration parameter for each vMF component, which is not present in existing approaches, yields superior results, especially for difficult clustering tasks in high-dimensional spaces.

ei

PDF [BibTex]

PDF [BibTex]


no image
Support Vector Machines for 3D Shape Processing

Steinke, F., Schölkopf, B., Blanz, V.

Computer Graphics Forum, 24(3, EUROGRAPHICS 2005):285-294, September 2005 (article)

Abstract
We propose statistical learning methods for approximating implicit surfaces and computing dense 3D deformation fields. Our approach is based on Support Vector (SV) Machines, which are state of the art in machine learning. It is straightforward to implement and computationally competitive; its parameters can be automatically set using standard machine learning methods. The surface approximation is based on a modified Support Vector regression. We present applications to 3D head reconstruction, including automatic removal of outliers and hole filling. In a second step, we build on our SV representation to compute dense 3D deformation fields between two objects. The fields are computed using a generalized SVMachine enforcing correspondence between the previously learned implicit SV object representations, as well as correspondences between feature points if such points are available. We apply the method to the morphing of 3D heads and other objects.

ei

PDF [BibTex]

PDF [BibTex]


no image
Fast Protein Classification with Multiple Networks

Tsuda, K., Shin, H., Schölkopf, B.

Bioinformatics, 21(Suppl. 2):59-65, September 2005 (article)

Abstract
Support vector machines (SVM) have been successfully used to classify proteins into functional categories. Recently, to integrate multiple data sources, a semidefinite programming (SDP) based SVM method was introduced Lanckriet et al (2004). In SDP/SVM, multiple kernel matrices corresponding to each of data sources are combined with weights obtained by solving an SDP. However, when trying to apply SDP/SVM to large problems, the computational cost can become prohibitive, since both converting the data to a kernel matrix for the SVM and solving the SDP are time and memory demanding. Another application-specific drawback arises when some of the data sources are protein networks. A common method of converting the network to a kernel matrix is the diffusion kernel method, which has time complexity of O(n^3), and produces a dense matrix of size n x n. We propose an efficient method of protein classification using multiple protein networks. Available protein networks, such as a physical interaction network or a metabolic network, can be directly incorporated. Vectorial data can also be incorporated after conversion into a network by means of neighbor point connection. Similarly to the SDP/SVM method, the combination weights are obtained by convex optimization. Due to the sparsity of network edges, the computation time is nearly linear in the number of edges of the combined network. Additionally, the combination weights provide information useful for discarding noisy or irrelevant networks. Experiments on function prediction of 3588 yeast proteins show promising results: the computation time is enormously reduced, while the accuracy is still comparable to the SDP/SVM method.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Iterative Kernel Principal Component Analysis for Image Modeling

Kim, K., Franz, M., Schölkopf, B.

IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(9):1351-1366, September 2005 (article)

Abstract
In recent years, Kernel Principal Component Analysis (KPCA) has been suggested for various image processing tasks requiring an image model such as, e.g., denoising or compression. The original form of KPCA, however, can be only applied to strongly restricted image classes due to the limited number of training examples that can be processed. We therefore propose a new iterative method for performing KPCA, the Kernel Hebbian Algorithm which iteratively estimates the Kernel Principal Components with only linear order memory complexity. In our experiments, we compute models for complex image classes such as faces and natural images which require a large number of training examples. The resulting image models are tested in single-frame super-resolution and denoising applications. The KPCA model is not specifically tailored to these tasks; in fact, the same model can be used in super-resolution with variable input resolution, or denoising with unknown noise characteristics. In spite of this, both super-resolution a nd denoising performance are comparable to existing methods.

ei

Web DOI [BibTex]

Web DOI [BibTex]


no image
Phenotypic characterization of chondrosarcoma-derived cell lines

Schorle, C., Finger, F., Zien, A., Block, J., Gebhard, P., Aigner, T.

Cancer Letters, 226(2):143-154, August 2005 (article)

Abstract
Gene expression profiling of three chondrosarcoma derived cell lines (AD, SM, 105KC) showed an increased proliferative activity and a reduced expression of chondrocytic-typical matrix products compared to primary chondrocytes. The incapability to maintain an adequate matrix synthesis as well as a notable proliferative activity at the same time is comparable to neoplastic chondrosarcoma cells in vivo which cease largely cartilage matrix formation as soon as their proliferative activity increases. Thus, the investigated cell lines are of limited value as substitute of primary chondrocytes but might have a much higher potential to investigate the behavior of neoplastic chondrocytes, i.e. chondrosarcoma biology.

ei

Web [BibTex]

Web [BibTex]


no image
Local Rademacher Complexities

Bartlett, P., Bousquet, O., Mendelson, S.

The Annals of Statistics, 33(4):1497-1537, August 2005 (article)

Abstract
We propose new bounds on the error of learning algorithms in terms of a data-dependent notion of complexity. The estimates we establish give optimal rates and are based on a local and empirical version of Rademacher averages, in the sense that the Rademacher averages are computed from the data, on a subset of functions with small empirical error. We present some applications to classification and prediction with convex function classes, and with kernel classes in particular.

ei

PDF PostScript Web [BibTex]

PDF PostScript Web [BibTex]


no image
Building Sparse Large Margin Classifiers

Wu, M., Schölkopf, B., BakIr, G.

In Proceedings of the 22nd International Conference on Machine Learning, pages: 996-1003, (Editors: L De Raedt and S Wrobel ), ACM, New York, NY, USA, ICML , August 2005 (inproceedings)

Abstract
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The added constraint explicitly controls the sparseness of the classifier and an approach is provided to solve the formulated problem. When considering the dual of this problem, it can be seen that building an SLMC is equivalent to constructing an SVM with a modified kernel function. Further analysis of this kernel function indicates that the proposed approach essentially finds a discriminating subspace that can be spanned by a small number of vectors, and in this subspace different classes of data are linearly well separated. Experimental results over several classification benchmarks show that in most cases the proposed approach outperforms the state-of-art sparse learning algorithms.

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Learning from Labeled and Unlabeled Data on a Directed Graph

Zhou, D., Huang, J., Schölkopf, B.

In Proceedings of the 22nd International Conference on Machine Learning, pages: 1041 -1048, (Editors: L De Raedt and S Wrobel), ACM, New York, NY, USA, ICML, August 2005 (inproceedings)

Abstract
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is considered. The time complexity of the algorithm derived from this framework is nearly linear due to recently developed numerical techniques. In the absence of labeled instances, this framework can be utilized as a spectral clustering method for directed graphs, which generalizes the spectral clustering approach for undirected graphs. We have applied our framework to real-world web classification problems and obtained encouraging results.

ei

PostScript PDF [BibTex]

PostScript PDF [BibTex]


no image
Regularization on Discrete Spaces

Zhou, D., Schölkopf, B.

In Pattern Recognition, Lecture Notes in Computer Science, Vol. 3663, pages: 361-368, (Editors: WG Kropatsch and R Sablatnig and A Hanbury), Springer, Berlin, Germany, 27th DAGM Symposium, August 2005 (inproceedings)

Abstract
We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such an estimation problem is generally referred to as transductive inference. It is well-known that many meaningful inductive or supervised methods can be derived from a regularization framework, which minimizes a loss function plus a regularization term. In the same spirit, we propose a general discrete regularization framework defined on finite object sets, which can be thought of as the discrete analogue of classical regularization theory. A family of transductive inference schemes is then systemically derived from the framework, including our earlier algorithm for transductive inference, with which we obtained encouraging results on many practical classification problems. The discrete regularization framework is built on the discrete analysis and geometry developed by ourselves, in which a number of discrete differential operators of various orders are constructed, which can be thought of as the discrete analogue of their counterparts in the continuous case.

ei

PDF PostScript DOI [BibTex]

PDF PostScript DOI [BibTex]


no image
Large Margin Non-Linear Embedding

Zien, A., Candela, J.

In ICML 2005, pages: 1065-1072, (Editors: De Raedt, L. , S. Wrobel), ACM Press, New York, NY, USA, 22nd International Conference on Machine Learning, August 2005 (inproceedings)

Abstract
It is common in classification methods to first place data in a vector space and then learn decision boundaries. We propose reversing that process: for fixed decision boundaries, we ``learn‘‘ the location of the data. This way we (i) do not need a metric (or even stronger structure) -- pairwise dissimilarities suffice; and additionally (ii) produce low-dimensional embeddings that can be analyzed visually. We achieve this by combining an entropy-based embedding method with an entropy-based version of semi-supervised logistic regression. We present results for clustering and semi-supervised classification.

ei

PDF PostScript Web DOI [BibTex]

PDF PostScript Web DOI [BibTex]


no image
Face Detection: Efficient and Rank Deficient

Kienzle, W., BakIr, G., Franz, M., Schölkopf, B.

In Advances in Neural Information Processing Systems 17, pages: 673-680, (Editors: LK Saul and Y Weiss and L Bottou), MIT Press, Cambridge, MA, USA, 18th Annual Conference on Neural Information Processing Systems (NIPS), July 2005 (inproceedings)

Abstract
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an existing algorithm where the set of support vectors is replaced by a smaller, so-called reduced set of synthesized input space points. In contrast to the existing method that finds the reduced set via unconstrained optimization, we impose a structural constraint on the synthetic points such that the resulting approximations can be evaluated via separable filters. For applications that require scanning an entire image, this decreases the computational complexity of a scan by a significant amount. We present experimental results on a standard face detection database.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Methods Towards Invasive Human Brain Computer Interfaces

Lal, T., Hinterberger, T., Widman, G., Schröder, M., Hill, J., Rosenstiel, W., Elger, C., Schölkopf, B., Birbaumer, N.

In Advances in Neural Information Processing Systems 17, pages: 737-744, (Editors: LK Saul and Y Weiss and L Bottou), MIT Press, Cambridge, MA, USA, 18th Annual Conference on Neural Information Processing Systems (NIPS), July 2005 (inproceedings)

Abstract
During the last ten years there has been growing interest in the development of Brain Computer Interfaces (BCIs). The field has mainly been driven by the needs of completely paralyzed patients to communicate. With a few exceptions, most human BCIs are based on extracranial electroencephalography (EEG). However, reported bit rates are still low. One reason for this is the low signal-to-noise ratio of the EEG. We are currently investigating if BCIs based on electrocorticography (ECoG) are a viable alternative. In this paper we present the method and examples of intracranial EEG recordings of three epilepsy patients with electrode grids placed on the motor cortex. The patients were asked to repeatedly imagine movements of two kinds, e.g., tongue or finger movements. We analyze the classifiability of the data using Support Vector Machines (SVMs) and Recursive Channel Elimination (RCE).

ei

PDF Web [BibTex]

PDF Web [BibTex]