Search

Coupling learning is designed to estimate, discover, and extract the interactions and relationships among learning components. It provides insights into complex interactive data, and has been extensively incorporated into recommender systems to enhance the interpretability of sophisticated relationships between users and items. Coupling learning can be further fostered once the trending collaborative learning can be engaged to take advantage of the cross-platform data. To facilitate this, privacy-preserving solutions are in high demand—it is desired that the collaboration should not expose either the private data of each individual owner or the model parameters trained on their datasets. In this article, we develop a distributed collaborative coupling learning system, which enables differential privacy. The proposed system defends against the adversary who has gained full knowledge of the training mechanism and the access to the model trained collaboratively. It also addresses the privacy-utility tradeoff by a provable tight sensitivity bound. Our experiments demonstrate that the proposed system guarantees favorable privacy gains at a modest cost in recommendation quality, even in scenarios with a large number of training epochs.

Semantic segmentation of point cloud data, an efficient 3-D scattered point representation, is a fundamental task for various applications, such as autonomous driving and 3-D telepresence. In recent years, deep learning techniques have achieved significant progress in semantic segmentation, especially in the 2-D image setting. However, due to the irregularity of point clouds, most of them cannot be applied to this special data representation directly. While recent works are able to handle the irregularity problem and maintain the permutation invariance, most of them fail to capture the valuable high-dimensional local feature in fine granularity. Inspired by fuzzy mathematical methods and the analysis on the drawbacks of current state-of-the-art works, in this article, we propose a novel deep neural model, Fuzzy3DSeg, that is able to directly feed in the point clouds while maintaining invariant to the permutation of the data feeding order. We deeply integrate the learning of the fuzzy neighborhood feature of each point into our network architecture, so as to perform operations on high-dimensional features. We demonstrate the effectiveness of this network architecture level integration, compared with methods of the fuzzy data preprocessing cascading neural network. Comprehensive experiments on two challenging datasets demonstrate that the proposed Fuzzy3DSeg significantly outperforms the state-of-the-art methods.

Existing research exploits the semantic information from reviews to complement user-item interactions for item recommendation. However, as these approaches either defer the user-item interactions until the prediction layer or simply concatenate all the reviews of a user/item into a single review, they fail to capture the complex correlations between each user-item pair or introduce noises. Thus, we propose a novel Hierarchical and Interactive Gate Network (HIGnet) model for rating prediction. Modeling local word informativeness and global review semantics in a hierarchical manner enable us to exploit textual features of users/items and capture complex semantic user-item correlations at different levels of granularities. Experiments on five challenging real-world datasets demonstrate the state-of-the-art performance of the proposed HIGnet model. To facilitate community research, the implementation of the proposed model is made publicly available (https://github.com/uqjwen/higan).

Deep Convolutional Neural Networks (DCNNs) have enhanced the performance of semantic image segmentation but many challenges still remain. Specifically, some details may be lost due to the downsampling operations in DCNNs. Furthermore, objects may appear in an image at different scales, and extracting features using convolutional filters with large sizes is costly in computation. Moreover, in many cases, contextual information, such as global and background features, is potentially useful for semantic segmentation. In this paper, we address these challenges by proposing a Multi-Receptive Atrous Convolutional Network (MRACN) for semantic image segmentation. The proposed MRACN captures the multi-receptive features and the global features at different receptive scales of the input. MRACN can serve as a module easily being integrated into existing models. We adapt the ResNet-101 model as the backbone network and further propose a MRACN segmentation model (MRACN-Seg). The experimental results demonstrate the effectiveness of the proposed model on two datasets: a benchmark dataset (PASCAL VOC 2012) and our industry dataset.

Social media has evolved into one of the most important channels to share micro-videos nowadays. The sheer volume of micro-videos available in social networks often undermines users’ capability to choose the micro-videos that best fit their interests. Recommendation appear as a natural solution to this problem. However, existing video recommendation methods only consider the users’ historical preferences on videos, without exploring any video contents. In this paper, we develop a novel latent genre aware micro-video recommendation model to solve the problem. First, we extract user-item interaction features, and auxiliary features describing both contextual and visual contents of micro-videos. Second, these features are fed into the neural recommendation model that simultaneously learns the latent genres of micro-videos and the optimal recommendation scores. Experiments on real-world dataset demonstrate the effectiveness and the efficiency of our proposed method compared with several state-of-the-art approaches.

In recommender systems, the user-item interaction data is usually sparse and not sufficient for learning comprehensive user/item representations for recommendation. To address this problem, we propose a novel dual-bridging recommendation model (DBRec). DBRec performs latent user/item group discovery simultaneously with collaborative filtering, and interacts group information with users/items for bridging similar users/items. Therefore, a user's preference over an unobserved item, in DBRec, can be bridged by the users within the same group who have rated the item, or the user-rated items that share the same group with the unobserved item. In addition, we propose to jointly learn user-user group (item-item group) hierarchies, so that we can effectively discover latent groups and learn compact user/item representations. We jointly integrate collaborative filtering, latent group discovering and hierarchical modelling into a unified framework, so that all the model parameters can be learned toward the optimization of the objective function. We validate the effectiveness of the proposed model with two real datasets, and demonstrate its advantage over the state-of-the-art recommendation models with extensive experiments., Comment: 10 pages, 16 figures, The 28th ACM International Conference on Information and Knowledge Management (CIKM '19)

