The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Kernel Methods for Pattern Analysis
Abstract
Kernel methods provide a powerful and unified framework for pattern discovery, motivating algorithms that can act on general types of data (e.g. strings, vectors or text) and look for general types of relations (e.g. rankings, classifications, regressions, clusters). The application areas range from neural networks and pattern recognition to machine learning and data mining. This book, developed from lectures and tutorials, fulfils two major roles: firstly it provides practitioners with a large toolkit of algorithms, kernels and solutions ready to use for standard pattern discovery problems in fields such as bioinformatics, text analysis, image analysis. Secondly it provides an easy introduction for students and researchers to the growing field of kernel-based pattern analysis, demonstrating with examples how to handcraft an algorithm or a kernel for a new specific application, and covering all the necessary conceptual and mathematical tools to do so.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
Self-citationProbability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
An Introduction to Support Vector Machines
Cristianini, N., & Shawe-Taylor, J. S. (2000) · ePrints Soton (University of Southampton) · Cited by 4,115
Self-citationOn the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
Boosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Bartlett, P. L., & Mendelson, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_15 · Cited by 1,949
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
On the method of bounded differences
McDiarmid, C. (1989) · Surveys in Combinatorics, 1989 · doi:10.1017/cbo9781107359949.008 · Cited by 1,425
Neural network learning theoretical foundations
Anthony, M., & Bartlett, P. L. (2009) · Cited by 1,310
Bartlett, P. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661502 · Cited by 1,166
Ledoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
Weighted sums of certain dependent random variables
Azuma, K. (1967) · Tohoku Mathematical Journal · doi:10.2748/tmj/1178243286 · Cited by 1,084
Structural risk minimization over data-dependent hierarchies
Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705570 · Cited by 527
Self-citationNew concentration inequalities in product spaces
Talagrand, M. (1996) · Inventiones Mathematicae · doi:10.1007/s002220050108 · Cited by 501
Scale-sensitive dimensions, uniform convergence, and learnability
Alon, N., Ben-David, S., Cesa-Bianchi, N., & Haussler, D. (1997) · Journal of the ACM · doi:10.1145/263867.263927 · Cited by 340
Generalization Performance of Support Vector Machines and Other Pattern Classifiers
Bartlett, P. L., & Shawe-Taylor, J. S. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/1130.003.0007 · Cited by 286
Self-citationRademacher Processes and Bounding the Risk of Function Learning
Koltchinskii, V., & Panchenko, D. (2000) · High Dimensional Probability II · doi:10.1007/978-1-4612-1358-1_29 · Cited by 209
A sharp concentration inequality with applications
Boucheron, S., Lugosi, G., & Massart, P. (2000) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(200005)16:3<277::aid-rsa4>3.0.co;2-1 · Cited by 185
On the generalization of soft margin algorithms
Shawe-Taylor, J. S., & Cristianini, N. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.802647 · Cited by 84
Self-citationA result of Vapnik with applications
Anthony, M., & Shawe-Taylor, J. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90126-9 · Cited by 48
Self-citationOn the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum
Shawe-Taylor, J. S., Williams, C., Cristianini, N., & Kandola, J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36169-3_4 · Cited by 43
Self-citation
Cited by
A systematic analysis of performance measures for classification tasks
Sokolova, M., & Lapalme, G. (2009) · Information Processing & Management · doi:10.1016/j.ipm.2009.03.002 · Cited by 7,515
Weiss, K., Khoshgoftaar, T. M., & Wang, D. (2016) · Journal of Big Data · doi:10.1186/s40537-016-0043-6 · Cited by 6,260
Machine learning for molecular and materials science
Butler, K. T., Davies, D. W., Cartwright, H., Isayev, O., & Walsh, A. (2018) · Nature · doi:10.1038/s41586-018-0337-2 · Cited by 4,968
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
(2012) · MPG.PuRe (Max Planck Society) · doi:10.5555/2188385.2188410 · Cited by 3,603
Metadata
- Authors
- Shawe-Taylor, J., & Cristianini, N.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2004-06-28
- OpenAlex
- W1510073064
- Cited by
- 6,587
- References
- 23
- FWCI
- 104.31
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.