检索结果-内蒙古大学图书馆

SSRN 2024年

作者： Alhaek, Fares Li, Tianrui Rajeh, Taha M. Javed, Muhammad Hafeez Liang, Weichao School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China

The proliferation of vehicles and the intricate layout of road systems have contributed to a significant rise in traffic accidents, posing a pressing concern globally. Despite the advancements facilitated by deep learning, several challenges persist in the domain of traffic accident prediction. Firstly, the sparsity of accident data in certain city regions presents a significant obstacle, particularly when attempting fine-grained predictions at a local level. Secondly, the intricate spatial-temporal relations inherent in traffic accident data pose a challenge for existing prediction models. In response to these formidable challenges, this paper presents GLST-TARP, a novel model for predicting traffic accident risk in urban environments by leveraging both global semantic and localized geographic spatial-temporal relations. Specifically, we construct multi-graphs to encode global static and dynamic spatial relations, incorporating attention mechanisms to adaptively focus on relevant information and temporal relations. Additionally, we employ channel-wise convolutional neural network blocks to extract localized geographic features and enhance predictive accuracy. The proposed model is trained using a Huber loss function tailored for regression tasks, relieving the impact of zero values during optimization. Experimental results demonstrate that GLST-TARP outperforms state-of-the-art methods in predicting traffic accident risks, showcasing its potential for enhancing urban safety and transportation management. © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Training of Spiking Neural Network joint Curriculum Learning Strategy

arXiv

引用

arXiv 2023年

作者： Tang, Lingling Chu, Jielei Gong, Zhiguo Li, Tianrui The School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China The State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China

Starting with small and simple concepts, and gradually introducing complex and difficult concepts is the natural process of human learning. Spiking Neural Networks (SNNs) aim to mimic the way humans process information, but current SNNs models treat all samples equally, which does not align with the principles of human learning and overlooks the biological plausibility of SNNs. To address this, we propose a CL-SNN model that introduces Curriculum Learning(CL) into SNNs, making SNNs learn more like humans and providing higher biological interpretability. CL is a training strategy that advocates presenting easier data to models before gradually introducing more challenging data, mimicking the human learning process. We use a confidence-aware loss to measure and process the samples with different difficulty levels. By learning the confidence of different samples, the model reduces the contribution of difficult samples to parameter optimization automatically. We conducted experiments on static image datasets MNIST, Fashion-MNIST, CIFAR10, and neuromorphic datasets N-MNIST, CIFAR10-DVS, DVS-Gesture. The results are promising. To our best knowledge, this is the first proposal to enhance the biologically plausibility of SNNs by introducing CL. Copyright © 2023, The Authors. All rights reserved.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Forensicability Assessment of Questioned Images in Recapturing Detection

arXiv

引用

arXiv 2022年

作者： Chen, Changsheng Zhao, Lin Cai, Rizhao Yu, Zitong Huang, Jiwu Kot, Alex C. The Guangdong Key Laboratory of Intelligent Information Processing and Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology College of Electronics and Information Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China The Department of Electrical and Electrics Engineering Nanyang Technological University Singapore639798 Singapore

Recapture detection of face and document images is an important forensic task. With deep learning, the performances of face anti-spoofing (FAS) and recaptured document detection have been improved significantly. However, the performances are not yet satisfactory on samples with weak forensic cues. The amount of forensic cues can be quantified to allow a reliable forensic result. In this work, we propose a forensicability assessment network to quantify the forensicability of the questioned samples. The low-forensicability samples are rejected before the actual recapturing detection process to improve the efficiency of recapturing detection systems. We first extract forensicability features related to both image quality assessment and forensic tasks. By exploiting domain knowledge of the forensic application in image quality and forensic features, we define three task-specific forensicability classes and the initialized locations in the feature space. Based on the extracted features and the defined centers, we train the proposed forensic assessment network (FANet) with cross-entropy loss and update the centers with a momentum-based update method. We integrate the trained FANet with practical recapturing detection schemes in face anti-spoofing (FAS) and recaptured document detection tasks. Experimental results show that, for a generic CNN-based FAS scheme, FANet reduces the EERs from 33.75% to 19.23% under ROSE to IDIAP protocol by rejecting samples with the lowest 30% forensicability scores. The performance of FAS schemes is poor in the rejected samples, with EER as high as 56.48%. Similar performances in rejecting low-forensicability samples have been observed for the state-of-the-art approaches in FAS and recaptured document detection tasks. To the best of our knowledge, this is the first work that assesses the forensicability of recaptured document images and improves the system efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Image quality

来源：评论

学校读者我要写书评

暂无评论

Challenges and Approaches for Mitigating Byzantine Attacks in Federated Learning

arXiv

引用

arXiv 2021年

