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

Performance analysis of various classification algorithms for providing competency training to workplace risk prevention

引用

Multimedia Tools and Applications 2025年第15期84卷 15123-15149页

作者： Garg, Shruti Murugan, Prabhu Manimaran, A. Sundar, Ramesh Dakshinamoorthy, Prabakar Rajaram, Gnanajeyaraman Birla Institute of Technology Ranchi Mesra India Department of ECE Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Saveetha University Chennai602105 India Department of Computer Science and Engineering Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Saveetha University Chennai602105 India Department of Networking and Communication School of Computing SRM Institute of Science and Technology SRM Nagar Kattankulathur India Department of Data Science and Business Systems School of Computing SRM Institute of Science and Technology SRM Nagar Kattankulathur India

In the workplace, risk prevention helps detect the risks and prevent accidents. To achieve this, workers' mental and physical parameters related to their health should be focused on and analyzed. It helps improve the workers' mental health and thus improves organizational performance. There are a lot of mental illnesses due to excess work and a lack of professional knowledge. It affects the performance of the worker. So, the organization needs to conduct competency training programs to improve their professional skills and the mindset to tackle the work pressure. There are several competency training programs given in various organizations to mold the workers, and it considerably reduces workplaces risks. Competency training in the workplace teaches integrity, honesty, managerial skills, and other workers. Developing organizational skills is the primary concern in this competency training. This paper enabled one of the best machine learning algorithms to be chosen to predict the hazards in the workplace and provide a healthy environment to the workers. For that, several classification methods such as Logistic Regression, Decision trees, AdaBoost classifier, Random Forest, Gradient Boosting classifier, and XGBoost classifier are implemented experimented with, and the performance is verified with python software. From the comparison, it has been found that the XGBoost classifier is selected as the best classifier and identified that it is highly suitable for analyzing and predicting workplace risks data. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Occupational risks

来源：评论

学校读者我要写书评

暂无评论

Reliability and Robustness analysis of Machine Learning based Phishing URL Detectors

引用

IEEE Transactions on Dependable and Secure Computing 2022年 1-18页

作者： Sabir, Bushra Babar, M. Ali Gaire, Raj Abuadbba, Alsharif School of Computer Science The University of Adelaide Adelaide SA Australia CSIROs Data61 Canberra Australia

ML-based Phishing URL (MLPU) detectors serve as the first level of defence to protect users and organisations from being victims of phishing attacks. Lately, few studies have launched successful adversarial attacks against specific MLPU detectors raising questions on their practical reliability and usage. Nevertheless, the robustness of these systems has not been extensively investigated. Therefore, the security vulnerabilities of these systems, in general, remain primarily unknown that calls for testing the robustness of these systems. In this article, we have proposed a methodology to investigate the reliability and robustness of 50 representative state-of-the-art MLPU models. First, we have proposed a cost-effective Adversarial URL generator URLBUG that created an Adversarial URL dataset ($Adv_\text{data}$) . Subsequently, we reproduced 50 MLPU (traditional ML and Deep learning) systems and recorded their baseline performance. Lastly, we tested the considered MLPU systems on $Adv_\text{data}$ and analyzed their robustness and reliability using box plots and heat maps. Our results showed that the generated adversarial URLs have valid syntax and can be registered at a median annual price of ${\$}$11.99, and out of 13% of the already registered adversarial URLs, 63.94% were used for malicious purposes. Moreover, the considered MLPU models Matthew Correlation Coefficient (MCC) dropped from median 0.92 to 0.02 when tested against $Adv_\text{data}$, indicating that the baseline MLPU models are unreliable in their current form. Further, our findings identified several security vulnerabilities of these systems and provided future directions for researchers to design dependable and secure MLPU systems. IEEE

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Sample Complexity of Posted Pricing for a Single Item 38

Sample Complexity of Posted Pricing for a Single Item

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Jin, Billy Kesselheim, Thomas Ma, Will Singla, Sahil Cornell University School of Operations Research and Information Engineering United States University of Bonn Institute of Computer Science Lamarr Institute for Machine Learning and Artificial Intelligence Germany Columbia University Graduate School of Business Data Science Institute United States Georgia Tech School of Computer Science United States

Selling a single item to n self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximization. Since the optimal mechanisms are often impractical and do not work for sequential buyers, posted pricing mechanisms, where fixed prices are set for the item for different buyers, have emerged as a practical and effective alternative. This paper investigates how many samples are needed from buyers' value distributions to find near-optimal posted prices, considering both independent and correlated buyer distributions, and welfare versus revenue maximization. We obtain matching upper and lower bounds (up to logarithmic factors) on the sample complexity for all these settings. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence Strategies for Accurate Segmentation and Categorization of Unveiling Genetic Disorders in Bioinformatics 2

Artificial Intelligence Strategies for Accurate Segmentation...

引用

2nd International Conference on Self Sustainable Artificial Intelligence Systems, ICSSAS 2024

