The DOI matches its OpenAlex record; 32 of the 32 references it cites were found in a registry or an index.
Data Preprocessing For Supervised Leaning
Open accessOverview
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
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322753616 · Cited by 3,502
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Fayyad, U. M., & Irani, K. B. (1993) · International Joint Conference on Artificial Intelligence · Cited by 2,870
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning
Hall, M. A. (2000) · Cited by 1,715
Data preparation for data mining
Pyle, D. (1999) · Cited by 1,368
Feature subset selection using a genetic algorithm
Yang, J., & Honavar, V. (1998) · IEEE Intelligent Systems · doi:10.1109/5254.671091 · Cited by 1,362
Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem
Hernández, M. A., & Stolfo, S. J. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009761603038 · Cited by 812
Overcoming the Myopia of Inductive Learning Algorithms with RELIEFF
Kononenko, I., Šimec, E., & Robnik-Šikonja, M. (1997) · Applied Intelligence · doi:10.1023/a:1008280620621 · Cited by 796
Identifying Mislabeled Training Data
Brodley, C. E., & Friedl, M. A. (1999) · Cited by 718
Selection of Relevant Features in Machine Learning.
Langley, P. (1994) · doi:10.21236/ada292575 · Cited by 709
A probabilistic approach to feature selection - a filter solution
Liu, H., & Setiono, R. (1996) · Cited by 665
Data mining for direct marketing: problems and solutions
Ling, C. X., & Cheng-hui, L. (1998) · Cited by 661
Induction of Selective Bayesian Classifiers
LANGLEY, P., & SAGE, S. (1994) · Uncertainty Proceedings 1994 · doi:10.1016/b978-1-55860-332-5.50055-9 · Cited by 657
Identifying Mislabeled Training Data
Brodley, C. E., & Friedl, M. A. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.606 · Cited by 612
Optimal number of features as a function of sample size for various classification rules
Hua, J., Xiong, Z., Lowey, J., Suh, E., & Dougherty, E. R. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti171 · Cited by 437
Neural-network feature selector
Setiono, R., & Liu, H. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572104 · Cited by 379
Identification of Outliers in Multivariate Data
Rocke, D. M., & Woodruff, D. L. (1996) · Journal of the American Statistical Association · doi:10.1080/01621459.1996.10476975 · Cited by 360
Adaptive floating search methods in feature selection
Somol, P., Pudil, P., Novovičová, J., & Paclı́k, P. (1999) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00083-5 · Cited by 305
A unified notion of outliers: properties and computation
Knorr, E. M., & Ng, R. T. (1997) · Cited by 275
Imputation of Missing Data in Industrial Databases
Lakshminarayan, K., Harp, S. A., & Samad, T. (1999) · Applied Intelligence · doi:10.1023/a:1008334909089 · Cited by 261
Evaluating feature selection methods for learning in data mining applications
Piramuthu, S. (2004) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00911-6 · Cited by 191
Teng, C.-M. (1999) · International Conference on Machine Learning · Cited by 173
The Effects of Training Set Size on Decision Tree Complexity
Oates, T., & Jensen, D. D. (1997) · International Conference on Machine Learning · Cited by 154
Feature Generation Using General Constructor Functions
Markovitch, S., & Rosenstein, D. (2002) · Machine Learning · doi:10.1023/a:1014046307775 · Cited by 143
Khiops: A Statistical Discretization Method of Continuous Attributes
Boullé, M. (2004) · Machine Learning · doi:10.1023/b:mach.0000019804.29836.05 · Cited by 111
A Unifying View on Instance Selection
Reinartz, T. P. (2002) · Data Mining and Knowledge Discovery · doi:10.1023/a:1014047731786 · Cited by 94
Efficient learning of selective Bayesian network classifiers
Singh, M., & Provan, G. M. (1996) · Cited by 81
Efficient Multisplitting Revisited: Optima-Preserving Elimination of Partition Candidates
Elomaa, T., & Rousu, J. (2004) · Data Mining and Knowledge Discovery · doi:10.1023/b:dami.0000015868.85039.e6 · Cited by 45
Liu, H., & Setiono, R. (1998) · Expert Systems with Applications · doi:10.1016/s0957-4174(98)90049-5 · Cited by 43
Constructing X-of-N Attributes for Decision Tree Learning
Zheng, Z. (2000) · Machine Learning · doi:10.1023/a:1007626017208 · Cited by 39
Somol, P., & Pudil, P. (2002) · Pattern Recognition · doi:10.1016/s0031-3203(01)00245-x · Cited by 28
Strategies for Scaling Up Evolutionary Instance Reduction Algorithms for Data Mining
Cano, J.-R., Herrera, F., & Lozano, M. (2006) · Springer eBooks · doi:10.1007/3-540-32358-9_2 · Cited by 9
Cited by
Building an efficient intrusion detection system based on feature selection and ensemble classifier
Zhou, Y., Cheng, G., Jiang, S., & Dai, M. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107247 · Cited by 675
Cavalcante, I. M., Frazzon, E. M., Forcellini, F. A., & Ivanov, D. (2019) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2019.03.004 · Cited by 527
Deng, Z., Hu, X., Lin, X., Che, Y., Xu, L., & Guo, W. (2020) · Energy · doi:10.1016/j.energy.2020.118000 · Cited by 423
A Systematic Literature Review and Meta-Analysis on Cross Project Defect Prediction
Hosseini, S., Turhan, B., & Gunarathna, D. (2019) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2017.2770124 · Cited by 317
Ghorbani, R., & Ghousi, R. (2020) · IEEE Access · doi:10.1109/access.2020.2986809 · Cited by 289
Metadata
- Authors
- Kotsiantis, S. B., Kanellopoulos, D. N., & Pintelas, P.
- Venue
- Zenodo (CERN European Organization for Nuclear Research)
- Publisher
- European Organization for Nuclear Research
- Published
- 2007-12-28
- Volume
- 1
- Issue
- 12
- Pages
- 4104-4109
- OpenAlex
- W1961147827
- Cited by
- 631
- References
- 32
- FWCI
- 3.94
- 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.