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

Text Generation to Aid Depression Detection: A Comparative Study of Conditional Sequence Generative Adversarial Networks

学校读者我要写书评

暂无评论

Text Generation to Aid Depression Detection: A Comparative S...

IEEE International Conference on Big data

作者： ML Tlachac Walter Gerych Kratika Agrawal Benjamin Litterer Nicholas Jurovich Saitheeraj Thatigotla Jidapa Thadajarassiri Elke A. Rundensteiner Department of Information Systems & Analytics Center for Health & Behavioral Sciences Bryant University Smithfield USA Data Science and Computer Science Departments Worcester Polytechnic Institute (WPI) Worcester USA School of Information University of Michigan Ann Arbor USA University of Tennessee Knoxville TN

ISBN: (纸本)9781665480468

Corpuses of unstructured textual data, such as text messages between individuals, are often predictive of medical issues such as depression. The text data usually used in healthcare applications has high value and great variety, but is typically small in volume. Generating labeled unstructured text data is important to improve models by augmenting these small datasets, as well as to facilitate anonymization. While methods for labeled data generation exist, not all of them generalize well to small datasets. In this work, we thus perform a much needed systematic comparison of conditional text generation models that are promising for small datasets due to their unified architectures. We identify and implement a family of nine conditional sequence generative adversarial networks for text generation, which we collectively refer to as cSeqGAN models. These models are characterized along two orthogonal design dimensions: weighting strategies and feedback mechanisms. We conduct a comparative study evaluating the generation ability of the nine cSeqGAN models on three diverse text datasets with depression and sentiment labels. To assess the quality and realism of the generated text, we use standard machine learning metrics as well as human assessment via a user study. While the unconditioned models produced predictive text, the cSeqGAN models produced more realistic text. Our comparative study lays a solid foundation and provides important insights for further text generation research, particularly for the small datasets common within the healthcare domain.

关键词： Systematics Medical services Machine learning Predictive models Big data Depression Generative adversarial networks

E-Learning: A Successful Learning Environment

学校读者我要写书评

暂无评论

E-Learning: A Successful Learning Environment

computer science and Emerging Technologies (CSET), International Conference on

作者： Fayiz Momani Amer Ahmad Hatamleh Wan Mohd Amir Fazamin Wan Hamzah Julaily Aida Jusoh Muhammad D. Zakaria Sunanda Das E-business & Commerce Department Faculty of Management and Financial Sciences University of Petra (UOP) Jordan Head of Departments Faculty of Business and Financial Science MIS BI and Data Analysis Irbid National University Irbid Jordan Faculty of Informatics and Computing (UniSZA) Malaysia Faculty of Informatics and Computing UniSZA Malaysia Cyber Security School of Computer Science and Engineering Jain University Bangalore India

Education is developing with the economy. This led to the creation of e-Iearning tools for instructors and students. In e-learning, electronic resources are used to teach. E-learning can be taught in or out of school, but computers and the Internet are essential. That is, e-learning involves delivering education to a big group of people at once or over time. So, overall, in this research is about E-learning that make a successful environment. We chose this term since it is widely used in E-learning research to improve student academic achievement. Due to the difficulties of accessing adequate study materials during the Covid-19 epidemic, distance learning has grown more popular among students. This study proposes a unique learning technique that involves choosing and organizing important learning items using a recommender system. We also studied our method's efficacy. Using a recommended system to help online learning activities was proven to be effective. Software development methodology is a collection of principles and processes used to build software. Systematic software development is the goal. The research approach utilized for this topic is Lean Development Methodology. We also examine the advantages and disadvantages of e-learning. This research also introduces various new strategies and methodologies that may be employed in the future to improve system-learning. It also presents system that we choose and why we choose it. So, it aims to eliminate waste and increase production. Following the principles can help developers avoid nonproductive chores while still producing high-quality results. The ultimate objective is to develop an efficient and error-free system. Finally, E-learning is a social revolution. It's part of a bigger rethinking of how we teach future employees and students. The eLearning platform enabled the learning data visualization dashboard beautifully. User-centered design lets the dashboard adapt to its users' demands.

关键词：

Ethical Challenges and Evolving Strategies in the Integration of Artificial Intelligence into Clinical Practice

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Weiner, Ellison B. Dankwa-Mullan, Irene Nelson, William A. Hassanpour, Saeed Dartmouth College HanoverNH03755 United States Department of Health Policy and Management Milken Institute School of Public Health The George Washington University WashingtonDC20052 United States Dartmouth Institute for Health Policy and Clinical Practice Geisel School of Medicine Dartmouth College HanoverNH03755 United States Departments of Biomedical Data Science Computer Science and Epidemiology Geisel School of Medicine Dartmouth College HanoverNH03755 United States

