RW-MC:self-adaptive random walk based matrix completion algorithm
Concerning the continually perceiving performance of virtual access points (VAP) was urgent in software-defined wireless network (SDWN),with the features of VAPs’ measurement data (VMD),a self-adaptive matrix completion algorithm based on random walk was proposed,named RW-MC.Firstly,the discrete rat...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2017-09-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017186/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841539488584564736 |
---|---|
author | Xin-heng WANG Qian-yun WANG Jia-jie WANG Guo-feng ZHAO Wen-qiang JIN |
author_facet | Xin-heng WANG Qian-yun WANG Jia-jie WANG Guo-feng ZHAO Wen-qiang JIN |
author_sort | Xin-heng WANG |
collection | DOAJ |
description | Concerning the continually perceiving performance of virtual access points (VAP) was urgent in software-defined wireless network (SDWN),with the features of VAPs’ measurement data (VMD),a self-adaptive matrix completion algorithm based on random walk was proposed,named RW-MC.Firstly,the discrete ratio and covering ratio of VMD account for a sample determination model was used to claim initial samples.Secondly,random walk model was implemented for generating sampling data points in the next iteration.Finally,a self-adaptive sampling redress model concerning the differences between the current error rates and normalize error rates of neighboring completion matrices.The experiments show that the approach can collect the real-time sensory data,meanwhile,maintain a relatively low error rate for a small sampling rate. |
format | Article |
id | doaj-art-2e730631c818444faacb64dfde634615 |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2017-09-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-2e730631c818444faacb64dfde6346152025-01-14T07:12:59ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2017-09-01389510559712221RW-MC:self-adaptive random walk based matrix completion algorithmXin-heng WANGQian-yun WANGJia-jie WANGGuo-feng ZHAOWen-qiang JINConcerning the continually perceiving performance of virtual access points (VAP) was urgent in software-defined wireless network (SDWN),with the features of VAPs’ measurement data (VMD),a self-adaptive matrix completion algorithm based on random walk was proposed,named RW-MC.Firstly,the discrete ratio and covering ratio of VMD account for a sample determination model was used to claim initial samples.Secondly,random walk model was implemented for generating sampling data points in the next iteration.Finally,a self-adaptive sampling redress model concerning the differences between the current error rates and normalize error rates of neighboring completion matrices.The experiments show that the approach can collect the real-time sensory data,meanwhile,maintain a relatively low error rate for a small sampling rate.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017186/SDWNmatrix completionRW-MCrandom walk |
spellingShingle | Xin-heng WANG Qian-yun WANG Jia-jie WANG Guo-feng ZHAO Wen-qiang JIN RW-MC:self-adaptive random walk based matrix completion algorithm Tongxin xuebao SDWN matrix completion RW-MC random walk |
title | RW-MC:self-adaptive random walk based matrix completion algorithm |
title_full | RW-MC:self-adaptive random walk based matrix completion algorithm |
title_fullStr | RW-MC:self-adaptive random walk based matrix completion algorithm |
title_full_unstemmed | RW-MC:self-adaptive random walk based matrix completion algorithm |
title_short | RW-MC:self-adaptive random walk based matrix completion algorithm |
title_sort | rw mc self adaptive random walk based matrix completion algorithm |
topic | SDWN matrix completion RW-MC random walk |
url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017186/ |
work_keys_str_mv | AT xinhengwang rwmcselfadaptiverandomwalkbasedmatrixcompletionalgorithm AT qianyunwang rwmcselfadaptiverandomwalkbasedmatrixcompletionalgorithm AT jiajiewang rwmcselfadaptiverandomwalkbasedmatrixcompletionalgorithm AT guofengzhao rwmcselfadaptiverandomwalkbasedmatrixcompletionalgorithm AT wenqiangjin rwmcselfadaptiverandomwalkbasedmatrixcompletionalgorithm |