Service recommendation is a fundamental task in many application environments (e.g., Mashup creation and cloud computing). In the past, various methods have been proposed to facilitate the service selection process based on the original functional descriptions. However, the mined features from the descriptions are usually too sparse for training a well-performed model. In addition, most methods neglect to differentiate the weights of various features, while words included in descriptions usually exhibit different intentions (e.g., functional or non-functional). To address these challenges, in this paper we propose a text expansion and deep model-based approach for service recommendation. Specifically, we first expand the description of services at sentence level based on a novel probabilistic topic model that learns topics of words, sentences and descriptions in a stratified fashion. The expansion process can bridge the vocabulary gap between services and user queries with the collective semantic similarity of sentences and descriptions. Then, we propose a Long Short-Term Memory-based model to recommend services with two attention mechanisms - a functional attention mechanism that takes tags as functional prior to mine the function-related features of services and Mashups, and a contextual attention mechanism that considers Mashup requirements as application scenario to help select the most appropriate service. We evaluate the proposed approach on a real-world dataset and the results show it has an improvement of 34% in F-measure over the basic LSTM model.

Visible Light Positioning (VLP), a promising indoor positioning technique, has gained wide popularity worldwide because of its ubiquitous infrastructure, low power consumption, and high positioning precision. However, VLP systems based on photodiodes (PDs) often suffer from varying ambient light with time and space, which seriously degrades their positioning precision and robustness. In this article, we carefully evaluate the influence of the ambient light on the VLP system, which includes the reduction of positioning accuracy by varying ambient light with time and the inaccurate parameter calibration by unevenly distributed ambient light. Then, we figure out that the influence of ambient light on the Received Signals Strength (RSS) values is determined by the ambient light intensity and PD, which is independent of external factors, including distance, frequency, LED, etc. Next, we propose a new positioning framework, RatioVLP, where a ratio model that is more robust to varying ambient light with time is used. However, the ratio model is severely dependent on the lambert parameters that are vulnerable to ambient light, which reduces the framework's precision when the calibration area is unevenly covered by ambient light. Thus, we design new parameters that are less sensitive to ambient light, called R parameter, to connect the RSS ratio and its corresponding distance ratio, which can strengthen the ratio model's robustness and effectively reduce the influence of ambient light on the parameter calibration process. Experimental results show that the positioning precision of the proposed method is improved by more than 50% when compared to the conventional lambert model in scenes influenced by ambient light.

How to provide a low-cost but accurate localization solution for the indoor mobile robots are essential in many Internet of Things (IoT) applications, such as smart home and asset tracking. To achieve this goal, this article originally proposes a modified two-filter smoother based on ensemble Kalman filter (denoted as EnKS) for the localization of indoor mobile robots. The proposed EnKS algorithm consists of both a forward part of an EnKF with Statistical Linear Regression and a backward part of a modified information Kalman filter with state error vector. The EnKS based on stochastic sampling with ensemble members can achieve better positioning accuracy than other Kalman smoothers. When compared to EnKF, the proposed EnKS combines a backward filter to compensate for the estimation error of EnKF and further improves the accuracy. Furthermore, the implementation of the proposed EnKS is conducted in the real world visible light positioning (VLP) system using pre-existing LED lights for low-cost robot localization. To make a performance comparison, this article also uses baseline smoothers based on extended Kalman filter and central difference Kalman filter in the VLP system. Preliminary experimental results imply that the proposed EnKS is able to achieve the best positioning accuracy, as high as 11.18 cm on average, but with a comparable computational complexity, which enables to meet the demands of many robot applications.

Fairness (also known as equity interchangeably) in machine learning is important for societal wellbeing, but limited public datasets hinder its progress. Currently, no dedicated public medical datasets with imaging data for fairness learning are available, though minority groups suffer from more health issues. To address this gap, we introduce Harvard Glaucoma Fairness (Harvard-GF), a retinal nerve disease dataset including 3,300 subjects with both 2D and 3D imaging data and balanced racial groups for glaucoma detection. Glaucoma is the leading cause of irreversible blindness globally with Blacks having doubled glaucoma prevalence than other races. We also propose a fair identity normalization (FIN) approach to equalize the feature importance between different identity groups. Our FIN approach is compared with various state-of-the-art fairness learning methods with superior performance in the racial, gender, and ethnicity fairness tasks with 2D and 3D imaging data, demonstrating the utilities of our dataset Harvard-GF for fairness learning. To facilitate fairness comparisons between different models, we propose an equity-scaled performance measure, which can be flexibly used to compare all kinds of performance metrics in the context of fairness. The dataset and code are publicly accessible via https://ophai.hms.harvard.edu/harvard-gf3300/.

Knowledge representation of networked systems is fundamental in many disciplines. To date, most existing methods for representation learning primarily focus on networks with simplex labels, yet real-world objects (nodes) are inherently complex in nature and often contain rich semantics or labels, e.g., a user may belong to diverse interest groups of a social network, resulting in multi-label networks for many applications. A multi-label network not only has multiple labels for each node, the labels are often highly correlated making existing methods ineffective or even fail to handle such correlation for node representation learning. In this paper, we propose a novel multi-label graph convolutional network (MuLGCN) for learning node representation of multi-label networks. To fully explore label-label correlation and network topology structures, we propose to model a multi-label network as two Siamese GCNs: a node-node-label graph and a label-label-node graph. The two GCNs each handle one aspect of representation learning for nodes and labels, respectively, and they are seamlessly integrated under one objective function. The learned label representations can effectively preserve the inner-label interaction and node label properties, and are then aggregated to enhance the node representation learning under a unified training framework. Experiments validate the effectiveness of our proposed approach.

Clustering Web services can improve the quality and efficiency of service discovery and management within a service repository. Nowadays, Web services frequently interact (e.g., composition relation and tag sharing relation) with each other to form a complex and heterogeneous service relationship network. The rich network relations inherently reflect either positive or negative clustering association between Web services, which can be a strong supplement to service semantics for characterizing functional affinities between Web services. In this paper, we propose to cluster Web services by utilizing both description documents and the structural information from the service relationship network. We first learn the content semantic information from service description documents based on the widely used Doc2vec model, and meanwhile, learn the structural semantic information from the service relationship network based on a network representation learning algorithm. Then, we propose to pretrain the content and structural semantic information to obtain the most relevant and unified features through training a service classification model with partially labeled data. Finally, a spectral clustering algorithm is utilized for Web services clustering based on the above unified features with preserved content and structural semantics. Therefore, the proposed services clustering approach takes advantage of both service content semantic and service network structure semantic based similarity between services. Extensive experiments are conducted on a real-world dataset from ProgrammableWeb, composed of 12919 Web API services. Experimental results demonstrate that our approach yields an improvement of 4.78% in precision and 5.4% in recall over the state-of-the-art method.