Loughrey et al., 2004 - Google Patents
Overfitting in wrapper-based feature subset selection: The harder you try the worse it getsLoughrey et al., 2004
View PDF- Document ID
- 7210085529700024356
- Author
- Loughrey J
- Cunningham P
- Publication year
- Publication venue
- International conference on innovative techniques and applications of artificial intelligence
External Links
Snippet
In Wrapper based feature selection, the more states that are visited during the search phase of the algorithm the greater the likelihood of finding a feature subset that has a high internal accuracy while generalizing poorly. When this occurs, we say that the algorithm has …
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
- G06N3/04—Architectures, e.g. interconnection topology
- G06N3/0472—Architectures, e.g. interconnection topology using probabilistic elements, e.g. p-rams, stochastic processors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/62—Methods or arrangements for recognition using electronic means
- G06K9/6267—Classification techniques
- G06K9/6268—Classification techniques relating to the classification paradigm, e.g. parametric or non-parametric approaches
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/62—Methods or arrangements for recognition using electronic means
- G06K9/6267—Classification techniques
- G06K9/6279—Classification techniques relating to the number of classes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
- G06N3/08—Learning methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/62—Methods or arrangements for recognition using electronic means
- G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
- G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
- G06K9/6247—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on an approximation criterion, e.g. principal component analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/12—Computer systems based on biological models using genetic models
- G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/02—Knowledge representation
- G06N5/022—Knowledge engineering, knowledge acquisition
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/04—Inference methods or devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
- G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Loughrey et al. | Overfitting in wrapper-based feature subset selection: The harder you try the worse it gets | |
Zhuang et al. | TILDE: Term independent likelihood moDEl for passage re-ranking | |
Raihan et al. | Sparse weight activation training | |
Tsamardinos et al. | Bootstrapping the out-of-sample predictions for efficient and accurate cross-validation | |
Papadopoulos | Inductive conformal prediction: Theory and application to neural networks | |
Bay | Nearest neighbor classification from multiple feature subsets | |
Lawrence et al. | Function approximation with neural networks and local methods: Bias, variance and smoothness | |
WO1997044741A1 (en) | System and method for combining multiple learning agents to produce a prediction method | |
EP3929823A1 (en) | Program, learning method, and information processing apparatus | |
Antonello et al. | Selecting informative contexts improves language model finetuning | |
Shi et al. | Learning where to sample in structured prediction | |
Dittadi et al. | Planning from pixels in atari with learned symbolic representations | |
Lenz et al. | No imputation without representation | |
US7853541B1 (en) | Method and apparatus for simmered greedy optimization | |
JP3868344B2 (en) | Text multiple topics extraction method and apparatus, text multiple topics extraction program, and recording medium recording the program | |
Puuronen et al. | Advanced local feature selection in medical diagnostics | |
Danubianu et al. | Data dimensionality reduction for data mining: A combined filter-wrapper framework | |
Apte et al. | Ramp: Rules abstraction for modeling and prediction | |
Pellatt et al. | CausalBatch: solving complexity/performance tradeoffs for deep convolutional and LSTM networks for wearable activity recognition | |
El Hajjami et al. | Machine learning facing behavioral noise problem in an imbalanced data using one side behavioral noise reduction: application to a fraud detection | |
Peng et al. | Adaptive nonmonotone conjugate gradient training algorithm for recurrent neural networks | |
Paja | Generational feature elimination to find all relevant feature subset | |
Babu et al. | Recognition of Chronic Kidney Disease Using Machine Learning | |
Wetmore et al. | Speeding up the self-organizing feature map using dynamic subset selection | |
Danubianu et al. | Unsupervised information-based feature selection for speech therapy optimization by data mining techniques |