scientific article; zbMATH DE number 1748431
From MaRDI portal
Publication:4530306
zbMATH Open1017.68053MaRDI QIDQ4530306FDOQ4530306
Authors: Ning Zhong, Yiyu Yao 
Publication date: 3 June 2002
Title of this publication is not available (Why is that?)
Recommendations
Cited In (32)
- Indiscernibility structures induced from function sets: graph and digraph case
- Set-based granular computing: a lattice model
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- New perspectives of granular computing in relation geometry induced by pairings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interpretation of Extended Pawlak Flow Graphs Using Granular Computing
- Transactions on Rough Sets I
- Granular Computing – The Concept of Generalized Constraint-Based Computation
- Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model
- Neighborhood systems and approximate retrieval
- Dependency and accuracy measures for directed graphs
- Notions from rough set theory in a generalized dependency relation context
- Title not available (Why is that?)
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- On definable concepts of rough set models
- Granular computing on information tables: families of subsets and operators
- Granular computing: an augmented scheme of degranulation through a modified partition matrix
- The granular partition lattice of an information table
- A cognitive model based on granular computing
- Degree based models of granular computing under fuzzy indiscernibility relations
- Rough sets and interactive granular computing
- Automated granule discovery in continuous data for feature selection
- An application of fuzzy hypergraphs and hypergraphs in granular computing
- Lattice representations with set partitions induced by pairings
- Title not available (Why is that?)
- Multi-granulation covering rough intuitionistic fuzzy sets
- Granule description using possible attribute analysis
- Simple graphs in granular computing
- Rough sets on graphs: new dependency and accuracy measures
- Granular computing approach to finding association rules in relational database
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530306)
