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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Larsen, Kasper Green Montasser, Omar Zhivotovskiy, Nikita Department of Computer Science Aarhus University Denmark Department of Statistics and Data Science Yale University United States Department of Statistics University of California Berkeley United States

Multi-distribution or collaborative learning involves learning a single predictor that works well across multiple data distributions, using samples from each during training. Recent research on multi-distribution learning, focusing on binary loss and finite VC dimension classes, has shown near-optimal sample complexity that is achieved with oracle efficient algorithms. That is, these algorithms are computationally efficient given an efficient ERM for the class. Unlike in classical PAC learning, where the optimal sample complexity is achieved with deterministic predictors, current multi-distribution learning algorithms output randomized predictors. This raises the question: can these algorithms be derandomized to produce a deterministic predictor for multiple distributions? Through a reduction to discrepancy minimization, we show that derandomizing multi-distribution learning is computationally hard, even when ERM is computationally efficient. On the positive side, we identify a structural condition enabling an efficient black-box reduction, converting existing randomized multi-distribution predictors into deterministic ones. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing cervical cancer classification using transfer learning with deep gaussian processes and support vector machines

引用

Discover Artificial Intelligence 2024年第1期4卷 73页

作者： Ahishakiye, Emmanuel Kanobe, Fredrick Department of Networks Data Science and Artificial Intelligence Kyambogo University Kampala Uganda Department of Computer Science Kyambogo University Kampala Uganda

Background: Cervical cancer is the fourth most frequent cancer in women worldwide. Even though cervical cancer deaths have decreased significantly in Western countries, low and middle-income countries account for nearly 90% of cervical cancer deaths. While Western countries are leveraging the powers of artificial intelligence (AI) in the health sector, most countries in sub-Saharan Africa are still lagging. In Uganda, cytologists manually analyze Pap smear images for the detection of cervical cancer, a process that is highly subjective, slow, and tedious. Machine learning (ML) algorithms have been used in the automated classification of cervical cancer. However, most of the MLs have overfitting limitations which limits their deployment, especially in the health sector where accurate predictions are needed. Methods: In this study, we propose two kernel-based algorithms for automated detection of cervical cancer. These algorithms are (1) an optimized support vector machine (SVM), and (2) a deep Gaussian Process (DGP) model. The SVM model proposed uses an optimized radial basis kernel while the DGP model uses a hybrid kernel of periodic and local periodic kernel. Results: Experimental results revealed accuracy of 100% and 99.48% for an optimized SVM model and DGP model respectively. Results on precision, recall, and F1 score were also reported. Conclusions: The proposed models performed well on cervical cancer detection and classification, and therefore suitable for deployment. We plan to deploy our proposed models in a mobile application-based tool. The limitation of the study was the lack of access to high-performance computational resources. © The Author(s) 2024.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

Penalized M-Estimation Based on Standard Error Adjusted Adaptive Elastic-Net

引用

Journal of Systems science & Complexity 2023年第3期36卷 1265-1284页

作者： WU Xianjun WANG Mingqiu HU Wenting TIAN Guo-Liang LI Tao School of Statistics and Mathematics Zhongnan University of Economics and LawWuhan 430073China School of Statistics and Data Scicence Qufu Normal UniversityQufu 273165China Department of Statistics and Data Science Southern University of Science and TechnologyShenzhen 518055China

When there are outliers or heavy-tailed distributions in the data, the traditional least squares with penalty function is no longer applicable. In addition, with the rapid development of science and technology, a lot of data, enjoying high dimension, strong correlation and redundancy, has been generated in real life. So it is necessary to find an effective variable selection method for dealing with collinearity based on the robust method. This paper proposes a penalized M-estimation method based on standard error adjusted adaptive elastic-net, which uses M-estimators and the corresponding standard errors as weights. The consistency and asymptotic normality of this method are proved theoretically. For the regularization in high-dimensional space, the authors use the multi-step adaptive elastic-net to reduce the dimension to a relatively large scale which is less than the sample size, and then use the proposed method to select variables and estimate parameters. Finally, the authors carry out simulation studies and two real data analysis to examine the finite sample performance of the proposed method. The results show that the proposed method has some advantages over other commonly used methods.

