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

2024 International Conference on Distributed Systems, Computer Networks and Cybersecurity, ICDSCNC 2024

作者： Nidhishree, G. Vidyalakshmi, K. Vidyavardhaka College of Engineering Department of Computer Science and Engineering (Artificial Intelligence & Machine Learning) Mysuru India Ssahe University Sri Siddhartha Institute of Technology Department of Computer Science and Engineering (Data Science) Tumakuru India

ISBN: (数字)9798350375442

ISBN: (纸本)9798350375459

Cybersecurity has become very important due the rapid growth of digital technologies. It plays an important role in protecting computer systems and networks from potential attacks. Cybersecurity involves a set of technologies and algorithms that sometimes bring in threats to the security of computer networks, the end system, attacks on data, inappropriate access, changes and harm. Cyber-defense mechanisms involved at the host, application, network and data level require a constantly improved process to secure the system from any feasible attack, targeting data security and privacy. The network anomaly detection is challenging because of the complex network topologies and high dimensional data, leading to unbalanced performance, high false positive rates and difficulty of handling time-series data. Deep learning (DL) methods appear as an essential element in network Intrusion Detection Systems (NIDS) to recognize malicious behaviors or anomalies. Anomaly detection and network security are extensively utilized for intrusion detection performed by utilizing Cyber security to reduce malicious behavior in the networks. DL based-based detection utilizes many algorithms, which are capable of capturing complex patterns, effective for high-dimensional data. In DL, the anomaly is solved by two ways: flow-based detection that analyzes the network flows and packet-level data to identify anomalies. © 2024 IEEE.

关键词： anomaly detection cyber security deep learning intrusion detection system privacy and security

来源：评论

学校读者我要写书评

暂无评论

A Review of machine learning Algorithms for Detection of Breast Cancer 4

A Review of Machine Learning Algorithms for Detection of Bre...

引用

4th International Conference on Ubiquitous Computing and Intelligent Information Systems, ICUIS 2024

作者： Tale, Abhay Barhate, Aditya Verma, Prateek Gourshettiwar, Palash Faculty of Engineering and Technology Department of Artificial Intelligence and Data Science Maharashtra Wardha442001 India Faculty of Engineering and Technology Department of Artificial Intelligence and Machine Learning Maharashtra Wardha442001 India Faculty of Engineering and Technology Department of Computer Science and Medical Engineering Maharashtra Wardha442001 India

ISBN: (纸本)9798331529635

Breast cancer is still a global health concern, chiefly affecting women, as it is one of the major causes of cancer mortality. For the therapy to be effective, early diagnosis of cancer is critical to raising the survival level and increasing the effectiveness of the procedure. The advancement in the applied technique of machine learning (ML) has brought further opportunities for early and effective diagnosis of breast cancer. This review paper provides insights into how different ML algorithms including the Support Vector machine (SVM), Convolutional Neural Network (CNN), Random Forests, and many more have contributed to the detection of breast cancer. These algorithms have proved effective in providing solutions to various medical data and imaging including early diagnosis and treatment. The paper also looks at the use of ML with precision medicine to show that these technologies will help minimize false diagnoses and offer better treatment options. This review consolidates recent works and advancements to emphasize the prospect of ML in breast cancer management and calls for more studies to enhance its implementation in practice © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Optimal Ridge Regularization for Out-of-Distribution Prediction 41

Optimal Ridge Regularization for Out-of-Distribution Predict...

引用

41st International Conference on machine learning, ICML 2024

作者： Patil, Pratik Du, Jin-Hong Tibshirani, Ryan J. Department of Statistics University of California BerkeleyCA94720 United States Department of Statistics and Data Science Carnegie Mellon University PittsburghPA15213 United States Machine Learning Department Carnegie Mellon University PittsburghPA15213 United States

We study the behavior of optimal ridge regularization and optimal ridge risk for out-of-distribution prediction, where the test distribution deviates arbitrarily from the train distribution. We establish general conditions that determine the sign of the optimal regularization level under covariate and regression shifts. These conditions capture the alignment between the covariance and signal structures in the train and test data and reveal stark differences compared to the in-distribution setting. For example, a negative regularization level can be optimal under covariate shift or regression shift, even when the training features are isotropic or the design is underparameterized. Furthermore, we prove that the optimally tuned risk is monotonic in the data aspect ratio, even in the out-of-distribution setting and when optimizing over negative regularization levels. In general, our results do not make any modeling assumptions for the train or the test distributions, except for moment bounds, and allow for arbitrary shifts and the widest possible range of (negative) regularization levels. Copyright 2024 by the author(s)

关键词： Aspect ratio

来源：评论

学校读者我要写书评

暂无评论

Band selection in Hyperspectral Images using information similarity ranking

Band selection in Hyperspectral Images using information sim...

引用