作者： Sarathamani, T. Kavitha, K. Thirumoorthi, C. Vagini, K Jayanthi Manikandaprabhu, P. Sumathi, P. Kolkata India Mohan Babu University School of Computing Department of Ai and Ml Sree Sainath Nagar Tirupati India Psg College of Arts and Science Department of Computer Science Tamilnadu Coimbatore India Kpr College of Arts Science and Research Department of Computer science with Data Analytics Tamilnadu Coimbatore India Amrita Vishwa Vidyapeetham School of Computing Department of Computer Science Karnataka Mysuru India Dr. G R Damodaran College of Science Department of Computer Science Tamilnadu Coimbatore India

ISBN: (纸本)9798350368413

Women all across the world are affected by the potentially fatal condition known as breast cancer. According to clinical experts, early cancer detection helps to save lives. Several machine learning algorithms have been developed to classify cancers in order to diagnose breast cancer, and medical image processing has been found to be a beneficial area for increasing classification accuracy. One of the most crucial signs for detecting breast cancer early is micro classifications. Machine learning methods have been employed in numerous studies to address this problem. Various classification algorithms are used to find the presence of breast cancer whether it is Benign or Malignant. For earlier cancer detection and diagnosis, an image enhancement approach is being developed. A machine learning technique is employed in this work to attempt to categorize breast cancer. The purpose of the present research was to increase the accuracy of machine learning methods for disease diagnosis using ML techniques. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Trace-based Multi-Dimensional Root Cause Localization of Performance Issues in Microservice Systems 24

Trace-based Multi-Dimensional Root Cause Localization of Per...

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Zhang, Chenxi Dong, Zhen Peng, Xin Zhang, Bicheng Chen, Miao Fudan University China Shanghai Collaborative Innovation Center of Intelligent Visual Computing China School of Computer Science and Shanghai Key Laboratory of Data Science Fudan University China

ISBN: (纸本)9798400702174

Modern microservice systems have become increasingly complicated due to the dynamic and complex interactions and runtime environment. It leads to the system vulnerable to performance issues caused by a variety of reasons, such as the runtime environments, communications, coordinations, or implementations of services. Traces record the detailed execution process of a request through the system and have been widely used in performance issues diagnosis in microservice systems. By identifying the execution processes and attribute value combinations that are common in anomalous traces but rare in normal traces, engineers may localize the root cause of a performance issue into a smaller scope. However, due to the complex structure of traces and the large number of attribute combinations, it is challenging to find the root cause from the huge search space. In this paper, we propose TraceContrast, a trace-based multidimensional root cause localization approach. TraceContrast uses a sequence representation to describe the complex structure of a trace with attributes of each span. Based on the representation, it combines contrast sequential pattern mining and spectrum analysis to localize multidimensional root causes efficiently. Experimental studies on a widely used microservice benchmark show that TraceContrast outperforms existing approaches in both multidimensional and instance-dimensional root cause localization with significant accuracy advantages. Moreover, Trace-Contrast is efficient and its efficiency can be further improved by parallel execution. © 2024 ACM.

关键词： Spectrum analysis

来源：评论

学校读者我要写书评

暂无评论

Mapping the Scientific Landscape of Integrated Scheduling Towards Industry 5.0 with A Bibliometric Analysis 6

Mapping the Scientific Landscape of Integrated Scheduling To...

引用

6th International Conference on Industry 4.0 and Smart Manufacturing, ISM 2024

作者： Putri Ardyanti, Anak Agung Ayu Xie, Zhiqiang Karnyoto, Andrea Stevens Pardamean, Bens Estiyanti, Ni Made School of Computer Science and Technology Harbin University of Science and Technology Harbin150000 China Faculty of Information Technology and Design Primakara University Bali 80226 Indonesia Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta11480 Indonesia Computer Science Department BINUS Graduate Program Master of Computer Science Bina Nusantara University Jakarta 11480 Indonesia School of Management and Business University of Debrecen Debrecen Hungary

The industry is rapidly transitioning from the 4.0 era to the 5.0 era, prompting renewed interest among scholars in scheduling problems. They allow operations to process and assemble various components simultaneously. This bibliometric analysis provides a comprehensive understanding of the diverse research perspectives on the potential challenges of integrated scheduling within the framework. We identified 357 Scopus articles and analysed co-occurrence keyword (CNK) by VOSViewer tools and Global Citation Score (GCS) by Scopus tools. The research data obtained from 1993 to 2023 mainly in the subject areas of Engineering, computer science, Maths, and others. CNK identified six cluster keywords, and nine most cited articles based on normalised GCS. These results contribute to our understanding of the development of scheduling algorithms, shifting from an emphasis on manufacturing transfers to contemporary demand-centric research directions. Furthermore, this research provides a valuable perspective for policymakers, plant personnel, and manufacturing managers to make informed decisions. © 2025 The Authors. Published by Elsevier B.V.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Few-shot Link Prediction on Hyper-relational Facts 30

Few-shot Link Prediction on Hyper-relational Facts

引用

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

