Kernels as features: On kernels, margins, and low-dimensional mappings

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Machine-mediated learning

• Publication date

  2006-10-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10994-006-7550-1
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Statistical Learning Theory

  2021cited by this paper
• Kernel Methods in Computational Biology

  2005cited by this paper
• Kernel Methods for Pattern Analysis

  2004cited by this paper
• On Online Learning of Decision Lists

  2003cited by this paper
• Limitations of Learning Via Embeddings in Euclidean Half Spaces

  2003cited by this paper
• Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond

  2003cited by this paper
• Database-friendly random projections

  2001cited by this paper
• An introduction to kernel-based learning algorithms

  2001cited by this paper
• Learning Kernel Classifiers: Theory and Algorithms

  2001cited by this paper
• Advances in Large Margin Classifiers

  2000cited by this paper
• An algorithmic theory of learning: Robust concepts and random projection

  1999influential reference
• An elementary proof of the Johnson-Lindenstrauss Lemma

  1999cited by this paper
• Advances in kernel methods: support vector learning

  1999cited by this paper
• Generalization Performance of Support Vector Machines and Other Pattern Classifiers

  1999cited by this paper
• UCI Repository of machine learning databases

  1998cited by this paper
• Large Margin Classification Using the Perceptron Algorithm

  1998cited by this paper
• Structural Risk Minimization Over Data-Dependent Hierarchies

  1998cited by this paper
• Support-Vector Networks

  1995cited by this paper
• A training algorithm for optimal margin classifiers

  1992cited by this paper
• Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

  1987cited by this paper
• How to construct random functions

  1986cited by this paper
• Extensions of Lipschitz mappings into Hilbert space

  1984cited by this paper
• Generalized inverses: theory and applications

  1974cited by this paper

• A Study of Sensitive Fault Detection for Lithium-Ion Batteries Being Recharged Using Support Vector Machine Classifier and Receiver Operating Characteristics

  2026cites this paper
• One-class classification with node embedding type features

  2025cites this paper
• The generalization error of max-margin linear classifiers: Benign overfitting and high dimensional asymptotics in the overparametrized regime

  2025cites this paper
• Simulating soil hydrologic dynamics using crop growth and machine learning models

  2024cites this paper
• Regularized Gauss-Newton for Optimizing Overparameterized Neural Networks

  2024cites this paper
• Random features and polynomial rules

  2024cites this paper
• Universality of max-margin classifiers

  2023cites this paper
• Learning from higher-order statistics, efficiently: hypothesis tests, random features, and neural networks

  2023cites this paper
• Six lectures on linearized neural networks

  2023cites this paper
• On Linear Separability under Linear Compression with Applications to Hard Support Vector Machine

  2022cites this paper
• Statistical optimality conditions for compressive ensembles

  2021influential citation
• Generalization error of random feature and kernel methods: hypercontractivity and kernel matrix concentration

  2021cites this paper
• Minimum complexity interpolation in random features models

  2021cites this paper
• University of Birmingham Structure from Randomness in Halfspace Learning with the Zero-One Loss

  2020cites this paper
• Improving Random Projections With Extra Vectors to Approximate Inner Products

  2020cites this paper
• Structure from Randomness in Halfspace Learning with the Zero-One Loss

  2020cites this paper
• High-dimensional model recovery from random sketched data by exploring intrinsic sparsity

  2020influential citation
• Large scale analysis of generalization error in learning using margin based classification methods

  2020cites this paper
• Prediction of Alzheimer’s Disease Using Machine Learning Classifiers

  2020cites this paper
• Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination

  2020cites this paper
• Binarized Johnson-Lindenstrauss embeddings

  2020cites this paper
• The Effectiveness of Johnson-Lindenstrauss Transform for High Dimensional Optimization With Adversarial Outliers, and the Recovery

  2020cites this paper
• The generalization error of max-margin linear classifiers: High-dimensional asymptotics in the overparametrized regime

  2019cites this paper
• Clustering Mixed Datasets by Using Similarity Features

  2019cites this paper
• Optimality Implies Kernel Sum Classifiers are Statistically Efficient

  2019cites this paper
• On the Statistical Efficiency of Optimal Kernel Sum Classifiers

  2019cites this paper
• Data-independent Random Projections from the feature-map of the homogeneous polynomial kernel of degree two

  2018cites this paper
• Outlier Removal for Enhancing Kernel-Based Classifier Via the Discriminant Information

  2018cites this paper
• Learning Data-adaptive Nonparametric Kernels

  2018cites this paper
• Data-independent Random Projections from the feature-space of the homogeneous polynomial kernel

  2018cites this paper
• Face sketch-photo synthesis and recognition: Dual-scale Markov Network and multi-information fusion

  2018cites this paper
• Effective sketching methods for value function approximation

  2017cites this paper
• Structure-aware error bounds for linear classification with the zero-one loss

  2017cites this paper
• From Affine Rank Minimization Solution to Sparse Modeling

  2017cites this paper
• There and Back Again: A General Approach to Learning Sparse Models

  2017cites this paper
• MREKLM: A fast multiple empirical kernel learning machine

  2017cites this paper
• Geometric-based KNN localization using sensor dissimilarity information

  2017cites this paper
