AP Selection for Indoor Localization Based on Neighborhood Rough Sets

Author(s):  
Yu-jia Zhu ◽  
Zhong-liang Deng
2017 ◽  
Vol 67 ◽  
pp. 59-68 ◽  
Author(s):  
Yumin Chen ◽  
Zunjun Zhang ◽  
Jianzhong Zheng ◽  
Ying Ma ◽  
Yu Xue

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 39678-39688 ◽  
Author(s):  
Zhixuan Deng ◽  
Zhonglong Zheng ◽  
Dayong Deng ◽  
Tianxiang Wang ◽  
Yiran He ◽  
...  

2019 ◽  
Vol 483 ◽  
pp. 1-20 ◽  
Author(s):  
Hongmei Chen ◽  
Tianrui Li ◽  
Xin Fan ◽  
Chuan Luo

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Jie Yang ◽  
Tian Luo ◽  
Fan Zhao ◽  
Shuai Li ◽  
Wei Zhou

Information granule is the basic element in granular computing (GrC), and it can be obtained according to the granulation criterion. In neighborhood rough sets, current uncertainty measures focus on computing the knowledge granulation of single granular space and have two main limitations: (i) neglecting the structural information of boundary regions and (ii) the inability to reflect the difference between neighborhood granular spaces with the same uncertainty for approximating a target concept. Firstly, a fuzziness-based uncertainty measure for neighborhood rough sets is introduced to characterize the structural information of boundary regions. Moreover, from the perspective of distance, based on the idea of density peaks, we present a fuzzy-neighborhood-granule-distance- (FNGD-) based method to discover the relationship between granules in a granular space. Then, to characterize the difference between granular spaces for approximating a target concept, we present the fuzzy neighborhood granular space distance (FNGSD) and fuzzy neighborhood boundary region distance (FNBRD). FNGD, FNGSD, and FNBRD are hierarchically organized from fineness to coarseness according to the semantics of granularity, which provide three-layer perspectives in the neighborhood system.


2018 ◽  
Vol 318 ◽  
pp. 271-286 ◽  
Author(s):  
Yuwen Li ◽  
Yaojin Lin ◽  
Jinghua Liu ◽  
Wei Weng ◽  
Zhenkun Shi ◽  
...  

2021 ◽  
pp. 1-11
Author(s):  
Jie Yang ◽  
Tian Luo ◽  
Lijuan Zeng ◽  
Xin Jin

Neighborhood rough sets (NRS) are the extended model of the classical rough sets. The NRS describe the target concept by upper and lower neighborhood approximation boundaries. However, the method of approximately describing the uncertain target concept with existed neighborhood information granules is not given. To solve this problem, the cost-sensitive approximation model of the NRS is proposed in this paper, and its related properties are analyzed. To obtain the optimal approximation granular layer, the cost-sensitive progressive mechanism is proposed by considering user requirements. The case study shows that the reasonable granular layer and its approximation can be obtained under certain constraints, which is suitable for cost-sensitive application scenarios. The experimental results show that the advantage of the proposed approximation model, moreover, the decision cost of the NRS approximation model will monotonically decrease with granularity being finer.


2021 ◽  
pp. 107868
Author(s):  
Tareq M. Al-shami ◽  
Davide Ciucci

Sign in / Sign up

Export Citation Format

Share Document