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

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Tangherloni, Andrea Coelho, Vasco Buffa, Francesca M. Cazzaniga, Paolo Bocconi Institute for Data Science and Analytics Bocconi University Department of Computing Sciences Milan Italy University of Milano-Bicocca Department of Informatics Systems and Communication Milan Italy Bocconi University Department of Computing Sciences Milan Italy Bocconi Institute for Data Science and Analytics Italy University of Bergamo Department of Human and Social Sciences Bergamo Italy

ISBN: (纸本)9798350308365

Evolutionary algorithms are effective techniques for optimizing non-linear and complex high-dimensional problems. However, most of them require a precise fine-tuning of their functioning settings to achieve satisfactory results. In this work, we propose a modified version of an evolutionary approach called the Evolutionary Algorithm for COmplex-process oPtimization (EACOP), designed to have a limited number of hyper-parameters. The base version of EACOP (bEACOP) combines different strategies, including the scatter search methodology, local searches, and a novel combination method based on path relinking to balance the exploration and exploitation phases. Our improved version (iEACOP) intensifies the exploration phase to escape from suboptimal search space areas where, on the contrary, bEACOP gets stuck. Our results show that iEACOP outperforms bEACOP on 27 out of 29 CEC 2017 test suite benchmark functions, exhibiting comparable performance against the three best algorithms of the CEC 2017 competition on single-objective bound-constrained real-parameter numerical optimization. The source code of bEACOP and iEACOP will be made publicly available on GitHub upon acceptance. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Forest-based Evolutionary Algorithm for Reconstructing Boolean Gene Regulatory Networks 21

Forest-based Evolutionary Algorithm for Reconstructing Boole...

引用

21st IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology, CIBCB 2024

作者： Stranieri, Nicolò Buffa, Francesca M. Tangherloni, Andrea Bocconi University Department of Computing Sciences Milan Italy University of Oxford Department of Oncology Oxford United Kingdom Bocconi University Bocconi Institute for Data Science and Analytics Department of Computing Sciences Milan Italy

ISBN: (纸本)9798350356632

Gene Regulatory Networks (GRNs) play a fundamental role in orchestrating the expression of our genes through complex interactions between DNA, RNA, proteins, and other molecules. Accurately reconstructing such networks from gene expression data is a critical yet challenging task in Systems Biology due to their intricate nature and limited data availability. In this work, we introduce a novel Forest-based Evolutionary Algorithm (FP) designed for reconstructing Boolean GRNs from time series data of gene expressions. Unlike traditional methods that struggle with scalability and accurate representation of regulatory interactions, FP utilizes a forest structure where each tree represents the logical relationships between genes, enhancing the model's capacity to depict complex networks efficiently. Our comprehensive testing indicates that FP rapidly converges towards potential solutions within a limited number of generations, although a higher fitness score does not always equate to a more accurate GRN representation. Implementing mini-batching techniques, inspired by their effectiveness in gradient descent optimization, shows promise in improving computational efficiency without sacrificing performance. A comparative analysis against the main state-of-the-art approaches reveals FP's tendency towards conservative predictions, emphasizing precision over recall, making it particularly suitable for contexts where the cost of false positives is high. These initial results suggest that FP is a robust and efficient tool for GRN inference. © 2024 IEEE.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

SACNN-IDS: A self-attention convolutional neural network for intrusion detection in industrial internet of things

引用

CAAI Transactions on Intelligence Technology 2024年第6期9卷 1398-1411页

作者： Mimonah Al Qathrady Safi Ullah Mohammed S.Alshehri Jawad Ahmad Sultan Almakdi Samar M.Alqhtani Muazzam A.Khan Baraq Ghaleb Department of Information Systems College of Computer Science and Information SystemsNajran UniversityNajranSaudi Arabia Department of Computer Science Quaid-i-Azam UniversityIslamabadPakistan Department of Computer Science College of Computer Science and Information SystemsNajran UniversityNajranSaudi Arabia School of Computing Engineering and the Built EnvironmentEdinburgh Napier UniversityEdinburghUK ICESCO Chair Big Data Analytics and Edge Computing Quaid-i-Azam UniversityIslamabadPakistan