Artificial intelligence (AI) has rapidly transformed various sectors, including healthcare, where it holds the potential to revolutionize clinical practice and improve patient outcomes. However, its integration into medical settings brings significant ethical challenges that need careful consideration. This paper examines the current state of AI in healthcare, focusing on five critical ethical concerns: justice and fairness, transparency, patient consent and confidentiality, accountability, and patient-centered and equitable care. These concerns are particularly pressing as AI systems can perpetuate or even exacerbate existing biases, often resulting from non-representative datasets and opaque model development processes. The paper explores how bias, lack of transparency, and challenges in maintaining patient trust can undermine the effectiveness and fairness of AI applications in healthcare. In addition, we review existing frameworks for the regulation and deployment of AI, identifying gaps that limit the widespread adoption of these systems in a just and equitable manner. Our analysis provides recommendations to address these ethical challenges, emphasizing the need for fairness in algorithm design, transparency in model decision-making, and patient-centered approaches to consent and data privacy. By highlighting the importance of continuous ethical scrutiny and collaboration between AI developers, clinicians, and ethicists, we outline pathways for achieving more responsible and inclusive AI implementation in healthcare. These strategies, if adopted, could enhance both the clinical value of AI and the trustworthiness of AI systems among patients and healthcare professionals, ensuring that these technologies serve all populations equitably. © 2024, CC BY.

关键词： Differential privacy

Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Luo, Yuetian Zhang, Anru R. Data Science Institute University of Chicago ChicagoIL60637 United States Departments of Biostatistics & Bioinformatics and Computer Science Duke University DurhamNC27710 United States

In this paper, we consider the estimation of a low Tucker rank tensor from a number of noisy linear measurements. The general problem covers many specific examples arising from applications, including tensor regression, tensor completion, and tensor PCA/SVD. We consider an efficient Riemannian Gauss-Newton (RGN) method for low Tucker rank tensor estimation. Different from the generic (super)linear convergence guarantee of RGN in the literature, we prove the first local quadratic convergence guarantee of RGN for low-rank tensor estimation in the noisy setting under some regularity conditions and provide the corresponding estimation error upper bounds. A deterministic estimation error lower bound, which matches the upper bound, is provided that demonstrates the statistical optimality of RGN. The merit of RGN is illustrated through two machine learning applications: tensor regression and tensor SVD. Finally, we provide the simulation results to corroborate our theoretical findings. Copyright © 2021, The Authors. All rights reserved.

关键词： Tensors

Estimating Total Treatment Effect in Randomized Experiments with Unknown Network Structure

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yu, Christina Lee Airoldi, Edoardo M. Borgs, Christian Chayes, Jennifer T. School of Operations Research and Information Engineering Cornell University IthacaNY United States Department of Statistics Operations and Data Science Fox School of Business Temple University PhiladelphiaPA United States Department of Electrical Engineering and Computer Science UC Berkeley BerkeleyCA United States Departments of Electrical Engineering and Computer Science Statistics Mathematics The School of Information UC Berkeley BerkeleyCA United States

Randomized experiments are widely used to estimate the causal effects of a proposed treatment in many areas of science, from medicine and healthcare to the physical and biological sciences, from the social sciences to engineering, to public policy and to the technology industry at large. Here, we consider situations where classical methods for estimating the total treatment effect on a target population are considerably biased due to confounding network effects, i.e., the fact that the treatment of an individual may impact their neighbors’ outcomes, an issue referred to as network interference or as non-individualized treatment response. A key challenge in these situations, is that the network is often unknown, and difficult, or costly, to measure. In this paper, we characterize the limitations in estimating the total treatment effect without knowledge of the network that drives interference, assuming a potential outcomes model with heterogeneous additive network effects. This model encompasses a broad class of network interference sources, including spillover, peer effects, and contagion. Within this framework, we show that, surprisingly, given access to average historical baseline measurements prior to the experiment, we can develop a simple estimator and efficient randomized design that outputs an unbiased estimate with low variance. Our solution does not require knowledge of the underlying network structure, and it comes with statistical guarantees for a broad class of models. We believe our results are poised to impact current randomized experimentation strategies due to its ease of interpretation and implementation, alongside its provable theoretical insights under heterogeneous network effects. Copyright © 2022, The Authors. All rights reserved.

关键词： Heterogeneous networks

Intermediate layers matter in momentum contrastive self supervised learning 21

学校读者我要写书评

暂无评论

Intermediate layers matter in momentum contrastive self supe...

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Aakash Kaku Sahana Upadhya Narges Razavian Center for Data Science New York University New York NY Department of Computer Science Courant Institute of Mathematical Sciences New York NY Departments of Population Health and Radiology NYU Grossman School of Medicine and NYU Center for Data Science New York NY

ISBN: (纸本)9781713845393

We show that bringing intermediate layers' representations of two augmented versions of an image closer together in self supervised learning helps to improve the momentum contrastive (MoCo) method. To this end, in addition to the con-trastive loss, we minimize the mean squared error between the intermediate layer representations or make their cross-correlation matrix closer to an identity matrix. Both loss objectives either outperform standard MoCo, or achieve similar performances on three diverse medical imaging datasets: NIH-Chest Xrays, Breast Cancer Histopathology, and Diabetic Retinopathy. The gains of the improved MoCo are especially large in a low-labeled data regime (e.g. 1% labeled data) with an average gain of 5% across three datasets. We analyze the models trained using our novel approach via feature similarity analysis and layer-wise probing. Our analysis reveals that models trained via our approach have higher feature reuse compared to a standard MoCo and learn informative features earlier in the network. Finally, by comparing the output probability distribution of models fine tuned on small versus large labeled data, we conclude that our proposed method of pre-training leads to lower Kolmogorov–Smirnov distance, as compared to a standard MoCo. This provides additional evidence that our proposed method learns more informative features in the pre-training phase which could be leveraged in a low-labeled data regime.

