Wearable Health Devices (WHDs) are increasingly helping people to better monitor their health status both at an activity/fitness level for self-health tracking and at a medical level providing more data to clinicians with a potential for earlier diagnostic and guidance of treatment. The technology revolution in the miniaturization of electronic devices is enabling to design more reliable and adaptable wearables, contributing for a world-wide change in the health monitoring approach. In this paper we review important aspects in the WHDs area, listing the state-of-the-art of wearable vital signs sensing technologies plus their system architectures and specifications. A focus on vital signs acquired by WHDs is made: first a discussion about the most important vital signs for health assessment using WHDs is presented and then for each vital sign a description is made concerning its origin and effect on heath, monitoring needs, acquisition methods and WHDs and recent scientific developments on the area (electrocardiogram, heart rate, blood pressure, respiration rate, blood oxygen saturation, blood glucose, skin perspiration, capnography, body temperature, motion evaluation, cardiac implantable devices and ambient parameters). A general WHDs system architecture is presented based on the state-of-the-art. After a global review of WHDs, we zoom in into cardiovascular WHDs, analysing commercial devices and their applicability versus quality, extending this subject to smart t-shirts for medical purposes. Furthermore we present a resumed evolution of these devices based on the prototypes developed along the years. Finally we discuss likely market trends and future challenges for the emerging WHDs area.

/pdf/wearable-health-devices-vital-sign-monitoring-systems-and-1g7q5ia3k7.pdf

Wearable Health Devices-Vital Sign Monitoring, Systems and Technologies.

Recent advances in technology have brought major breakthroughs in data collection, enabling a large amount of data to be gathered over time and thus generating time series. Mining this data has become an important task for researchers and practitioners in the past few years, including the detection of outliers or anomalies that may represent errors or events of interest. This review aims to provide a structured and comprehensive state-of-the-art on unsupervised outlier detection techniques in the context of time series. To this end, a taxonomy is presented based on the main aspects that characterize an outlier detection technique.

A Review on Outlier/Anomaly Detection in Time Series Data

Demand-side management technology is a key element of the proposed smart grid, which will help utilities make more efficient use of their generation assets by reducing consumers’ energy demand during peak load periods. However, although some modern appliances can respond to price signals from the utility companies, there is a vast stock of older appliances that cannot. For such appliances, utilities must infer what appliances are operating in a home, given only the power signals on the main feeder to the home (i.e., the home’s power consumption must be disaggregated into individual appliances). We report on an in-depth investigation of multi-label classification algorithms for disaggregating appliances in a power signal. A systematic review of this research topic shows that this class of algorithms has received little attention in the literature, even though it is arguably a more natural fit to the disaggregation problem than the traditional single-label classifiers used to date. We examine a multi-label meta-classification framework (RA ${k}$ EL), and a bespoke multi-label classification algorithm (ML ${k}$ NN), employing both time-domain and wavelet-domain feature sets. We test these classifiers on two real houses from the Reference Energy Disaggregation Dataset. We found that the multilabel algorithms are effective and competitive with published results on the datasets.

Toward Non-Intrusive Load Monitoring via Multi-Label Classification

Transfer learning (TL) has been successfully applied to many real-world problems that traditional machine learning (ML) cannot handle, such as image processing, speech recognition, and natural language processing (NLP). Commonly, TL tends to address three main problems of traditional machine learning: (1) insufficient labeled data, (2) incompatible computation power, and (3) distribution mismatch. In general, TL can be organized into four categories: transductive learning, inductive learning, unsupervised learning, and negative learning. Furthermore, each category can be organized into four learning types: learning on instances, learning on features, learning on parameters, and learning on relations. This article presents a comprehensive survey on TL. In addition, this article presents the state of the art, current trends, applications, and open challenges.

A Decade Survey of Transfer Learning (2010–2020)

Despite its importance, walking direction is still a key context lacking a cost-effective and continuous solution that people can access in indoor environments. Recently, device-free sensing has attracted great attention because these techniques do not require the user to carry any device and hence could enable many applications in smart homes and offices. In this paper, we present WiDir, the first system that leverages WiFi wireless signals to estimate a human's walking direction, in a device-free manner. Human motion changes the multipath distribution and thus WiFi Channel State Information at the receiver end. WiDir analyzes the phase change dynamics from multiple WiFi subcarriers based on Fresnel zone model and infers the walking direction. We implement a proof-of-concept prototype using commercial WiFi devices and evaluate it in both home and office environments. Experimental results show that WiDir can estimate human walking direction with a median error of less than 10 degrees.

WiDir: walking direction estimation using wireless signals

Given a data set D containing millions of data points and a data consumer who is willing to pay for $X to train a machine learning (ML) model over D, how should we distribute this $X to each data point to reflect its "value"? In this paper, we define the "relative value of data" via the Shapley value, as it uniquely possesses properties with appealing real-world interpretations, such as fairness, rationality and decentralizability. For general, bounded utility functions, the Shapley value is known to be challenging to compute: to get Shapley values for all N data points, it requires O(2N) model evaluations for exact computation and O(N log N) for (ϵ, δ)-approximation.In this paper, we focus on one popular family of ML models relying on K-nearest neighbors (KNN). The most surprising result is that for unweighted KNN classifiers and regressors, the Shapley value of all N data points can be computed, exactly, in O(N log N) time - an exponential improvement on computational complexity! Moreover, for (ϵ, δ)-approximation, we are able to develop an algorithm based on Locality Sensitive Hashing (LSH) with only sublinear complexity O(Nh(ϵ, K) log N) when ϵ is not too small and K is not too large. We empirically evaluate our algorithms on up to 10 million data points and even our exact algorithm is up to three orders of magnitude faster than the baseline approximation algorithm. The LSH-based approximation algorithm can accelerate the value calculation process even further.We then extend our algorithm to other scenarios such as (1) weighed KNN classifiers, (2) different data points are clustered by different data curators, and (3) there are data analysts providing computation who also requires proper valuation. Some of these extensions, although also being improved exponentially, are less practical for exact computation (e.g., O(NK) complexity for weigthed KNN). We thus propose an Monte Carlo approximation algorithm, which is O(N(log N)2/(log K)2) times more efficient than the baseline approximation algorithm.

/pdf/efficient-task-specific-data-valuation-for-nearest-neighbor-26cs0j2drv.pdf

Efficient task-specific data valuation for nearest neighbor algorithms

Accurate Location Based Service (LBS) is one of the fundamental but crucial services in the era of Internet of Things (IoT). WiFi fingerprinting-based Indoor Positioning System (IPS) has become the most promising solution for indoor LBS. However, the offline calibrated received signal strength (RSS) radio map is unable to provide consistent LBS with high localization accuracy under various environmental dynamics. To address this issue, we propose TKL-WinSMS as a systematic strategy, which is able to realize robust and adaptive indoor localization in dynamic indoor environments. We developed a WiFi-based Non-intrusive Sensing and Monitoring System (WinSMS) that enables WiFi routers as online reference points by extracting real-time RSS readings among them. With these online data and labeled source data from the offline calibrated radio map, we further combine the RSS readings from target mobile devices as unlabeled target data, to design a robust localization model using an emerging transfer learning algorithm, namely transfer kernel learning (TKL). It is able to learn a domain-invariant kernel by directly matching the source and target distributions in the reproducing kernel Hilbert space instead of the raw noisy signal space. The resultant kernel can be used as input for the SVR training procedure. In this manner, the trained localization model can inherit the information from online phase to adaptively enhance the offline calibrated radio map. Extensive experiments were conducted and demonstrated that the proposed TKL- WinSMS is able to improve the localization accuracy by at least 26\% compared with existing solutions under various environmental interferences.

Adaptive Localization in Dynamic Indoor Environments by Transfer Kernel Learning

We study causal subset selection with Directed Information as the measure of prediction causality. Two typical tasks, causal sensor placement and covariate selection, are correspondingly formulated into cardinality constrained directed information maximizations. To attack the NP-hard problems, we show that the first problem is submodular while not necessarily monotonic. And the second one is ``nearly'' submodular. To substantiate the idea of approximate submodularity, we introduce a novel quantity, namely submodularity index (SmI), for general set functions. Moreover, we show that based on SmI, greedy algorithm has performance guarantee for the maximization of possibly non-monotonic and non-submodular functions, justifying its usage for a much broader class of problems. We evaluate the theoretical results with several case studies, and also illustrate the application of the subset selection to causal structure learning.

/pdf/causal-meets-submodular-subset-selection-with-directed-1f5tx0txxh.pdf

Causal meets Submodular: Subset Selection with Directed Information

We present results from a set of experiments in this pilot study to investigate the causal influence of user activity on various environmental parameters monitored by occupant-carried multi-purpose sensors. Hypotheses with respect to each type of measurements are verified, including temperature, humidity, and light level collected during eight typical activities: sitting in lab / cubicle, indoor walking / running, resting after physical activity, climbing stairs, taking elevators, and outdoor walking. Our main contribution is the development of features for activity and location recognition based on environmental measurements, which exploit location- and activity-specific characteristics and capture the trends resulted from the underlying physiological process. The features are statistically shown to have good separability and are also information-rich. Fusing environmental sensing together with acceleration is shown to achieve classification accuracy as high as 99.13%. For building applications, this study motivates a sensor fusion paradigm for learning individualized activity, location, and environmental preferences for energy management and user comfort.

/pdf/environmental-sensing-by-wearable-device-for-indoor-activity-44sis5m3kr.pdf

Environmental sensing by wearable device for indoor activity and location estimation

We propose Veto-Consensus Multiple Kernel Learning (VCMKL), a novel way of combining multiple kernels such that one class of samples is described by the logical intersection (consensus) of base kernelized decision rules, whereas the other classes by the union (veto) of their complements. The proposed configuration is a natural fit for domain description and learning with hidden subgroups. We first provide generalization risk bound in terms of the Rademacher complexity of the classifier, then a large margin multi-ν learning objective with tunable training error bound is formulated. Seeing that the corresponding optimization is non-convex and existing methods severely suffer from local minima, we establish a new algorithm, namely Parametric Dual Descent Procedure(PDDP), that can approach global optimum with guarantees. The bases of PDDP are two theorems that reveal the global convexity and local explicitness of the parameterized dual optimum, for which a series of new techniques for parametric program have been developed. The proposed method is evaluated on extensive set of experiments, and the results show significant improvement over the state-of-the-art approaches.

/pdf/veto-consensus-multiple-kernel-learning-3gtfxrwk9g.pdf

Costas J. Spanos

Papers

Efficient task-specific data valuation for nearest neighbor algorithms

Adaptive Localization in Dynamic Indoor Environments by Transfer Kernel Learning

Causal meets Submodular: Subset Selection with Directed Information

Environmental sensing by wearable device for indoor activity and location estimation

Veto-Consensus Multiple Kernel Learning