Industrial Internet of Things(IIoT)is a pervasive network of interlinked smart devices that provide a variety of intelligent computing services in industrial *** IIoT nodes operate confidential data(such as medical,transportation,military,etc.)which are reachable targets for hostile intruders due to their openness and varied *** Detection Systems(IDS)based on Machine Learning(ML)and Deep Learning(DL)techniques have got significant ***,existing ML and DL-based IDS still face a number of obstacles that must be *** instance,the existing DL approaches necessitate a substantial quantity of data for effective performance,which is not feasible to run on low-power and low-memory *** and fewer data potentially lead to low performance on existing *** paper proposes a self-attention convolutional neural network(SACNN)architecture for the detection of malicious activity in IIoT networks and an appropriate feature extraction method to extract the most significant *** proposed architecture has a self-attention layer to calculate the input attention and convolutional neural network(CNN)layers to process the assigned attention features for *** performance evaluation of the proposed SACNN architecture has been done with the Edge-IIoTset and X-IIoTID *** datasets encompassed the behaviours of contemporary IIoT communication protocols,the operations of state-of-the-art devices,various attack types,and diverse attack scenarios.

关键词： convolutional neural network deep learning industrial internet of things intrusion detection self-attention

来源：评论

学校读者我要写书评

暂无评论

Q-Rung Orthopair Fuzzy Sets-Enhanced FMEA for COVID-19 Risk Assessment

Informatica (Slovenia)

引用

Informatica (Slovenia) 2025年第1期49卷 81-92页

作者： Abdullah, Lazim Awang, Noor Azzah Qiyas, Muhammad Special Interest Group of Modelling and Data Analytics Faculty of Computer Science and Mathematics Universiti Malaysia Terengganu Kuala Nerus21030 Malaysia College of Computing Informatics and Mathematics Universiti Teknologi MARA Selangor Shah Alam40450 Malaysia Department of Mathematics Riphah International University Failsabad Campus Pakistan

Failure Modes and Effects Analysis (FMEA) is a widely used tool for risk analysis, primarily to identify risk factors affecting system quality. Due to the limitations of the traditional FMEA model, several recent models incorporating advanced fuzzy set extensions have been developed to enhance the reliability of risk assessment outcomes. However, most of these models limit expert flexibility in expressing preferences and often overlook the impact of unequal expert weights and the stability of risk ranking results. This study introduces a new FMEA model based on Q-Rung Orthopair Fuzzy Sets (Q-ROFSs), termed Q-ROFSs-FMEA. Q-ROFSs, an extension of intuitionistic fuzzy sets, introduce a new linguistic term. The Q-ROFSs-FMEA model considers the unequal weights of experts, enabling a dynamic representation of expert preferences. These weights and the linguistic evaluation of risk factors are integrated through an aggregation operator, facilitating consensus among experts. The model is applied to a case study on COVID-19 risk factors, revealing that ‘older age’ (risk priority number 0.000012) is the highest risk factor, while ‘gender’ (risk priority number -0.0037) is the lowest. It is found that the ranking of risk factors determined by the Q-ROFSs-FMEA model is obtained as FM1 FM3 FM6 FM4 FM5 FM7 FM8 FM2 . Furthermore, a comparative analysis indicates consistent ranking results across different models, demonstrating the reliability of the proposed model. The case study and comparative analysis validate the effectiveness and applicability of the Q-ROFSsbased risk assessment model. © 2025 Slovene Society Informatika. All rights reserved.

关键词： Failure modes

来源：评论

学校读者我要写书评

暂无评论

A Fast Feature Selection for Interpretable Modeling Based on Fuzzy Inference Systems 21

A Fast Feature Selection for Interpretable Modeling Based on...

引用

21st IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology, CIBCB 2024

作者： Tangherloni, Andrea Cazzaniga, Paolo Stranieri, Nicolò Buffa, Francesca M. Nobile, Marco S. Bocconi Institute for Data Science and Analytics Bocconi University Department of Computing Sciences Milan Italy University of Bergamo Department of Human and Social Sciences Bergamo Italy Bocconi University Department of Computing Sciences Milan Italy Ca' Foscari University of Venice Department of Environmental Sciences Informatics and Statistics Venice Italy

ISBN: (纸本)9798350356632

