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

Disease and Medications Text Visualization Using Scattertext

学校读者我要写书评

暂无评论

Disease and Medications Text Visualization Using Scattertext

Intelligent Control, Computing and Communications (IC3), International Conference on

作者： Rama Krishna K Kaipa Sandhya Praveen Gujjar J Raghavendra M Devadas Vani Hiremani Sapna R Department of Artificial Intelligence and Machine Learning Impact college of Engineering and Applied Sciences Bengaluru India Department of Data Science Impact college of Engineering and applied sciences Bengaluru India Faculty of Management Studies JAIN (Deemed-to-be University) Bengaluru India Department of Information Technology Manipal Institute of Technology Bengaluru Manipal Academy of Higher Education (MAHE) Manipal India Symbiosis Institute of Technology Symbiosis International (Deemed) University Pune India

ISBN: (数字)9798331527495

ISBN: (纸本)9798331527501

Before text data can be analysed and visualised, it must be thoroughly cleaned due to its messy nature. data visualizations use the data to tell an engaging and simple-to-read story. That is what the Scattertext tool does. Scatter text allows which terms stand out in your corpora and how their frequency varies across categories. The dataset used in this paper includes reviews of drugs. This dataset offers a useful window into how people discuss their thoughts and experiences using various drugs. The drug names, user ratings, and the actual written reviews are among the details included in the dataset. This dataset consists of drug reviews collected from various sources, hence expressing a wide range of opinions and feelings. Each row in this dataset represents the experience a user had with a given medication and hence allows us to explore those emotions that are associated with any particular set of drugs. Understanding opinion expressed in the review about drugs might go a long way in helping decision-making processes in both healthcare and pharmaceuticals. The scatter plot distinguishes between labelled points and unlabelled ones by using a custom algorithm for Scattertext. By hovering their cursor over the labelled areas done client-side, users can interactively see which terms correspond to which points.

关键词： Drugs Reviews Decision making data visualization Medical services Market research Feature extraction Diseases Intelligent control

Gradients should stay on Path: Better Estimators of the Reverse- and Forward KL Divergence for Normalizing Flows

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Vaitl, Lorenz Nicoli, Kim Andrea Nakajima, Shinichi Kessel, Pan Machine Learning Group Department of Electrical Engineering & Computer Science Technische Universität Berlin Germany BIFOLD - Berlin Institute for the Foundations of Learning and Data Technische Universität Berlin Berlin Germany RIKEN Center for AIP Chuo City Tokyo103-0027 Japan

We propose an algorithm to estimate the path-gradient of both the reverse and forward Kullback–Leibler divergence for an arbitrary manifestly invertible normalizing flow. The resulting path-gradient estimators are straightforward to implement, have lower variance, and lead not only to faster convergence of training but also to better overall approximation results compared to standard total gradient estimators. We also demonstrate that path-gradient training is less susceptible to mode-collapse. In light of our results, we expect that path-gradient estimators will become the new standard method to train normalizing flows for variational inference. © 2022, CC BY.

关键词：

Path-Gradient Estimators for Continuous Normalizing Flows

学校读者我要写书评

暂无评论

arXiv 2022年

Recent work has established a path-gradient estimator for simple variational Gaussian distributions and has argued that the path-gradient is particularly beneficial in the regime in which the variational distribution approaches the exact target distribution. In many applications, this regime can however not be reached by a simple Gaussian variational distribution. In this work, we overcome this crucial limitation by proposing a path-gradient estimator for the considerably more expressive variational family of continuous normalizing flows. We outline an efficient algorithm to calculate this estimator and establish its superior performance empirically. © 2022, CC BY.

关键词：

Evaluating Posterior Distributions by Selectively Breeding Prior Samples

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Shalizi, Cosma Rohilla Department of Statistics and Data Science and of Machine Learning Carnegie Mellon University PittsburghPA15213 United States The Santa Fe Institute 1399 Hyde Park Road Santa FeNM87501 United States

Using Markov chain Monte Carlo to sample from posterior distributions was the key innovation which made Bayesian data analysis practical. Notoriously, however, MCMC is hard to tune, hard to diagnose, and hard to parallelize. This pedagogical note explores variants on a universal non-Markov-chain Monte Carlo scheme for sampling from posterior distributions. The basic idea is to draw parameter values from the prior distributions, evaluate the likelihood of each draw, and then copy that draw a number of times proportional to its likelihood. The distribution after copying is an approximation to the posterior which becomes exact as the number of initial samples goes to infinity;the convergence of the approximation is easily analyzed, and is uniform over Glivenko-Cantelli classes. While not entirely practical, the schemes are straightforward to implement (a few lines of R), easily parallelized, and require no rejection, burn-in, convergence diagnostics, or tuning of any control settings. I provide references to the prior art which deals with some of the practical obstacles, at some cost in computational and analytical simplicity. Copyright © 2022, The Authors. All rights reserved.

