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

2022 IEEE International Conference on Advances in Computing, Communication and Applied Informatics, ACCAI 2022

作者： Katarya, Rahul Nath, G Amar Singhal, Divit Shukla, Aryaman Delhi Technological University Big Data Analytics and Web Intelligence Laboratory Department of Computer Science Engineering New Delhi India

ISBN: (纸本)9781665495295

The coronavirus emanated in Wuhan city of China, in the last month of 2019 and was even announced as a global threat. Social media could be an utterly noteworthy supply of facts during a time of crisis. User-generated texts yield perception into users' minds withinside the direction of such times, giving us insights into their critiques in addition to moods. This venture examines Twitter messages (tweets) regarding people's sentiment on the unconventional coronavirus. The essential aim of sentiment evaluation is the origin of human emotion from messages or tweets. This venture is geared toward using numerous gadgets studying type algorithms to expect the people's reception of the worldwide pandemic by reading their tweets on Twitter. In the course of this paper, we are testing our dataset on five different classifiers, namely Random Forest, Logistic regression, Multinomial naive Bayes, K-nearest neighbor, and Support vector machines classifiers. Together with precision rankings and balanced accuracy rankings, metrics are offered to gauge the fulfilment of the numerous algorithms implemented. The K-Nearest Neighbor classifier has given the highest precision score while the Logistic Regression classifier gives the highest recall, F1, accuracy and balanced accuracy scores. © 2022 IEEE.

关键词： Coronavirus

来源：评论

学校读者我要写书评

暂无评论

A Transmission and Transformation Fault Detection Algorithm Based on Improved YOLOv5

引用

computers, Materials & Continua 2023年第9期76卷 2997-3011页

作者： Xinliang Tang Xiaotong Ru Jingfang Su Gabriel Adonis School of Information Science and Engineering Hebei University of Science and TechnologyShijiazhuang050000China Department of Computer Science and Information Systems Birkbeck Institute for Data AnalyticsLondonB100ABWC1E 7HXUK

On the transmission line,the invasion of foreign objects such as kites,plastic bags,and balloons and the damage to electronic components are common transmission line *** these faults is of great significance for the safe operation of power ***,a YOLOv5 target detection method based on a deep convolution neural network is *** this paper,Mobilenetv2 is used to replace Cross Stage Partial(CSP)-Darknet53 as the *** structure uses depth-wise separable convolution to reduce the amount of calculation and parameters;improve the detection *** the same time,to compensate for the detection accuracy,the Squeeze-and-Excitation Networks(SENet)attention model is fused into the algorithm framework and a new detection scale suitable for small targets is added to improve the significance of the fault target area in the *** pictures of foreign matters such as kites,plastic bags,balloons,and insulator defects of transmission lines,and sort theminto a data *** experimental results on datasets show that themean Accuracy Precision(mAP)and recall rate of the algorithm can reach 92.1%and 92.4%,*** the same time,by comparison,the detection accuracy of the proposed algorithm is higher than that of other methods.

关键词： Transmission line YOLOv5 multi-scale integration SENet

来源：评论

学校读者我要写书评

暂无评论

Ghost Module Based Residual Mixture of Self-Attention and Convolution for Online Signature Verification

引用

computers, Materials & Continua 2024年第4期79卷 695-712页

作者： Fangjun Luan Xuewen Mu Shuai Yuan Department of Computer Technology School of Computer Science and EngineeringShenyang Jianzhu UniversityShenyang110168China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Jianzhu UniversityShenyang110168China Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang Jianzhu UniversityShenyang110168China

Online Signature Verification (OSV), as a personal identification technology, is widely used in various ***, it faces challenges, such as incomplete feature extraction, low accuracy, and computational heaviness. Toaddress these issues, we propose a novel approach for online signature verification, using a one-dimensionalGhost-ACmix Residual Network (1D-ACGRNet), which is a Ghost-ACmix Residual Network that combines convolutionwith a self-attention mechanism and performs improvement by using Ghost method. The Ghost-ACmix Residualstructure is introduced to leverage both self-attention and convolution mechanisms for capturing global featureinformation and extracting local information, effectively complementing whole and local signature features andmitigating the problem of insufficient feature extraction. Then, the Ghost-based Convolution and Self-Attention(ACG) block is proposed to simplify the common parts between convolution and self-attention using the Ghostmodule and employ feature transformation to obtain intermediate features, thus reducing computational ***, feature selection is performed using the random forestmethod, and the data is dimensionally reducedusing Principal Component Analysis (PCA). Finally, tests are implemented on the MCYT-100 datasets and theSVC-2004 Task2 datasets, and the equal error rates (EERs) for small-sample training using five genuine andforged signatures are 3.07% and 4.17%, respectively. The EERs for training with ten genuine and forged signaturesare 0.91% and 2.12% on the respective datasets. The experimental results illustrate that the proposed approacheffectively enhances the accuracy of online signature verification.

关键词： Online signature verification feature selection ACG block ghost-ACmix residual structure

来源：评论

学校读者我要写书评

暂无评论

Structure Balance and Gradient Matching-Based Signed Graph Condensation 39

