Abstract
Anti-drift is an emergent and challenging issue in sensor-related subjects. In this paper, we propose to address the time-varying drift (e.g. electronic nose drift), which is sometimes an ill-posed problem due to its uncertainty and unpredictability. Considering that drift is with different probability distribution from the regular data, a machine learning based subspace projection approach is proposed. The main idea behind is that given two data clusters with different probability distribution, we tend to find a latent projection P (i.e. a group of basis), such that the newly projected subspace of the two clusters is with similar distribution. In other words, drift is automatically removed or reduced by projecting the data onto a new common subspace. The merits are threefold: 1) the proposed subspace projection is unsupervised; without using any data label information; 2) a simple but effective domain distance is proposed to represent the mean distribution discrepancy metric; 3) the proposed anti-drift method can be easily solved by Eigen decomposition; and anti-drift is manifested with a well solved projection matrix in real application. Experiments on synthetic data and real datasets demonstrate the effectiveness and efficiency of the proposed anti-drift method in comparison to state-of-the-art methods.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
