2016
DOI: 10.1016/j.knosys.2015.07.040
|View full text |Cite
|
Sign up to set email alerts
|

Sequential three-way decision and granulation for cost-sensitive face recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 242 publications
(40 citation statements)
references
References 58 publications
0
40
0
Order By: Relevance
“…We observe that (18), (22) and (27) are satisfied and, in consequence, α = 0.7 and β = 0.65 by equations (19) and (21). Finally, we obtain the decision regions of the fuzzy event A …”
Section: Accepted Manuscriptmentioning
confidence: 86%
See 1 more Smart Citation
“…We observe that (18), (22) and (27) are satisfied and, in consequence, α = 0.7 and β = 0.65 by equations (19) and (21). Finally, we obtain the decision regions of the fuzzy event A …”
Section: Accepted Manuscriptmentioning
confidence: 86%
“…The DTRS approach approximates a given concept or a set by three regions (positive, negative and boundary regions) which correspond to positive, negative and boundary rules in threeway decisions (3WDs), respectively [11,50,51]. It has been applied to text classification [20,23], web-based support systems [54], cluster analysis [27,58], investment decisions [30], multi-classification [6,26,27], email filtering [17,63], government decisions [28], face recognition [22] etc. In the following, we first review developments of PRSs, DTRSs and 3WDs; then we present the main work of this paper.…”
Section: Introductionmentioning
confidence: 99%
“…To handle the nonmonotonicity of probabilistic positive region, Li and Zhou proposed a nonmonotonic attribute reduction for the DTRS model. It is not necessary for non-monotonic attribute reducts to induce the same positive region as the original attributes [30,31]. To improve the efficiency of probabilistic attribute reduction, Meng and Shi proposed a fast algorithm to compute the attribute reducts in DTRS model, in particular, the improvements include a fast division approach for equivalence class computation, a heuristic strategy of attribute selection and the post-processing techniques of super-reducts [39].…”
Section: Three-way Decision Theorymentioning
confidence: 99%
“…Firstly, we demonstrated that the probabilistic model of the piecewise-regular object is suitable to define the granularity levels. In comparison with other granularity definitions used in image recognition [8], our approach makes it possible to classify the new observation very fast, because the number of segments in the coarse-grained granules is usually low. Moreover, we paid attention to the practically important case of large number of classes.…”
Section: Fast Classification Of the Phogsmentioning
confidence: 99%