作者： Shi, Junyu Wan, Wei Hu, Shengshan Lu, Jianrong Zhang, Leo Yu School of Cyber Science and Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security China School of Information Technology Deakin University Australia

Recently emerged federated learning (FL) is an attractive distributed learning framework in which numerous wireless end-user devices can train a global model with the data remained autochthonous. Compared with the traditional machine learning framework that collects user data for centralized storage, which brings huge communication burden and concerns about data privacy, this approach can not only save the network bandwidth but also protect the data privacy. Despite the promising prospect, Byzantine attack, an intractable threat in conventional distributed network, is discovered to be rather efficacious against FL as well. In this paper, we conduct a comprehensive investigation of the state-of-the-art strategies for defending against Byzantine attacks in FL. We first provide a taxonomy for the existing defense solutions according to the techniques they used, followed by an across-the-board comparison and discussion. Then we propose a new Byzantine attack method called weight attack to defeat those defense schemes, and conduct experiments to demonstrate its threat. The results show that existing defense solutions, although abundant, are still far from fully protecting FL. Finally, we indicate possible countermeasures for weight attack, and highlight several challenges and future research directions for mitigating Byzantine attacks in FL. © 2021, CC BY.

关键词： data privacy

来源：评论

学校读者我要写书评

暂无评论

PseudoSC: A Binary Approximation to Stochastic computing within Latent Operation-Space for Ultra-Lightweight on-Edge DNNs

PseudoSC: A Binary Approximation to Stochastic Computing wit...

引用

Design Automation Conference

作者： Jihe Wang Zhaoqing Wang Danghui Wang School of Computer Science Northwestern Polytechnical University Xi’an China Engineering Research Center of Embedded System Integration Ministry of Education Northwestern Polytechnical University Xi’an China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Northwestern Polytechnical University Xi’an China

Recently, stochastic computing (SC) is increasingly popular in constructing MAC for on-edge DNNs benefiting from its outstanding energy-efficiency, including its adequate precision and gate-level operation. However, current SC-DNN systems always include a lot of costly SNGs/APCs for inevitably switches between binary and stochastic domains, which mortgages incongruous resources to pay the "bill" of the domain-switches and impedes highly-concurrent deployments. In this work, PseudoSC, a binary approximation to low-discrepancy SC, is proposed to totally remove the domain-switch for SNG/APC-free SC-DNNs. Its basic idea is to virtually re-arrange a couple of stochastic operands into a 2-D latent op-space, in which, original Monte Carlo sampling can be partitioned into three sub-ops, i.e., two fixed binary-ops and a fractal recursion. In theory, the recursion forms an isomorphic partition of the sampling repeated in smaller scales until the binary base-case achieved, as a result, a SC-op is well approximated only with binary-ops. Based on above theory, a multi-lane micro-architecture is designed to unroll the recursion within a few cycles and its advantages on hardware saving is verified under popular DNNs. The evaluation shows that the DNN-models with our schemes achieve 98.7% accuracy of the fixed-point implementations, which significantly outperform other SOTA methods. In addition, its reduced structure improves the power efficiency by 3.67 times on average.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Robust Android Malware Familial Classification

arXiv

引用

arXiv 2021年

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China University of Texas at Dallas Dallas United States National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. © 2021, CC0.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

Disentangling Interest and Conformity Representation to Mitigate Popularity Bias for Sequential Recommendation

Disentangling Interest and Conformity Representation to Miti...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Wenyue Hu Zhenyu Yang Yan Huang Zhibo Zhang Baojie Xu Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

The objective of sequential recommendation is to predict user preferences for items based on historical interaction sequences. This process often leads to a phenomenon known as popularity bias, where popular items are excessively recommended. Conformity, the tendency of users to follow popular items, is a significant factor contributing to this issue. Previous methods have not adequately disentangled conformity and interest, failing to accurately model users’ true intent. To address this, we propose a novel Disentangled Interest and Conformity Sequential Recommendation method (DICSRec) to mitigate the popularity bias. Specifically, we first design an Intent Encoding Module (IEM), which includes two independent encoders for conformity and interest to model their representations. To better disentangle these two factors, we design a disentangling task with proxy-based self-supervised learning and orthogonal regularization. Furthermore, to provide the Intent Encoding Module with more global information, we design a Global Conformity-aware Module (GCM), which supplies item popularity information and aids in enhancing user conformity representation. Lastly, recognizing the varying significance of user conformity and interest, we propose an adaptive Fusion Prediction Module (FPM) that adaptively aggregates user conformity and interest representations for final prediction. Experiments on four real-world datasets consistently demonstrate the superiority of our method over advanced sequential recommendation models. Code implementation is available at: https://***/lyra0611/DICSRec.

关键词： Adaptation models Codes Fuses Aggregates Neural networks Self-supervised learning Multitasking

来源：评论

学校读者我要写书评

暂无评论

