2015
DOI: 10.1117/12.2205909
|View full text |Cite
|
Sign up to set email alerts
|

Fast algorithm for feature extraction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…The features extracted are the reduct. For an information system = ( , , , ) , where is a finite nonempty set of objects and is a finite nonempty set of attributes, is a nonempty set of values, and is an information function that maps an object in to exactly one value in , the feature reduction steps is given as follows [17]:…”
Section: Feature Extraction Algorithmmentioning
confidence: 99%
“…The features extracted are the reduct. For an information system = ( , , , ) , where is a finite nonempty set of objects and is a finite nonempty set of attributes, is a nonempty set of values, and is an information function that maps an object in to exactly one value in , the feature reduction steps is given as follows [17]:…”
Section: Feature Extraction Algorithmmentioning
confidence: 99%