2020 International Conference on System, Computation, Automation and Networking (ICSCAN) 2020
DOI: 10.1109/icscan49426.2020.9262401
|View full text |Cite
|
Sign up to set email alerts
|

A Novel HOSFS Algorithm for Online Streaming Feature Selection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…In second step subset selection is performed by PSO Algorithm it is used to evaluate all the selected subsets and selects the best subset from the generated n number of subset. Sandhiya S and Palani U [14] proposed an online feature selection algorithm for streaming features called Heuristic Online Streaming Feature Selection (HOSFS) which has advantages on choosing features from streaming features and omits the irrelevant and redundant features in real-time by using self-adaption sliding window protocol, and Heuristic function. Which assigns heuristic value to the features using the trained heuristic function and selects features with higher heuristic value where other features are considered as irrelevant features.…”
Section: Related Workmentioning
confidence: 99%
“…In second step subset selection is performed by PSO Algorithm it is used to evaluate all the selected subsets and selects the best subset from the generated n number of subset. Sandhiya S and Palani U [14] proposed an online feature selection algorithm for streaming features called Heuristic Online Streaming Feature Selection (HOSFS) which has advantages on choosing features from streaming features and omits the irrelevant and redundant features in real-time by using self-adaption sliding window protocol, and Heuristic function. Which assigns heuristic value to the features using the trained heuristic function and selects features with higher heuristic value where other features are considered as irrelevant features.…”
Section: Related Workmentioning
confidence: 99%
“…The main difference between PRL and the just mentioned approaches is that, thanks to the feature generator component, PRL has the capability of treating problems with infinitely many features. PRL, like HOSFS [42], is also theoretically suitable for dealing with streaming of features, however, its main limitation is the efficiency that it could not be ideal in settings with high throughput.…”
Section: On-line Feature Selectionmentioning
confidence: 99%