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

Feature selection using modified chaotic satin bowerbird algorithm with deep transfer learning for Multispectral Image Classification

引用

International Journal of Information Technology (Singapore) 2024年 1-13页

作者： Rajakani, M. Kavitha, R.J. Rajesh, S. Department of Data Science and Business Systems School of Computing Faculty of Engineering and Technology SRM Institute of Science and Technology SRM Nagar Kattankulathur Chennai India Department of Electronics and Communication Engineering University College of Engineering Panruti Panruti 607106 India Department of Information Technology Mepco Schlenk Engineering College Sivakasi India

Multispectral image classification has received significant attention among research communities and academicians. Recently, several artificial intelligence (AI) models can be used for the extraction of prominent features. Besides, deep learning (DL) methods become more familiar and gained interest in the remote sensing community for the classification of multispectral and hyperspectral images. With this motivation, this paper presents an optimized feature learning with deep transfer learning enabled multispectral image classification (OFLDTL-MSIC) technique. The proposed OFLDTL-MSIC technique aims to categorize the different class labels of the multispectral images. Besides, the OFLDTL-MSIC technique applies multi-level discrete wavelet transform (DWT) based image decomposition technique. Moreover, the EfficientNet technique is applied as a feature extractor to generate a collection of features. Furthermore, selecting optimal features extracted by a EfficientNet involves identifying and retaining the most relevant and informative features The improved chaotic satin bowerbird optimization (CSBO) algorithm which uses dynamic population size is proposed for feature selection and kernel extreme learning machine (KELM) model is applied for the classification process. In order to ensure the enhanced performance of the OFLTDL-MSIC technique, a wide range of simulations take place using the Madurai LISS IV multispectral images and the results are examined under several aspects. The extensive comparative study highlighted the better performance of the OFLTDL-MSIC technique over the recent methods. © Bharati Vidyapeeth's institute of Computer Applications and Management 2024.

关键词： Deep learning Image classification Multispectral images Parameter tuning Remote sensing

来源：评论

学校读者我要写书评

暂无评论

A Review on data Quality Dimensions for Big data 7

A Review on Data Quality Dimensions for Big Data

引用

7th Information Systems International Conference, ISICO 2023

作者： Ridzuan, Fakhitah Zainon, Wan Mohd Nazmee Wan Faculty of Data Science and Computing Universiti Malaysia Kelantan Pengkalan Chepa Kelantan Kota Bharu16100 Malaysia Institute for Artificial Intelligence & Big Data Universiti Malaysia Kelantan Pengkalan Chepa Kelantan Kota Bharu16100 Malaysia School of Computer Sciences Universiti Sains Malaysia Penang11800 Malaysia

Big data wave has led to a rapid increase in the amount of data being collected by organizations. While the accuracy and reliability of prediction models are often prioritized, the quality of the collected data is frequently overlooked. Poor data quality can result in the common problem of ‘garbage in, garbage out'. Traditional measures of data quality, such as accuracy, consistency, completeness, and timeliness, are no longer adequate in the era of Big data. Therefore, this paper proposes a taxonomy of data quality dimensions specifically for Big data, addressing emerging challenges by formulating 20 dimensions and categorizing them into four distinct categories. © 2023 The Authors. Published by Elsevier B.V.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Source Separation for IoT Anti-Jamming via Multitask Learning and Meta-Learning

引用

IEEE Internet of Things Journal 2025年第11期12卷 16761-16776页

作者： Guo, Pengcheng Yu, Miao Li, Cheng An, Kang Sun, Yifu Chatzinotas, Symeon Niyato, Dusit National University of Defense Technology Sixty-Third Research Institute Nanjing210007 China State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System Luoyang471000 China Kyung Hee University College of Electronics and Information Yongin17104 Korea Republic of Nanyang Technological University College of Computing and Data Science Jurong West 639798 Singapore

Malicious jamming attacks pose a significant threat to the integrity and performance of Internet of Things (IoT) networks. However, many jamming patterns are rare or infrequent, which makes them difficult to counter effectively. This article addresses the critical issue of anti-jamming (AJ) under few-shot sample conditions in IoT networks. Source separation is a key component of AJ communication. Although deep learning-based source separation has demonstrated significant advantages, it typically requires a large amount of labeled data, which can be impractical in certain environments. To overcome this challenge, we propose two novel schemes that leverage multitask learning (MTL) and meta-learning (ML) to enhance the model’s signal separation capabilities within the constraints of limited sample scenarios. MTL enhances robustness by leveraging shared representations across tasks, while ML allows for rapid adaptation to novel jamming signals with minimal samples. Specifically, we employ a modified separation model, SepFormer, as our baseline and integrate MTL and ML schemes to enable the separation of unknown or few-shot jamming signals. Additionally, we have constructed two datasets encompassing both simulated and real-world environmental data to test and evaluate the performance of the proposed methods. Simulation results demonstrate the superior AJ performance of our schemes, particularly when compared with a direct application of the separation model with few-shot samples. Furthermore, our evaluation of performance across various jamming scenarios and interference-to-signal ratios (ISRs) further confirms the effectiveness of our proposed scheme. © 2014 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Design of Teaching Model for Intuitive Imagination Development Supported by NetPad 17th

Design of Teaching Model for Intuitive Imagination Developme...

引用

17th International Conference on Computer science and Education, ICCSE 2022

作者： Gao, Jinghui Li, Jing Wang, Jie Zhou, Qixin Zhang, Chuanjun Guan, Hao Institute of Computing Science and Technology Guangzhou University Guangzhou China Department of Teaching Leshan Normal University Chengdu China School of Mathematics and Big Data Guizhou Education University Guiyang China

ISBN: (纸本)9789819924455

As one of the core literacies in mathematics, intuitive imagination is essential in learning geometry in middle school. Recently, BOPPPS, which is a teaching model that featured clear objectives, has gradually become an effective course design model for cultivating students’ intuitive imagination. Meanwhile, NetPad is a browser-based dynamic mathematical software that supports online mathematical experiments and dynamically displays geometric changes. In this paper, we propose a model called N-BOPPPS, which combines advantages of the BOPPPS teaching model and NetPad, aiming at developing students’ intuitive imagination. This model consists of six procedures supported by NetPad, i.e., bridge-in, objective, pre-assessment, participatory learning, post-assessment, and summary. It supports classroom instructions such as the inquiry-based model and student-engaged model. Besides, it encourages students to carry out experimental investigations and innovative practice during the learning process, and then their intuitive imagination is improved. At last, teaching practice is conducted under the guidance of N-BOPPPS and the effectiveness of this model is verified. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Automated Depression Detection from Text and Audio: A Systematic Review

引用

IEEE Journal of Biomedical and Health Informatics 2025年

作者： Li, Yuxin Kumbale, Sinchana Chen, Yanru Surana, Tanmay Chng, Eng Siong Guan, Cuntai Nanyang Technological University College of Computing and Data Science Singapore Manipal Institute of Technology Department of Computer Science and Engineering Manipal India

Depression is a prevalent mental health disorder that presents significant challenges for timely diagnosis and intervention. Automated Depression Detection (ADD) systems using text and audio offer scalable mental health assessment solutions. This review systematically evaluates 65 studies published between 2018 and 2024, focusing on ADD methods that utilize machine learning models with multimodal data. We examine key methodologies, including data augmentation, multimodal fusion, and feature extraction, along with state-of-the-art ADD systems. The review emphasizes the need for culturally adaptable, high-quality datasets and interpretable models for clinical use. We also identify gaps in longitudinal data and real-world applications. Future research should focus on developing clinically integrated, cross-cultural ADD systems that are interpretable, scalable, and robust. The findings of this review contribute to the research field by providing a comprehensive overview of existing methodologies, identifying gaps in the current literature, and offering insights for future advancements in depression detection using speech and text analysis. © 2013 IEEE.

关键词： mHealth

来源：评论

学校读者我要写书评

暂无评论

Autonomous Robot Navigation in Unknown Terrains using Generative Adversarial Networks 4

Autonomous Robot Navigation in Unknown Terrains using Genera...

引用

4th International Conference on Soft computing for Security Applications, ICSCSA 2024

作者： Chitra, P. Sridar, K. Govindan, Sudha Britto Raj, S. Akshya, J. Choudhry, Mani Deepak Sundarrajan, M. St Joseph's Institute of Technology Department of Artificial Intelligence and Data Science Chennai India Veerammal Engineering College Department of Computer Science and Engineering Dindigul India Sona College of Technology Department of Computer Science and Engineering Salem India RRASE College of Engineering Department of Computer Science and Engineering Chennai India SRM Institute of Science and Technology Department of Computational Intelligence Chennai India SRM Institute of Science and Technology Department of Computing Technologies Chennai India SRM Institute of Science and Technology Department of Networking and Communications Chennai India

ISBN: (纸本)9798331515720

Autonomous Robot Navigation in unknown and dynamic environments is considered one of the grand challenges in robotics. These motions that guide it span from rescue operations to planetary exploration. Classical methods for path planning, including A*, Dijkstra, and RRT, were unable to balance the efficiency and adaptability of motion planning over complex terrain. This may have a powerful solution using Generative Adversarial Networks (GANs) with advanced machine learning techniques to improve the ability of robotic navigation. This study proposes a GAN-based approach for designing an effective self-adaptive path planning and obstacle avoidance system for autonomous robots. Despite performing well in structured environments, traditional techniques normally fail in analysing the unstructured terrains with real-time adjustments and dynamic changes due to the high computational costs and lack of flexibility involved. In this regard, the proposed GAN-based system resolves these issues by rating navigation paths concerning safety and efficiency. Quantitative analysis demonstrates that within a forest, desert, urban, or off-road environment, the computational times by using the developed strategy turn out to be 0.12 seconds, 0.10 seconds, 0.14 seconds, and 0.13 seconds, respectively, behaving much lower than what can be achieved with other algorithms. This approach proves much superior in terms of computational efficiency path smoothness and adaptability under different environmental conditions in applications related to autonomous robot navigation systems. © 2024 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Machine learning tool for exploring sentiment analysis on twitter data

引用

Materials Today: Proceedings 2022年 56卷 1927-1934页

作者： Biradar, Shanta H. Gorabal, J.V. Gupta, Gaurav Department of Information Science & Engineering Sir M Visvesvaraya Institute of Technology Bengaluru562157 India Department of Computer Science & Engineering ATME College of Engineering Mysore570028 India Yogananda School of AI Computing and Data Science Shoolini University Himachal Pradesh Solan India

In social media, micro-blogging is a common routine of most people around the world. Social media analytics gathering structure and unstructured Big-data from various social sites and analyzing to make business decisions using Apache Hadoop and Apache Hive respectively. The objective of the research work was to develop big data technology used for gathering and handling large unstructured data from real time social media for sentiment analysis for identifying the brand and services. The methodology devised an algorithm based on sentimental analysis using customers review classification, which dealt with prepossessing the datasets, clustering of the data based on the specific domains, feature vector using n-gram models and tf-idf vectors extracts synonyms and classification sentiment analysis. The result shows that applied sentimental analysis with unsupervised clustering of data into specific domains and supervised machine learning techniques handle large amounts of twitter data in an efficient way. The developed tool 1.5 times faster than that of traditional database to Hadoop cluster and also the accuracy is nearly 80 %, which helps the user in computing, analyzing and interpreting interaction and associations between people, topics and ideas. © 2021

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of Computer science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Key Generationfor Secure File Sharing System Using Time Stamp

Dynamic Key Generationfor Secure File Sharing System Using T...

引用

2024 International Conference on Innovative computing, Intelligent Communication and Smart Electrical Systems, ICSES 2024

作者： Annie Silviya, S.H. Hilda Jerlin, C.M. Mohana Suganthi, N. Helen Sathiya, V. Jayashree, R. Oviya, N. Rajalakshmi Institute of Technology Chennai India Artificial Intelligence and Data Science Panimalar Engineering College Chennai India School of Computing Computer Science and Engineering Vel Tech Rangarajan Dr Sagunthala R&d Institute of Science and Technology Chennai India Vel Tech Multi Tech Dr Rangarajan Dr Sakunthala Engineering College Chennai India

ISBN: (纸本)9798331543617

Dynamic key generation for secure file sharing system using timestamp is a novel approach to military-based secure file sharing, which adds an additional layer of security to AES-2S6 which is prominently considered as the military-grade encryption. It is designed to enhance the confidentiality and integrity of transmitted files. When a Sender uploads a file, the system prompts for a character, converts it to its ASCII value, adds the current system time value to it and utilizes this aggregated value as a unique code to secure the uploaded file. To retrieve a file, the user must possess either the file key or initiate the retrieval process during the exact time of the original upload or in the next precise clock cycle. The combination of these factors provides an extra layer of security, making unauthorized access significantly more challenging. © 2024 IEEE.

关键词： Cryptography Encryption File Sharing System Timestamp

来源：评论

学校读者我要写书评

暂无评论

ABXI: Invariant Interest Adaptation for Task-Guided Cross-Domain Sequential Recommendation 25

ABXI: Invariant Interest Adaptation for Task-Guided Cross-Do...

引用

34th ACM Web Conference, WWW 2025

作者： Bian, Qingtian de Carvalho, Marcus Li, Tieying Xu, Jiaxing Fang, Hui Ke, Yiping College of Computing and Data Science Nanyang Technological University Singapore School of Computer Science and Engineering Northeastern University Shenyang China Research Institute for Interdisciplinary Sciences Key Laboratory of Interdisciplinary Research of Computation and Economics Shanghai University of Finance and Economics Shanghai China

ISBN: (纸本)9798400712746

Cross-Domain Sequential Recommendation (CDSR) has recently gained attention for countering data sparsity by transferring knowledge across domains. A common approach merges domain-specific sequences into cross-domain sequences, serving as bridges to connect domains. One key challenge is to correctly extract the shared knowledge among these sequences and appropriately transfer it. Most existing works directly transfer unfiltered cross-domain knowledge rather than extracting domain-invariant components and adaptively integrating them into domain-specific modelings. Another challenge lies in aligning the domain-specific and cross-domain sequences. Existing methods align these sequences based on timestamps, but this approach can cause prediction mismatches when the current tokens and their targets belong to different domains. In such cases, the domain-specific knowledge carried by the current tokens may degrade performance. To address these challenges, we propose the A-B-Cross-to-Invariant Learning Recommender (ABXI). Specifically, leveraging LoRA’s effectiveness for efficient adaptation, ABXI incorporates two types of LoRAs to facilitate knowledge adaptation. First, all sequences are processed through a shared encoder that employs a domain LoRA for each sequence, thereby preserving unique domain characteristics. Next, we introduce an invariant projector that extracts domain-invariant interests from cross-domain representations, utilizing an invariant LoRA to adapt these interests into modeling each specific domain. Besides, to avoid prediction mismatches, all domain-specific sequences are aligned to match the domains of the cross-domain ground truths. Experimental results on three datasets demonstrate that our approach outperforms other CDSR counterparts by a large margin. © 2025 Copyright held by the owner/author(s).

关键词： cross-domain sequential recommendation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：