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

machine learning-Enhanced Self-Management for Energy-Effective and Secure statistics Assortment in Unattended WSNs

SN Computer science 2025年第2期6卷 1-10页

作者： Biswas, Preesat Mishra, Aishwarya Dixit, Rinku Sharma Dwivedi, Abhishek Choudhary, Shailee Lohmor Tiwari, Shweta Chakravarthi, M. Ayyappa Electronics & Telecommunications Government Engineering College C. G Jagdalpur India Department of Computer Science & Engineering IES College of Technology M.P Bhopal India Department of Artificial Intelligence and Machine Learning New Delhi Institute of Management Delhi India Department of Data Science and Engineering School of AIML IoT & IS CCE DS and Computer Applications Manipal University Jaipur Jaipur Rajasthan India Department of Computer Science and Engineering Gyan Ganga Institute of Technology and Sciences M.P Jabalpur India Department of CSE-Data Science KKR and KSR Institute of Technology and Sciences Guntur India

Unattended Wireless Sensor Networks (UWSNs) operate without human supervision and have limited resources. In a conventional WSN with a fixed sink for data collection, nodes one hop away from the sink consume more energy, causing a hotspot issue. This leads to network fragmentation and reduced sensing efficiency. To address this, a mobile sink is proposed. This study details the development and implementation of Secure MRL, focusing on legitimate message communication to the mobile sink via convex nodes. By using these convex nodes as data collection points, the mobile sink avoids traversing the entire network. We employ an enhanced system to generate keys and authenticate messages, assessing its resilience against various attacks, including sleep deprivation, snooze, network substitution, and modification. Findings indicate that Secure MRL maintains consistent performance across different node counts and significantly reduces energy consumption by 84%, improving the speed of attack detection. This improvement is achieved by monitoring the digital signature and residual energy of nodes. The proposed SVM-based network training establishes a residual energy cut-off, while convex nodes mitigate synchronization issues among other sensor nodes in Secure MRL. Additionally, convex nodes manage the availability checks for the mobile sink. The proposed approach demonstrates a 92% improvement in packet delivery ratio (PDR) and an 89% reduction in end-to-end delay, highlighting its efficacy in enhancing network performance. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2025.

关键词： Duty-cycled UWSN MRL Sec-MRL SEC-TMP SVM UWSN

来源：评论

学校读者我要写书评

暂无评论

Smart Attendance Management using a Self-Supervised learning Approach 5

Smart Attendance Management using a Self-Supervised Learning...

引用

5th International Conference on Image Processing and Capsule Networks, ICIPCN 2024

作者： Vikram, D. Ajina, H. Gokilapriya, S. Malini, M. Rathinam Technical Campus Department of Computer Science and Engineering Coimbatore India Rathinam Technical Campus Department of Artificial Intelligence and Data Science Coimbatore India Kalingarkarunanidhi Institute of Technology Department of Artificial Intelligence and Machine Learning Coimbatore India Sri G.V.G Visalakshi College for Women Department of Information Technology Udumalpet India

ISBN: (纸本)9798350367171

Organizational efficiency is significantly influenced by automated attendance management systems, yet traditional methods often lack flexibility and reliability. This study proposes a novel approach to transform the Smart Attendance Management System (SAMS) by leveraging recent advances in Self-Supervised learning (SSL). The proposed method enhances accuracy and adaptability without explicit supervision by integrating SSL techniques at multiple stages, including feature extraction, anomaly detection, and data preparation. The proposed system learns meaningful representations from unlabeled attendance data through SSL-based data preprocessing, thereby improving the performance of downstream tasks. Feature extraction by utilizing SSL enables the proposed system to extract robust features enhancing both anomaly detection and attendance tracking. Anomaly detection models trained with SSL frameworks can effectively identify unusual attendance patterns. Additionally, SSL-based continuous learning ensures that the proposed system can adapt to the changing user behaviors and various situations. Supported by SSL, the proposed SAMS offers a more precise, efficient, and flexible solution for managing attendance, positioning it to meet the evolving demands of contemporary businesses across various industries. © 2024 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Mean Estimation in Banach Spaces Under Infinite Variance and Martingale Dependence

arXiv

引用

arXiv 2024年

作者： Whitehouse, Justin Chugg, Ben Martinez-Taboada, Diego Ramdas, Aaditya Management Science and Engineering Stanford University United States Machine Learning Department Carnegie Mellon University United States Department of Statistics and Data Science Carnegie Mellon University United States

We consider estimating the shared mean of a sequence of heavy-tailed random variables taking values in a Banach space. In particular, we revisit and extend a simple truncation-based mean estimator first proposed by Catoni and Giulini. While existing truncation-based approaches require a bound on the raw (non-central) second moment of observations, our results hold under a bound on either the central or non-central pth moment for some p ∈ (1, 2]. Our analysis thus handles distributions with infinite variance. The main contributions of the paper follow from exploiting connections between truncation-based mean estimation and the concentration of martingales in smooth Banach spaces. We prove two types of time-uniform bounds on the distance between the estimator and unknown mean: line-crossing inequalities, which can be optimized for a fixed sample size n, and iterated logarithm inequalities, which match the tightness of line-crossing inequalities at all points in time up to a doubly logarithmic factor in n. Our results do not depend on the dimension of the Banach space, hold under martingale dependence, and all constants in the inequalities are known and small. Copyright © 2024, The Authors. All rights reserved.

