2012 9th International Conference on Fuzzy Systems and Knowledge Discovery 2012
DOI: 10.1109/fskd.2012.6233736
|View full text |Cite
|
Sign up to set email alerts
|

Parallelized extraction of traffic state estimation rules based on bootstrapping rough set

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2013
2013
2016
2016

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…The analysis of computational complexity leads to various postprocessing models, such as parallel computing, probability calculation, and decision tree. For example, the evaluated complexity of rules extraction from massive traffic data is used to parallelize the attribute significance calculation in bootstrapping rough set algorithm to estimate traffic state more accurately and efficiently [23]. The work in [23] focuses on the evaluation of algorithmic complexity for the algorithmic parallelization of computationintensive problems.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…The analysis of computational complexity leads to various postprocessing models, such as parallel computing, probability calculation, and decision tree. For example, the evaluated complexity of rules extraction from massive traffic data is used to parallelize the attribute significance calculation in bootstrapping rough set algorithm to estimate traffic state more accurately and efficiently [23]. The work in [23] focuses on the evaluation of algorithmic complexity for the algorithmic parallelization of computationintensive problems.…”
Section: Related Workmentioning
confidence: 99%
“…For example, the evaluated complexity of rules extraction from massive traffic data is used to parallelize the attribute significance calculation in bootstrapping rough set algorithm to estimate traffic state more accurately and efficiently [23]. The work in [23] focuses on the evaluation of algorithmic complexity for the algorithmic parallelization of computationintensive problems. However, massive traffic data analysis urgently requires the evaluation of data-centric computational complexity to parallelize the data-intensive problems.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…These kinds of work always run into challenges of computational efficiency when dealing with large data sets. Luckily, this problem can be effectively solved by algorithmic parallelization executed on CI resources [14]. …”
Section: Related Workmentioning
confidence: 99%