Optimization of control parameters for genetic algorithms
IEEE Transactions on Systems, Man and Cybernetics
Multilayer feedforward networks are universal approximators
Neural Networks
C4.5: programs for machine learning
C4.5: programs for machine learning
Variable precision rough set model
Journal of Computer and System Sciences
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Machine Learning - Special issue on learning with probabilistic representations
Task assignment with unknown duration
Journal of the ACM (JACM)
A reduction algorithm meeting users' requirements
Journal of Computer Science and Technology
Machine Learning
Rough sets and intelligent data analysis
Information Sciences—Informatics and Computer Science: An International Journal
AdaCost: Misclassification Cost-Sensitive Boosting
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Dynamic Reducts as a Tool for Extracting Laws from Decisions Tables
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Computation of Minimal Cost Reducts
ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
RSES and RSESlib - A Collection of Tools for Rough Set Computations
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Attribute Core of Decision Table
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
Consistency-based search in feature selection
Artificial Intelligence
Semantics-Preserving Dimensionality Reduction: Rough and Fuzzy-Rough-Based Approaches
IEEE Transactions on Knowledge and Data Engineering
Training Cost-Sensitive Neural Networks with Methods Addressing the Class Imbalance Problem
IEEE Transactions on Knowledge and Data Engineering
Information Sciences: an International Journal
On Three Types of Covering-Based Rough Sets
IEEE Transactions on Knowledge and Data Engineering
Top 10 algorithms in data mining
Knowledge and Information Systems
Induction of multiple fuzzy decision trees based on rough set technique
Information Sciences: an International Journal
Attribute reduction in decision-theoretic rough set models
Information Sciences: an International Journal
A hierarchical model for test-cost-sensitive decision systems
Information Sciences: an International Journal
Information Sciences: an International Journal
Parallel Reducts in a Series of Decision Subsystems
CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 02
Journal of Artificial Intelligence Research
Improving generalization of fuzzy IF-THEN rules by maximizing fuzzy entropy
IEEE Transactions on Fuzzy Systems
A general definition of an attribute reduct
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Minimal attribute space bias for attribute reduction
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Positive approximation: An accelerator for attribute reduction in rough set theory
Artificial Intelligence
Weighted reduction for decision tables
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
On reduct construction algorithms
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Knowledge reduction in inconsistent decision tables
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Accumulated cost based test-cost-sensitive attribute reduction
RSFDGrC'11 Proceedings of the 13th international conference on Rough sets, fuzzy sets, data mining and granular computing
Optimal sub-reducts with test cost constraint
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Transversal and function matroidal structures of covering-based rough sets
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Bipartite graphs and coverings
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Test cost constraint reduction with common cost
FGIT'11 Proceedings of the Third international conference on Future Generation Information Technology
Approximations and uncertainty measures in incomplete information systems
Information Sciences: an International Journal
Attribute reduction of data with error ranges and test costs
Information Sciences: an International Journal
A measurement theory view on the granularity of partitions
Information Sciences: an International Journal
A competition strategy to cost-sensitive decision trees
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Cost-Sensitive classification based on decision-theoretic rough set model
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Minimum cost attribute reduction in decision-theoretic rough set models
Information Sciences: an International Journal
Matroidal structure of rough sets and its characterization to attribute reduction
Knowledge-Based Systems
Quantitative analysis for covering-based rough sets through the upper approximation number
Information Sciences: an International Journal
Granular association rule mining through parametric rough sets
BI'12 Proceedings of the 2012 international conference on Brain Informatics
Rough matroids based on relations
Information Sciences: an International Journal
Quick attribute reduction in inconsistent decision tables
Information Sciences: an International Journal
Four matroidal structures of covering and their relationships with rough sets
International Journal of Approximate Reasoning
An extension to rough c-means clustering algorithm based on boundary area elements discrimination
Transactions on Rough Sets XVI
Incorporating logistic regression to decision-theoretic rough sets for classifications
International Journal of Approximate Reasoning
On an optimization representation of decision-theoretic rough set model
International Journal of Approximate Reasoning
Feature selection with test cost constraint
International Journal of Approximate Reasoning
Characteristic matrix of covering and its application to Boolean matrix decomposition
Information Sciences: an International Journal
Hi-index | 0.07 |
In many data mining and machine learning applications, there are two objectives in the task of classification; one is decreasing the test cost, the other is improving the classification accuracy. Most existing research work focuses on the latter, with attribute reduction serving as an optional pre-processing stage to remove redundant attributes. In this paper, we point out that when tests must be undertaken in parallel, attribute reduction is mandatory in dealing with the former objective. With this in mind, we posit the minimal test cost reduct problem which constitutes a new, but more general, difficulty than the classical reduct problem. We also define three metrics to evaluate the performance of reduction algorithms from a statistical viewpoint. A framework for a heuristic algorithm is proposed to deal with the new problem; specifically, an information gain-based @l-weighted reduction algorithm is designed, where weights are decided by test costs and a non-positive exponent @l, which is the only parameter set by the user. The algorithm is tested with three representative test cost distributions on four UCI (University of California - Irvine) datasets. Experimental results show that there is a trade-off while setting @l, and a competition approach can improve the quality of the result significantly. This study suggests potential application areas and new research trends concerning attribute reduction.