作者： Wei, Jiyao Guan, Saiping Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Hyper-relational facts, which consist of a primary triple (head entity, relation, tail entity) and auxiliary attribute-value pairs, are widely present in real-world Knowledge Graphs (KGs). Link Prediction on Hyper-relational Facts (LPHFs) is to predict a missing element in a hyper-relational fact, which helps populate and enrich KGs. However, existing LPHFs studies usually require an amount of high-quality data. They overlook few-shot relations, which have limited instances, yet are common in real-world scenarios. Thus, we introduce a new task, Few-Shot Link Prediction on Hyper-relational Facts (FSLPHFs). It aims to predict a missing entity in a hyper-relational fact with limited support instances. To tackle FSLPHFs, we propose MetaRH, a model that learns Meta Relational information in Hyper-relational facts. MetaRH comprises three modules: relation learning, support-specific adjustment, and query inference. By capturing meta relational information from limited support instances, MetaRH can accurately predict the missing entity in a query. As there is no existing dataset available for this new task, we construct three datasets to validate the effectiveness of MetaRH. Experimental results on these datasets demonstrate that MetaRH significantly outperforms existing representative models. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

The Double Contrast for Unsupervised Person Re-Identification 24

The Double Contrast for Unsupervised Person Re-Identificatio...

引用

2024 International Conference on computer Vision and Deep Learning, CVDL 2024

作者： Liu, Daocheng Fu, Yanyun Shi, Wenxi Zhu, Zhansheng Wang, Deyong School of Computer Science and Technology Urumqi China Beijing Academy of Science and Technology Beijing China Key Laboratory of Big Data of Xinjiang Social Security Risk Urumqi China

ISBN: (纸本)9798400718199

At present, the most popular unsupervised person re-identification(Re-ID) research mainly uses some clustering methods to gather samples with similar features and generate a pseudo-label for each cluster, and uses the parameterless contrast loss to feedback correlation information between *** previous methods used the memory dictionary to store all instance-dependent features, but This approach does not take into account the different number of positive samples in each cluster, and the progress of each cluster update of the memory dictionary is not the *** order to improve the consistency of the update progress, a method is implemented to store the central feature vector in each cluster, but using a hard-sample feature vector in the cluster to update it, so that a single instance feature cannot represent the central feature well. In this article, we study out a method to combine hard instance contrast and cluster contrast, that is, the central feature vector in each cluster is stored in the memory dictionary, and the hard instance feature vector in each cluster is also stored *** addition, in terms of momentum update, the central feature vector and hard instance feature vector of each cluster in mini-batch are used for *** not only solves the problem of inconsistent update progress, but also better learns the similarity and difference of instances in the same cluster, and better aggregates instances within cluster and instances between clusters. Through three dataset experiments, it is concluded that this method has a good improvement. © 2024 ACM.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Nested Event Extraction upon Pivot Element Recognition 30

Nested Event Extraction upon Pivot Element Recognition

引用

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

作者： Ren, Weicheng Li, Zixuan Jin, Xiaolong Bai, Long Su, Miao Liu, Yantao Guan, Saiping Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Nested Event Extraction (NEE) aims to extract complex event structures where an event contains other events as its arguments recursively. Nested events involve a kind of Pivot Elements (PEs) that simultaneously act as arguments of outer-nest events and as triggers of inner-nest events, and thus connect them into nested structures. This special characteristic of PEs brings challenges to existing NEE methods, as they cannot well cope with the dual identities of PEs. Therefore, this paper proposes a new model, called PerNee, which extracts nested events mainly based on recognizing PEs. Specifically, PerNee first recognizes the triggers of both inner-nest and outer-nest events and further recognizes the PEs via classifying the relation type between trigger pairs. The model uses prompt learning to incorporate information from both event types and argument roles for better trigger and argument representations to improve NEE performance. Since existing NEE datasets (e.g., Genia11) are limited to specific domains and contain a narrow range of event types with nested structures, we systematically categorize nested events in the generic domain and construct a new NEE dataset, called ACE2005-Nest. Experimental results demonstrate that PerNee consistently achieves state-of-the-art performance on ACE2005-Nest, Genia11, and Genia13. The ACE2005-Nest dataset and the code of the PerNee model are available at https://***/waysonren/PerNee. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Selective Temporal Knowledge Graph Reasoning 30

Selective Temporal Knowledge Graph Reasoning

引用

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

作者： Hou, Zhongni Jin, Xiaolong Li, Zixuan Bai, Long Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Temporal Knowledge Graph (TKG), which characterizes temporally evolving facts in the form of (subject, relation, object, timestamp), has attracted much attention recently. TKG reasoning aims to predict future facts based on given historical ones. However, existing TKG reasoning models are unable to abstain from predictions they are uncertain, which will inevitably bring risks in real-world applications. Thus, in this paper, we propose an abstention mechanism for TKG reasoning, which helps the existing models make selective, instead of indiscriminate, predictions. Specifically, we develop a confidence estimator, called Confidence Estimator with History (CEHis), to enable the existing TKG reasoning models to first estimate their confidence in making predictions, and then abstain from those with low confidence. To do so, CEHis takes two kinds of information into consideration, namely, the certainty of the current prediction and the accuracy of historical predictions. Experiments with representative TKG reasoning models on two benchmark datasets demonstrate the effectiveness of the proposed CEHis. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：