Information-theoretic measures for knowledge discovery and data mining
From MaRDI portal
Recommendations
Cited in
(20)- Community detection by \(L_{0}\)-penalized graph Laplacian
- A measurement theory view on the granularity of partitions
- On the entropy of couplings
- Interactive comparison of multifield scalar data based on largest contours
- Attribute association based privacy preservation for multi trust level environment
- Mining non-redundant diverse patterns: an information theoretic perspective
- Maximum entropy models and subjective interestingness: an application to tiles in binary databases
- scientific article; zbMATH DE number 1958527 (Why is no real title available?)
- Entropy and co-entropy of a covering approximation space
- Information-theoretic measures associated with rough set approximations
- Foundations of Info-Metrics
- Entropy measures and granularity measures for set-valued information systems
- Objective measures for association pattern analysis
- Hierarchical Community Detection by Recursive Partitioning
- Optimization via low-rank approximation for community detection in networks
- A pseudo-likelihood approach to community detection in weighted networks
- Modeling sparsity in count-weighted networks with stochastic block models
- Breaking the curse of dimensionality: hierarchical Bayesian network model for multi-view clustering
- Pseudo-likelihood methods for community detection in large sparse networks
- Fuzzy-rough attribute reduction via mutual information with an application to cancer classification
This page was built for publication: Information-theoretic measures for knowledge discovery and data mining
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4817082)
