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

Predicting Age and Gender in Author Profiling: A Multi-Feature Exploration

computers, Materials & Continua 2024年第5期79卷 3333-3353页

作者： Aiman Muhammad Arshad Bilal Khan Sadique Ahmad Muhammad Asim Department of Computer Science City University of Science and Information TechnologyPeshawar25000Pakistan EIAS:Data Science and Blockchain Laboratory College of Computer and Information SciencesPrince Sultan UniversityRiyadh11586Saudi Arabia School of Computer Science and Technology Guangdong University of TechnologyGuangzhou510006China

Author Profiling (AP) is a subsection of digital forensics that focuses on the detection of the author’s personalinformation, such as age, gender, occupation, and education, based on various linguistic features, e.g., stylistic,semantic, and syntactic. The importance of AP lies in various fields, including forensics, security, medicine, andmarketing. In previous studies, many works have been done using different languages, e.g., English, Arabic, French,***, the research on RomanUrdu is not up to the ***, this study focuses on detecting the author’sage and gender based on Roman Urdu text messages. The dataset used in this study is Fire’18-MaponSMS. Thisstudy proposed an ensemble model based on AdaBoostM1 and Random Forest (AMBRF) for AP using multiplelinguistic features that are stylistic, character-based, word-based, and sentence-based. The proposed model iscontrasted with several of the well-known models fromthe literature, including J48-Decision Tree (J48),Na飗e Bays(NB), K Nearest Neighbor (KNN), and Composite Hypercube on Random Projection (CHIRP), NB-Updatable,RF, and AdaboostM1. The overall outcome shows the better performance of the proposed AdaboostM1 withRandom Forest (ABMRF) with an accuracy of 54.2857% for age prediction and 71.1429% for gender predictioncalculated on stylistic features. Regarding word-based features, age and gender were considered in 50.5714% and60%, respectively. On the other hand, KNN and CHIRP show the weakest performance using all the linguisticfeatures for age and gender prediction.

关键词： Digital forensics author profiling for security AdaBoostM1 random forest ensemble learning

来源：评论

学校读者我要写书评

暂无评论

A Cover-Independent Deep Image Hiding Method Based on Domain Attention Mechanism

引用

computers, Materials & Continua 2024年第3期78卷 3001-3019页

作者： Nannan Wu Xianyi Chen James Msughter Adeke Junjie Zhao School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China School of Electronics and Information Engineering Nanjing University of Information Science and TechnologyNanjing210044China

Recently,deep image-hiding techniques have attracted considerable attention in covert communication and high-capacity information ***,these approaches have some *** example,a cover image lacks self-adaptability,information leakage,or weak *** address these issues,this study proposes a universal and adaptable image-hiding ***,a domain attention mechanism is designed by combining the Atrous convolution,which makes better use of the relationship between the secret image domain and the cover image ***,to improve perceived human similarity,perceptual loss is incorporated into the training *** experimental results are promising,with the proposed method achieving an average pixel discrepancy(APD)of 1.83 and a peak signal-to-noise ratio(PSNR)value of 40.72 dB between the cover and stego images,indicative of its high-quality ***,the structural similarity index measure(SSIM)reaches 0.985 while the learned perceptual image patch similarity(LPIPS)remarkably registers at ***,self-testing and cross-experiments demonstrate the model’s adaptability and generalization in unknown hidden spaces,making it suitable for diverse computer vision tasks.

关键词： Deep image hiding attention mechanism privacy protection data security visual quality

来源：评论

学校读者我要写书评

暂无评论

Enhanced Acceleration for Generalized Nonconvex Low-Rank Matrix Learning

引用

Chinese Journal of Electronics 2025年第1期34卷 98-113页

作者： Hengmin Zhang Jian Yang Wenli Du Bob Zhang Zhiyuan Zha Bihan Wen School of Electrical and Electronic Engineering Nanyang Technological University School of Computer Science and Engineering Nanjing University of Science and Technology School of Information Science and Engineering East China University of Science and Technology Department of Electrical and Computer Engineering University of Macau

Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.

