Back to Search
Start Over
RW-MC:self-adaptive random walk based matrix completion algorithm
- Source :
- Tongxin xuebao, Vol 38, Pp 95-105 (2017)
- Publication Year :
- 2017
- Publisher :
- Editorial Department of Journal on Communications, 2017.
-
Abstract
- 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.
- Subjects :
- SDWN
matrix completion
RW-MC
random walk
Telecommunication
TK5101-6720
Subjects
Details
- Language :
- Chinese
- ISSN :
- 1000436X
- Volume :
- 38
- Database :
- Directory of Open Access Journals
- Journal :
- Tongxin xuebao
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.3dd91d8dc9cd4c26bec9c52296473333
- Document Type :
- article
- Full Text :
- https://doi.org/10.11959/j.issn.1000-436x.2017186