2024 International Conference on machine Intelligence for GeoAnalytics and Remote Sensing, MIGARS 2024

作者： Hitendra Sarma, T. Dharma Reddy, R. Mrudula, K. Rammohan Rao, K. Dhondi, Sankalp Kanthi, Murali Vasavi College of Engineering Department of Information Technology Hyderabad India Gnits Department of Mathematics Hyderabad India Brane Enterprises Pvt. Ltd. Machine Learning Engineer Hyderabad India Cmr Technical Campus Department of Data Science Hyderabad India

ISBN: (纸本)9798350389678

Band selection in hyperspectral images is crucial for reducing redundant features and improving subsequent tasks like classification and segmentation. This article presents a novel band ranking method based on information similarity measures from the concepts of information theory. We introduce the Normalized Mutual Information for similarity and Variation of Information for dissimilarity to create a ranking scheme based on the affinity of a band to become a cluster center. We explore hybrid schemes combining structural and informational attributes. Supervised approaches using label-wise similarities using ground truth supervision are also investigated. Evaluation against state-of-the-art band selection algorithms on popular datasets, using both traditional machine learning and Deep learning models, demonstrates superior results. This study underscores the significance of informational and structural attributes in unsupervised band selection and the potential for further enhancement through supervised similarity with ground truth information. © 2024 IEEE.

关键词： Remote sensing

来源：评论

学校读者我要写书评

暂无评论

The mathematics of dots and pixels: On the theoretical foundations of image halftoning

引用

GAMM Mitteilungen 2025年第1期48卷

作者： Krahmer, Felix Veselovska, Anna Department of Mathematics and Munich Data Science Institute Technical University of Munich Munich Germany Munich Center for Machine Learning Munich Germany

The evolution of image halftoning, from its analog roots to contemporary digital methodologies, encapsulates a fascinating journey marked by technological advancements and creative innovations. Yet the theoretical understanding of halftoning is much more recent. In this article, we explore various approaches towards shedding light on the design of halftoning approaches and why they work. We discuss both halftoning in a continuous domain and on a pixel grid. We start by reviewing the mathematical foundation of the so-called electrostatic halftoning method, which departed from the heuristic of considering the back dots of the halftoned image as charged particles attracted by the grey values of the image in combination with mutual repulsion. Such an attraction-repulsion model can be mathematically represented via an energy functional in a reproducing kernel Hilbert space allowing for a rigorous analysis of the resulting optimization problem as well as a convergence analysis in a suitable topology. A second class of methods that we discuss in detail is the class of error diffusion schemes, arguably among the most popular halftoning techniques due to their ability to work directly on a pixel grid and their ease of application. The main idea of these schemes is to choose the locations of the black pixels via a recurrence relation designed to agree with the image in terms of the local averages. We discuss some recent mathematical understanding of these methods that is based on a connection to (Formula presented.) quantizers, a popular class of algorithms for analog-to-digital conversion. © 2025 The Authors. GAMM-Mitteilungen published by Wiley-VCH GmbH.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Combining Evidence Across Filtrations

arXiv

引用

arXiv 2024年

作者： Choe, Yo Joong Ramdas, Aaditya Data Science Institute University of Chicago United States Department of Statistics and Data Science Machine Learning Department Carnegie Mellon University United States

In sequential anytime-valid inference, any admissible procedure must be based on e-processes: generalizations of test martingales that quantify the accumulated evidence against a composite null hypothesis at any stopping time. This paper proposes a method for combining e-processes constructed in different filtrations but for the same null. Although e-processes in the same filtration can be combined effortlessly (by averaging), e-processes in different filtrations cannot because their validity in a coarser filtration does not translate to a finer filtration. This issue arises in sequential tests of randomness and independence, as well as in the evaluation of sequential forecasters. We establish that a class of functions called adjusters can lift arbitrary e-processes across filtrations. The result yields a generally applicable "adjust-then-combine" procedure, which we demonstrate on the problem of testing randomness in real-world financial data. Furthermore, we prove a characterization theorem for adjusters that formalizes a sense in which using adjusters is necessary. There are two major implications. First, if we have a powerful e-process in a coarsened filtration, then we readily have a powerful e-process in the original filtration. Second, when we coarsen the filtration to construct an e-process, there is a logarithmic cost to recovering validity in the original filtration.1 © 2024, CC BY.

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

A Study on Integrating machine learning Techniques for Waste Management 7

A Study on Integrating Machine Learning Techniques for Waste...

引用

7th International Conference on Circuit Power and Computing Technologies, ICCPCT 2024

作者： Vaidya, Ruchika Dattangire, Rahul Biradar, Divya Verma, Prateek Faculty of Engineering and Technology Department of Artificial Intelligence and Machine Learning Maharashtra Wardha442001 India Data Engineering Publicis Sapient HoustonTX77002 United States University of Texas Department of Computer Science ArlingtonTX76019 United States