关键词： Adaptive elastic net -estimation oracle property standard error

来源：评论

学校读者我要写书评

暂无评论

Secure container Orchestration: A framework for detecting and mitigating Orchestrator - level vulnerabilities

引用

Multimedia Tools and Applications 2025年第17期84卷 18351-18371页

作者： Mahavaishnavi, V. Saminathan, R. Prithviraj, R. Department of Artificial Intelligence and Data Science Panimalar Engineering College Tamil Nadu Chennai600123 India Department of Computer Science and Engineering Annamalai University Chidambaram India Department of Computer Science and Engineering Annamalai University Chidambaram India

This paper presents Secure Orchestration, a novel framework meticulously planned to uphold rigorous security measures over the profound security concerns that lie within the container orchestration platforms, especially in Kubernetes. The widespread adoption of containerized environments has raised concerns about the vulnerabilities at the level of the orchestrator. Secure Orchestration delivers a comprehensive approach by leveraging cutting-edge methods to detect and prevent the exposure of vulnerabilities from orchestrator misconfigurations, privilege escalation exploits that can thwart the orchestration security layer, and unauthorized access attempts targeting the orchestration system itself. In addition, it is further strengthened by deploying an Intrusion Detection and Prevention System (IDPS), which is responsible for actively monitoring the orchestration infrastructure. The IDPS utilizes sophisticated algorithms and mechanisms for detecting anomalies to continuously assess the orchestration environment for indications of intrusion, vulnerabilities, and anomalous activities. By using this proactive approach, the framework is able to rapidly identify potential threats and respond through countermeasures in a timely manner, thus greatly reducing the risks associated with orchestrator level vulnerabilities. Conducting a set of real-world experiments that closely simulate a variety of threat scenarios is imperative for empirically validating the efficiency of this framework. The obtained empirical results yield insightful revelations on the efficacy of the framework in accurately identifying and mitigating vulnerabilities, thereby ensuring the privacy and integrity of container orchestration systems. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Identification of Human Activity from Video Streaming Smartphone data Using Intensified VGG16

引用

International Journal of Engineering, Transactions B: Applications 2025年第6期38卷 1340-1352页

作者： Yadav, R.K. Daniel, A. Semwal, V.B. Department of Computer Science and Engineering Amity University Gwalior India Data Science and Engineering Manipal University Jaipur India Department of Computer Science and Engineering Maulana Azad National Institute Technology Bhopal India

Human activity recognition (HAR) techniques pick out and interpret human behaviors and actions by analyzing data gathered from various sensor devices. HAR aims to recognize and automatically categorize human activities using patterns and attributes taken from sensor data. HAR is complex in implementing the algorithm for a self-recorded dataset, including challenges such as age variation, wearing different clothes, environment and surface, the direction of the smartphone camera, and many more. The paper aims to propose a VGG16 deep learning framework including an activation function and different optimizers for classifying human activity from the real-time captured dataset;further, we compare the evaluated results with existing results. The proposed methods achieved 99.88% accuracy with excellent precision, recall, and F_measure values. Comparing the evaluated result with existing outcomes over the WISDM and UCI-HAR datasets. The new things in the article are a self-captured dataset of various aged male, female, and healthy volunteers to perform seven activities. Furthermore, this research uses Tensor Processing Units (TPU) available on Kaggle to improve classification accuracy while reducing error rates and speeding up execution. ©2025 The author(s).

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

Stylometry-driven framework for Urdu intrinsic plagiarism detection: a comprehensive analysis using machine learning, deep learning, and large language models

引用

