The DOI matches its Crossref record; 310 of the 310 references it cites were found in a registry or an index.
Series in Machine Perception and Artificial Intelligence
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
Items 201–310 of 310
Learning decision rules in noisy domains
Niblett, T., & Ivan Bratko, A. (1987) · Cited by 175
Graph theoretical clustering based on limited neighbourhood sets
Urquhart, R. (1982) · Pattern Recognition · doi:10.1016/0031-3203(82)90069-3 · Cited by 173
The process of knowledge discovery in databases
Brachman, R. J., & Anand, T. (1996) · Knowledge Discovery and Data Mining · Cited by 171
Exploiting unlabeled data in ensemble methods
Bennett, K. P., Demiriz, A., & Maclin, R. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775090 · Cited by 171
Trading accuracy for simplicity in decision trees
Bohanec, M., & Bratko, I. (1994) · Machine Learning · doi:10.1007/bf00993345 · Cited by 170
Inducing oblique decision trees with evolutionary algorithms
Canti-Paz, E., & Kamath, C. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.806857 · Cited by 169
A hybrid decision tree/genetic algorithm method for data mining
Carvalho, D. R., & Freitas, A. A. (2003) · Information Sciences · doi:10.1016/j.ins.2003.03.013 · Cited by 168
Diversity in multiple classifier systems
Kuncheva, L. I. (2005) · Information Fusion · doi:10.1016/j.inffus.2004.04.009 · Cited by 165
Error reduction through learning multiple descriptions
Ali, K. M., & Pazzani, M. J. (1996) · Machine Learning · doi:10.1007/bf00058611 · Cited by 163
On the Accuracy of Meta-learning for Scalable Data Mining
Chan, P. K., & Stolfo, S. J. (1997) · Journal of Intelligent Information Systems · doi:10.1023/a:1008640732416 · Cited by 158
Large-Scale Parallel Data Mining
(2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46502-2 · Cited by 158
Oliveira, L. S., Sabourin, R., Bortolozzi, F., & Suen, C. Y. (2003) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s021800140300271x · Cited by 157
Thaid a Sequential Analysis Program for the Analysis of Nominal Scale Dependent Variables
Morgan, J. N., & Messenger, R. C. (1973) · Deep Blue (University of Michigan) · Cited by 155
Peng, F., Jacobs, R. A., & Tanner, M. A. (1996) · Journal of the American Statistical Association · doi:10.1080/01621459.1996.10476965 · Cited by 155
On the Complexity of Computing and Learning with Multiplicative Neural Networks
Schmitt, M. (2002) · Neural Computation · doi:10.1162/08997660252741121 · Cited by 153
Direct transfer of learned information among neural networks
Pratt, L., Mostow, J., & Kamm, C. (1991) · Cited by 151
Incremental clustering for dynamic information processing
Can, F. (1993) · ACM Transactions on Information Systems · doi:10.1145/130226.134466 · Cited by 151
Hierarchies of adaptive experts
Jordan, M. I., & Jacobs, R. A. (1991) · neural information processing systems · Cited by 150
Zhou, Z., & Chen, Z.-Q. (2002) · Knowledge-Based Systems · doi:10.1016/s0950-7051(02)00038-2 · Cited by 148
Test strategies for cost-sensitive decision trees
Ling, C. X., Sheng, V. S., & Yang, Q. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.131 · Cited by 144
Detection of land-cover transitions by combining multidate classifiers
Bruzzone, L., Cossu, R., & Vernazza, G. L. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.06.002 · Cited by 132
Growing and pruning neural tree networks
Sakar, A., & Mammone, R. J. (1993) · IEEE Transactions on Computers · doi:10.1109/12.210172 · Cited by 131
A Novel Validity Index for Determination of the Optimal Number of Clusters
Kim, D.-J., Park, Y.-W., & Park, D.-J. (2001) · IEICE Transactions on Information and Systems · Cited by 130
Selective Ensemble of Decision Trees
Zhou, Z., & Tang, W. (2007) · Springer eBooks · doi:10.1007/3-540-39205-x_81 · Cited by 128
Constructing Decision Trees in Noisy Domains.
Niblett, T. (1987) · Cited by 127
Use of contextual information for feature ranking and discretization
Hong, S. J. (1997) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.634751 · Cited by 127
Understanding the Nature of Learning: Issues and Research Directions
Michalski, R. S. (1985) · doi:10.13021/mars/3560 · Cited by 124
Learning Ensembles from Bites: A Scalable and Accurate Approach
Chawla, N. V., Hall, L., Bowyer, K. W., & Kegelmeyer, W. P. (2004) · doi:10.5555/1005332.1005347 · Cited by 124
Decision trees and multi-valued attributes
Quilan, J. R. (1988) · Machine intelligence · Cited by 122
Chen, K., Wang, L., & Chi, H. (1997) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001497000196 · Cited by 121
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
Bentley, J. L., & Friedman (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675043 · Cited by 119
Decomposition in data mining: an industrial case study
Kusiak, A. (2000) · IEEE Transactions on Electronics Packaging Manufacturing · doi:10.1109/6104.895081 · Cited by 113
Neural and statistical classifiers-taxonomy and two case studies
Holmström, L., Koistinen, P., Laaksonen, J. T., & Erkki Oja, A. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.554187 · Cited by 111
Hampshire, J. B., & Waibel, A. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.142911 · Cited by 107
Option Decision Trees with Majority Votes
Kohavi, R., & Kunz, C. (1997) · Cited by 106
Combining Estimators Using Non-Constant Weighting Functions
Volker Tresp, C., & Taniguchi, M. (1994) · Cited by 106
Jenkins, R. E., & Yuhas, B. P. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.238326 · Cited by 104
Multi-class protein fold classification using a new ensemble machine learning approach.
Tan, A. C., Gilbert, D., & Deville, Y. (2003) · PubMed · Cited by 103
On the Boosting Ability of Top–Down Decision Tree Learning Algorithms
Kearns, M. J., & Mansour, Y. (1999) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1543 · Cited by 102
Lower Bounds on Learning Decision Lists and Trees
Hancock, T. R., Jiang, T., Li, M., & Tromp, J. (1996) · Information and Computation · doi:10.1006/inco.1996.0040 · Cited by 101
Estimating the Predictive Accuracy of a Classifier
Bensusan, H. N., & Kalousis, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44795-4_3 · Cited by 100
Families of splitting criteria for classification trees
Shih, Y. (1999) · Statistics and Computing · doi:10.1023/a:1008920224518 · Cited by 100
Structure determination in fuzzy modeling: a fuzzy CART approach
Jang, J. R. (1994) · doi:10.1109/fuzzy.1994.343738 · Cited by 100
Optimisation en analyse ordinale des données
Marcotorchino, J.-F., & Michaud, P. (1979) · Masson eBooks · Cited by 98
Computational experience on four algorithms for the hard clustering problem
Al-Sultana, K. S., & Khan, M. M. (1996) · Pattern Recognition Letters · doi:10.1016/0167-8655(95)00122-0 · Cited by 98
Noisy replication in skewed binary classification
Lee, S. S. (2000) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(99)00095-x · Cited by 95
Evaluation of Adaptive Mixtures of Competing Experts
Nowlan, S. J., & Hinton, G. E. (1990) · neural information processing systems · Cited by 94
Lookahead and pathology in decision tree induction
Murthy, S. K., & Salzberg, S. L. (1995) · Cited by 91
Model selection for medical diagnosis decision support systems
Mangiameli, P. M., West, D., & Rampal, R. (2002) · Decision Support Systems · doi:10.1016/s0167-9236(02)00143-4 · Cited by 91
The Dynamics of AdaBoost: Cyclic Behavior and Convergence of Margins
Rudin, C. D., Daubechies, I. C., & Schapire, R. E. (2004) · doi:10.5555/1005332.1044712 · Cited by 90
Ensemble Methods for Classification in Cheminformatics
Merkwirth, C., Mauser, H., Schulz‐Gasch, T., Roche, O., Ståhl, M., & Lengauer, T. (2004) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci049850e · Cited by 88
On evaluating performance of classifiers for rare classes
Joshi, M. V. (2003) · Proceedings · doi:10.1109/icdm.2002.1184018 · Cited by 88
Oblivious Decision Trees and Abstract Cases
Langley, P., & Sage, S. (1994) · Cited by 87
Data mining of printed-circuit board defects
Kusiak, A., & Kurasek, C. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.928564 · Cited by 87
Combining Decision Trees and Neural Networks for Drug Discovery
Langdon, W. B., Barrett, S. J., & Buxton, B. F. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45984-7_6 · Cited by 84
Hu, X. T. (2002) · Proceedings · doi:10.1109/icdm.2001.989524 · Cited by 80
Interpretable boosted naïve Bayes classification
Ridgeway, G. K., Madigan, D., Richardson, T. S., & O’Kane, J. W. (1998) · Cited by 77
Wolpert, D. H. (2018) · CRC Press eBooks · doi:10.1201/9780429492525-5 · Cited by 77
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
Kearns, M. J., & Mansour, Y. (1998) · Cited by 76
A NARMAX model representation for adaptive control based on local models
Johansen, T. A., & Foss, B. A. (1992) · Modeling Identification and Control A Norwegian Research Bulletin · doi:10.4173/mic.1992.1.3 · Cited by 76
Membership authentication in the dynamic group by face classification using SVM ensemble
Pang, S., Kim, D., & Bang, S. Y. (2002) · Pattern Recognition Letters · doi:10.1016/s0167-8655(02)00213-1 · Cited by 72
Fast and Robust General Purpose Clustering Algorithms
Estivill‐Castro, V., & Yang, J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44533-1_24 · Cited by 69
Logical vs. Analogical or Symbolic vs. Connectionist or Neat vs. Scruffy
(1990) · The MIT Press eBooks · doi:10.7551/mitpress/1425.003.0013 · Cited by 69
Large datasets lead to overly complex models: an explanation and a solution
Oates, T., & Jensen, D. D. (1998) · Cited by 68
Decision-tree instance-space decomposition with grouped gain-ratio
Cohen, S., Rokach, L., & Maimon, O. (2007) · Information Sciences · doi:10.1016/j.ins.2007.01.016 · Cited by 68
Graphical models for discovering knowledge
Buntine, W. (1996) · Cited by 65
IMPROVING STABILITY OF DECISION TREES
Last, M., Maimon, O., & Minkov, E. (2002) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001402001599 · Cited by 65
Growing simpler decision trees to facilitate knowledge discovery
Cherkauer, K. J., & SHAVLIK, J. W. (1996) · Cited by 63
Maimon, O., & Rokach, L. (2005) · Cited by 62
FINDING SMALL EQUIVALENT DECISION TREES IS HARD
Zantema, H., & Bodlaender, H. L. (2000) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054100000193 · Cited by 60
Genetic algorithms as a tool for restructuring feature space representations
Vafaie, H., & Jong, K. A. D. (2002) · doi:10.1109/tai.1995.479372 · Cited by 60
Günter, S., & Horst Bunke, A. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.05.002 · Cited by 59
Applying the Waek Learning Framework to Understand and Improve C4.5.
Dietterich, T. G., Kearns, M. J., & Mansour, Y. (1996) · International Conference on Machine Learning · Cited by 57
Targeting business users with decision table classifiers
Kohavi, R., & Sommerfield, D. A. (1998) · Cited by 54
Generalization Bounds for Decision Trees
Mansour, Y., & McAllester, D. (2000) · Cited by 52
Feature set decomposition for decision trees
Rokach, L., & Maimon, O. (2005) · Intelligent Data Analysis · doi:10.3233/ida-2005-9202 · Cited by 49
Diversity between Neural Networks and Decision Trees for Building Multiple Classifier Systems
Wang, W., Jones, P., & Partridge, D. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45014-9_23 · Cited by 48
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
Structurally adaptive modular networks for nonstationary environments
Ramamurti, V., & Ghosh, J. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.737501 · Cited by 46
Feature transformation by function decomposition
Zupan, B., Bohanec, M., Demšar, J., & Bratko, I. (1998) · IEEE Intelligent Systems and their Applications · doi:10.1109/5254.671090 · Cited by 43
Walsh, P. F., Cunningham, P., Rothenberg, S. J., Doherty, S. O., HOEY, H. M. C. V., & Healy, R. (2004) · European Journal of Emergency Medicine · doi:10.1097/00063110-200410000-00004 · Cited by 43
Methods for cost-sensitive learning
Dietterich, T. G., & Margineantu, D. D. (2002) · Cited by 41
Myopic Policies in Sequential Classification
Ben‐Bassat (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675054 · Cited by 41
Designing storage efficient decision trees
Murphy, O. J., & McCraw, R. L. (1991) · IEEE Transactions on Computers · doi:10.1109/12.76408 · Cited by 41
Extensions to the CART algorithm
Crawford, S. L. (1990) · Academic Press Ltd. eBooks · Cited by 41
Feature selection via the discovery of simple classification rules
Holmes, G., & Nevill-Manning, C. G. (1995) · Cited by 39
A new hybrid approach in combining multiple experts to recognise handwritten numerals
Rahman, F., & Fairhurst, M. C. (1997) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)00078-0 · Cited by 38
Economic Induction: A Case Study.
Núñez, M. (1988) · Cited by 37
da Gama, J. M. P. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44399-1_28 · Cited by 34
Problem decomposition and the learning of skills
Michie, D. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59286-5_46 · Cited by 33
Data Mining by Attribute Decomposition with Semiconductor Manufacturing Case Study
Maimon, O., & Rokach, L. (2001) · Massive computing · doi:10.1007/978-1-4757-4911-3_13 · Cited by 33
Global learning of decision trees by an evolutionary algorithm
Krętowski, M., & Grześ, M. (2005) · Springer eBooks · doi:10.1007/0-387-26325-x_36 · Cited by 33
Lucila Ohno-machado, A., & Musen, M. A. (1997) · Connection Science · doi:10.1080/095400997116748 · Cited by 27
When does overfitting decrease prediction accuracy in induced decision trees and rule sets?
Schaffer, C. (1991) · Lecture notes in computer science · doi:10.1007/bfb0017014 · Cited by 25
Signature Table Systems and Learning
Biermann, A. W., Fairfield, J. R. C., & Beres, T. R. (1982) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1982.4308882 · Cited by 25
Negative Correlation Learning and the Ambiguity Family of Ensemble Methods
Gavin Brown, B., & Wyatt, J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44938-8_27 · Cited by 24
Ensemble feature selection with the simple Bayesian classification in medical diagnostics
Tsymbal, A., & Puuronen, S. J. (2003) · Proceedings - IEEE Symposium on Computer-Based Medical Systems · doi:10.1109/cbms.2002.1011381 · Cited by 24
A METHODOLOGY FOR IMPROVING THE PERFORMANCE OF NON-RANKER FEATURE SELECTION FILTERS
Rokach, L., Chizi, B., & Maimon, O. (2007) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001407005727 · Cited by 24
Controlling constructive induction in CIPF: An MDL approach
Pfahringer, B. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57868-4_62 · Cited by 21
Approximate Splitting for Ensembles of Trees using Histograms
Kamath, C., Cantú‐Paz, E., & Littau, D. (2002) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.22 · Cited by 20
Robust Order Statistics Based Ensembles for Distributed Data Mining
Tumer, K., & Ghosh, J. (2001) · Defense Technical Information Center (DTIC) · doi:10.21236/ada396346 · Cited by 20
Learning from Examples and Membership Queries with Structured Determinations
Tadepalli, P. V., & Russell, S. (1998) · Machine Learning · doi:10.1023/a:1007421315813 · Cited by 20
An empirical study of the performance of heuristic methods for clustering
Mishra, S. K., & Raghavan, V. V. (1994) · Machine intelligence and pattern recognition · doi:10.1016/b978-0-444-81892-8.50042-0 · Cited by 18
Online Adaptive Decision Trees
Basak, J. K. (2004) · Neural Computation · doi:10.1162/0899766041336396 · Cited by 18
An Empirical Study of Building Compact Ensembles
Liu, H., Mandvikar, A., & Mody, J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27772-9_63 · Cited by 17
Stages of the discovery process
Reinartz, T. P. (2002) · Oxford University Press eBooks · Cited by 12
Generate Different Neural Networks by Negative Correlation Learning
Liu, Y. (2005) · Lecture notes in computer science · doi:10.1007/11539087_17 · Cited by 11
Fürnkranz, J. (1997) · Cited by 7
Valiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
(1996)
Cited by
A performance evaluation of local descriptors
Mikolajczyk, K., & Schmid, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.188 · Cited by 6,723
Toward Objective Evaluation of Image Segmentation Algorithms
Unnikrishnan, R., Pantofaru, C., & Hebert, M. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1046 · Cited by 792
Gated Siamese Convolutional Neural Network Architecture for Human Re-identification
Varior, R. R., Haloi, M., & Wang, G. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46484-8_48 · Cited by 723
Loyola-Gonzalez, O. (2019) · IEEE Access · doi:10.1109/access.2019.2949286 · Cited by 559
A Siamese Long Short-Term Memory Architecture for Human Re-identification
Varior, R. R., Shuai, B., Lu, J., Xu, D., & Wang, G. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46478-7_9 · Cited by 524
Metadata
- Venue
- Series in machine perception and artificial intelligence
- Publisher
- WORLD SCIENTIFIC
- Published
- 2012-07-18
- ISSN
- 1793-0839 (ISSN-L)
- OpenAlex
- W2309460698
- Cited by
- 365
- References
- 310
- Type
- paratext
- 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.