Data Associations Between Two Hierarchy Trees
DOI10.1142/S0129054118500284zbMATH Open1415.68062OpenAlexW2901636710WikidataQ128988972 ScholiaQ128988972MaRDI QIDQ5384530FDOQ5384530
Shuo Yan, Binfeng Yan, Yunyong Zhang, Lin Yan, Jinfeng Kou
Publication date: 24 June 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054118500284
Reasoning under uncertainty in the context of artificial intelligence (68T37) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Association discovery from relational data via granular computing
- Minimum cost attribute reduction in decision-theoretic rough set models
- Information granules: Towards foundations of granular computing
- Composite rough sets for dynamic data mining
- Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
- Rough sets and intelligent data analysis
- On the rough consistency measures of logic theories and approximate reasoning in rough logic
- Quantitative analysis for covering-based rough sets through the upper approximation number
- Independence for full conditional probabilities: structure, factorization, non-uniqueness, and Bayesian networks
- Approximation Spaces in Rough–Granular Computing
- Fuzzy rough set techniques for uncertainty processing in a relational database
- Rough data-deduction based on the upper approximation
- Title not available (Why is that?)
This page was built for publication: Data Associations Between Two Hierarchy Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384530)