Large datasets are often beneficial for the generation of predictive models using machine learning approaches. However, it is often the case that not all variables in the dataset contain useful information. In fact, some variables might be useless, redundant, misleading, or even harmful to performance, both in terms of accuracy and computational effort. Because of that, Feature Selection (FS) is one of the most delicate and important steps in machine learning. This is even more relevant in the case of interpretable models based on Fuzzy Inference Systems (FIS). The reasons are two-fold: on the one hand, FIS are generally built on top of a data partitioning based on clustering, which can suffer from high dimensionality;on the other hand, the knowledge base of the FIS, to be concretely understandable, should not contain rules involving too many variables. FS can be performed using multiple approaches, most notably filter and wrapper methods. The latter are often based on evolutionary algorithms, where a population of candidate solutions (each representing a possible set of selected variables) evolves towards the optimal selection. Although wrapper methods can be effective, they are, in general, computationally expensive. In this work, we propose a completely different - and more computationally effective - algorithm based on Random Forest (RF) models. Specifically, we exploit RFs to rank variables according to their importance. Then, we use that information to perform a statistical analysis and determine the minimal set of features necessary to build an accurate FIS. We show the effectiveness of our approach by using two (semi)synthetic datasets built on real-world datasets, and we validate our approach by applying the FS method to a medical dataset. © 2024 IEEE.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Advanced Techniques in Network Traffic Analysis: Utilizing Wireshark For In-Depth Live data Packet Inspection And Information Capture 2

Advanced Techniques in Network Traffic Analysis: Utilizing W...

引用

2nd IEEE International Conference on Communication, Security and Artificial Intelligence, ICCSAI 2023

作者： Chowhan, Santhosh Saxena, Abhilash Kumar University Department of Data Analytics and Mathematical Sciences Karnataka Bangalore India College of Computing Science and Information Technology Teerthanker Mahaveer University Uttar Pradesh Moradabad India

ISBN: (纸本)9798350369960

The escalating frequency and sophistication of cyber-attacks have placed a spotlight on the importance of Quality of Service (QoS) and robust network security mechanisms. Effective traffic analysis and distribution are critical for maintaining the integrity of network applications and safeguarding data. Our research focuses on the development and assessment of a network intrusion detection system (NIDS) that utilizes the advanced packet analysis capabilities of Wireshark, a renowned network protocol analyzer. The system is designed to enhance network security by enabling more efficient and accurate data collection through network monitoring tools. This serves as the foundation for detecting and thwarting a wide range of malicious activities, including malware and spyware incursions, within network traffic. The innovation of our approach lies in its integration of packet sniffing technology with AI-driven analysis techniques. By applying Machine Learning algorithms to the data captured by Wireshark, our NIDS is capable of identifying patterns indicative of intrusive behavior, which might elude traditional detection methods. We present a comprehensive evaluation of our system, showcasing its efficacy in real-time intrusion detection and its potential for integration into existing network infrastructures. This study contributes to the ongoing discourse in cybersecurity, offering a sophisticated tool in the battle against digital threats and reinforcing the role of intelligent systems in protecting network environments © 2023 IEEE.

关键词： data Packet Analysis Techniques Network Security and Forensics Network Traffic Analysis packets Real-Time Network Monitoring Wireshark for data Packet Inspection

来源：评论

学校读者我要写书评

暂无评论

Exponential Capacity of Dense Associative Memories

引用

Physical Review Letters 2024年第7期132卷 077301-077301页

作者： Carlo Lucibello Marc Mézard Department of Computing Sciences Bocconi University Milano 20136 Italy and Bocconi Institute for Data Science and Analytics (BIDSA) Milano 20136 Italy.

Recent generalizations of the Hopfield model of associative memories are able to store a number P of random patterns that grows exponentially with the number N of neurons, P=exp(αN). Besides the huge storage capacity, another interesting feature of these networks is their connection to the attention mechanism which is part of the Transformer architecture widely applied in deep learning. In this work, we study a generic family of pattern ensembles using a statistical mechanics analysis which gives exact asymptotic thresholds for the retrieval of a typical pattern, α1, and lower bounds for the maximum of the load α for which all patterns can be retrieved, αc, as well as sizes of attraction basins. We discuss in detail the cases of Gaussian and spherical patterns, and show that they display rich and qualitatively different phase diagrams.

关键词： Disordered systems Spin glasses Deep learning Machine learning Replica theory

来源：评论

学校读者我要写书评

暂无评论

A Multistage Framework for Detection of Very Small Objects 23

A Multistage Framework for Detection of Very Small Objects

引用

6th International Conference on Machine Vision and Applications, ICMVA 2023

作者： Don, Duleep Rathgamage Aygun, Ramazan Karakaya, Mahmut School of Data Science and Analytics College of Computing and Software Engineering Kennesaw State University MariettaGA30060 United States Department of Computer Science College of Computing and Software Engineering Kennesaw State University MariettaGA30060 United States

ISBN: (纸本)9781450399531

