Pages that link to "Item:Q1750532"

The following pages link to Efficient parallel Boolean matrix based algorithms for computing composite rough set approximations (Q1750532):

Displaying 14 items.

• An incremental attribute reduction approach based on knowledge granularity under the attribute generalization (Q313000) (← links)
• A sequential three-way approach to multi-class decision (Q1726322) (← links)
• The investigation of covering rough sets by Boolean matrices (Q1783937) (← links)
• Distributed approach for computing rough set approximations of big incomplete information systems (Q2056292) (← links)
• An incremental attribute reduction method for dynamic data mining (Q2200538) (← links)
• Novel systematic mathematical computation based on the spiking frequency gate (SFG): innovative organization of spiking computer (Q2200720) (← links)
• Semi-monolayer covering rough set on set-valued information systems and its efficient computation (Q2237123) (← links)
• Design of logic gates using spiking neural P systems with homogeneous neurons and astrocytes-like control (Q2282261) (← links)
• Dynamical updating fuzzy rough approximations for hybrid data under the variation of attribute values (Q2291781) (← links)
• Incremental updating of rough approximations in interval-valued information systems under attribute generalization (Q2293061) (← links)
• Six-set approximation theorem of neighborhood related rough sets (Q2302816) (← links)
• Double-local rough sets for efficient data mining (Q6092076) (← links)
• Variable precision multi-granulation composite rough sets with multi-decision and their applications to medical diagnosis (Q6125199) (← links)
• Divide and conquer: a granular concept-cognitive computing system for dynamic classification decision making (Q6167411) (← links)