Improved robust Kalman filtering for uncertain systems with missing measurements

In this paper, a novel robust finite-horizon Kalman filter is developed for discrete linear time-varying systems with missing measurements and normbounded parameter uncertainties. The missing measurements are modelled by a Bernoulli distributed sequence and the system parameter uncertainties are in the state and output matrices. A two stage recursive structure is considered for the Kalman filter and its parameters are determined guaranteeing that the covariances of the state estimation errorsare not more than the known upper bound. Finally, simulation results are presented to illustrate the outperformance of the proposed robust estimator compared with the previous results in the literature.

An effective privacy preserving algorithm for neighborhood-based collaborative filtering

As a popular technique in recommender systems, Collaborative Filtering (CF) has been the focus of significant attention in recent years, however, its privacy-related issues, especially for the neighborhood-based CF methods, cannot be overlooked. The aim of this study is to address these privacy issues in the context of neighborhood-based CF methods by proposing a Private Neighbor Collaborative Filtering (PNCF) algorithm. This algorithm includes two privacy preserving operations: Private Neighbor Selection and Perturbation. Using the item-based method as an example, Private Neighbor Selection is constructed on the basis of the notion of differential privacy, meaning that neighbors are privately selected for the target item according to its similarities with others. Recommendation-Aware Sensitivity and a re-designed differential privacy mechanism are introduced in this operation to enhance the performance of recommendations. A Perturbation operation then hides the true ratings of selected neighbors by adding Laplace noise. The PNCF algorithm reduces the magnitude of the noise introduced from the traditional differential privacy mechanism. Moreover, a theoretical analysis is provided to show that the proposed algorithm can resist a KNN attack while retaining the accuracy of recommendations. The results from experiments on two real datasets show that the proposed PNCF algorithm can obtain a rigid privacy guarantee without high accuracy loss. © 2013 Published by Elsevier B.V. All rights reserved.

Biomedical signal filtering for noisy environments

 Luke's work addresses issue of robustly attenuating multi-source noise from surface EEG signals using a novel Adaptive-Multiple-Reference Least-Means-Squares filter (AMR-LMS). In practice, the filter successfully removes electrical interference and muscle noise generated during movement which contaminates EEG, allowing subjects to maintain maximum mobility throughout signal acquisition and during the use of a Brain Computer Interface.

Modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach

Learning preference models from human generated data is an important task in modern information processing systems. Its popular setting consists of simple input ratings, assigned with numerical values to indicate their relevancy with respect to a specific query. Since ratings are often specified within a small range, several objects may have the same ratings, thus creating ties among objects for a given query. Dealing with this phenomena presents a general problem of modelling preferences in the presence of ties and being query-specific. To this end, we present in this paper a novel approach by constructing probabilistic models directly on the collection of objects exploiting the combinatorial structure induced by the ties among them. The proposed probabilistic setting allows exploration of a super-exponential combinatorial state-space with unknown numbers of partitions and unknown order among them. Learning and inference in such a large state-space are challenging, and yet we present in this paper efficient algorithms to perform these tasks. Our approach exploits discrete choice theory, imposing generative process such that the finite set of objects is partitioned into subsets in a stagewise procedure, and thus reducing the state-space at each stage significantly. Efficient Markov chain Monte Carlo algorithms are then presented for the proposed models. We demonstrate that the model can potentially be trained in a large-scale setting of hundreds of thousands objects using an ordinary computer. In fact, in some special cases with appropriate model specification, our models can be learned in linear time. We evaluate the models on two application areas: (i) document ranking with the data from the Yahoo! challenge and (ii) collaborative filtering with movie data. We demonstrate that the models are competitive against state-of-the-arts.

Multivariate adaptive autoregressive modeling and kalman filtering for motor imagery BCI

Adaptive autoregressive (AAR) modeling of the EEG time series and the AAR parameters has been widely used in Brain computer interface (BCI) systems as input features for the classification stage. Multivariate adaptive autoregressive modeling (MVAAR) also has been used in literature. This paper revisits the use of MVAAR models and propose the use of adaptive Kalman filter (AKF) for estimating the MVAAR parameters as features in a motor imagery BCI application. The AKF approach is compared to the alternative short time moving window (STMW) MVAAR parameter estimation approach. Though the two MVAAR methods show a nearly equal classification accuracy, the AKF possess the advantage of higher estimation update rates making it easily adoptable for on-line BCI systems.

Human perception-based washout filtering using genetic algorithm