Structure Balance and Gradient Matching-Based Signed Graph C...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Li, Rong Xu, Long Liu, Songbai Ji, Junkai Li, Lingjie Lin, Qiuzhen Ma, Lijia College of Computer Science and Software Engineering Shenzhen University Shenzhen China College of Big Data and Internet Shenzhen Technology University Shenzhen China

ISBN: (纸本)157735897X

Training graph neural networks (GNNs) for graph representation has received increasing concerns due to its outstanding performance in the link prediction and node classification tasks, but it incurs much time and storage for tackling large-scale graphs. To alleviate this issue, graph condensation has been emerged to condense the large graph into a small but highly-informative graph, while achieving comparable performance of GNNs trained on the small graph and large graph. However, existing works mainly focus on the gradient or distribution matching under GNN training trajectories to condense simple link structures, while overlooking the structure matching for condensing signed graph that exists conflict links and structural balance among nodes. To bridge this gap, we propose a novel Structure Balance and Gradient Matching-Based Signed Graph Condensation (SGSGC) method for condensing signed graph with node attributes, conflict links and structural balance into informative smaller ones. Specifically, we first propose a structure-balanced matching to match the structural balance between the original and condensed signed graph, and then combine it with the gradient matching to condense signed graph for the link sign prediction task, while preserving both conflicting link structures and node attributes. Moreover, we use the feature smoothing and the graph sparsification technique to improve the robustness for the GNN training, respectively. Finally, a bi-level optimization technique is proposed to simultaneously find the optimal node attributes and conflict structure of the condensed graph. Experiments on six datasets demonstrate that SGSGC achieves excellent performance. On Epinions, 94% test accuracy of training on the original signed graph, while reducing their graph size by 99.95% - 99.99%, and there exist 2.24% - 6.26% accuracy improvements for link sign prediction compared to the state-of-the-arts. Copyright © 2025, Association for the Advancement of Artificial Int

关键词： Network theory (graphs)

来源：评论

学校读者我要写书评

暂无评论

CMNEE: A Large-Scale Document-Level Event Extraction dataset based on Open-Source Chinese Military News 30

CMNEE: A Large-Scale Document-Level Event Extraction Dataset...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Zhu, Mengna Xu, Zijie Zeng, Kaisheng Xiao, Kaiming Wang, Mao Ke, Wenjun Huang, Hongbin Laboratory for Big Data and Decision National University of Defense Technology China School of Computer Science and Engineering Southeast University China Computer Science and Technology Tsinghua University China

ISBN: (纸本)9782493814104

Extracting structured event knowledge, including event triggers and corresponding arguments, from military texts is fundamental to many applications, such as intelligence analysis and decision assistance. However, event extraction in the military field faces the data scarcity problem, which impedes the research of event extraction models in this domain. To alleviate this problem, we propose CMNEE, a large-scale, document-level open-source Chinese Military News Event Extraction dataset. It contains 17,000 documents and 29,223 events, which are all manually annotated based on a pre-defined schema for the military domain including 8 event types and 11 argument role types. We designed a two-stage, multi-turns annotation strategy to ensure the quality of CMNEE and reproduced several state-of-the-art event extraction models with a systematic evaluation. The experimental results on CMNEE fall shorter than those on other domain datasets obviously, which demonstrates that event extraction for military domain poses unique challenges and requires further research efforts. Our code and data can be obtained from https://***/Mzzzhu/CMNEE. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

TSR-Jack: An In-Browser Crypto-Jacking Detection Method Based on Time Series Representation Learning 26th

TSR-Jack: An In-Browser Crypto-Jacking Detection Method Base...

引用

26th International Conference on Information and Communications Security, ICICS 2024

作者： Cui, Bo Liu, Shuai Engineering Research Center of Ecological Big Data Ministry of Education Beijing China College of Computer Science Inner Mongolia University Hohhot China

ISBN: (纸本)9789819788002

As the economic value of cryptocurrencies continues to ascend, an increasing number of cybercriminals exploit malicious browser scripts to commandeer the system and network resources of victims for unauthorized cryptocurrency mining. This form of browser-based mining, termed crypto-jacking, imparts substantial impact and harm to society, enterprises, and users. However, existing research methods lead to poor transferability because they require model training using labeling data from detection devices. To solve this problem, we introduce a crypto-jacking detection method based on time series representation learning, called TSR-jack. Specifically, we first collect hardware runtime system data for a period of time and generate datasets. After slicing the time series datasets, they are used to train a time series representation model, which introduces the loss of temporal information to extract temporal features. The temporal features can capture similarities between different devices and therefore address model transfer difficulties. Finally, the time vectors obtained from representation learning are fed into SVM for classification. Experimental results show that our TSR-jack method outperforms similar dynamic feature detection methods, especially when considering transferability, with a precision improvement of more than 5%. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Jin, Dongyang Fan, Chao Chen, Weihua Yu, Shiqi Department of Computer Science and Engineering Southern University of Science and Technology China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Alibaba Group China

ISBN: (纸本)157735897X