关键词： Markov processes

Flow-Based Sampling for Entanglement Entropy and the machine learning of Defects

学校读者我要写书评

暂无评论

Physical Review Letters 2025年第15期134卷 151601-151601页

作者： Andrea Bulgarelli Elia Cellini Karl Jansen Stefan Kühn Alessandro Nada Shinichi Nakajima Kim A. Nicoli Marco Panero Department of Physics University of Turin and INFN Turin unit Via Pietro Giuria 1 I-10125 Turin Italy Computation-Based Science and Technology Research Center The Cyprus Institute Nicosia Cyprus Deutsches Elektronen-Synchrotron DESY Zeuthen Germany Berlin Institute for the Foundations of Learning and Data (BIFOLD) Berlin Germany Machine Learning Group Technische Universität Berlin Berlin Germany RIKEN Center for AIP Tokyo Japan Transdisciplinary Research Area (TRA) Matter University of Bonn Germany Helmholtz Institute for Radiation and Nuclear Physics (HISKP) Bonn Germany Department of Physics and Helsinki Institute of Physics PL 64 FIN-00014 University of Helsinki Finland

We introduce a novel technique to numerically calculate Rényi entanglement entropies in lattice quantum field theory using generative models. We describe how flow-based approaches can be combined with the replica trick using a custom neural-network architecture around a lattice defect connecting two replicas. Numerical tests for the ϕ4 scalar field theory in two and three dimensions demonstrate that our technique outperforms state-of-the-art Monte Carlo calculations, and exhibit a promising scaling with the defect size.

关键词： Lattice theory

Secure Device on boarding in IoT Networks

学校读者我要写书评

暂无评论

Secure Device on boarding in IoT Networks

International Conference on science Technology Engineering and Management (ICONSTEM)

作者： P. Sathyaraj Shankar Nayak Bhukya S. Rukmani Devi Chetan Umadi A. Ajina Rajendiran M Department of Electronics and Communication Engineering RMK College of Engineering and Technology Puduvoyal Tamil Nadu India Department of Computer Science Engineering (Data Science) CMR Technical Campus Hyderabad Telangana India Department of Computer Science Saveetha College of Liberal Arts and Sciences SIMATS Deemed to be University Chennai Tamil Nadu India Department of Electronics& Telecommunication Engineering Dayananda Sagar College of Engineering Bengaluru Karnataka India Department of Artificial Intelligence and Machine Learning M S Ramaiah Institute of Technology Bangalore India Department of Computer Science and Engineering Panimalar Engineering College Chennai Tamil Nadu India

ISBN: (数字)9798350365092

ISBN: (纸本)9798350365108

The fast spread of Internet of Things (IoT) gadgets has led to unprecedented number of interconnected systems offering many applications and services. Diverse elements in IoT networks increase security vulnerabilities, especially when adding new devices. IoT device onboarding secures device integration, authentication, and network connection authorization. This research shows the hazards and limitations of secure IoT device connections. Research examines onboarding protocols' merits and downsides. Bootstrapping, mutual authentication, and key establishment protect the IoT device-network connection in the proposed architecture. Overcoming scalability and resource constraints makes onboarding several IoT devices straightforward. We also analyze IoT network security with PKI and certificate-based authentication. Safe communication pathways and ongoing observation and system adjustments to address new security issues are discussed in this essay. Researchers test the technology in IoT environments. The framework handles onboarding in this case. The method safeguards onboarding and IoT ecosystem data, research demonstrate. A detailed device onboarding approach increases IoT security talks. The framework fixes onboarding issues and vulnerabilities for secure IoT networks.

关键词： Protocols Scalability Ecosystems Authentication Interconnected systems Network security Mathematics

Deep Reinforcement learning for Beam Angle Optimization of Intensity-Modulated Radiation Therapy

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Bao, Peng Wang, Gong Yang, Ruijie Dong, Bin The Center for Data Science Peking University the Department of Radiation Oncology Peking University Third Hospital Beijing China The Department of Radiation Oncology Peking University Third Hospital Beijing China Beijing International Center for Mathematical Research Center for Machine Learning Research National Biomedical Imaging Center Peking University Beijing China