关键词： Learning systems Image recognition Minimization Computational efficiency Complexity theory Matrix decomposition Optimization Image reconstruction Singular value decomposition Convergence

来源：评论

学校读者我要写书评

暂无评论

Multi-label, Classification-based Prediction of Breast Cancer Metastasis Directions

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2025年第1期52卷 1-10页

作者： Wang, Tingting Fan, Qi Tan, Liang Zhang, Beier School of Computer and Software Engineering Anhui Institute of Information Technology China School of Computer Science and Technology Huaibei Normal University China School of Computer and Software Engineering Anhui Institute of Information Technology China School of Computer Science and Technology Huaibei Normal University China

Predicting the metastatic direction of primary breast cancer (BC), thus assisting physicians in precise treatment, strict follow-up, and effectively improving the prognosis. The clinical data of 293,946 patients with primary BC diagnosed between 2010 and 2015 were collected from the Surveillance, Epidemiology, and End Results database. Multiple interpolations and Multi-label Synthetic Minority Over-sampling Technique methods were used for data analysis, and machine learning model was established for multi-label classification. Finally, Surgical information, lymph node status, distant metastasis, tumor size, chemotherapy, histological type, and radiotherapy had significant influence as inputs. Compared with the k-nearest neighbor model, average accuracies of the decision tree and random forest (RF) models increased from 88.84% to 93.59% and 94.14%, respectively. Their average precision, recall rate, F1 score, area under the receiver operating characteristic curve and weighted-F1 increased from 87.24% to 95.85% and 94.74%, 87.73% to 90.40% and 91.76%, 87.07% to 92.16% and 93.45%, 97.11% to 99.53% and 99.95%, 82.13% to 89.44% and 90.48%, respectively. In conclusion, the RF model, which showed the best performance, can be used in multi-label prediction of BC metastasis directions, and can assist physicians in diagnosing and treating patients with primary BC. © (2025), (International Association of Engineers). All rights reserved.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

Anomaly Detection Model of Time Segment Power Usage Behavior Using Unsupervised Learning

引用

Journal of Internet technology 2024年第3期25卷 455-463页

作者： Ho, Wen-Jen Hsieh, Hsin-Yuan Tsai, Chia-Wei Software Technology Institute Institute for Information Industry Taiwan Department of Computer Science and Information Engineering National Taitung University Taiwan Department of Computer Science and Information Engineering National Taichung University of Science and Technology Taiwan

In Taiwan, the current electricity prices for residential users remain relatively low. This results in a diminished incentive for these users to invest in energy-saving improvements. Consequently, devising strategies to encourage residential users to adopt energy-saving measures becomes a vital research area. Grounded in behavioral science, this study introduces a feasible approach where an energy management system provides alerts and corresponding energy-saving recommendations to residential users upon detecting abnormal electricity consumption behavior. To pinpoint anomalous electricity usage within specific time segments, this research employs an unsupervised machine learning method, developing an anomaly detection model for the overall electricity consumption behavior of residential users. The model focuses on analyzing 2-hour intervals of electricity consumption, enabling more effective detection of abnormal usage patterns. It is trained using power consumption data collected from five actual residential users as part of an experimental study. The results indicate that the proposed anomaly detection model achieves performance metrics such as Precision, Recall, and F1-score of 0.90 or above, showcasing its potential for practical implementation. © 2024 Taiwan Academic Network Management Committee. All rights reserved.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

Controllable Preparation of Branched Polyolefins with Various Microstructural Units via Chain-walking Ethylene and Pentene Polymerizations

引用

Chinese Journal of Polymer science 2023年第6期41卷 905-914,I0008页

作者： Hong-Ju Liu Wan-Lu Tian Xiao-Yue Wang Tong Lei Pei Li Guo-Yong Xu Chao Li Shao-Jie Zhang Fu-Zhou Wang Institutes of Physical Science and Information Technology School of Computer Science and TechnologyAnhui UniversityHefei 230601China

Branched polyolefins with controllable topology structures were generated from the chain-walking(co)polymerizations of ethylene,1-pentene(1P)and 2-pentene(2P)using Brookhart-typeα-diimine Ni(II)-based catalysts possessing different para-substituted groups,{[(4-R-2-Et-6-Me-C6H2N=C)2Nap]NiBr2,Nap:1,8-naphthdiyl;R=CHMePh,Ni1;R=Ph,Ni2;R=H,Ni3}.The X-ray diffraction analysis demonstrated that the crystalline structure of Ni1′is in centrosymmetric dimer structure mode with the bimetallic Ni center connected by two bromide *** para-sec-phenethyl moiety in the catalyst Ni1 obviously improved its catalytic performance and thermal stability in the ethylene *** Ni1/Et2AlCl system showed great catalytic activities(up to 7.73×106 g·mol-1·h-1)and achieved polyethylene(PE)with alkyl chains,including Me,Et,n-Pr,n-Bu,sec-Bu branches and longer chains(Lg).Compared with the 1-pentene polymerization,this catalyst system successfully mediated the polymerization of 2P to give highly branched polymers with approximately 195 branches/1000C possessing Me,Et,and n-Pr branches and a long methylene sequence due to the monomer *** Et branches derived from 2,3-insertion is slightly less than the sum of Me and n-Pr branches derived from 3,2-insertion,indicating that the 3,2-insertion mode is a slightly favorable pathway in the polymerization of 2P.

关键词： polymerization insertion chains

来源：评论

学校读者我要写书评

暂无评论

Hyperparameter Optimization for Convolutional Neural Networks using the Salp Swarm Algorithm

引用

Informatica (Slovenia) 2023年第9期47卷 133-144页

作者： Abdulsaed, Entesar H. Alabbas, Maytham Khudeyer, Raidah S. Department of Computer Science College of Computer Science and Information Technology University of Basrah Basrah Iraq Department of Computer Information Systems College of Computer Science and Information Technology University of Basrah Basrah Iraq

Convolutional neural networks (CNNs) have exceptionally performed across various computer vision tasks. However, their effectiveness depends heavily on the careful selection of hyperparameters. Optimizing these hyperparameters can be challenging and time-consuming, especially when working with large datasets and complex network architectures. In response, we propose a novel approach for hyperparameter optimization in CNNs using the Salp Swarm Algorithm (SSA). Based on the natural behavior of mollusks, SSA mimics the collective intelligence that governs feeding and navigation. Taking advantage of SSA's unique properties, our research thoroughly explores the hyperparameter space. This exploration aims to identify the algorithm that maximizes CNNs performance. This paper presents the architecture of the SSA-based framework for hyperparameter optimization and compares it to other established optimization techniques, such as Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). We also present experimental results using the MNIST and fashion MNIST datasets, achieving an impressive classification accuracy of 99.46% for MNIST and 94.53% for fashion-MNIST. This case study not only contributes to the fields of deep learning and hyperparameter optimization by demonstrating the effectiveness of SSA in optimizing CNNs, but it also provides benefits to researchers and practitioners who are looking for optimal hyperparameter configurations for CNNs in a variety of computer vision applications. We also evaluate the scalability and robustness of our proposed method in the context of different CNNs structures. The insights we gained highlight SSA's potential for addressing challenges related to hyperparameter optimization. © 2023 Slovene Society Informatika. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

NeOR: neural exploration with feature-based visual odometry and tracking-failure-reduction policy

引用

Optoelectronics Letters 2025年第5期21卷 290-297页

作者： ZHU Ziheng LIU Jialing CHEN Kaiqi TONG Qiyi LIU Ruyu College of Computer Science and Technology College of Software Zhejiang University of Technology School of Information Science and Technology Hangzhou Normal University