关键词： Banach spaces

来源：评论

学校读者我要写书评

暂无评论

IMPULSE NOISE REMOVAL BY L1 WEIGHTED NUCLEAR NORM MINIMIZATION

引用

Journal of Computational Mathematics 2023年第6期41卷 1171-1191页

作者： Jian Lu Yuting Ye Yiqiu Dong Xiaoxia Liu Yuru Zou Shenzhen Key Laboratory of Advanced Machine Learning and Applications College of Mathematics and StatisticsShenzhen UniversityShenzhen 518060China Guangdong Key Laboratory of Intelligent Information Processing Pazhou LabGuangzhou 510335China Department of Applied Mathematics and Computer Science Technical University of Denmark2800 Kgs.LyngbyDenmark

In recent years,the nuclear norm minimization(NNM)as a convex relaxation of the rank minimization has attracted great research *** assigning different weights to singular values,the weighted nuclear norm minimization(WNNM)has been utilized in many ***,most of the work on WNNM is combined with the l 2-data-fidelity term,which is under additive Gaussian noise *** this paper,we introduce the L1-WNNM model,which incorporates the l 1-data-fidelity term and the regularization from *** apply the alternating direction method of multipliers(ADMM)to solve the non-convex minimization problem in this *** exploit the low rank prior on the patch matrices extracted based on the image non-local self-similarity and apply the L1-WNNM model on patch matrices to restore the image corrupted by impulse *** results show that our method can effectively remove impulse noise.

关键词： Image denoising Weighted nuclear norm minimization l 1-data-fidelity term Low rank analysis Impulse noise

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimization without Retraction on the Random Generalized Stiefel Manifold 41

Optimization without Retraction on the Random Generalized St...

引用

41st International Conference on machine learning, ICML 2024

作者： Vary, Simon Ablin, Pierre Gao, Bin Absil, P.-A. ICTEAM Institute UCLouvain Louvain-la-neuve Belgium Department of Statistics University of Oxford Oxford United Kingdom Apple Machine Learning Group Paris France Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China

Optimization over the set of matrices X that satisfy XΤBX = Ip, referred to as the generalized Stiefel manifold, appears in many applications involving sampled covariance matrices such as the canonical correlation analysis (CCA), independent component analysis (ICA), and the generalized eigenvalue problem (GEVP). Solving these problems is typically done by iterative methods that require a fully formed B. We propose a cheap stochastic iterative method that solves the optimization problem while having access only to a random estimates of B. Our method does not enforce the constraint in every iteration;instead, it produces iterations that converge to critical points on the generalized Stiefel manifold defined in expectation. The method has lower per-iteration cost, requires only matrix multiplications, and has the same convergence rates as its Riemannian optimization counterparts that require the full matrix B. Experiments demonstrate its effectiveness in various machine learning applications involving generalized orthogonality constraints, including CCA, ICA, and the GEVP. Copyright 2024 by the author(s)

关键词： Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

GeoAgriGuard: AI-Driven Pest and Disease Management with Remote Sensing for Global Food Security

引用

Remote Sensing in Earth Systems sciences 2025年第2期8卷 409-422页

作者： Sharada, K. Choudhary, Shailee Lohmor Harikrishna, T. Dixit, Rinku Sharma Suman, Sanjay Kumar Ayyappa Chakravarthi, M. Bhagyalakshmi, L. Department of Computer Science and Engineering GITAM (Deemed to Be University) AP Visakhapatnam India Department of Artificial Intelligence and Machine Learning New Delhi Institute of Management Delhi India Department of AIML Annamacharya University Andhra Pradesh Rajampet India Department of ECE St. Martin’s Engineering College Telangana Secunderabad India Departmentt of CSE-Data Science KSR Institute of Technology and Science KKR & AP Guntur India Department of ECE Rajalakshmi Engineering College TN Chennai India

Agricultural productivity is increasingly threatened by the growing frequency and severity of pest and disease outbreaks, exacerbated by climate change and evolving environmental conditions. The GeoAgriGuard AI-Driven Pest and Disease Management System integrates remote sensing technologies with advanced AI models to address pest and disease outbreaks in agriculture. Utilizing multi-spectral and hyper-spectral satellite and drone imagery, the system processes crop health data through comprehensive preprocessing steps, including radiometric, geometric, and atmospheric corrections. Vegetation indices such as NDVI and NDWI further enhance the data quality, ensuring accurate detection of crop stress. A hybrid deep learning ensemble, combining models like ResNet, Transformer, DenseNet, and AutoEncoders, processes this data to predict and classify pest and disease occurrences. The proposed model achieved a remarkable accuracy of 97.81%, significantly outperforming existing models such as SVM (82.45%) and CNN (90.12%). By integrating these AI predictions with GIS-based spatial analysis, the system generates real-time risk maps, enabling farmers to take timely and localized actions. Performance metrics, including precision (96.72%), recall (95.83%), and F1-score (96.27%), demonstrate the system’s reliability in real-world applications. GeoAgriGuard provides a scalable, data-driven solution for enhancing crop protection and improving global food security. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2025.

