Hash kernels for structured data
From MaRDI portal
Publication:2880988
zbMATH Open1235.68188MaRDI QIDQ2880988FDOQ2880988
Authors: Qinfeng Shi, James Petterson, John Langford, S. V. N. Vishwanathan, Gideon Dror, Alex J. Smola 
Publication date: 17 April 2012
Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)
Full work available at URL: http://www.jmlr.org/papers/v10/shi09a.html
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cited In (15)
- A unifying view of explicit and implicit feature maps of graph kernels
- Title not available (Why is that?)
- Sequence graph transform (SGT): a feature embedding function for sequence data mining
- On \(b\)-bit min-wise hashing for large-scale regression and classification with sparse data
- Optimization of robust loss functions for weakly-labeled image taxonomies
- Binary vectors for fast distance and similarity estimation
- Propagation kernels: efficient graph kernels from propagated information
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- kLog: a language for logical and relational learning with kernels
- Efficient tabling of structured data with enhanced hash-consing
- Deep kernel supervised hashing for node classification in structural networks
- Fast support vector machines for convolution tree kernels
- High-dimensional model recovery from random sketched data by exploring intrinsic sparsity
- The matrix ridge approximation: algorithms and applications
- Discovering robust embeddings in (dis)similarity space for high-dimensional linguistic features
Uses Software
This page was built for publication: Hash kernels for structured data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880988)
