A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique

DOI10.3233/FI-2021-2069MaRDI QIDQ5025039

Christine Zarges, Dagdia Zaineb Chelly

Publication date: 1 February 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

rough set theorygranular computingbig datafeature selectionlocality sensitive hashingdistributed processing

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• UCI-ml
• MPI
• Hadoop
• Apache Spark

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rudiments of rough sets
• Positive approximation: an accelerator for attribute reduction in rough set theory
• Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
• Evolutionary feature selection for big data classification: a MapReduce approach
• Scalable density-based clustering with quality guarantees using random projections
• A distributed approach for graph mining in massive networks
• Scalable time series classification
• Discovering outlying aspects in large datasets
• Multiple Bayesian discriminant functions for high-dimensional massive data classification
• Classification of high-dimensional evolving data streams via a resource-efficient online ensemble
• On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts
• Similarity estimation techniques from rounding algorithms
• Rough set methods in feature selection and recognition
• 10.1162/153244303322753616
• Locality-sensitive hashing scheme based on p-stable distributions
• Unsupervised rough set classification using GAs

This page was built for publication: A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique