Parallel attribute reduction in dominance-based neighborhood rough set

The amount of data collected from different real-world applications is increasing rapidly. When the volume of data is too large to be loaded to memory, it may be impossible to analyze it using a single computer. Although efforts have been taken to manage big data by using a single computer, the prob...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information sciences Ročník 373; s. 351 - 368
Hlavní autori: Chen, Hongmei, Li, Tianrui, Cai, Yong, Luo, Chuan, Fujita, Hamido
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 10.12.2016
Predmet:
Acceptability
Algorithms
Attribute reduction
Big data
Computation
Computer simulation
Data management
Mathematical models
Parallel algorithm
Parallel processing
Rough set models
Rough sets
Parallel algorithm
Big data
Rough sets
Attribute reduction
ISSN:0020-0255, 1872-6291
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The amount of data collected from different real-world applications is increasing rapidly. When the volume of data is too large to be loaded to memory, it may be impossible to analyze it using a single computer. Although efforts have been taken to manage big data by using a single computer, the problem may not be solved in an acceptable time frame, making parallel computing an indispensable way to handle big data. In this paper, we investigate approaches to attribute reduction in parallel using dominance-based neighborhood rough sets (DNRS), which take into consideration the partial orders among numerical and categorical attribute values, and can be utilized in a multicriteria decision-making method. We first present some properties of attribute reduction in DNRS, and then investigate principles of parallel attribute reduction in DNRS. Parallelization on different components of attribute reduction are explored in detail. Furthermore, parallel attribute reduction algorithms in DNRS are proposed. Experimental results on UCI data and big data show that the proposed parallel algorithm is both effective and efficient.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2016.09.012