ISBN: (纸本)9798350372816

The current study focuses on how various machine learning (ML) algorithms can be used in waste management and emphasizes the significance of intelligent technologies in addressing contemporary issues. By leading a broad writing survey, the paper features the meaning of incorporating these advances into waste management practices. The system segment subtleties the information assortment, preprocessing, model determination, and assessment measurements utilized in the review. The accuracy and performance metrics of various classifiers, including K Nearest Neighbors, Linear Support Vector Classifier, Logistic Regression, Decision Tree, Multi-Layer Perceptron, and Random Forest, are demonstrated by the results of experiments with them. Especially noteworthy is the MLP classifier's 91.81% accuracy. The discoveries highlight the viability of ML approaches in ssmart waste management. In addition, a comparison table that summarizes the classifiers' accuracy scores provides insight into their suitability for applications in waste management. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Stability Bounds for Smooth Optimal Transport Maps and their Statistical Implications

arXiv

引用

arXiv 2025年

作者： Balakrishnan, Sivaraman Manole, Tudor Department of Statistics and Data Science Machine Learning Department Carnegie Mellon University United States Statistics and Data Science Center Massachusetts Institute of Technology United States

We study estimators of the optimal transport (OT) map between two probability distributions. We focus on plugin estimators derived from the OT map between estimates of the underlying distributions. We develop novel stability bounds for OT maps which generalize those in past work, and allow us to reduce the problem of optimally estimating the transport map to that of optimally estimating densities in the Wasserstein distance. In contrast, past work provided a partial connection between these problems and relied on regularity theory for the Monge-Ampère equation to bridge the gap, a step which required unnatural assumptions to obtain sharp guarantees. We also provide some new insights into the connections between stability bounds which arise in the analysis of plugin estimators and growth bounds for the semi-dual functional which arise in the analysis of Brenier potential-based estimators of the transport map. We illustrate the applicability of our new stability bounds by revisiting the smooth setting studied by Manole et al. [2024], analyzing two of their estimators under more general conditions. Critically, our bounds do not require smoothness or boundedness assumptions on the underlying measures. As an illustrative application, we develop and analyze a novel tuning parameter-free estimator for the OT map between two strongly log-concave distributions. Copyright © 2025, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

The Age and Gender Detection using Deep Convolution Neural Network

The Age and Gender Detection using Deep Convolution Neural N...

引用

2024 IEEE International Conference on Signal Processing and Advance Research in Computing, SPARC 2024

作者： Chauhan, Shweta Kumar, Rahul Kumar, Bibek Madhav Institute of Science and Technology Department of Artificial Intelligence and Machine Learning Madhya Pradesh Gwalior474005 India GLA University ECE Department Uttar Pradesh Mathura281406 India Symbiosis University of Applied Sciences School of Data Science Madhya Pradesh Indore453112 India

ISBN: (纸本)9798350385199

Automatic age and gender classification has become important researcher since the rise of social platforms and social media. The main advancements in face recognition are the ability to determine a person's age and gender. This paper makes a significant contribution by providing a survey of different face recognition methods for determining age and gender. A deep neural network (DNN) known as a convolutional neural network is frequently used for natural language processing and image recognition and processing. The proposed method significantly enhances three elements: face alignment, face recognition, and face recognition accuracy. All weight vectors of people in the same age group within a given database are averaged together. To predict gender and age, picture classification and regression models have been discussed in this paper respectively. Although training the proposed network to make accurate predictions takes a lot of time, it significantly improves age and gender categorization precision. From the experimental results we compared and analyzed the work to the most recent UTK-Face benchmark for estimating age and gender. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Empirical Bernstein in smooth Banach spaces

arXiv

引用

arXiv 2024年

作者： Martinez-Taboada, Diego Ramdas, Aaditya Department of Statistics & Data Science United States Machine Learning Department Carnegie Mellon University United States

Existing concentration bounds for bounded vector-valued random variables include extensions of the scalar Hoeffding and Bernstein inequalities. While the latter is typically tighter, it requires knowing a bound on the variance of the random variables. We derive a new vector-valued empirical Bernstein inequality, which makes use of an empirical estimator of the variance instead of the true variance. The bound holds in 2-smooth separable Banach spaces, which include finite dimensional Euclidean spaces and separable Hilbert spaces. The resulting confidence sets are instantiated for both the batch setting (where the sample size is fixed) and the sequential setting (where the sample size is a stopping time). The confidence set width asymptotically exactly matches that achieved by Bernstein in the leading term. The method and supermartingale proof technique combine several tools of Pinelis (1994) and Waudby-Smith and Ramdas (2024). Copyright © 2024, The Authors. All rights reserved.

关键词： Banach spaces

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：