The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Sparsity and Smoothness Via the Fused Lasso
Abstract
Summary: The lasso penalizes a least squares regression by the sum of the absolute values (L1-norm) of the coefficients. The form of this penalty encourages sparse solutions (with many coefficients equal to 0). We propose the ‘fused lasso’, a generalization that is designed for problems with features that can be ordered in some meaningful way. The fused lasso penalizes the L1-norm of both the coefficients and their successive differences. Thus it encourages sparsity of the coefficients and also sparsity of their differences—i.e. local constancy of the coefficient profile. The fused lasso is especially useful when the number of features p is much greater than N, the sample size. The technique is also extended to the ‘hinge’ loss function that underlies the support vector classifier. We illustrate the methods on examples from protein mass spectroscopy and gene expression data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Self-citationThe Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Self-citationUse of proteomic patterns in serum to identify ovarian cancer
Petricoin, E. F., Ardekani, A. M., Hitt, B. A., Levine, P. J., Fusaro, V. A., Steinberg, S. M., Mills, G. B., Simone, C., Fishman, D. A., Kohn, E. C., et al. (2002) · The Lancet · doi:10.1016/s0140-6736(02)07746-2 · Cited by 3,236
Research works printed but not linked: 19
- Adam, 2003, Serum protein fingerprinting coupled with a pattern-matching algorithm distinguishes prostate cancer from benign prostate hyperplasia and healthy mean, Cancer Res., 63, 3609
- Boser, 1992, Proc. Computational Learning Theory II, Philadelphia
- Chen, 2001, Atomic decomposition by basis pursuit, SIAM Rev., 43, 129, 10.1137/S003614450037906X · DOI · Paper page
- Donoho, 1994, Ideal spatial adaptation by wavelet shrinkage, Biometrika, 81, 425, 10.1093/biomet/81.3.425 · DOI · Paper page
- Efron, 2002, Technical Report
- Geyer, 1996, On the asymptotics of convex stochastic optimization
- Gill, 1997, Technical Report NA 97-4
- Golub, 1999, Molecular classification of cancer: class discovery and class prediction by gene expression monitoring, Science, 286, 531, 10.1126/science.286.5439.531 · DOI · Paper page
- Hoerl, 1970, Ridge regression: biased estimation for nonorthogonal problems, Technometrics, 12, 55, 10.1080/00401706.1970.10488634 · DOI · Paper page
- Knight, 2000, Asymptotics for lasso-type estimators, Ann. Statist., 28, 1356
- Land, 1996, Technical Report
- Lee, 2002, Technical Report
- Rosset, 2003, Adaptable, efficient and robust methods for regression and classification via piecewise linear regularized coefficient paths
- Rosset, 2004, Boosting as a regularized path to a maximum margin classifier, J. Mach. Learn. Res., 5, 941
- Stein, 1981, Estimation of the mean of a multivariate normal distribution, Ann. Statist., 9, 1131, 10.1214/aos/1176345632 · DOI · Paper page
- Tibshirani, 2001, Diagnosis of multiple cancer types by shrunken centroids of gene expression, Proc. Natn. Acad. Sci. USA, 99, 6567, 10.1073/pnas.082099299 · DOI · Paper page
- Tibshirani, 2004, Sparsity and smoothness via the fused lasso
- Wold, 1975, Perspectives in Probability and Statistics, in Honor of M. S. Bartlett, 117
- Zhu, 2003, Technical Report
Cited by
Applications of machine learning to machine fault diagnosis: A review and roadmap
Lei, Y., Yang, B., Jiang, X., Jia, F., Li, N., & Nandi, A. K. (2020) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2019.106587 · Cited by 2,997
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018) · ACM Computing Surveys · doi:10.1145/3136625 · Cited by 2,442
The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
Danaher, P., Wang, P., & Witten, D. M. (2014) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12033 · Cited by 855
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
Penalized regression, standard errors, and Bayesian lassos
Casella, G., Ghosh, M., Gill, J., & Kyung, M. (2010) · Bayesian Analysis · doi:10.1214/10-ba607 · Cited by 567
Metadata
- Authors
- Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., & Knight, K.
- Venue
- Journal of the Royal Statistical Society Series B: Statistical Methodology
- Publisher
- Oxford University Press (OUP)
- Published
- 2004-12-13
- Volume
- 67
- Issue
- 1
- Pages
- 91-108
- ISSN
- 1369-7412 (ISSN-L)
- 1467-9868
- OpenAlex
- W2140514146
- Cited by
- 2,724
- References
- 4
- FWCI
- 7.87
- Type
- journal article
- Language
- en
- Open access
- closed
- Funders
- National Science Foundation (DMS-9971405, CCR-0306662)
- National Institutes of Health (N01-HV-28183)
- Office of Naval Research (N00014-02-1-0076)
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sparsity and Smoothness Via the Fused Lasso. https://app.cochat.ai/papers/10.1111/j.1467-9868.2005.00490.x
- The paper
- Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., & Knight, K. (2005). Sparsity and Smoothness Via the Fused Lasso. Journal of the Royal Statistical Society Series B: Statistical Methodology. https://doi.org/10.1111/j.1467-9868.2005.00490.x
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.
