C4.5: programs for machine learning
C4.5: programs for machine learning
Rough set approach to incomplete information systems
Information Sciences: an International Journal
Rules in incomplete information systems
Information Sciences: an International Journal
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Machine Learning
Maximum Consistency of Incomplete Datavia Non-Invasive Imputation
Artificial Intelligence Review
Machine Learning
Interval-Set Algebra for Qualitative Knowledge Representation
ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
A Comparison of Several Approaches to Missing Attribute Values in Data Mining
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Induction of Classification Rules by Granular Computing
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
An Analysis of Quantitative Measures Associated with Rules
PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
On the Unknown Attribute Values in Learning from Examples
ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
Concept Formation and Learning: A Cognitive Informatics Perspective
ICCI '04 Proceedings of the Third IEEE International Conference on Cognitive Informatics
"Missing Is Useful': Missing Values in Cost-Sensitive Decision Trees
IEEE Transactions on Knowledge and Data Engineering
International Journal of Approximate Reasoning
On the evaluation of the decision performance of an incomplete decision table
Data & Knowledge Engineering
Granular Computing: Granular Classifiers and Missing Values
COGINF '07 Proceedings of the 6th IEEE International Conference on Cognitive Informatics
A Two-Phase Model for Learning Rules from Incomplete Data
Fundamenta Informaticae - Fundamentals of Knowledge Technology
On characterization of generalized interval-valued fuzzy rough sets on two universes of discourse
International Journal of Approximate Reasoning
Relationship between similarity measure and entropy of interval valued fuzzy sets
Fuzzy Sets and Systems
Representing uncertainty on set-valued variables using belief functions
Artificial Intelligence
An experimental comparison of three rough set approaches to missing attribute values
Transactions on rough sets VI
Two-phase rule induction from incomplete data
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Combination entropy and combination granulation in incomplete information system
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Missing template decomposition method and its implementation in rough set exploration system
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Attribute reduction of data with error ranges and test costs
Information Sciences: an International Journal
International Journal of Approximate Reasoning
Generalized probabilistic approximations of incomplete data
International Journal of Approximate Reasoning
Multigranulation decision-theoretic rough sets
International Journal of Approximate Reasoning
On the rough consistency measures of logic theories and approximate reasoning in rough logic
International Journal of Approximate Reasoning
Artificial Intelligence in Medicine
International Journal of Approximate Reasoning
Pessimistic rough set based decisions: A multigranulation fusion strategy
Information Sciences: an International Journal
Hi-index | 0.00 |
A novel interval set approach is proposed in this paper to induce classification rules from incomplete information table, in which an interval-set-based model to represent the uncertain concepts is presented. The extensions of the concepts in incomplete information table are represented by interval sets, which regulate the upper and lower bounds of the uncertain concepts. Interval set operations are discussed, and the connectives of concepts are represented by the operations on interval sets. Certain inclusion, possible inclusion, and weak inclusion relations between interval sets are presented, which are introduced to induce strong rules and weak rules from incomplete information table. The related properties of the inclusion relations are proved. It is concluded that the strong rules are always true whatever the missing values may be, while the weak rules may be true when missing values are replaced by some certain known values. Moreover, a confidence function is defined to evaluate the weak rule. The proposed approach presents a new view on rule induction from incomplete data based on interval set.