ICML 2000 - PDF Preprint Papers

ICML 2000 Workshop on Statistical Network Analysis

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICML-2000 Paper

click to vote

ICML
2000
IEEE

299views Machine Learning» more ICML 2000»

Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning

15 years 7 days ago

Download www.cs.waikato.ac.nz

Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate f...

Mark A. Hall

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	299	Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning	claim
2	220	Bounds on the Generalization Performance of Kernel Machine Ensembles	claim
3	218	Constructive Feature Learning and the Development of Visual Expertise	claim
4	214	Learning Probabilistic Models for Decision-Theoretic Navigation of Mobile Robots	claim
5	207	Discovering Homogeneous Regions in Spatial Data through Competition	claim
6	204	Hierarchical Unsupervised Learning	claim
7	192	Convergence Problems of General-Sum Multiagent Reinforcement Learning	claim
8	188	X-means: Extending K-means with Efficient Estimation of the Number of Clusters	claim
9	183	Algorithms for Inverse Reinforcement Learning	claim
10	182	Learning to Probabilistically Identify Authoritative Documents	claim
11	182	Crafting Papers on Machine Learning	claim
12	172	On-line Learning for Humanoid Robot Systems	claim
13	169	Duality and Geometry in SVM Classifiers	claim
14	169	Rates of Convergence for Variable Resolution Schemes in Optimal Control	claim
15	169	Solving the Multiple-Instance Problem: A Lazy Learning Approach	claim
16	165	A Bayesian Framework for Reinforcement Learning	claim
17	164	Behavioral Cloning of Student Pilots with Modular Neural Networks	claim
18	161	Using Error-Correcting Codes for Text Classification	claim
19	160	FeatureBoost: A Meta-Learning Algorithm that Improves Model Robustness	claim
20	158	Learning Bayesian Networks for Diverse and Varying numbers of Evidence Sets	claim
21	158	Algorithm Selection using Reinforcement Learning	claim
22	155	Maximum Entropy Markov Models for Information Extraction and Segmentation	claim
23	155	Combining Reinforcement Learning with a Local Control Algorithm	claim
24	154	Enhancing the Plausibility of Law Equation Discovery	claim
25	154	Discriminative Reranking for Natural Language Parsing	claim
26	153	Eligibility Traces for Off-Policy Policy Evaluation	claim
27	151	Bayesian Averaging of Classifiers and the Overfitting Problem	claim
28	151	Learning Declarative Control Rules for Constraint-BAsed Planning	claim
29	151	Version Space Algebra and its Application to Programming by Demonstration	claim
30	150	Lightweight Rule Induction	claim
31	148	Clustering with Instance-level Constraints	claim
32	147	Classification of Individuals with Complex Structure	claim
33	147	Data as Ensembles of Records: Representation and Comparison	claim
34	147	Learning to Fly: An Application of Hierarchical Reinforcement Learning	claim
35	147	Using Learning by Discovery to Segment Remotely Sensed Images	claim
36	146	Less is More: Active Learning with Support Vector Machines	claim
37	140	Practical Reinforcement Learning in Continuous Spaces	claim
38	138	Relative Loss Bounds for Temporal-Difference Learning	claim
39	138	Meta-Learning by Landmarking Various Learning Algorithms	claim
40	137	A Nonparametric Approach to Noisy and Costly Optimization	claim
41	137	A Boosting Approach to Topic Spotting on Subdialogues	claim
42	132	Discovering Test Set Regularities in Relational Domains	claim
43	131	Learning Subjective Functions with Large Margins	claim
44	128	Mutual Information in Learning Feature Transformations	claim
45	127	A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets	claim
46	126	Reinforcement Learning in POMDP's via Direct Gradient Ascent	claim
47	126	Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria	claim
48	126	Using Knowledge to Speed Learning: A Comparison of Knowledge-based Cascade-correlation and Multi-task Learning	claim
49	124	Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers	claim
50	124	Learning to Predict Performance from Formula Modeling and Training Data	claim
51	123	Learning to Create Customized Authority Lists	claim
52	123	Online Ensemble Learning: An Empirical Study	claim
53	122	Learning Horn Expressions with LogAn-H	claim
54	122	Incremental Learning in SwiftFile	claim
55	114	Complete Cross-Validation for Nearest Neighbor Classifiers	claim
56	112	Disciple-COA: From Agent Programming to Agent Teaching	claim
57	112	Achieving Efficient and Cognitively Plausible Learning in Backgammon	claim
58	112	Probabilistic DFA Inference using Kullback-Leibler Divergence and Minimality	claim
59	111	TPOT-RL Applied to Network Routing	claim
60	106	Multi-agent Q-learning and Regression Trees for Automated Pricing Decisions	claim
61	94	Knowledge Representation Issues in Control Knowledge Learning	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers