The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
A hybrid approach for feature subset selection using neural networks and ant colony optimization
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
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
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
Floating search methods in feature selection
Pudil, P., Novovičová, J., & Kittler, J. (1994) · Pattern Recognition Letters · doi:10.1016/0167-8655(94)90127-9 · Cited by 3,098
Devijver, P. A., & Kittler, J. (1982) · Prentice-Hall International eBooks · Cited by 2,910
Ant Algorithms for Discrete Optimization
Dorigo, M., Caro, G. D., & Gambardella, L. M. (1999) · Artificial Life · doi:10.1162/106454699568728 · Cited by 2,808
Irrelevant Features and the Subset Selection Problem
John, G. H., Kohavi, R., & Pfleger, K. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50023-4 · Cited by 2,368
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
The feature selection problem: traditional methods and a new algorithm
Kira, K., & Rendell, L. A. (1992) · National Conference on Artificial Intelligence · Cited by 1,897
Pattern Recognition and Neural Networks
Fulkerson, B. (1997) · Technometrics · doi:10.1080/00401706.1997.10485099 · Cited by 1,371
Feature subset selection using a genetic algorithm
Yang, J., & Honavar, V. (1998) · IEEE Intelligent Systems · doi:10.1109/5254.671091 · Cited by 1,362
A Branch and Bound Algorithm for Feature Subset Selection
Narendra, & Fukunaga (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674939 · Cited by 1,245
Genetic algorithms as a strategy for feature selection
Leardi, R., Boggia, R., & Terrile, M. (1992) · Journal of Chemometrics · doi:10.1002/cem.1180060506 · Cited by 828
Ant-Based Load Balancing in Telecommunications Networks
Schoonderwoerd, R., Holland, O. E., Bruten, J. L., & Rothkrantz, L. J. M. (1997) · Adaptive Behavior · doi:10.1177/105971239700500203 · Cited by 739
Learning with many irrelevant features
Almuallim, H., & Dietterich, T. G. (1991) · Cited by 623
Ant system for Job-shop Scheduling
Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 617
Caruana, R., & Freitag, D. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50012-x · Cited by 545
Costa, D., & Hertz, A. (1997) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600357 · Cited by 497
Applying the ANT System to the Vehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_20 · Cited by 408
Lung cancer cell identification based on artificial neural network ensembles
Zhou, Z.-H., Jiang, Y., Yang, Y.-B., & Chen, S.-F. (2002) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(01)00094-x · Cited by 355
From Natural to Artificial Swarm Intelligence
Bonabeau, E. W., Dorigo, M., & Guy Theraulaz, A. (1999) · Oxford University Press eBooks · Cited by 278
Using Decision Trees to Improve Case-Based Learning
Cardie, C. (1993) · Machine Learning Proceedings 1993 · doi:10.1016/b978-1-55860-307-3.50010-1 · Cited by 255
Further Research on Feature Selection and Classification Using Genetic Algorithms
Punch, W. F., Goodman, E. D., Pei, M., Chia-Shun, L., Hovland, P., & Enbody, R. J. (1993) · Cited by 242
An Ant Approach to the Flow Shop Problem
Stützle, T. (1998) · Cited by 183
Learning pattern classification-a survey
Kulkarni, S. R., Lugosi, G., & Venkatesh, S. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720536 · Cited by 161
Feature Subset Selection Using Ant Colony Optimization
Al-Ani, A. (2008) · UTS ePRESS (University of Technology Sydney) · doi:10.5281/zenodo.1072065 · Cited by 160
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
Gambardella, L. M., & Dorigo, M. (1997) · doi:10.71910/supsi.7460 · Cited by 102
Feature Subset Selection within a Simulated Annealing Data Mining Algorithm
Debuse, J. C. W., & Rayward-Smith, V. J. (1997) · Journal of Intelligent Information Systems · doi:10.1023/a:1008641220268 · Cited by 86
Metaheuristics for Group Shop Scheduling
Sampels, M., Blum, C., Mastrolilli, M., & Rossi-Doria, O. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45712-7_61 · Cited by 22
Letting Ants Labeling Point Features
Schreyer, M. (2002) · Cited by 20
Letting ants labeling point features [sic.: for 'labeling' read 'label']
Schreyer, M., & Raidl, G. R. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2002.1004475 · Cited by 18
Learning decision rules for pattern classification under a family of probability measures
Kulkarni, S. R., & Vidyasagar, M. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.567668 · Cited by 14
A COMPARATIVE STUDY OF ANT-BASED OPTIMIZATION FOR DYNAMIC ROUTING
Sim, K. M., & Sun, W. H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45336-9_19 · Cited by 9
Cited by
A Survey on Evolutionary Computation Approaches to Feature Selection
Xue, B., Zhang, M., Browne, W. N., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2504420 · Cited by 1,841
Metaheuristic design of feedforward neural networks: A review of two decades of research
Ojha, V. K., Abraham, A., & Snášel, V. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.01.013 · Cited by 606
A survey on swarm intelligence approaches to feature selection in data mining
Nguyen, B. H., Xue, B., & Zhang, M. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100663 · Cited by 403
Moradi, P., & Gholampour, M. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.01.044 · Cited by 372
Artificial neural networks in business: Two decades of research
Tkáč, M., & Verner, R. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2015.09.040 · Cited by 340
Metadata
- Authors
- Sivagaminathan, R. K., & Ramakrishnan, S.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2007-07
- Volume
- 33
- Issue
- 1
- Pages
- 49-60
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W1975586526
- Cited by
- 258
- References
- 34
- FWCI
- 14.16
- Type
- journal article
- 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.