• Authentication of Identical Twins Using Tri Modal Matching

  2017cites this paper
• Architectures and Algorithms for Intrinsic Computation with Memristive Devices

  2016cites this paper
• Face Recognition in Unconstrained Environment

  2016cites this paper
• Similarity, kernels, and the fundamental constraints on cognition

  2016influential citation
• Recursive Sampling for the Nystrom Method

  2016cites this paper
• Provably Useful Kernel Matrix Approximation in Linear Time

  2016cites this paper
• The Price of Differential Privacy for Low-Rank Factorization

  2016cites this paper
• Image Cluster Method Based on Ensemble Locality Sensitive Clustering

  2016cites this paper
• 集成式位置敏感聚类方法 Image Cluster Method Based on Ensemble Locality Sensitive Clustering

  2016cites this paper
• Compressed Signal Processing on Nyquist-Sampled Signals

  2016cites this paper
• Network Flow Formulations for Learning Binary Hashing

  2016cites this paper
• Improper Deep Kernels

  2016cites this paper
• Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach

  2015influential citation
• Learning Structured Models for Segmentation of 2-D and 3-D Imagery

  2015cites this paper
• Fast Sparse Least-Squares Regression with Non-Asymptotic Guarantees

  2015cites this paper
• An Efficient and Effective Multiple Empirical Kernel Learning Based on Random Projection

  2015influential citation
• An NMF Perspective on Binary Hashing

  2015cites this paper
• Visual Categorization with Random Projection

  2015cites this paper
• Theory of Dual-sparse Regularized Randomized Reduction

  2015cites this paper
• Improved Neural Networks with Random Weights for Short-Term Load Forecasting

  2015cites this paper
• Improved Bounds on the Dot Product under Random Projection and Random Sign Projection

  2015cites this paper
• Structure And Similarity In Vision

  2015cites this paper
• Training Free Face Recognition and Cropping using Skin Identification Algorithm

  2015cites this paper
• New Algorithms for Graphical Models and Their Applications in Learning

  2015cites this paper
• Toward a unified theory of sparse dimensionality reduction in Euclidean space

  2015cites this paper
• Enhanced Locality Sensitive Clustering in High Dimensional Space

  2014cites this paper
• Face Sketch Recognition from Local Features

  2014cites this paper
• An Analysis of Random Projections in Cancelable Biometrics

  2014cites this paper
• Digital Image Technique using Gabor Filter and SVM in Heterogeneous Face Recognition

  2014cites this paper
• Learning with Random Projections

  2014cites this paper
• Approximate Ensemble Methods for Physical Activity Recognition Applications

  2014cites this paper
• Random Projections for Classification: A Recovery Approach

  2014cites this paper
• Decision tree ensembles based on kernel features

  2014influential citation
• LOCALITY SENSITIVE CLUSTERING IN HIGH DIMENSIONAL SPACE

  2014cites this paper
• Randomized Subspace Learning with Structure Preservation

  2014cites this paper
• Randomized Subspace Learning Algorithms with Subspace Structure Preservation Guarantees

  2014cites this paper
• Other Kernel Methods

  2014cites this paper
• Web-Server Based Student Attendance System

  2014cites this paper
• Face Recognition of Different Modalities UsingSIFT and LBP Features

  2014cites this paper
• Random Projection Random Discretization Ensembles—Ensembles of Linear Multivariate Decision Trees

  2014cites this paper
• Randomness Efficient Fast-Johnson-Lindenstrauss Transform with Applications in Differential Privacy and Compressed Sensing

  2014cites this paper
• Semi-supervised learning via sparse model

  2014cites this paper
• Active Learning of Halfspaces

  2013influential citation
• Toward a unified theory of sparse dimensionality reduction in Euclidean space

  2013cites this paper
• Adaptive metric dimensionality reduction

  2013cites this paper
• Learning in high dimensions with projected linear discriminants

  2013cites this paper
• Heterogeneous Face Recognition Using Kernel Prototype Similarities

  2013cites this paper
• A learning theory approach to noninteractive database privacy

  2013cites this paper
• On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp

  2013cites this paper
• Solving Nonlinear SVM in Linear Time? A Nyström Approximated SVM with Applications to Image Classification

  2013cites this paper
• Beam search algorithms for multilabel learning

  2013cites this paper
• Beyond Worst-Case Analysis in Privacy and Clustering: Exploiting Explicit and Implicit Assumptions

  2013cites this paper
• Learning Discriminative Features and Structured Models for Segmentation in Microscopy and Natural Images

  2013cites this paper
• Random projection ensemble learning with multiple empirical kernels

  2013cites this paper
• Recovering the Optimal Solution by Dual Random Projection

  2012influential citation
• A Random Introduction To Random Projections

  2012cites this paper
• The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy

  2012cites this paper
• Is margin preserved after random projection?

  2012influential citation
• Kernelized Locality-Sensitive Hashing

  2012cites this paper
• Learning as MAP Inference in Discrete Graphical Models

  2012cites this paper
• ADHD diagnosis from multiple data sources with batch effects

  2012cites this paper
• Structured Image Segmentation Using Kernelized Features

  2012cites this paper
• Efficient active learning of halfspaces: an aggressive approach

  2012cites this paper