With the popularity of social networks, the conflict between the heterogeneous social network data publishing and user privacy leakage is becoming very obvious. Especially for critical node users, if the critical node...
ISBN:
(数字)9783031402838
ISBN:
(纸本)9783031402821;9783031402838
With the popularity of social networks, the conflict between the heterogeneous social network data publishing and user privacy leakage is becoming very obvious. Especially for critical node users, if the critical node users suffer from background knowledge attacks during data publishing, it can not only lead to the privacy information leakage of the critical user but also lead to the privacy leakage of their friends. To address this issue, we propose a critical node privacy protection method based on random pruning of critical trees. First, we obtain the critical node candidate set by the degree centrality. Then, we calculate the candidate node's global and local criticality to get the critical node set. Next, we extract the critical tree with the critical node as the root node. Finally, we design a critical tree privacy protection strategy based on random pruning. The experimental results show that the proposed method can balance the privacy and availability of critical nodes in the network data publishing.
Existing RGB-D salient object detection methods generally rely on the dual-encoder structure for RGB and depth feature extraction. However, we observe that the encoders in such models are often not adequately trained ...
ISBN:
(纸本)9789819947607;9789819947614
Existing RGB-D salient object detection methods generally rely on the dual-encoder structure for RGB and depth feature extraction. However, we observe that the encoders in such models are often not adequately trained to obtain superior feature representations. We name this problem the "under-training issue". To this end, we propose a multi-branch decoding network (MBDNet) to suppress this issue. The MBDNet introduces additional decoding branches with supervision to form a multi-branch decoding (MBD) structure, facilitating the training of the encoders and enhancing the feature representation. Specifically, to ensure the effectiveness of the introduced supervision and improve the performance of additional decoding branches, we design an adaptive multi-scale decoding (AMSD) module. We also design a multi-branch feature aggregation (MBFA) module to aggregate the multi-branch features in MBD to further improve the detection accuracy. In addition, we design an enhancement complement fusion (ECF) module to achieve multi-modality feature fusion. Extensive experiments demonstrate that our MBDNet outperforms other state-of-the-art methods and mitigates the "under-training issue".
The paper described an agent-based model that simulate group work of elementary school children. It imitates students' characteristics and behaviours most frequently found in pedagogical literature about active an...
ISBN:
(纸本)9783031414558;9783031414565
The paper described an agent-based model that simulate group work of elementary school children. It imitates students' characteristics and behaviours most frequently found in pedagogical literature about active and group learning. The model main objective is to forecast the change in the student's knowledge. We simulated and compared knowledge changes during individual learning and cooperative learning with different group composition. The observation of real students was carried out and compared to the outcomes of the simulations. The results are discussed in the context of improving the model by adding previously not included students' characteristics and behaviours.
Few-shot learning hasmade significant progress recently thanks to pretraining methods and meta-learning approaches. These methods, however, require an extensive labeled dataset that is difficult to obtain. We propose ...
ISBN:
(纸本)9789819947607;9789819947614
Few-shot learning hasmade significant progress recently thanks to pretraining methods and meta-learning approaches. These methods, however, require an extensive labeled dataset that is difficult to obtain. We propose an unsupervised few-shot learning method based on positive expansions and negative proxies to fully utilize abundant unlabeled data. Our approach learns meaningful representations through self-supervised pre-training on unlabeled data using a simple but effective positive and negative sampling strategy. Specifically, we sort the negative queue in descending order based on similarity to the query embedding and then select the top N negatives as positive extensions. Behind these N negatives, we choose M negatives as proxies. We further incorporate this sampling strategy into a novel contrastive loss function. We learn the representation by minimizing the distance between query and positive extensions while maximizing the distance to negative proxies. Our approach greatly narrows the performance gap between supervised and unsupervised learning in twowidely used few-shot benchmarks. Under a linear evaluation protocol, our method also achieves performance comparable to current SOTA self-supervised learning methods.
Generating a coherent and reasonable story for a given story outline, i.e., outline-conditioned story generation, is an important and challenging task. The key challenges of the task lie in how to ensure that the majo...
ISBN:
(数字)9783031402890
ISBN:
(纸本)9783031402883;9783031402890
Generating a coherent and reasonable story for a given story outline, i.e., outline-conditioned story generation, is an important and challenging task. The key challenges of the task lie in how to ensure that the majority of the story outline points appear in the generated story sufficiently and expand the source of information for the story outline effectively, these challenges are still under-explored by prior works, especially for outline-conditioned Chinese story generation. In this paper, we propose a novel outline-conditioned Chinese story generation framework that utilizes a two-stream decoding mechanism to make sure most of the points listed in the outlines of the stories are included in the generated stories by training the generative model and generating the stories twice. Moreover, we enlarge the outline points by incorporating external knowledge from a Chinese commonsense knowledge base to generate various Chinese stories. Extensive experiments show that our framework outperforms the state-of-the-art Chinese generation models on several evaluation metrics, demonstrating the importance of the two-stream decoding mechanism and the necessity of incorporating extra Chinese knowledge into the story outline for generating more diverse Chinese stories.
Combining the use of 3D LiDAR's and 2D cameras is getting increasingly popular in sensor suits for perception tasks, making them two important sets of sensors for 3D object detection. Fusing the data of these two ...
ISBN:
(纸本)9783031414558;9783031414565
Combining the use of 3D LiDAR's and 2D cameras is getting increasingly popular in sensor suits for perception tasks, making them two important sets of sensors for 3D object detection. Fusing the data of these two sensors results in a highly descriptive environment. However, the combination into a single representation is not straightforward due to the difference in signal characteristics and distribution. Thus the robustness of such system is highly dependent on calibration. In case of most methods the image quality is also a predominant condition for performance. This paper proposes a calibration framework in PyTorch for both KITTI and nuScenes. CalibRRNet takes monocular images and 3D depth information as input and outputs a 6 DoF rigid body transformation. Using similar architecture to ResNet18, leveraging the advantage of jumping connection, we add a recurrent network on the last stage to keep track of the previously predicted transformations. Training CalibRRNet is against photometric consistency and point cloud distance. CalibRRNet solves the geometric problem and predicts the extrinsic calibration parameters. The application of the proposed framework is not limited to only pure calibration tasks. It can also be used as a preprocessing module for camera-lidar fusion models to alleviate the need for an accurate calibration to ensure performance. Our experiments results confirm the validity of the proposed approach, with primary improvements observed on translation, but also on rotation.
Data Science is one of the most prominent interdisciplinary fields of artificialintelligence at the moment. It aims to analyze large volumes of data (big data) in complex environments in order to extract knowledge fr...
详细信息
ISBN:
(纸本)9783031429347;9783031429354
Data Science is one of the most prominent interdisciplinary fields of artificialintelligence at the moment. It aims to analyze large volumes of data (big data) in complex environments in order to extract knowledge from them. In this contribution a first approach to change mining is presented. The algorithm employs an evolutionary fuzzy system and it is developed within an Android application which will allow us the incorporation and comparison of new algorithms in the future. The accompanying study is based on the analysis of data generated by wearables, more specifically smart bands, in order to discover knowledge in sleep and activity data generated by the user in different time periods.
Reinforcement learning (RL) techniques for traffic signal control (TSC) have gained increasing popularity in recent years. However, most existing RL-based TSC methods tend to focus primarily on the RL model structure ...
ISBN:
(纸本)9783031434297;9783031434303
Reinforcement learning (RL) techniques for traffic signal control (TSC) have gained increasing popularity in recent years. However, most existing RL-based TSC methods tend to focus primarily on the RL model structure while neglecting the significance of proper traffic state representation. Furthermore, some RL-based methods heavily rely on expert-designed traffic signal phase competition. In this paper, we present a novel approach to TSC that utilizes queue length as an efficient state representation. We propose two new methods: (1) Max Queue-Length (M-QL), an optimization-based traditional method designed based on the property of queue length;and (2) AttentionLight, an RL model that employs the self-attention mechanism to capture the signal phase correlation without requiring human knowledge of phase relationships. Comprehensive experiments on multiple real-world datasets demonstrate the effectiveness of our approach: (1) the M-QL method outperforms the latest RL-based methods;(2) AttentionLight achieves a new state-of-the-art performance;and (3) our results highlight the significance of proper state representation, which is as crucial as neural network design in TSC methods. Our findings have important implications for advancing the development of more effective and efficient TSC methods. Our code is released on Github (https://github. com/LiangZhang1996/AttentionLight).
Clustering high-dimensional spatiotemporal data using an unsupervised approach is a challenging problem for many data-driven applications. Existing state-of-the-art methods for unsupervised clustering use different si...
ISBN:
(纸本)9783031434297;9783031434303
Clustering high-dimensional spatiotemporal data using an unsupervised approach is a challenging problem for many data-driven applications. Existing state-of-the-art methods for unsupervised clustering use different similarity and distance functions but focus on either spatial or temporal features of the data. Concentrating on joint deep representation learning of spatial and temporal features, we propose Deep Spatiotemporal Clustering (DSC), a novel algorithm for the temporal clustering of high-dimensional spatiotemporal data using an unsupervised deep learning method. Inspired by the U-net architecture, DSC utilizes an autoencoder integrating CNN-RNN layers to learn latent representations of the spatiotemporal data. DSC also includes a unique layer for cluster assignment on latent representations that uses the Student's t-distribution. By optimizing the clustering loss and data reconstruction loss simultaneously, the algorithm gradually improves clustering assignments and the nonlinear mapping between low-dimensional latent feature space and high-dimensional original data space. A multivariate spatiotemporal climate dataset is used to evaluate the efficacy of the proposed method. Our extensive experiments show our approach outperforms both conventional and deep learning-based unsupervised clustering algorithms. Additionally, we compared the proposed model with its various variants (CNN encoder, CNN autoencoder, CNN-RNN encoder, CNN-RNN autoencoder, etc.) to get insight into using both the CNN and RNN layers in the autoencoder, and our proposed technique outperforms these variants in terms of clustering results.
Graph structures have shown to represent a viable approach to developingAGI. This paper describes howa knowledge graph could be represented in neurons and introduces theUniversal Knowledge Store (UKS), an open-source ...
Graph structures have shown to represent a viable approach to developingAGI. This paper describes howa knowledge graph could be represented in neurons and introduces theUniversal Knowledge Store (UKS), an open-source implementation, which could form one component of AGI. Unlike backpropagationrelated systems which have only the most tenuous biological relationship, graph structures can be built from basic biological neuron models.
暂无评论