Granular cabin: an efficient solution to neighborhood learning in big data

DOI10.1016/j.ins.2021.11.034OpenAlexW3217487116MaRDI QIDQ6188177

No author found.

Publication date: 1 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.11.034

zbMATH Keywords

computational efficiencygranular computingneighborhood rough setneighborhood learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Computational aspects of data analysis and big data (68T09)

Cites Work

• Covering based rough set approximations
• Quick attribute reduct algorithm for neighborhood rough set model
• Neighborhood systems and approximate retrieval
• Neighborhood rough set based heterogeneous feature subset selection
• Notions from rough set theory in a generalized dependency relation context
• Local rough set: a solution to rough data analysis in big data
• Pseudo-label neighborhood rough set: measures and attribute reductions
• Attribute reduction based on \(k\)-nearest neighborhood rough sets
• Attribute group for attribute reduction
• Incremental three-way neighborhood approach for dynamic incomplete hybrid data
• A novel fuzzy rough set model with fuzzy neighborhood operators
• Feature selection using neighborhood entropy-based uncertainty measures for gene expression data classification
• A neighborhood rough set model with nominal metric embedding
• Covering-based variable precision fuzzy rough sets with PROMETHEE-EDAS methods
• Object similarity measures and Pawlak's indiscernibility on decision tables
• Rough sets
• Decision systems in rough set theory: A set operatorial perspective

This page was built for publication: Granular cabin: an efficient solution to neighborhood learning in big data