Neural Computing and Applications 2025年第9期37卷 6479-6513页

作者： Manzoor, Muhammad Faraz Farooq, Muhammad Shoaib Abid, Adnan Department of Computer Science University of Management and Technology Lahore Pakistan Department of Data Science Faculty of Computing and Information Technology University of the Punjab Lahore Pakistan

Detecting plagiarism in documents is a well-established task in natural language processing (NLP). Broadly, plagiarism detection is categorized into two types (1) intrinsic: to check the whole document or all the passages have been written by a single author;(2) extrinsic: where a suspicious document is compared with a given set of source documents to figure out sentences or phrases which appear in both documents. In the pursuit of advancing intrinsic plagiarism detection, this study addresses the critical challenge of intrinsic plagiarism detection in Urdu texts, a language with limited resources for comprehensive language models. Acknowledging the absence of sophisticated large language models (LLMs) tailored for Urdu language, this study explores the application of various machine learning, deep learning, and language models in a novel framework. A set of 43 stylometry features at six granularity levels was meticulously curated, capturing linguistic patterns indicative of plagiarism. The selected models include traditional machine learning approaches such as logistic regression, decision trees, SVM, KNN, Naive Bayes, gradient boosting and voting classifier, deep learning approaches: GRU, BiLSTM, CNN, LSTM, MLP, and large language models: BERT and GPT-2. This research systematically categorizes these features and evaluates their effectiveness, addressing the inherent challenges posed by the limited availability of Urdu-specific language models. Two distinct experiments were conducted to evaluate the impact of the proposed features on classification accuracy. In experiment one, the entire dataset was utilized for classification into intrinsic plagiarized and non-plagiarized documents. Experiment two categorized the dataset into three types based on topics: moral lessons, national celebrities, and national events. Both experiments are thoroughly evaluated through, a fivefold cross-validation analysis. The results show that the random forest classifier achieved an ex

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

OptiFog: A Framework for Acquiring State Information and Predicting Resource Availability for Task Offloading in Cooperative Fog-Networks

引用

IEEE Transactions on Services Computing 2024年 1-13页

作者： Alam, Mehbub Ahmed, Nurzaman Ghosh, Shyamal Matam, Rakesh Barbhuiya, Ferdous Ahmed Department of Computer Science and Engineering Indian Institute of Information Technology Guwahati India Department of Computer Science Dartmouth College Hanover USA School of Data Science Indian Institute of Science Education and Research Thiruvananthapuram India

The primary objective of fog computing is to minimize the reliance of IoT devices on the cloud by leveraging the resources of fog network. Typically, IoT devices offload computation tasks to fog to meet different task requirements such as latency in task execution, computation costs, etc. So, selecting such a fog node that meets task requirements is a crucial challenge. To choose an optimal fog node, access to each node's resource availability information is essential. Existing approaches often assume state availability or depend on a subset of state information to design mechanisms tailored to different task requirements. In this paper, OptiFog: a cluster-based fog computing architecture for acquiring the state information followed by optimal fog node selection and task offloading mechanism is proposed. Additionally, a continuous time Markov chain based stochastic model for predicting the resource availability on fog nodes is proposed. This model prevents the need to frequently synchronize the resource availability status of fog nodes, and allows to maintain an updated state information. Extensive simulation results show that OptiFog lowers task execution latency considerably, and schedules almost all the tasks at the fog layer compared to the existing state-of-the-art. IEEE

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

CoverGAN: cover photo generation from text story using layout guided GAN

引用

Soft Computing 2025年第1期29卷 405-423页

作者： Cheema, Adeel Naeem, M. Asif Department of Data Science and Artificial Intelligence National University of Computer and Emerging Sciences Islamabad Pakistan