CSLP: Collaborative Solution to Long-Tail Problem and Popularity Bias in Sequential Recommendation

CSLP: Collaborative Solution to Long-Tail Problem and Popula...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Yan Huang Zhenyu Yang Wenyue Hu Baojie Xu Zhibo Zhang The Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Sequential Recommender systems (SRS), leveraging the temporal information from users' behaviors, have noticeably improved user experience against traditional systems. However, these behaviors often follow long-tail distribution, making the systems biased towards popular items (i.e., popularity bias). Moreover, popularity bias would amplify the neglect of long-tail recommendations, thereby sharpening the long-tail problem. Previous researches usually address these challenges independently, focusing on reducing the over-recommendation of popular items or enhancing the representation quality of tail items. Indeed, it is possible to incorporate their merits to achieve the best of both worlds. Thus, we propose a novel and unified framework, named Collaborative Solution to Long tailed problem and Popularity bias (CSLP), to tackle both the long-tail problem and popularity bias simultaneously. To achieve this, we first introduce a representation enhancement module featuring dual generators to enhance user and item representations, particularly for those in the tail. On the other hand, a debiasing module incorporating an Inverse Propensity Score (IPS) with a clipping strategy is introduced to further alleviate the popularity bias. Specifically, this clipping strategy demonstrates a clear decrease in the original IPS method's variance, effectively improving the recommendation for stability and accuracy. Experiments on three widely-used datasets show CSLP's effectiveness in solving both issues. CSLP surpasses all baselines (traditional, popularity bias, and long-tail problem) in overall performance, significantly enhancing recommendation accuracy for both tail users and items, and achieving a more balanced ratio of recommendations between popular and tail items. Code is available at https://***/Echohuangyan/CSLP.

关键词： Hands Heavily-tailed distribution Accuracy Collaboration Tail Linear programming Generators User experience IP networks Recommender systems

来源：评论

学校读者我要写书评

暂无评论

A Collaborative Heterogeneous Graph Neural Network for Personalized News Recommendation

A Collaborative Heterogeneous Graph Neural Network for Perso...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Chenglong Shi Haibin Geng Wenfeng Jiang Jinbao Li Chao Wu Song Liu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Personalized news recommendation is the process of predicting the relevance of news to users and recommending news to user to fulfill their information needs. However, existing news recommendation methods extract semantic information from users and candidate news respectively, ignoring semantic interaction information between users and candidate news. Furthermore, previous models only use same node types for message passing, ignoring different characteristics and topology between different node types. In addition, existing methods learn news representations through text representations, ignoring semantic correlation information between entity relationships and texts. To solve these problems, we propose a personalized news recommendation model named CoHG. In our model, we design a collaborative fusion module to obtain semantic interaction information through interacting user history news with candidate news. Furthermore, we design a heterogeneous gated graph neural network that maps different node types into a same space to extract higher-order information in user graphs for message passing. Moreover, we design an enhanced relevant attention module to enhance semantic correlation information of text content by aggregating text representation and entity representation into a unified representation. Finally, we conducted experiments on MIND and Adressa datasets to compare with other baseline models.

关键词： Correlation Message passing Semantics Collaboration Logic gates Graph neural networks Topology History data mining Cybernetics

来源：评论

学校读者我要写书评

暂无评论

A Cross-Modal Interactive Memory Network Based on Fine-Grained Medical Feature Extraction for Radiology Report Generation

A Cross-Modal Interactive Memory Network Based on Fine-Grain...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Xitong Ma Yuansen Kuang Lin Yuan Cheng Tian Yijie Zeng Song Liu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Radiology report generation is an essential task in the medical field, which aims to automate the generation of medical terminology descriptions of radiology images. However, this task currently suffers from several problems: 1) existing methods need to manually build knowledge graphs or templates (consuming time and effort) to introduce medical or prior knowledge to assist in report generation; 2) previous models cannot handle the problem of data bias well (anomaly reports and anomaly descriptions make up only a tiny portion of the dataset), causing the models to ignore the learning of anomaly descriptions easily; 3) existing approaches cannot robustly supervise the model, resulting in incomplete and inconsistent reports being generated. To address these issues, we propose a cross-modal interactive memory network based on fine-grained medical feature extraction. In our model, we design a cross-modal interactive memory network to automatically store and remember the required medical text knowledge and use this medical knowledge to help generate reports. Furthermore, we design an abnormal medical knowledge enhancement module to enhance the learning of abnormal fine-grained knowledge through the interaction of disease topics and their states to interact with text features. In addition, we design a cross-modal joint semantic loss unit to reduce semantic differences between different features and improve the visual representation ability of the model. We experimented and evaluated our model on MIMIC-CXR and IU-Xray datasets to compare with other baseline models.

关键词： Knowledge engineering Visualization Terminology Semantics MIMICs Memory management Radiology Feature extraction data models Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：