The Motion Cueing Algorithm (MCA) transforms longitudinal and rotational motions into simulator movement, aiming to regenerate high fidelity motion within the simulators physical limitations. Classical washout filters are widely used in commercial simulators because of their relative simplicity and reasonable performance. The main drawback of classical washout filters is the inappropriate empirical parameter tuning method that is based on trial-and-error, and is effected by programmers’ experience. This is the most important obstacle to exploiting the platform efficiently. Consequently, the conservative motion produces false cue motions. Lack of consideration for human perception error is another deficiency of classical washout filters and also there is difficulty in understanding the effect of classical washout filter parameters on generated motion cues. The aim of this study is to present an effortless optimization method for adjusting the classical MCA parameters, based on the Genetic Algorithm (GA) for a vehicle simulator in order to minimize human sensation error between the real and simulator driver while exploiting the platform within its physical limitations. The vestibular sensation error between the real and simulator driver as well as motion limitations have been taken into account during optimization. The proposed optimized MCA based on GA is implemented in MATLAB/Simulink. The results show the superiority of the proposed MCA as it improved the human sensation, maximized reference signal shape following and exploited the platform more efficiently within the motion constraints.

Privacy preserving collaborative filtering for KNN attack resisting

Privacy preserving is an essential aspect of modern recommender systems. However, the traditional approaches can hardly provide a rigid and provable privacy guarantee for recommender systems, especially for those systems based on collaborative filtering (CF) methods. Recent research revealed that by observing the public output of the CF, the adversary could infer the historical ratings of the particular user, which is known as the KNN attack and is considered a serious privacy violation for recommender systems. This paper addresses the privacy issue in CF by proposing a Private Neighbor Collaborative Filtering (PriCF) algorithm, which is constructed on the basis of the notion of differential privacy. PriCF contains an essential privacy operation, Private Neighbor Selection, in which the Laplace noise is added to hide the identity of neighbors and the ratings of each neighbor. To retain the utility, the Recommendation-Aware Sensitivity and a re-designed truncated similarity are introduced to enhance the performance of recommendations. A theoretical analysis shows that the proposed algorithm can resist the KNN attack while retaining the accuracy of recommendations. The experimental results on two real datasets show that the proposed PriCF algorithm retains most of the utility with a fixed privacy budget.

New results on H∞ filtering for nonlinear large-scale systems with interconnected time-varying delays

This paper proposes a new design method of H∞ filtering for nonlinear large-scale systems with interconnected time-varying delays. The interaction terms with interval time-varying delays are bounded by nonlinear bounding functions including all states of the subsystems. A stable linear filter is designed to ensure that the filtering error system is exponentially stable with a prescribed convergence rate. By constructing a set of improved Lyapunov functions and using generalized Jensen inequality, new delay-dependent conditions for designing H∞ filter are obtained in terms of linear matrix inequalities. Finally, an example is provided to illustrate the effectiveness of the proposed result.

Human perception-based washout filtering

 Through this research we have developed a new Motion Cueing Algorithm (MCA) based on Genetic Algorithm. This method accurately produces translational and rotational motions in a simulator platform with high fidelity and within the simulator’s physical limitations. The results show the superiority of the proposed MCA compared with previous methods.

Process capability estimation for leukocyte filtering process in blood service: a comparison study

This article considers a comparison study between different non-normal process capability estimation methods and utilizing themin the leukocyte filtering process in blood service sectors. Since the amount of leukocyte in a unit of the blood is a critical issue inthe blood transfusion process and patient safety, estimating and monitoring the capability of the leukocyte filtering process to meetthe target window is very important for blood service sectors. However, observed data from the leukocyte filtering process showthat the leukocyte levels after filtering demonstrate a right skewed distribution and applying conventional methods with a normalityassumption fails to provide trustful results. Hence, we first conduct a simulation study to compare different methods in estimating theprocess capability index of non-normal processes and then we apply these techniques to obtain the process capability of the leukocytefiltering process. The study reveals that the Box-Cox transformation method provides reliable estimation of the process capability ofthe leukocyte filtering process.

Filtering redundant data from RFID data streams

Radio Frequency Identification (RFID) enabled systems are evolving in many applications that need to know the physical location of objects such as supply chain management. Naturally, RFID systems create large volumes of duplicate data. As the duplicate data wastes communication, processing, and storage resources as well as delaying decision-making, filtering duplicate data from RFID data stream is an important and challenging problem. Existing Bloom Filter-based approaches for filtering duplicate RFID data streams are complex and slow as they use multiple hash functions. In this paper, we propose an approach for filtering duplicate data from RFID data streams. The proposed approach is based on modified Bloom Filter and uses only a single hash function. We performed extensive empirical study of the proposed approach and compared it against the Bloom Filter, d-Left Time Bloom Filter, and the Count Bloom Filter approaches. The results show that the proposed approach outperforms the baseline approaches in terms of false positive rate, execution time, and true positive rate.

Collaborative filtering via sparse Markov random fields

Recommender systems play a central role in providing individualized access to information and services. This paper focuses on collaborative filtering, an approach that exploits the shared structure among mind-liked users and similar items. In particular, we focus on a formal probabilistic framework known as Markov random fields (MRF). We address the open problem of structure learning and introduce a sparsity-inducing algorithm to automatically estimate the interaction structures between users and between items. Item-item and user-user correlation networks are obtained as a by-product. Large-scale experiments on movie recommendation and date matching datasets demonstrate the power of the proposed method.