Multiagent-System-Based Attention Mechanism for Predicting Product Popularity: Handling Positive-Negative Diffusion Over Social Networks.

This brief is concerned with the prediction problem of product popularity under a social network (SN) with positive-negative diffusion (PND). First, a PND model is proposed to enable the simulation of product diffusion, and three user states are defined. Second, an optimal and precise feature vector of every user is extracted through a multi-agent-system-based attention mechanism (MASAM) that is devised. The weight matrix shared in the mechanism of all agents is learned using a distributed learning algorithm provided in MASAM. Third, an MAS model for product diffusion on SN is established based on the feature representations from MASAM. Rules for agent interaction during PND diffusion are suggested, which accelerate the simulation of information spread in SN. Finally, comprehensive experiments are conducted to verify the effectiveness and efficiency of the proposed models and algorithms in prediction and to compare their performance with baseline methods. Furthermore, a case study is provided to illustrate the applicability and extendibility of the developed algorithm.

Influence Maximization in Multiagent Systems by a Graph Embedding Method: Dealing With Probabilistically Unstable Links.

This article is concerned with the influence maximization (IM) problem under a network with probabilistically unstable links (PULs) via graph embedding for multiagent systems (MASs). First, two diffusion models, the unstable-link independent cascade (UIC) model and the unstable-link linear threshold (ULT) model, are designed for the IM problem under the network with PULs. Second, the MAS model for the IM problem with PULs is established and a series of interaction rules among agents are built for the MAS model. Third, the similarity of the unstable structure of the nodes is defined and a novel graph embedding method, termed the unstable-similarity2vec (US2vec) approach, is proposed to tackle the IM problem under the network with PULs. According to the embedding results of the US2vec approach, the seed set is figured out by the developed algorithm. Finally, extensive experiments are conducted to: 1) verify the validity of the proposed model and the developed algorithms and 2) illustrate the optimal solution for IM under different scenarios with PULs.

Integrating Lung Parenchyma Segmentation and Nodule Detection With Deep Multi-Task Learning.

Lung parenchyma segmentation is valuable for improving the performance of lung nodule detection in computed tomography (CT) images. Traditionally, the two tasks are performed separately. This paper proposes a deep multi-task learning (MTL) approach to integrate these tasks for better lung nodule detection. Three new ideas lead to our proposed approach. First, lung parenchyma segmentation is used as the attention module and is combined with nodule detection in a single deep network. Second, lung nodule detection is performed in an anchor-free manner by dividing it into two subtasks, nodule center identification and nodule size regression. Third, a novel pyramid dilated convolution block (PDCB) is proposed to utilize the advantage of dilated convolution and tackle its gridding problem for better lung parenchyma segmentation. Based on these ideas, we design our end-to-end deep network architecture and corresponding MTL method to achieve lung parenchyma segmentation and nodule detection simultaneously. We evaluate the proposed approach on the commonly used Lung Nodule Analysis 2016 (LUNA16) dataset. The experimental results show the value of our contributions and demonstrate that our approach can yield significant improvements compared with state-of-the-art counterparts.