Data associations between two hierarchy trees

DOI10.1142/S0129054118500284MaRDI QIDQ5384530zbMATH OpenOpenAlexWikidataFDO

Authors Shuo Yan, Yunyong Zhang, Binfeng Yan, 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

zbMATH Keywords

partitiondata associationgranulehierarchy treedata setnumerical information

Mathematics Subject Classification ID

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)

Recommendations

• On characterizing hierarchies of granulation structures via distances
• Granular computing approach to finding association rules in relational database
• Association discovery from relational data via granular computing
• Hierarchies on fuzzy information granulations: A knowledge distance based lattice approach
• A granular computing approach to knowledge discovery in relational databases

Cites work

• Analysis on a new discernibility function and proof about attribute reduction based on granular computing
• Approximation spaces in rough-granular computing
• Association discovery from relational data via granular computing
• Composite rough sets for dynamic data mining
• Fuzzy rough set techniques for uncertainty processing in a relational database
• Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
• Independence for full conditional probabilities: structure, factorization, non-uniqueness, and Bayesian networks
• Information granules: Towards foundations of granular computing
• Minimum cost attribute reduction in decision-theoretic rough set models
• 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
• Rough data-deduction based on the upper approximation
• Rough sets and intelligent data analysis

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)