2016 5th International Conference on Computer Science and Network Technology (ICCSNT) 2016
DOI: 10.1109/iccsnt.2016.8070156
|View full text |Cite
|
Sign up to set email alerts
|

Knowledge extraction from big data using MapReduce-based Parallel-Reduct algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…In the proposed methodology, as one of the essential phases of the technique (after calculating of the stability of pixel categories in discrete intervals), they borrowed the degree of dependence among knowledge from the classical RST as the evaluation criterion of the discretization scheme. Then, each band was scanned in turn with the strategy Zhang et al (2012), Sachin and Shubhangi (2015), Cui and Huang (2015), Jing et al (2014), Chowdhury et al (2016), Pandu (2020) Apache Spark Dagdia et al (2017), Vluymans et al (2015) of splitting and merging to obtain an optimal discrete feature set. Remote sensing image features were the input of the algorithm, and discretized features were the output.…”
Section: 1mentioning
confidence: 99%
See 1 more Smart Citation
“…In the proposed methodology, as one of the essential phases of the technique (after calculating of the stability of pixel categories in discrete intervals), they borrowed the degree of dependence among knowledge from the classical RST as the evaluation criterion of the discretization scheme. Then, each band was scanned in turn with the strategy Zhang et al (2012), Sachin and Shubhangi (2015), Cui and Huang (2015), Jing et al (2014), Chowdhury et al (2016), Pandu (2020) Apache Spark Dagdia et al (2017), Vluymans et al (2015) of splitting and merging to obtain an optimal discrete feature set. Remote sensing image features were the input of the algorithm, and discretized features were the output.…”
Section: 1mentioning
confidence: 99%
“…(2012),Sun et al (2019),Sachin and Shubhangi (2015),Jing et al (2014),Banerjee and Badr (2018), Hong-Wei and Xindi (2016),Narayanan et al (2017),Chowdhury et al (2016),Pal (2020),Li et al (2019), Vluymans et al (2015), Wang et al (2016b), Zhao et al (2020) Cloud computing Zhang et al (2012), Sun et al (2019), Kune (2014), Qu et al (2019), Li et al (2015), Wang et al (2016b), Grzegorowski et al (2017) Rule induction Zhou and Lin (2018), Wang et al (2016b) Data clustering Wan and Li (2019), Cui and Gao (2019), Xie (2018), Grzegorowski et al (2017), Li et al (2021), Janusz and Ślęzak (2014) RS-based approximate SQL Naouali and Missaoui (2005), Ślęzak et al (2012; 2018) Hybridizations Local rough sets Skowron et al (2018), Yang et al (2017), Qiana et al…”
mentioning
confidence: 99%
“…In the scenario of big data, in multi-database integration environment, [1] give general algorithms and basic algorithms for different aspects of network paradox knowledge discovery. Based on rough set theory, [2] use parallel-reduction algorithm for knowledge extraction and it is suitable for large data sets with different roughness. In the process of constructing enterprise knowledge graphs, the inconsistency and knowledge conflicts are solved by [3] using the associated data paradigm algorithm.…”
Section: Related Workmentioning
confidence: 99%