scientific article; zbMATH DE number 1748431

zbMath1017.68053MaRDI QIDQ4530306

Ning Zhong, Y. Y. Yao

Publication date: 3 June 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

granular computing model

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (15)

Multi-granulation covering rough intuitionistic fuzzy sets ⋮ Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ On definable concepts of rough set models ⋮ Rough sets on graphs: New dependency and accuracy measures ⋮ Neighborhood systems and approximate retrieval ⋮ Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model ⋮ Simple graphs in granular computing ⋮ Automated granule discovery in continuous data for feature selection ⋮ Dependency and accuracy measures for directed graphs ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Interpretation of Extended Pawlak Flow Graphs Using Granular Computing ⋮ Lattice representations with set partitions induced by pairings ⋮ An application of fuzzy hypergraphs and hypergraphs in granular computing ⋮ Degree based models of granular computing under fuzzy indiscernibility relations

This page was built for publication: