Estimating attributes: analysis and extensions of RELIEF
ECML-94 Proceedings of the European conference on machine learning on Machine Learning
Web document clustering: a feasibility demonstration
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Optimizations of rough set model
Fundamenta Informaticae
Entropy-based subspace clustering for mining numerical data
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
C4.5: Programs for Machine Learning
C4.5: Programs for Machine Learning
On Clustering Validation Techniques
Journal of Intelligent Information Systems
Machine Learning
Generating Accurate Rule Sets Without Global Optimization
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Searching for Relational Patterns in Data
PKDD '97 Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery
IEEE Transactions on Pattern Analysis and Machine Intelligence
An introduction to the WEKA data mining system
Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Comparing clusterings---an information based distance
Journal of Multivariate Analysis
Exploring the boundary region of tolerance rough sets for feature selection
Pattern Recognition
A comparison of extrinsic clustering evaluation metrics based on formal constraints
Information Retrieval
The feature selection problem: traditional methods and a new algorithm
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Feature selection and dualities in maximum entropy discrimination
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Data mining with an ant colony optimization algorithm
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
As a generalization of partitions, covers allow overlaps between their members. In this paper, we will propose a family of entropy-like measures over covers, which are anti monotonic with regard to the partial order defined by refinement relations of covers. In parallel to the entropy theory, we also develop their conditional forms, which in turn lead to a family of semi-metrics on covers. These make it possible to apply entropy-based techniques in data mining or machine learning to problems naturally modelled by covers.