Wrappers for feature subset selection
Artificial Intelligence - Special issue on relevance
Rough computational methods for information systems
Artificial Intelligence
Uncertainly measures of rough set prediction
Artificial Intelligence
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
The algorithm on knowledge reduction in incomplete information systems
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Machine Learning
Rough set methods in feature selection and recognition
Pattern Recognition Letters - Special issue: Rough sets, pattern recognition and data mining
Feature Selection Using Rough Sets Theory
ECML '93 Proceedings of the European Conference on Machine Learning
Fundamenta Informaticae
An introduction to variable and feature selection
The Journal of Machine Learning Research
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
Information-preserving hybrid data reduction based on fuzzy-rough techniques
Pattern Recognition Letters
A Comparative Study of Algebra Viewpoint and Information Viewpoint in Attribute Reduction
Fundamenta Informaticae
Measures for evaluating the decision performance of a decision table in rough set theory
Information Sciences: an International Journal
Attribute reduction in decision-theoretic rough set models
Information Sciences: an International Journal
Probabilistic rough set approximations
International Journal of Approximate Reasoning
Computational Intelligence and Feature Selection: Rough and Fuzzy Approaches
Computational Intelligence and Feature Selection: Rough and Fuzzy Approaches
Discernibility matrix simplification for constructing attribute reducts
Information Sciences: an International Journal
Knowledge structure, knowledge granulation and knowledge distance in a knowledge base
International Journal of Approximate Reasoning
FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute
Transactions on Rough Sets IX
Information Processing and Management: an International Journal - Special issue: Formal methods for information retrieval
A roughness measure for fuzzy sets
Information Sciences: an International Journal
Positive approximation: An accelerator for attribute reduction in rough set theory
Artificial Intelligence
The feature selection problem: traditional methods and a new algorithm
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning
Diverse reduct subspaces based co-training for partially labeled data
International Journal of Approximate Reasoning
Analysis of association rule mining on quantitative concept lattice
AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
Multigranulation rough sets: From partition to covering
Information Sciences: an International Journal
FRPS: A Fuzzy Rough Prototype Selection method
Pattern Recognition
Multigranulation decision-theoretic rough sets
International Journal of Approximate Reasoning
Feature selection with test cost constraint
International Journal of Approximate Reasoning
On the rough consistency measures of logic theories and approximate reasoning in rough logic
International Journal of Approximate Reasoning
Knowledge reduction for decision tables with attribute value taxonomies
Knowledge-Based Systems
International Journal of Approximate Reasoning
Hi-index | 0.00 |
Feature selection is a challenging problem in many areas such as pattern recognition, machine learning and data mining. Rough set theory, as a valid soft computing tool to analyze various types of data, has been widely applied to select helpful features (also called attribute reduction). In rough set theory, many feature selection algorithms have been developed in the literatures, however, they are very time-consuming when data sets are in a large scale. To overcome this limitation, we propose in this paper an efficient rough feature selection algorithm for large-scale data sets, which is stimulated from multi-granulation. A sub-table of a data set can be considered as a small granularity. Given a large-scale data set, the algorithm first selects different small granularities and then estimate on each small granularity the reduct of the original data set. Fusing all of the estimates on small granularities together, the algorithm can get an approximate reduct. Because of that the total time spent on computing reducts for sub-tables is much less than that for the original large-scale one, the algorithm yields in a much less amount of time a feature subset (the approximate reduct). According to several decision performance measures, experimental results show that the proposed algorithm is feasible and efficient for large-scale data sets.