Home › Entities › academia › A Distributed Rough Set Theory Algorithm based on Locality Sensitive Hashing for an Efficient Big Data Pre-processing

A Distributed Rough Set Theory Algorithm based on Locality Sensitive Hashing for an Efficient Big Data Pre-processing

Research article (2018 IEEE International Conference on Big Data (Big Data), 2018) · cited 10× · AI/ML
academia openalex:W2912720401
Press Enter · cited answer in seconds

A Distributed Rough Set Theory Algorithm based on Locality Sensitive Hashing for an Efficient Big Data Pre-processing

Summary

A Distributed Rough Set Theory Algorithm based on Locality Sensitive Hashing for an Efficient Big Data Pre-processing is a scholarly article[1].

Key Facts

  • A Distributed Rough Set Theory Algorithm based on Locality Sensitive Hashing for an Efficient Big Data Pre-processing's instance of is recorded as scholarly article[2].

Related Entities

Christine Zarges

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). A Distributed Rough Set Theory Algorithm based on Locality Sensitive Hashing for an Efficient Big Data Pre-processing. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-distributed-rough-set-theory-algorithm-based-on-locality-sensitive-hashing-for-an-efficient-big-data-pre-processing
MLA “A Distributed Rough Set Theory Algorithm based on Locality Sensitive Hashing for an Efficient Big Data Pre-processing.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-distributed-rough-set-theory-algorithm-based-on-locality-sensitive-hashing-for-an-efficient-big-data-pre-processing.
BibTeX @misc{4ortxyz_a-distributed-rough-set-theory-algorithm-based-on-locality-sensitive-hashing-for-an-efficient-big-data-pre-processing_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A Distributed Rough Set Theory Algorithm based on Locality Sensitive Hashing for an Efficient Big Data Pre-processing}}, year = {2026}, url = {https://4ort.xyz/entity/a-distributed-rough-set-theory-algorithm-based-on-locality-sensitive-hashing-for-an-efficient-big-data-pre-processing}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A Distributed Rough Set Theory Algorithm based on Locality Sensitive Hashing for an Efficient Big Data Pre-processing — https://4ort.xyz/entity/a-distributed-rough-set-theory-algorithm-based-on-locality-sensitive-hashing-for-an-efficient-big-data-pre-processing (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/a-distributed-rough-set-theory-algorithm-based-on-locality-sensitive-hashing-for-an-efficient-big-data-pre-processing · Last refreshed: