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

23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024

作者： Wu, Xiaoqiang Zhu, Qingling Lin, Qiuzhen Chen, Weineng Li, Jianqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Computer Science and Engineering South China University of Technology Guangzhou China

Evolutionary reinforcement learning algorithms (ERLs), which combine evolutionary algorithms (EAs) with reinforcement learning (RL), have demonstrated significant success in enhancing RL performance. However, most ERLs rely heavily on Gaussian mutation operators to generate new individuals. When the standard deviation is too large or small, this approach will result in the production of poor or highly similar offspring. Such outcomes can be detrimental to the learning process of the RL agent, as too many poor or similar experiences are generated by these individuals. In order to alleviate these issues, this paper proposes an Adaptive Evolutionary Reinforcement Learning (AERL) method that adaptively adjusts both the standard deviation and the evaluation process. By tracking the performance of new individuals, AERL maintains the mutation strength within a suitable range without the need for additional gradient computations. Moreover, the proposed AERL approach early terminates unnecessary evaluations and discards experiences arising from poor individuals, thereby resulting in enhanced learning efficiency. Empirical assessments conducted on a variety of continuous control problems demonstrate the effectiveness of the AERL method. © 2024 International Foundation for Autonomous Agents and Multiagent Systems.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Efficient Plant Disease Detection using K-Means clustering and DenseNet-based Classification 3

Efficient Plant Disease Detection using K-Means clustering a...

引用

3rd International Conference on Electronics and Renewable Systems, ICEARS 2025

作者： Yashodha, G. Rajakumar, B. Krishnamoorthy, M. Surendran, R. Kg College of Arts and Science Department of Computer Technology Coimbatore641035 India J.N.N. Institute of Engineering Department of Artificial Intelligence and Data Science Chennai601102 India Panimalar Engineering College Department of Computer Science and Engineering Chennai600 123 India Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Department of Computer Science and Engineering Chennai India

ISBN: (数字)9798331509675

ISBN: (纸本)9798331509675

Early detection is vital in crop health, yet improvement in productivity faces time-consuming and inefficient challenges due to traditional manual techniques of plant disease detection. Thus, we present a deep learning-based novel framework with a method called k-means clustering with DenseNet Classification denoted by Kmc-Densenet. The approach streamlines this plant disease detection process involving the overall pipeline of extensive preprocessing, segmentation, and classification. In the preprocessing stage, we employ contrast enhancement techniques to improve the visibility of disease symptoms, ensuring clearer and more consistent leaf images for further analysis. For the segmentation task, we leverage a k-means clustering which effectively isolates regions of interest, distinguishing between healthy and diseased areas of the plant leaf. In the classification stage, we use a DenseNet variant of CNN, known for its feature reuse capabilities, to classify the plant diseases with high accuracy. The DenseNet model helps overcome the challenges posed by class imbalance, enhancing the overall detection performance. Finally the parameters of the Densenet model is fine-tuned using the Lyrebird Optimization Algorithm. The proposed Kmc-Densenet method is evaluated on the publicly available Plant village dataset, demonstrating superior performance in both segmentation and classification tasks. This framework offers a more efficient and reliable solution for early plant disease detection in precision agriculture, with potential applications in improving crop yield and quality. © 2025 IEEE.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Improving Event Coreference Resolution Using Prompt Learning and U-shaped Module 4

Improving Event Coreference Resolution Using Prompt Learning...

引用

4th International Conference on computer science and Blockchain, CCSB 2024

作者： Zhang, Mengyao Long, Jun Huang, Wenti School of Software Xinjiang University Urumqi China Institute of Big Data Central South University Changsha China School of Computer Science and Engineering Hunan University of Science and Technology Changsha China

ISBN: (纸本)9798350356502

Event Coreference Resolution (ECR) focuses on clustering event mentions that allude to identical actual events. Previous research primarily focuses on encoding event mentions without incorporating human interpretations, making it difficult to integrate human-summarized rules for guiding the ECR task. Furthermore, the semantic relations between event mentions have not been thoroughly explored, which impacts coreference judgment. To address these issues, we first utilize the powerful Longformer to acquire event representations at the document level. In addition, we introduce a prompt learning template to better emphasize event types and parameters, enhancing the interaction between event modeling and coreference judgment. Ultimately, we create matching vectors for event mentions using tensor matching and incorporate a U-shaped module to effectively identify the semantic relationships among these mentions, which enhances coreference discrimination. DPTU surpasses other ECR models on the KBP2017 dataset in cause of some experiments. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Knowledge Leaks in data-Driven Business Models? Exploring Different Types of Knowledge Risks and Protection Measures

引用

Schmalenbach Journal of Business Research 2024年第3期76卷 357-396页

作者： Fruhwirth, Michael Pammer-Schindler, Viktoria Thalmann, Stefan Know-Center GmbH Institute for Interactive Systems and Data Science Faculty of Computer Science and Biomedical Engineering Graz University of Technology Silicon Austria Labs GmbH Business Analytics and Data Science-Center (BANDAS-Center) School of Business Economics and Social Sciences University of Graz

data-driven business models imply the inter-organisational exchange of data or similar value objects. data science methods enable organisations to discover patterns and eventually knowledge from data. Further, by training machine learning models, knowledge is materialised in those models. Thus, organisations might risk the exposure of competitive knowledge by sharing data-related value objects, such as data, models or predictions. Although knowledge risks have been studied in traditional business models, little research has been conducted in the direction of data-driven business models. In this explorative qualitative study, we conducted 28 expert interviews in three rounds (two exploratory and one evaluatory) and identified five types of risks along the three basic types of value objects: data, models and predictions. These risks depend on the context, i.e., when competitive knowledge could be discovered from shared value objects. We found that those risks can be mitigated by technology, contractual regulations, trusted relationships, and adjusting the business model design. In this study, we show that the risk of knowledge leakage is a relevant risk factor in data-driven business models. Overall, knowledge risks should be considered already during business model design, and their management requires an interdisciplinary approach via a balanced assessment. The level of knowledge protection from a technology perspective highly depends on computer science innovations and thus is a moving target. As an outlook, we suggest that knowledge risk will become even more relevant with the extensive usage of machine learning and artificial intelligence in data-driven business models. © The Author(s) 2024.

关键词： Business model innovation data analytics data-driven business models Knowledge risks Risk management Value objects

来源：评论

学校读者我要写书评

暂无评论

On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs

引用

Frontiers of computer science 2023年第4期17卷 97-107页

作者： Jia LI Wenjun LI Yongjie YANG Xueying YANG School of Information Engineering Hunan Industry PolytechnicChangsha 410036China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha 410015China Chair of Economic Theory Saarland UniversitySaarbrücken 66123Germany

In the minimum degree vertex deletion problem,we are given a graph,a distinguished vertex in the graph,and an integer κ,and the question is whether we can delete at most κ vertices from the graph so that the distinguished vertex has the unique minimum *** maximum degree vertex deletion problem is defined analogously but here we want the distinguished vertex to have the unique maximum *** is known that both problems areΨ-hard and fixed-parameter intractable with respect to some natural *** this paper,we study the(parameterized)complexity of these two problems restricted to split graphs,p-degenerate graphs,and planar *** study provides a comprehensive complexity landscape of the two problems restricted to these special graphs.

关键词： minimum degree maximum degree vertex deletion split graphs planar graphs parameterized complexity

来源：评论

学校读者我要写书评

暂无评论

Analysis of MFCC and Chromagram Features in Lightweight Bidirectional LSTM and Attention Models for Music Genre Classification 21

Analysis of MFCC and Chromagram Features in Lightweight Bidi...

引用

21st International computer Conference on Wavelet Active Media Technology and Information Processing, ICCWAMTIP 2024

作者： Huang, Renxiang Li, Xu Li, Jianping School of Artificial Intelligence and Big Data Sichuan University of Arts and Science China Khoury College of Computer Science Northeastern university BostonMA02115 United States School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu610054 China

ISBN: (纸本)9798331519254

Music genre classification is essential for organizing music libraries and enhancing recommendation systems. This paper evaluates four lightweight models combining Mel Frequency Cepstral Coefficients (MFCCs) and Chromagram features with Bidirectional LSTM and Multi-head Attention architectures. Using the GTZAN dataset, we found that models with Multi-head Attention, outperformed with MFCCs features, achieving a test accuracy of 85.6%. MFCCs excel in capturing timbral characteristics critical for genre classification, while Chromagram features proved less effective. Although overfitting occurred, future studies can focus on incorporating methods like data augmentation and regularization to improve performance. These lightweight models offer a balance between accuracy and computational efficiency, making them suitable for real-time applications. © 2024 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Elevating Cystic Fibrosis Detection in Lungs using HRCT Images with a Cutting-Edge CNN-Based Approach 2

Elevating Cystic Fibrosis Detection in Lungs using HRCT Imag...

引用

2nd International Conference on Advanced Computing and Communication Technologies, ICACCTech 2024

作者： Ganjam, Amrutha Sriya Reddy C, Kishor Kumar Radhika, D. Ganjam, Karthik Singh.t, Monika Akuthota, Keerthi Sai Stanley College of Engineering and Technology for Women abids Department of Computer Science Hyderabad India University of Edinburgh Department School of Informatics MSc Data Science Edinburgh United Kingdom Stanley College of Engineering and Technology for Women Deptartment. of Computer Science and Engineering Hyderabad India

ISBN: (纸本)9798331519056

The creation of an algorithm for recognizing pathological abnormalities in cystic fibrosis is investigated in this paper using the CNN model with a modified psp-net. Currently, Decision Trees, Random Forests, PSP Nets, and Neural Networks are utilized in the diagnosis of cystic fibrosis. Since convolutional neural networks (CNNs) can process complicated picture data rapidly and efficiently, the goal of this study is to use CNNs for the detection of anomalies associated with cystic fibrosis. The method groups distinct annotated images into a simple and efficient structure, runs the set of images through a multiscale CNN procedure, and precisely locates the lung region affected by cystic fibrosis. The result of this paper demonstrated that differences in the training dataset can impact performance, but annotating CT images and categorizing them in terms of similar pathologies can improve the accuracy of the model. The proposed CNN model achieved an Accuracy of 84 %, Precision of 74%, Recall of 79%, F1-Score of 72%, error rate of 16% Which is better when compared with existing approaches. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Model

Few-shot Prompting for Pairwise Ranking: An Effective Non-Pa...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Sinhababu, Nilanjan Parry, Andrew Ganguly, Debasis Samanta, Debasis Mitra, Pabitra Centre for Computational and Data Sciences IIT Kharagpur India School of Computing Science University of Glasgow United Kingdom Department of Computer Science and Engineering IIT Kharagpur India

ISBN: (纸本)9798891761681

A supervised ranking model, despite its effectiveness over traditional approaches, usually involves complex processing - typically multiple stages of task-specific pre-training and fine-tuning. This has motivated researchers to explore simpler pipelines leveraging large language models (LLMs) that can work in a zero-shot manner. However, since zero-shot inference does not make use of a training set of pairs of queries and their relevant documents, its performance is mostly worse than that of supervised models, which are trained on such example pairs. Motivated by the existing findings that training examples generally improve zero-shot performance, in our work, we explore if this also applies to ranking models. More specifically, given a query and a pair of documents, the preference prediction task is improved by augmenting examples of preferences for similar queries from a training set. Our proposed pairwise few-shot ranker demonstrates consistent improvements over the zero-shot baseline on both in-domain (TREC DL) and out-domain (BEIR subset) retrieval benchmarks. Our method also achieves a close performance to that of a supervised model without requiring any complex training pipeline. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

XGCN:a library for large-scale graph neural network recommendations

引用

Frontiers of computer science 2024年第3期18卷 247-249页

作者： Xiran SONG Hong HUANG Jianxun LIAN Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Microsoft Research Asia Beijing 100080China

1 Introduction Graph Neural Networks(GNNs)have gained widespread adoption in recommendation systems,and nowadays there is a pressing need to effectively manage large-scale graph data[1].When it comes to large graphs,GNNs may encounter the scalability issue stemming from their multi-layer messagepassing ***,scaling GNNs has emerged as a crucial research area in recent years,with numerous scaling strategies being proposed.

关键词： scaling gained operations

来源：评论

学校读者我要写书评

暂无评论

Theoretical Insights for Diffusion Guidance: A Case Study for Gaussian Mixture Models 41

Theoretical Insights for Diffusion Guidance: A Case Study fo...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Wu, Yuchen Chen, Minshuo Li, Zihao Wang, Mengdi Wei, Yuting Department of Statistics and Data Science The Wharton School University of Pennsylvania United States Department of Electrical and Computer Engineering Princeton University United States

Diffusion models benefit from instillation of task-specific information into the score function to steer the sample generation towards desired properties. Such information is coined as guidance. For example, in text-to-image synthesis, text input is encoded as guidance to generate semantically aligned images. Proper guidance inputs are closely tied to the performance of diffusion models. A common observation is that strong guidance promotes a tight alignment to the task-specific information, while reducing the diversity of the generated samples. In this paper, we provide the first theoretical study towards understanding the influence of guidance on diffusion models in the context of Gaussian mixture models. Under mild conditions, we prove that incorporating diffusion guidance not only boosts classification confidence but also diminishes distribution diversity, leading to a reduction in the differential entropy of the output distribution. Our analysis covers the widely adopted sampling schemes including those based on the SDE and ODE reverse processes, and leverages comparison inequalities for differential equations as well as the Fokker-Planck equation that characterizes the evolution of probability density function, which may be of independent theoretical interest. Copyright 2024 by the author(s)

关键词： Fokker Planck equation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：