Granular computing on binary relations

MaRDI QIDQ4484261zbMATH OpenFDO

Authors Tsau Young Lin

Publication date 12 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2475/24750296.htm

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• scientific article; zbMATH DE number 1303620
• Granular computing approach to finding association rules in relational database
• scientific article; zbMATH DE number 1303621
• The Measures Relationships Study of Three Soft Rules Based on Granular Computing
• scientific article; zbMATH DE number 1748431

Cited in

(14)

• Three-way decision making approach to conflict analysis and resolution using probabilistic rough set over two universes
• New perspectives of granular computing in relation geometry induced by pairings
• Rough set-based conflict analysis model and method over two universes
• Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model
• Generalized rough sets based on relations
• Toward a generalized theory of uncertainty (GTU) -- an outline
• The connectivity of the covering approximation space
• Model on Analysis of Industrial Relation Based on the Binary Relation Theory
• Attribute reduction of data with error ranges and test costs
• General expression of knowledge granularity based on a fuzzy relation matrix
• Three-way decisions with evaluative linguistic expressions
• Consensus in preference-based conflict situations
• The fourth type of covering-based rough sets
• Three-way compound conflict analysis under multi-valued agent-agent mutual selection environment

This page was built for publication: Granular computing on binary relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484261)