Graph learning has been demonstrated as one of the most effective methods for semi-supervised dimension reduction, as it can achieve label propagation between labeled and unlabeled samples to improve the feature projection performance. However, most existing methods perform this important label propagation process on the graph with sub-optimal structure, which will reduce the quality of the learned labels and thus affect the subsequent dimension reduction. To alleviate this problem, in this paper, we propose an effective Label Propagation with Structured Graph Learning (LPSGL) method for semi-supervised dimension reduction. In our model, label propagation, semi-supervised structured graph learning and dimension reduction are simultaneously performed in a unified learning framework. We propose a semi-supervised structured graph learning method to characterize the intrinsic semantic relations of samples more accurately. Further, we assign different importance scores for the given and learned labeled samples to differentiate their effects on learning the feature projection matrix. In our method, the semantic information can be propagated more effectively from labeled samples to the unlabeled samples on the learned structured graph. And a more discriminative feature projection matrix can be learned to perform the dimension reduction. An iterative optimization with the proved convergence is proposed to solve the formulated learning framework. Experiments demonstrate the state-of-the-art performance of the proposed method. The source codes and testing datasets are available at https://github.com/FWang-sdnu/LPSGL-code .

Neighborhood-based recommenders are a major class of Collaborative Filtering models. The intuition is to exploit neighbors with similar preferences for bridging unseen user-item pairs and alleviating data sparseness, in other words, learn the sub-graph representation of each user in a user graph. Many existing works propose neural attention networks to aggregate neighbors and place higher weights on the specific subsets of users for recommendation. However, the neighborhood information is not necessarily always informative, and the noises in the neighborhood can negatively affect the model performance. To address this issue, we propose a novel neighborhood-based recommender, where a hybrid gated network is designed to automatically separate similar neighbors from dissimilar (noisy) ones, and aggregate those similar neighbors to comprise neighborhood representations. The confidence in the neighborhood is also addressed by putting higher weights on the neighborhood representations if we are confident with the neighborhood information, and vice versa. In addition, a user-neighbor component is proposed to explicitly regularize user-neighbor proximity in latent space. These two components are combined into a unified model to complement each other for the recommendation task. Extensive experiments on three public datasets demonstrate that the proposed model consistently outperforms the state-of-the-art neighborhood-based recommenders. Furthermore, we study different variants of the proposed model to justify the underlying intuition of the proposed hybrid gated network and user-neighbor modeling components.

Traditional recommender systems encounter several challenges such as data sparsity and unexplained recommendation. To address these challenges, many works propose to exploit semantic information from review data. However, these methods have two major limitations in terms of the way to model textual features and capture textual interaction. For textual modeling, they simply concatenate all the reviews of a user/item into a single review. However, feature extraction at word/phrase level can violate the meaning of the original reviews. As for textual interaction, they defer the interactions to the prediction layer, making them fail to capture complex correlations between users and items. To address those limitations, we propose a novel Hierarchical Text Interaction model (HTI) for rating prediction. In HTI, we propose to model low-level word semantics and high-level review representations hierarchically. The hierarchy allows us to exploit textual features at different granularities. To further capture complex user–item interactions, we propose to exploit semantic correlations between each user–item pair at different hierarchies. At word level, we propose an attention mechanism specialized to each user–item pair, and capture the important words for representing each review. At review level, we mutually propagate textual features between the user and item, and capture the informative reviews. The aggregated review representations are integrated into a collaborative filtering framework for rating prediction. Experiments on five real-world datasets demonstrate that HTI outperforms state-of-the-art models by a large margin. Further case studies provide a deep insight into HTI’s ability to capture semantic correlations at different levels of granularities for rating prediction.

As the sheer volume of available micro-videos often undermines the users’ capability to choose the micro-videos, in this paper, we propose a multi-source multi-net micro-video recommendation model that recommends micro-videos fitting users’ best interests. Different from existing works, as micro-video inherits the characteristics of social platforms, we simultaneously incorporate multi-source content data of items and multi-networks of users to learn user and item representations for recommendation. This information can be complementary to each other in a way that multi-modality data can bridge the semantic gap among items, while multi-type user networks, such as following and reposting, are able to propagate the preferences among users. Furthermore, to discover the hidden categories of micro-videos that properly match users’ interests, we interactively learn the user-item representations. The resulted categorical representations are interacted with user representations to model user preferences at different level of hierarchies. Finally, multi-source content item data, multi-type user networks and hidden item categories are jointly modelled in a unified recommender, and the parameters of the model are collaboratively learned to boost the recommendation performance. Experiments on a real dataset demonstrate the effectiveness of the proposed model and its advantage over the state-of-the-art baselines.