Generating cover photos from story text is a non trivial challenge to solve. Existing approaches focus on generating only images from given text prompt. To the best of our knowledge, non of these approaches focus on generating cover photos from a text story. The paper addresses this issue by introducing multi-object image generation with text title from a text story. We split the problem into three steps:- understanding semantics of text story, predicting layout of objects, and generating a cover photo. At start, a semantic relation was encoded between text story objects using a Scene graph, then features from graph neural network were concatenated with single object features from scene graph to create an object layout. All of these features were then passed on to the image generating part. Image generation was further divided into two phases. In the first phase, the image is generated using a scene graph image generation model. While in the second phase, the results of first phase were further enhanced using image translation model conditioned on the object layout. In final phase we generated title of the given story based on generated image. In our experiments, we used custom dataset of text stories with three animal categories along with the COCO dataset. For the image generating part, we evaluated our approach with state of the art models known as scene_gen and sg2im. Our method generated high-resolution informative cover photo with story title by positioning the objects at right locations as specified in the text story. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

PVTAdpNet: polyp segmentation using pyramid vision transformer with a novel adapter block

引用

International Journal of Information Technology (Singapore) 2025年 1-16页

作者： Nezhad, Arshia Yousefi Aghaei, Helia Sajedi, Hedieh Department of Mathematics Statistics and Computer Science College of Science University of Tehran Tehran Iran

Colorectal cancer is one of the most prevalent cancers in the world. It illustrates the effectiveness of early detection and treatment of precursor polyps to prevent progression to malignancy. Despite the pivotal role of colonoscopy in detecting colorectal cancer and polyps, its efficacy has been marred by high miss rates attributed to heterogeneity in polyps and observer variability. Recent advancements in deep learning have significantly improved the automation of polyp detection and segmentation systems. In this study, we introduce the Pyramid Vision Transformer Adapter Residual Network (PVTAdpNet) to enhance existing models. As such, PVTAdpNet also presents an encoder-decoder architecture with additional upsampling layers by fusing some principles from the Pyramid Vision Transformer model with a novel residual block and adapter base skip connection. The lightweight design of PVTAdapNet enables real-time inference, making it suitable for clinical integration. This research contributes to developing advanced computer-aided diagnosis systems for improved polyp detection and early cancer diagnosis. PVTAdpNet obtains a high Dice coefficient of 0.8851 and a mean Intersection over Union of 0.8167 on out-of-distribution polyp datasets. Evaluation of the PolypGen dataset demonstrates PVTAdpNet's capability for real-time, accurate performance within familiar distributions. The source code of our network is available at https://***/ayousefinejad/***. © Bharati Vidyapeeth's Institute of computer Applications and Management 2025.

关键词： Adapter residual network Colonoscopy Colorectal cancer Deep learning Polyp detection Pyramid vision transformer Transformer

来源：评论

学校读者我要写书评

暂无评论

data-driven slicing for dimension reduction in regressions:A likelihood-ratio approach

引用

science China Mathematics 2024年第3期67卷 647-664页

作者： Peirong Xu Tao Wang Lixing Zhu Department of Statistics Shanghai Jiao Tong UniversityShanghai 200240China Center for Statistics and Data Science Beijing Normal University at ZhuhaiZhuhai 519087China

To efficiently estimate the central subspace in sufficient dimension reduction,response discretization via slicing its range is one of the most used methodologies when inverse regression-based methods are ***,existing slicing schemes are almost all ad hoc and not widely ***,how to define datadriven schemes with certain optimal properties is a longstanding problem in this *** research described here is then ***,we introduce a likelihood-ratio-based framework for dimension reduction,subsuming the popularly used methods including the sliced inverse regression,the sliced average variance estimation and the likelihood acquired ***,we propose a regularized log likelihood-ratio criterion to obtain a data-driven slicing scheme and derive the asymptotic properties of the estimators.A simulation study is carried out to examine the performance of the proposed method and that of existing methods.A data set concerning concrete compressive strength is also analyzed for illustration and comparison.

关键词： full-likelihood approach adaptive slicing regularization second-order method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：