关键词：

HOW DOES THE BRAIN COMPUTE WITH PROBABILITIES?

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Haefner, Ralf M. Beck, Jeff Savin, Cristina Salmasi, Mehrdad Pitkow, Xaq Department of Brain and Cognitive Sciences University of Rochester RochesterNY United States Department of Neurobiology Duke University DurhamNC United States Departments of Neural Science and Data Science New York University New YorkNY United States Gatsby Computational Neuroscience Unit Max Planck UCL Centre for Computational Psychiatry and Ageing Research University College London United Kingdom Neuroscience Institute Department of Machine Learning Carnegie Mellon University PittsburghPA United States Department of Neuroscience Center for Neuroscience and Artificial Intelligence Baylor College of Medicine HoustonTX United States Department of Electrical and Computer Engineering Department of Computer Science Rice University HoustonTX United States

This perspective piece is the result of a Generative Adversarial Collaboration (GAC) tackling the question 'How does neural activity represent probability distributions?'. We have addressed three major obstacles to progress on answering this question: first, we provide a unified language for defining competing hypotheses. Second, we explain the fundamentals of three prominent proposals for probabilistic computations - Probabilistic Population Codes (PPCs), Distributed Distributional Codes (DDCs), and Neural Sampling Codes (NSCs) - and describe similarities and differences in that common language. Third, we review key empirical data previously taken as evidence for at least one of these proposal, and describe how it may or may not be explainable by alternative proposals. Finally, we describe some key challenges in resolving the debate, and propose potential directions to address them through a combination of theory and *** Codes 92 Copyright © 2024, The Authors. All rights reserved.

关键词： Generative adversarial networks

CONCENTRATION INEQUALITIES AND OPTIMAL NUMBER OF LAYERS FOR STOCHASTIC DEEP NEURAL NETWORKS

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Caprio, Michele Mukherjee, Sayan PRECISE Center Department of Computer and Information Science University of Pennsylvania 3330 Walnut Street PhiladelphiaPA19104 United States Center for Scalable Data Analytics and Artificial Intelligence Universität Leipzig Humboldtstraße 25 Leipzig04105 Germany The Max Planck Institute for Mathematics in the Sciences Inselstraße 22 Leipzig04103 Germany Departments of Statistical Science Mathematics Computer Science and Biostatistics & Bioinformatics Duke University DurhamNC27708 United States

We state concentration inequalities for the output of the hidden layers of a stochastic deep neural network (SDNN), as well as for the output of the whole SDNN. These results allow us to introduce an expected classifier (EC), and to give probabilistic upper bound for the classification error of the EC. We also state the optimal number of layers for the SDNN via an optimal stopping procedure. We apply our analysis to a stochastic version of a feedforward neural network with ReLU activation *** Codes Primary: 62M45, Secondary: 60G42 © 2022, CC BY.

关键词： Deep neural networks

A general linear-time inference method for Gaussian processes on one dimension

学校读者我要写书评

暂无评论

The Journal of Machine Learning Research

The Journal of Machine Learning Research 2021年第1期22卷 10580-10615页

作者： Jackson Loper David Blei John P. Cunningham Liam Paninski Data Science Institute Columbia University New York New York Data Science Institute Departments of Statistics and Computer Science Columbia University New York New York Department of Statistics Mortimer B. Zuckerman Mind Brain Behavior Institute Grossman Center for the Statistics of Mind Columbia University New York New York Departments of Statistics and Neuroscience Mortimer B. Zuckerman Mind Brain Behavior Institute Grossman Center for the Statistics of Mind Columbia University New York New York

Gaussian Processes (GPs) provide powerful probabilistic frameworks for interpolation, forecasting, and smoothing, but have been hampered by computational scaling issues. Here we investigate data sampled on one dimension (e.g., a scalar or vector time series sampled at arbitrarily-spaced intervals), for which state-space models are popular due to their linearly-scaling computational costs. It has long been conjectured that state-space models are general, able to approximate any one-dimensional GP. We provide the first general proof of this conjecture, showing that any stationary GP on one dimension with vector-valued observations governed by a Lebesgue-integrable continuous kernel can be approximated to any desired precision using a specifically-chosen state-space model: the Latent Exponentially Generated (LEG) family. This new family offers several advantages compared to the general state-space model: it is always stable (no unbounded growth), the covariance can be computed in closed form, and its parameter space is unconstrained (allowing straightforward estimation via gradient descent). The theorem's proof also draws connections to Spectral Mixture Kernels, providing insight about this popular family of kernels. We develop parallelized algorithms for performing inference and learning in the LEG model, test the algorithm on real and synthetic data, and demonstrate scaling to datasets with billions of samples.

关键词：