The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Novel Unsupervised Feature Filtering of Biological Data
Open accessAbstract
Motivation: Many methods have been developed for selecting small informative feature subsets in large noisy data. However, unsupervised methods are scarce. Examples are using the variance of data collected for each feature, or the projection of the feature on the first principal component. We propose a novel unsupervised criterion, based on SVD-entropy, selecting a feature according to its contribution to the entropy (CE) calculated on a leave-one-out basis. This can be implemented in four ways: simple ranking according to CE values (SR); forward selection by accumulating features according to which set produces highest entropy (FS1); forward selection by accumulating features through the choice of the best CE out of the remaining ones (FS2); backward elimination (BE) of features with the lowest CE. Results: We apply our methods to different benchmarks. In each case we evaluate the success of clustering the data in the selected feature spaces, by measuring Jaccard scores with respect to known classifications. We demonstrate that feature filtering according to CE outperforms the variance method and gene-shaving. There are cases where the analysis, based on a small set of selected features, outperforms the best score reported when all information was used. Our method calls for an optimal size of the relevant feature set. This turns out to be just a few percents of the number of genes in the two Leukemia datasets that we have analyzed. Moreover, the most favored selected genes turn out to have significant GO enrichment in relevant cellular processes. Abbreviations: Singular Value Decomposition (SVD), Principal Component Analysis (PCA), Quantum Clustering (QC), Gene Shaving (GS), Variance Selection (VS), Backward Elimination (BE) Contact: royke@cs.huji.ac.il Conflicts of Interest: not reported
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Golub, T. R., Slonim, D. K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J. P., Coller, H., Loh, M. L., Downing, J. R., Caligiuri, M. A., et al. (1999) · Science · doi:10.1126/science.286.5439.531 · Cited by 11,516
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
The information bottleneck method
Tishby, N., Pereira, F. C., & Bialek, W. (2000) · arXiv · doi:10.48550/arxiv.physics/0004057 · Cited by 2,626 · cited 1×
“Although standard entropy considerations appear in feature selection meth-ods, such as the supervised bottleneck approach (Tishby et al ., 2000), the use of SVD-entropy for feature selection is a novel approach.”
Singular value decomposition for genome-wide expression data processing and modeling
Alter, O., Brown, P. O., & Botstein, D. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.18.10101 · Cited by 1,971
Singular Value Decomposition and Principal Component Analysis
Wall, M. E., Rechtsteiner, A., & Rocha, L. M. (2005) · A Practical Approach to Microarray Data Analysis · doi:10.1007/0-306-47815-3_5 · Cited by 1,215
Coupled two-way clustering analysis of gene microarray data
Getz, G., Levine, E., & Domany, E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.210134797 · Cited by 813
'Gene shaving' as a method for identifying distinct sets of genes with similar expression patterns
Hastie, T., Tibshirani, R., Eisen, M. B., Alizadeh, A., Levy, R., Staudt, L., Chan, W. C., Botstein, D., & Brown, P. (2000) · Genome Biology · doi:10.1186/gb-2000-1-2-research0003 · Cited by 547 · cited 1×
“The latter is a variation of a method of Hastie et al .”
MethodLiu, H., Li, J., & Wong, L. (2002) · PubMed · Cited by 410
CLICK: a clustering algorithm with applications to gene expression analysis.
Sharan, R., & Ron Shamir, A. (2000) · PubMed · Cited by 395
Wolf, L., & Shashua, A. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1194906 · Cited by 239
Algorithm for Data Clustering in Pattern Recognition Problems Based on Quantum Mechanics
Horn, D., & Gottlieb, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.88.018702 · Cited by 212
Self-citationXing, E. P., & Karp, R. M. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.suppl_1.s306 · Cited by 201
Adaptive dimension reduction for clustering high dimensional data
Ding, C., He, X., Hongyuan Zha, B., & Simon, H. D. (2003) · Proceedings · doi:10.1109/icdm.2002.1183897 · Cited by 164
Liu, B., Cui, Q., Jiang, T., & Ma, S. (2004) · BMC Bioinformatics · doi:10.1186/1471-2105-5-136 · Cited by 158
Camon, E. B., Barrell, D. G., Lee, V., Dimmer, E. C., & Apweiler, R. (2004) · PubMed · Cited by 133
Class discovery in gene expression data
Ben‐Dor, A., Friedman, N., & Yakhini, Z. (2001) · doi:10.1145/369133.369167 · Cited by 124
Novel clustering algorithm for microarray expression data in a truncated SVD space
Horn, D., & Axel, I. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg053 · Cited by 67
Self-citationCOMPACT: A Comparative Package for Clustering Assessment
Varshavsky, R., Linial, M., & Horn, D. (2005) · Lecture notes in computer science · doi:10.1007/11576259_18 · Cited by 32
Self-citation
Cited by
A review of feature selection techniques in bioinformatics
Saeys, Y., Inza, I., & Larrañaga, P. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm344 · Cited by 5,244
Dethlefsen, L., Huse, S., Sogin, M. L., & Relman, D. A. (2008) · PLoS Biology · doi:10.1371/journal.pbio.0060280 · Cited by 2,361
STEM: a tool for the analysis of short time series gene expression data
Ernst, J., & Bar-Joseph, Z. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-191 · Cited by 1,703
A gene expression atlas of the model legume Medicago truncatula
Benedito, V. A., Torres‐Jerez, I., Murray, J. D., Andriankaja, A., Allen, S., Kakar, K., Wandrey, M., Verdier, J., Zuber, H., Ott, T., et al. (2008) · The Plant Journal · doi:10.1111/j.1365-313x.2008.03519.x · Cited by 735
Dynamic regulatory network controlling TH17 cell differentiation
Yosef, N., Shalek, A. K., Gaublomme, J. T., Jin, H., Lee, Y., Awasthi, A., Wu, C., Karwacz, K., Xiao, S., Jorgolli, M., et al. (2013) · Nature · doi:10.1038/nature11981 · Cited by 682
Metadata
- Authors
- Varshavsky, R., Gottlieb, A., Linial, M., & Horn, D.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2006-07-15
- Volume
- 22
- Issue
- 14
- Pages
- e507-e513
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2140703956
- Cited by
- 339
- References
- 19
- FWCI
- 9.21
- Type
- journal article
- Language
- en
- Open access
- bronze
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.