The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Information-Theoretic Feature Selection in Microarray Data Using Variable Complementarity
Open accessAbstract
The paper presents an original filter approach for effective feature selection in microarray data characterized by a large number of input variables and a few samples. The approach is based on the use of a new information-theoretic selection, the double input symmetrical relevance (DISR), which relies on a measure of variable complementarity. This measure evaluates the additional information that a set of variables provides about the output with respect to the sum of each single variable contribution. We show that a variable selection approach based on DISR can be formulated as a quadratic optimization problem: the dispersion sum problem (DSP). To solve this problem, we use a strategy based on backward elimination and sequential replacement (BESR). The combination of BESR and the DISR criterion is compared in theoretical and experimental terms to recently proposed information-theoretic criteria. Experimental results on a synthetic dataset as well as on a set of eleven microarray classification tasks show that the proposed technique is competitive with existing filter selection methods.
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
Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing
Benjamini, Y., & Hochberg, Y. (1995) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1995.tb02031.x · Cited by 109,482
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Peng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544
Gene expression profiling predicts clinical outcome of breast cancer
van 't Veer, L. J., Dai, H., van de Vijver, M. J., He, Y. D., Hart, A. A. M., Mao, M., Peterse, H. L., van der Kooy, K., Marton, M. J., Witteveen, A. T., et al. (2002) · Nature · doi:10.1038/415530a · Cited by 9,536
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
A Gene-Expression Signature as a Predictor of Survival in Breast Cancer
van de Vijver, M. J., He, Y. D., van 't Veer, L. J., Dai, H., Hart, A. A. M., Voskuil, D. W., Schreiber, G. J., Peterse, J. L., Roberts, C., Marton, M. J., et al. (2002) · New England Journal of Medicine · doi:10.1056/nejmoa021967 · Cited by 6,488
Multivariate Density Estimation: Theory, Practice, and Visualization
Scott, D. W. (1992) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316849 · Cited by 3,696
Feature selection for classification
DASH, M., & LIU, H. (1997) · Intelligent Data Analysis · doi:10.1016/s1088-467x(97)00008-5 · Cited by 3,574
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322753616 · Cited by 3,502
Selection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298
Estimating attributes: Analysis and extensions of RELIEF
Kononenko, I. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-57868-4_57 · Cited by 2,958
Elements of Information Theory
Jacobs, K. (1992) · Discrete Stochastics · doi:10.1007/978-3-0348-8645-1_7 · Cited by 2,918
MINIMUM REDUNDANCY FEATURE SELECTION FROM MICROARRAY GENE EXPRESSION DATA
DING, C., & PENG, H. (2005) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s0219720005001004 · Cited by 2,751
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×
“Mutual information is a well-known statistical measure which has been used in data analysis for defining concepts like variable relevance [4], [22], [38], redundancy [26], [44], [46] and interaction [20], [22], [26].”
MethodMargolin, A. A., Nemenman, I., Basso, K., Wiggins, C., Stolovitzky, G., Favera, R. D., & Califano, A. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-s1-s7 · Cited by 2,420
Margolin, A. A., Nemenman, I. M., Basso, K., Wiggins, C. H., Stolovitzky, G. A., Favera, R. D., & Califano, A. (2006) · BMC Bioinformatics · doi:10.7916/d8g15zbp · Cited by 2,246
Feature selection: evaluation, application, and small sample performance
Jain, A., & Zongker, D. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.574797 · Cited by 2,171
Using mutual information for selecting features in supervised neural net learning
Battiti, R. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.298224 · Cited by 2,148
Efficient Feature Selection via Analysis of Relevance and Redundancy
Yu, L., & Liu, H. (2004) · doi:10.5555/1005332.1044700 · Cited by 1,983
Supervised and Unsupervised Discretization of Continuous Features
Dougherty, J., Kohavi, R., & Sahami, M. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50032-3 · Cited by 1,936
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Estimation of entropy and mutual information
Paninski, L. (2003) · Neural Computation · doi:10.1162/089976603321780272 · Cited by 1,442 · cited 1×
“This entropy estimation method is known to be biased [31].”
MethodMultivariate Information Transmission
McGill, W. J. (1954) · Psychometrika · doi:10.1007/bf02289159 · Cited by 686
Learning with many irrelevant features
Almuallim, H., & Dietterich, T. G. (1991) · Cited by 623
Fast Binary Feature Selection with Conditional Mutual Information
FleuretFrançois (2004) · Journal of Machine Learning Research · doi:10.5555/1005332.1044711 · Cited by 593
Gene expression profiling predicts clinical outcome of breast cancer
(2002) · Nature · doi:10.1038/news020128-6 · Cited by 533
Learning Boolean concepts in the presence of many irrelevant features
Almuallim, H., & Dietterich, T. G. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90084-1 · Cited by 520
A Problem of Dimensionality: A Simple Example
Trunk, G. V. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766926 · Cited by 431
Van den Bulcke, T., Van Leemput, K., Naudts, B., van Remortel, P., Ma, H., Verschoren, A., De Moor, B., & Marchal, K. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-43 · Cited by 293
Information-Theoretic Inference of Large Transcriptional Regulatory Networks
Meyer, P. E., Kontos, K., Lafitte, F., & Bontempi, G. (2007) · EURASIP Journal on Bioinformatics and Systems Biology · doi:10.1155/2007/79879 · Cited by 273
Self-citationTowards Principled Feature Selection: Relevancy, Filters and Wrappers
Tsamardinos, I., & Aliferis, C. (2003) · Cited by 238
Searching for interacting features
Zhao, Z., & Liu, H. (2007) · International Joint Conference on Artificial Intelligence · Cited by 235
Application of the mutual information criterion for feature selection in computer‐aided diagnosis
Tourassi, G. D., Frederick, E. D., Markey, M. K., & Floyd, C. E. (2001) · Medical Physics · doi:10.1118/1.1418724 · Cited by 221
Greedily Finding a Dense Subgraph
Asahiro, Y., Iwama, K., Tamaki, H., & Tokuyama, T. (2000) · Journal of Algorithms · doi:10.1006/jagm.1999.1062 · Cited by 211
A Formalism for Relevance and Its Application in Feature Subset Selection
Bell, D., & Wang, H. (2000) · Machine Learning · doi:10.1023/a:1007612503587 · Cited by 197
The Multiinformation Function as a Tool for Measuring Stochastic Dependence
Studený, M., & Vejnarová, J. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_10 · Cited by 173
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
Merz, P., & Freisleben, B. (2002) · Journal of Heuristics · doi:10.1023/a:1017912624016 · Cited by 164
On the Use of Variable Complementarity for Feature Selection in Cancer Classification
Meyer, P. E., & Bontempi, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11732242_9 · Cited by 159
Self-citationQuantifying and Visualizing Attribute InteractionsPreprint
Jakulin, A., & Bratko, I. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0308002 · Cited by 115
Braga-Neto, U. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.273062 · Cited by 62
Training a 3-node neural network is NP-complete
Blum, A. L., & Rivest, R. L. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56483-7_20 · Cited by 58
Learning Bayesian Networks Using Feature Selection
Provan, G. M., & Singh, M. (1996) · Lecture notes in statistics · doi:10.1007/978-1-4612-2404-4_28 · Cited by 47
Cited by
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
“An alternative criterion, Joint Mutual Information (Yang and Moody 1999; Meyer et al. 2008) is proposed to increase the complementary information that is shared between unselected features and selected features given the class labels.”
BackgroundA review of feature selection methods based on mutual information
Vergara, J. R., & Estévez, P. A. (2014) · Neural Computing and Applications · doi:10.1007/s00521-013-1368-0 · Cited by 1,255
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Treviño, R. P., Tang, J., & Liu, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.07996 · Cited by 739
Benchmark for filter methods for feature selection in high-dimensional classification data
Bommert, A., Sun, X., Bischl, B., Rahnenführer, J., & Lang, M. (2020) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2019.106839 · Cited by 725
A review of microarray datasets and applied feature selection methods
Bolón-Canedo, V., Sánchez-Maroño, N., Alonso-Betanzos, A., Benítez, J. M., & Herrera, F. (2014) · Information Sciences · doi:10.1016/j.ins.2014.05.042 · Cited by 666
Metadata
- Authors
- Meyer, P. E., Schretter, C., & Bontempi, G.
- Venue
- IEEE Journal of Selected Topics in Signal Processing
- Published
- 2008-06
- Volume
- 2
- Issue
- 3
- Pages
- 261-274
- ISSN
- 1932-4553 (ISSN-L)
- OpenAlex
- W2165580920
- Cited by
- 280
- References
- 42
- FWCI
- 2.11
- Type
- journal article
- Language
- en
- Open access
- green
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.