关键词： AI-driven agriculture Crop disease Deep learning Food security GIS NDVI Pest detection Precision agriculture Remote sensing Satellite imagery

来源：评论

学校读者我要写书评

暂无评论

Building a data Lake for Power BI in the Cloud: A Review on Utilizing Cloud Storage Services for Large datasets 2

Building a Data Lake for Power BI in the Cloud: A Review on ...

引用

2nd DMIHER International Conference on Artificial Intelligence in Healthcare, Education and Industry, IDICAIEI 2024

作者： Gurbade, Viraj Vijay Verma, Prateek Gundewar, Swapnil Bramhe, Vijendra Singh 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 Vit Bhopal University School of Computing Science and Engineering Kothrikalan Madhya Pradesh Sehore466114 India

ISBN: (纸本)9798331528713

A data lake is a centralized repository where you may store both structured and unstructured data at any scale. Unlike typical data warehouses, which need data structure for storage, data lakes allow you to store raw data in its natural state. This adaptability makes data lakes suitable for storing large volumes of various data kinds, including photographs, videos, log files, sensor data, and others. When integrating a data lake with Power Business Intelligence (BI), organizations can harness the power of both technologies to gain valuable insights from their data. In the realm of data-driven decision-making, organizations face the challenge of managing and extracting insights from vast and diverse datasets, a task conventional on-premises storage solutions often struggle with due to the exponential growth of data. Thus, the adoption of more scalable and flexible alternatives becomes imperative. Cloud-based data lakes emerge as transformative solutions, offering unparalleled scalability, accessibility, cost-effectiveness, and advanced security protocols. This paper discuss the concept of constructing a cloud-based data lake optimized for Power BI, leveraging leading cloud storage services like Azure data Lake Storage (ADLS) and Amazon S3. By seamlessly integrating Power BI with the cloud data lake, organizations can overcome traditional storage limitations and reap numerous benefits. The practical applications in advanced analytics, customer insights, IoT data management, and data discovery underscore the real-world utility of cloud data lakes. The integration of Power BI with a cloud data lake augments efficient data analysis and self-service analytics potential, offering organizations a comprehensive solution for deriving actionable insights from their data assets. © 2024 IEEE.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

learning Discrete Latent Variable Structures with Tensor Rank Conditions 38

Learning Discrete Latent Variable Structures with Tensor Ran...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Chen, Zhengming Cai, Ruichu Xie, Feng Qiao, Jie Wu, Anpeng Li, Zijian Hao, Zhifeng Zhang, Kun School of Computer Science Guangdong University of Technology China Machine Learning Department Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Department of Applied Statistics Beijing Technology and Business University China Department of Computer Science and Technology Zhejiang University China College of Science Shantou University Guangdong Shantou China Department of Philosophy Carnegie Mellon University United States

Unobserved discrete data are ubiquitous in many scientific disciplines, and how to learn the causal structure of these latent variables is crucial for uncovering data patterns. Most studies focus on the linear latent variable model or impose strict constraints on latent structures, which fail to address cases in discrete data involving non-linear relationships or complex latent structures. To achieve this, we explore a tensor rank condition on contingency tables for an observed variable set Xp, showing that the rank is determined by the minimum support of a specific conditional set (not necessary in Xp) that d-separates all variables in Xp. By this, one can locate the latent variable through probing the rank on different observed variables set, and further identify the latent causal structure under some structure assumptions. We present the corresponding identification algorithm and conduct simulated experiments to verify the effectiveness of our method. Our results elegantly expand the application scope of causal discovery with latent variables. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Customer Segmentation Using Clustering Analysis

Customer Segmentation Using Clustering Analysis

引用

2024 IEEE International Conference on Information Technology, Electronics and Intelligent Communication Systems, ICITEICS 2024

作者： Jiet, Moses Makuei Kamble, Aahash Puri, Chetan Yesankar, Prajyot Verma, Prateek Rewatkar, Rajendra Faculty of Engineering and Technology Department of Computer Science & Design Maharashtra Wardha442001 India Faculty of Engineering and Technology Department of Artificial Intelligence & Data Science Maharashtra Wardha442001 India Faculty of Engineering and Technology Department of Artificial Intelligence & Machine Learning Maharashtra Wardha442001 India Faculty of Engineering and Technology Department of Biomedical Engineering Maharashtra Wardha442001 India

ISBN: (纸本)9798350382693

This research focuses on the crucial role of the clustering technique in data mining, specifically in market forecasting and planning. The study presents a comprehensive report on utilizing the k-means clustering technique and data visualization tools to develop a real- time system for a supermarket, predicting sales across various annual cycles. An open-source dataset of a mall with n = 200 customers divided into k = 3 groups, demonstrated high accuracy in predicting day-to-day sales statistics when compared with actual results. The research highlights the effectiveness of the clustering technique in real-time sales prediction for supermarkets. © 2024 IEEE.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：