Embodied visual exploration is critical for building intelligent visual agents. This paper presents the neural exploration with feature-based visual odometry and tracking-failure-reduction policy(Ne OR), a framework for embodied visual exploration that possesses the efficient exploration capabilities of deep reinforcement learning(DRL)-based exploration policies and leverages feature-based visual odometry(VO) for more accurate mapping and positioning results. An improved local policy is also proposed to reduce tracking failures of feature-based VO in weakly textured scenes through a refined multi-discrete action space, keyframe fusion, and an auxiliary task. The experimental results demonstrate that Ne OR has better mapping and positioning accuracy compared to other entirely learning-based exploration frameworks and improves the robustness of feature-based VO by significantly reducing tracking failures in weakly textured scenes.

关键词： A

来源：评论

学校读者我要写书评

暂无评论

GPS: graph contrastive learning via multi-scale augmented views from adversarial pooling

引用

science China(information sciences) 2025年第1期68卷 145-158页

作者： Wei JU Yiyang GU Zhengyang MAO Ziyue QIAO Yifang QIN Xiao LUO Hui XIONG Ming ZHANG School of Computer Science National Key Laboratory for Multimedia Information ProcessingPeking University Artificial Intelligence Thrust The Hong Kong University of Science and Technology Department of Computer Science University of California

Self-supervised graph representation learning has recently shown considerable promise in a range of fields, including bioinformatics and social networks. A large number of graph contrastive learning approaches have shown promising performance for representation learning on graphs, which train models by maximizing agreement between original graphs and their augmented views(i.e., positive views). Unfortunately, these methods usually involve pre-defined augmentation strategies based on the knowledge of human experts. Moreover, these strategies may fail to generate challenging positive views to provide sufficient supervision signals. In this paper, we present a novel approach named graph pooling contrast(GPS) to address these *** by the fact that graph pooling can adaptively coarsen the graph with the removal of redundancy, we rethink graph pooling and leverage it to automatically generate multi-scale positive views with varying emphasis on providing challenging positives and preserving semantics, i.e., strongly-augmented view and weakly-augmented view. Then, we incorporate both views into a joint contrastive learning framework with similarity learning and consistency learning, where our pooling module is adversarially trained with respect to the encoder for adversarial robustness. Experiments on twelve datasets on both graph classification and transfer learning tasks verify the superiority of the proposed method over its counterparts.

关键词： graph representation learning graph neural networks graph contrastive learning graph augmentations graph pooling

来源：评论

学校读者我要写书评

暂无评论

Efficient Quantum Secure Vector Dominance and Its Applications in Computational Geometry

引用

IEEE Transactions on computers 2025年第6期74卷 2129-2143页

作者： Liu, Wenjie Su, Bingmei Sun, Feiyang Nanjing University of Information Science and Technology School of Software Nanjing210044 China Nanjing University of Information Science and Technology School of Computer Science Nanjing210044 China

Secure vector dominance is a key cryptographic primitive in secure computational geometry (SCG), determining the dominance relationship of vectors between two participants without revealing their private information. However, the security of traditional SVD protocols is compromised by the formidable computational power of quantum computing, and their efficiency needs further improvement. To address these challenges, an efficient quantum secure vector dominance (QSVD) protocol is proposed. Specifically, we first introduce a quantum private permutation (QPP) subprotocol to shuffle the elements of each participant's private input vector. To further facilitate secure data comparison, we propose an enhanced quantum millionaire subprotocol with equality determination functionality, building upon Jia's original protocol. Based on the above two subprotocols, we propose a QSVD protocol with polynomial complexity, deriving vector dominance in a single interaction with a semi-honest third party. Performance analyses confirm that QSVD protocol is correct, resilient against malicious attacks, and retains polynomial computational complexity, ensuring both security and efficiency. To demonstrate the scalability of the QSVD protocol, we illustrate its applications in several geometric computation problems, such as point-line inclusion determination, line-line intersect determination, and point-in-polygon determination. Finally, we validate the feasibility of our protocol by conducting comprehensive simulations on IBM's Qiskit platform, demonstrating its practical applicability and effectiveness in real quantum computing environments. © 1968-2012 IEEE.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：