The gait, as a kind of soft biometric characteristic, can reflect the distinct walking patterns of individuals at a distance, exhibiting a promising technique for unrestrained human identification. With largely excluding gait-unrelated cues hidden in RGB videos, the silhouette and skeleton, though visually compact, have acted as two of the most prevailing gait modalities for a long time. Recently, several attempts have been made to introduce more informative data forms like human parsing and optical flow images to capture gait characteristics, along with multi-branch architectures. However, due to the inconsistency within model designs and experiment settings, we argue that a comprehensive and fair comparative study among these popular gait modalities, involving the representational capacity and fusion strategy exploration, is still lacking. From the perspectives of fine vs. coarse-grained shape and whole vs. pixel-wise motion modeling, this work presents an in-depth investigation of three popular gait representations, i.e., silhouette, human parsing, and optical flow, with various fusion evaluations, and experimentally exposes their similarities and differences. Based on the obtained insights, we further develop a C2Fusion strategy, consequently building our new framework MultiGait++. C2Fusion preserves commonalities while highlighting differences to enrich the learning of gait features. To verify our findings and conclusions, extensive experiments on Gait3D, GREW, CCPG, and SUSTech1K are conducted. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bootstrap-Based Layerwise Refining for Causal Structure Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第6期5卷 2708-2722页

作者： Xiang, Guodu Wang, Hao Yu, Kui Guo, Xianjie Cao, Fuyuan Song, Yukun Hefei University of Technology Key Laboratory of Knowledge Engineering with the Big Data of Ministry of Education Hefei230601 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China Shanxi University School of Computer and Information Technology Taiyuan030006 China

Learning causal structures from observational data is critical for causal discovery and many machine learning tasks. Traditional constraint-based methods first adopt conditional independence (CI) tests to learn a global skeleton layer by layer and then orient the undirected edges to obtain a causal structure. However, the reliability of these statistical tests largely depends on the quality of data samples. In real-life scenarios, the presence of data noise or limited samples often makes many CI tests unreliable at each layer in the skeleton learning phase, leading to an inaccurate skeleton. As the number of layers increases, the inaccurate skeleton will continue to impair the skeleton construction of subsequent layers. Furthermore, an unreliable skeleton hampers the skeleton orientation procedure, resulting in an unsatisfactory causal structure. In this article, we propose a Bootstrap-based layerwise refining (BLR) algorithm for causal structure learning, which includes two new procedures to solve the above problems. First, BLR utilizes a novel layerwise skeleton refining procedure to construct the global skeleton layer by layer based on the bootstrap sampling. Second, BLR employs a collective skeleton orientation procedure that incorporates scoring techniques to collectively orient the global skeleton. The experimental results show that BLR outperforms the state-of-the-art methods on the benchmark Bayesian Network datasets. © 2020 IEEE.

关键词： Refining

来源：评论

学校读者我要写书评

暂无评论

Adversarial Contrastive Graph Augmentation with Counterfactual Regularization 39

Adversarial Contrastive Graph Augmentation with Counterfactu...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Long, Tao Zhang, Lei Zhang, Liang Cui, Laizhong College of Computer Science and Software Engineering Shenzhen University Guangdong Shenzhen China Shenzhen Research Institute of Big Data Guangdong Shenzhen China

ISBN: (纸本)157735897X

With the advancement of graph representation learning, self-supervised graph contrastive learning (GCL) has emerged as a key technique in the field. In GCL, positive and negative samples are generated through data augmentation. While recent works have introduced model-based methods to enhance positive graph augmentations, they often overlook the importance of negative samples, relying instead on rule-based methods that can fail to capture meaningful graph patterns. To address this issue, we propose a novel model-based adversarial contrastive graph augmentation (ACGA) method that automatically generates both positive graph samples with minimal sufficient information and hard negative graph samples. Additionally, we provide a theoretical framework to analyze the process of positive and negative graph augmentation in self-supervised GCL. We evaluate our ACGA method through extensive experiments on representative benchmark datasets, and the results demonstrate that ACGA outperforms state-of-the-art baselines. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Tree Regularization for Visual Explanations of Cancer Cell Classification

Tree Regularization for Visual Explanations of Cancer Cell C...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Raza, Muhammad Umair Chen, Jie Wang, Li Nawaz, Adil Leung, Victor C.M. Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology China

ISBN: (纸本)9798350386226

The challenge of interpretability remains a significant barrier to adopting deep neural networks in healthcare domains. Although tree regularization aims to align a deep neural network's decisions with a single axis-aligned decision tree, however, relying on one tree for all inputs often leads to sub-optimal performance and interoperability. To address this limitation, we propose an enhanced tree regularization method that integrates a post-hoc visual explainable model such as Grad-CAM. This approach guides the deep model to be well-approximated by decision trees tailored to the salient regions identified by Grad-CAM in the input space. We rigorously validate the effectiveness of this framework on two cancer cell datasets: CNMC, which focuses on acute lymphoblastic leukemia cells, and ISBI2016, which comprises benign and malignant skin lesions. The results demonstrate that the proposed method delivers simpler and more interpretable explanations without compromising accuracy, thereby advancing the interpretability of deep learning models in critical healthcare applications. © 2024 IEEE.

关键词： Cancer cells

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：