Objective: Intensity-modulated radiation therapy (IMRT) beam angle optimization (BAO) is a challenging combinatorial optimization problem that is NP-hard. In this study, we aim to develop a personalized BAO algorithm for IMRT that improves the quality of the final treatment. Methods: To improve the quality of IMRT treatment planning, we propose a deep reinforcement learning (DRL)based approach for IMRT BAO. We consider the task as a sequential decision-making problem and formulate it as a Markov Decision Process. To facilitate the training process, a 3D-Unet is designed to predict the dose distribution for the different number of beam angles, ranging from 1 to 9, to simulate the IMRT environment. By leveraging the simulation model, double deep-Q network (DDQN) and proximal policy optimization (PPO) are used to train agents to select the personalized beam angle sequentially within a few seconds. Results: The treatment plans with beam angles selected by DRL outperform those with clinically used evenly distributed beam angles. For DDQN, the overall average improvement of the CIs is 0.027, 0.032, and 0.03 for 5, 7, and 9 beam angles respectively. For PPO, the overall average improvement of CIs is 0.045, 0.051, and 0.025 for 5, 7, and 9 beam angles respectively. Conclusion: The proposed DRL-based beam angle selection strategy can generate personalized beam angles within a few seconds, and the resulting treatment plan is superior to that obtained using evenly distributed angles. Significance: A fast and automated personalized beam angle selection approach is been proposed for IMRT BAO. © 2023, CC BY.

关键词： Reinforcement learning

Facilitated machine learning for image-based fruit quality assessment

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Knott, Manuel Perez-Cruz, Fernando Defraeye, Thijs Empa Swiss Federal Laboratories for Materials Science Technology Laboratory for Biomimetic Membranes and Textiles St. Gallen Switzerland Swiss Data Science Center ETH Zurich and EPFL Zurich Switzerland Institute for Machine Learning Department of Computer Science ETH Zurich Switzerland

Image-based machine learning models can be used to make the sorting and grading of agricultural products more efficient. In many regions, implementing such systems can be difficult due to the lack of centralization and automation of postharvest supply chains. Stakeholders are often too small to specialize in machine learning, and large training data sets are unavailable. We propose a machine learning procedure for images based on pre-trained Vision Transformers. It is easier to implement than the current standard approach of training Convolutional Neural Networks (CNNs) as we do not (re-)train deep neural networks. We evaluate our approach based on two data sets for apple defect detection and banana ripeness estimation. Our model achieves a competitive classification accuracy equal to or less than one percent below the best-performing CNN. At the same time, it requires three times fewer training samples to achieve a 90% accuracy. © 2022, CC BY.

关键词： Computer vision

Precise Asymptotics of Bagging Regularized M-estimators

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Koriyama, Takuya Patil, Pratik Du, Jin-Hong Tan, Kai Bellec, Pierre C. Booth School of Business The University of Chicago ChicagoIL60637 United States 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 Department of Statistics Rutgers University New BrunswickNJ08854 United States

We characterize the squared prediction risk of ensemble estimators obtained through subagging (subsample bootstrap aggregating) regularized M-estimators and construct a consistent estimator for the risk. Specifically, we consider a heterogeneous collection of M ≥ 1 regularized M-estimators, each trained with (possibly different) subsample sizes, convex differentiable losses, and convex regularizers. We operate under the proportional asymptotics regime, where the sample size n, feature size p, and subsample sizes km for m ∈ [M] all diverge with fixed limiting ratios n/p and km/n. Key to our analysis is a new result on the joint asymptotic behavior of correlations between the estimator and residual errors on overlapping subsamples, governed through a (provably) contractible nonlinear system of equations. Of independent interest, we also establish convergence of trace functionals related to degrees of freedom in the non-ensemble setting (with M = 1) along the way, extending previously known cases for square loss and ridge, lasso regularizers. When specialized to homogeneous ensembles trained with a common loss, regularizer, and subsample size, the risk characterization sheds some light on the implicit regularization effect due to the ensemble and subsample sizes (M, k). For any ensemble size M, optimally tuning subsample size yields sample-wise monotonic risk. For the full-ensemble estimator (when M → ∞), the optimal subsample size k* tends to be in the overparameterized regime (k* ≤ min{n, p}), when explicit regularization is vanishing. Finally, joint optimization of subsample size, ensemble size, and regularization can significantly outperform regularizer optimization alone on the full data (without any subagging). Copyright © 2024, The Authors. All rights reserved.

关键词： Nonlinear equations