Small object detection is one of the most challenging problems in computer vision. Algorithms based on state-of-the-art object detection methods such as R-CNN, SSD, FPN, and YOLO fail to detect objects of very small sizes. In this study, we propose a novel method to detect very small objects, smaller than 8×8 pixels, that appear in a complex background. The proposed method is a multistage framework consisting of an unsupervised algorithm and three separately trained supervised algorithms. The unsupervised algorithm extracts ROIs from a high-resolution image. Then the ROIs are upsampled using SRGAN, and the enhanced ROIs are detected by our two-stage cascade classifier based on two ResNet50 models. The maximum size of the images used for training the proposed framework is 32×32 pixels. The experiments are conducted using rescaled German Traffic Sign Recognition Benchmark dataset (GTSRB) and downsampled German Traffic Sign Detection Benchmark dataset (GTSDB). Unlike MS COCO and DOTA datasets, the resulting GTSDB turns out to be very challenging for any small object detection algorithm due to not only the size of objects of interest but the complex textures of the background as well. Our experimental results show that the proposed method detects small traffic signs with an average precision of 0.332 at the intersection over union of 0.3. © 2023 ACM.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Developing a Strategic data Science Roadmap through Trend Analysis and Digital Maturity Assessment

Developing a Strategic Data Science Roadmap through Trend An...

引用

2024 IEEE International Conference on Technology Management, Operations and Decisions, ICTMOD 2024

作者： Nazliel, Kerem Kayabay, Kerem Gokalp, Mert Onuralp Aydin, Ebru Gokalp Eren, P. Erhan Kocyigit, Altan Graduate School of Informatics Middle East Technical University Ankara Turkey Converged Computing HLRS University of Stuttgart Stuttgart Germany Data Analytics Center TÜPRAŞ Ankara Turkey Hacettepe University Department of Computer Engineering Ankara Turkey

ISBN: (纸本)9798350367355

The rapid advancements in data Science and Artificial Intelligence require organizations to create strategic roadmaps that align with both technological trends and business objectives. This paper introduces a data-driven approach for developing such strategies, integrating Digital Maturity Assessment, Multivocal Literature Review, Topic Modeling, and SWOT analysis within the data Science Roadmapping (DSR) framework. The proposed approach aims to enhance the accuracy and relevance of roadmap development by combining multiple tools for comprehensive trend identification and organizational capability assessment. Ongoing validation through case studies will assess its practical application and effectiveness. © 2024 IEEE.

关键词： data accuracy

来源：评论

学校读者我要写书评

暂无评论

DE-ConvGraph 3D UNet: A Novel Deep Learning Model for Optimizing Radiotherapy Treatment Plans in Oropharyngeal Cancer

DE-ConvGraph 3D UNet: A Novel Deep Learning Model for Optimi...

引用

2023 IEEE Applied Imagery Pattern Recognition Workshop, AIPR 2023

作者： Murugadoss, Bhuvanashree Amudha, J. Sugumaran, Vijayan Amrita Vishwa Vidyapeetham School of Computing Department of Computer Science and Engineering Karnataka Bengaluru India Oakland University Center for Data Science and Big Data Analytics RochesterMI United States Oakland University Department of Decision and Information Sciences RochesterMI United States

ISBN: (纸本)9798350359527

Automated radiotherapy treatment planning aims to improve treatment accuracy and efficiency. However, the prevalent Knowledge-Based Planning (KBP) method faces issues like lengthy manual problem formulation and challenges in accurately modeling human anatomy and processing high-dimensional data. This work focuses on treatment plan optimization and considers deep learning as a potential solution. Deep learning algorithms, by virtue of their ability to learn from large quantities of data and model complex relationships, can automate the formulation of the optimization problem in KBP, saving significant time and effort. However, despite these compelling advantages, it should be noted that the current convolution-based encoder-decoder models used for radiotherapy treatment plan optimization have a limited capability in capturing long-range dependencies between distant voxels. This work aims to introduce 'DE-ConvGraph 3D UNet', a novel deep learning model, to address these limitations and optimize radiotherapy treatment plans for oropharyngeal cancer. The proposed 'DE-ConvGraph 3D UNet' model includes a Graph Convolutional Network (GCN) component to capture long-range dependencies between distant voxels. Furthermore, the dual-encoder structure of the model combines the strengths of GCN and 3D Convolutional U-Net, enabling global relationships and local pattern capturing in a 3D patient volume. Experiments were conducted using the benchmark dataset-OpenKBP-Opt. The proposed model shows improvements in performance in comparison to state-of-The-Art U-Net variants in terms of mean squared voxel-wise error, dose volume histogram points and clinical criteria satisfaction. © 2023 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：