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

arXiv 2024年

作者： Domschke, Nico Gatter, Thomas Golnik, Richard Stadler, Peter F. Bioinformatics Group Department of Computer Science Leipzig University Härtelstraße 16–18 LeipzigD-04107 Germany Bioinformatics Group Department of Computer Science Interdisciplinary Center for Bioinformatics Center for Scalable Data Analytics and Artificial Intelligence Dresden/Leipzig School of Embedded Composite Artificial Intelligence Leipzig University Härtelstraße 16–18 LeipzigD-04107 Germany Max Planck Institute for Mathematics in the Sciences Inselstraße 22 LeipzigD-04103 Germany Department of Theoretical Chemistry University of Vienna Währingerstraße 17 WienA-1090 Austria Facultad de Ciencias Universidad National de Colombia Bogotá Colombia Santa Fe Institute 1399 Hyde Park Rd. Santa FeNM87501 United States

The set of relevant cuts in a graph is the union of all minimum weight bases of the cut space. We show that a cut is relevant if and only if it is the a minimum weight cut between two distinct vertices. Moreover, we give a characterization in terms of Picard-Queyranne DAGs that can be used to accelerate the enumeration of the relevant cuts. © 2024, CC BY-NC-ND.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Homophobia and transphobia detection for low-resourced languages in social media comments

Natural Language Processing Journal

引用

Natural Language Processing Journal 2023年 5卷

作者： Prasanna Kumar Kumaresan Rahul Ponnusamy Ruba Priyadharshini Paul Buitelaar Bharathi Raja Chakravarthi Insight SFI Research Centre for Data Analytics Data Science Institute University of Galway Ireland Department of Mathematics Gandhigram Rural Institute-Deemed to be University Tamil Nadu India School of Computer Science University of Galway Ireland

People are increasingly sharing and expressing their emotions using online social media platforms such as Twitter, Facebook, and YouTube. An abusive, hateful, threatening, and discriminatory act that makes discomfort targets gay, lesbian, transgender, or bisexual individuals is called Homophobia and Transphobia. Detecting these types of acts on social media is called Homophobia and Transphobia Detection. This task has recently gained interest among researchers. Identifying homophobic and transphobic content for under-resourced languages is a bit challenging task. There are no such resources for Malayalam and Hindi to categorize these types of content as far now. This paper presents a new high-quality dataset for detecting homophobia and transphobia in Malayalam and Hindi languages. Our dataset consists of 5,193 comments in Malayalam and 3,203 comments in Hindi. We also submitted the experiments performed with traditional machine learning and transformer-based deep learning models on the Malayalam, Hindi, English, Tamil, and Tamil-English datasets.

关键词： dataset creation Under-resourced language Machine learning Transformer models Cross-lingual transfer learning Homophobia and transphobia Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Deep CNN: A machine learning approach for driver drowsiness detection based on eye state

引用

Revue d'Intelligence Artificielle 2019年第6期33卷 461-466页

作者： Reddy Chirra, Venkata Rami Uyyala, Srinivasulu Reddy Kishore Kolli, Venkata Krishna Department of Computer Applications National Institute of Technology Tiruchirappalli620015 India Machine Learning and Data Analytics Lab Department of Computer Applications National Institute of Technology Tiruchirappalli620015 India Department of Computer Science and Engineering VFSTR Guntur522213 India

Driver drowsiness is one of the reasons for large number of road accidents these days. With the advancement in computer Vision technologies, smart/intelligent cameras are developed to identify drowsiness in drivers, thereby alerting drivers which in turn reduce accidents when they are in fatigue. In this work, a new framework is proposed using deep learning to detect driver drowsiness based on Eye state while driving the vehicle. To detect the face and extract the eye region from the face images, Viola-Jones face detection algorithm is used in this work. Stacked deep convolution neural network is developed to extract features from dynamically identified key frames from camera sequences and used for learning phase. A SoftMax layer in CNN classifier is used to classify the driver as sleep or non-sleep. This system alerts driver with an alarm when the driver is in sleepy mood. The proposed work is evaluated on a collected dataset and shows better accuracy with 96.42% when compared with traditional CNN. The limitation of traditional CNN such as pose accuracy in regression is overcome with the proposed Staked Deep CNN. © 2019 Lavoisier. All rights reserved.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Large Language Models in Mental Health Care: a Scoping Review

arXiv

引用

arXiv 2024年

作者： Hua, Yining Liu, Fenglin Yang, Kailai Li, Zehan Na, Hongbin Sheu, Yi-Han Zhou, Peilin Moran, Lauren V. Ananiadou, Sophia CliDon, David A. Beam, Andrew Torous, John Department of Epidemiology Harvard T.H. Chan School of Public Health MA United States Department of Psychiatry Beth Israel Deaconess Medical Center MA United States Institute of Biomedical Engineering Department of Engineering Science University of Oxford Oxford United Kingdom Department of Computer Science The University of Manchester Manchester United Kingdom School of Biomedical Informatics University of Texas Health Science at Houston Houston United States Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia Center for Precision Psychiatry Massachusetts General Hospital MA United States Department of Psychiatry Harvard Medical School MA United States Data Science and Analytics Thrust Hong Kong University of Science and Technology Guangzhou China Division of Psychotic Disorders McLean Hospital MA United States The Alan Turing Institute London United Kingdom

The integration of large language models (LLMs) in mental health care is an emerging field. There is a need to systematically review the application outcomes and delineate the advantages and limitations in clinical settings. This review aims to provide a comprehensive overview of the use of LLMs in mental health care, assessing their efficacy, challenges, and potential for future applications. A systematic search was conducted across multiple databases including PubMed, Web of science, Google Scholar, arXiv, medRxiv, and PsyArXiv in November 2023. All forms of original research, peer-reviewed or not, published or disseminated between October 1, 2019, and December 2, 2023, are included without language restrictions if they used LLMs developed after T5 and directly addressed research questions in mental health care settings. From an initial pool of 313 articles, 34 met the inclusion criteria based on their relevance to LLM application in mental health care and the robustness of reported outcomes. Diverse applications of LLMs in mental health care are identified, including diagnosis, therapy, patient engagement enhancement, etc. Key challenges include data availability and reliability, nuanced handling of mental states, and effective evaluation methods. Despite successes in accuracy and accessibility improvement, gaps in clinical applicability and ethical considerations were evident, pointing to the need for robust data, standardized evaluations, and interdisciplinary collaboration. LLMs hold substantial promise for enhancing mental health care. For their full potential to be realized, emphasis must be placed on developing robust datasets, development and evaluation frameworks, ethical guidelines, and interdisciplinary collaborations to address current limitations. © 2024, CC BY.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Low-rank tensor recovery for Jacobian-based Volterra identification of parallel Wiener-Hammerstein systems

arXiv

引用

arXiv 2021年

作者： Usevich, Konstantin Dreesen, Philippe Ishteva, Mariya Université de Lorraine CNRS CRAN Nancy France STADIUS Center for Dynamical Systems Signal Processing and Data Analytics Belgium KU Leuven Department of Computer Science ADVISE-NUMA campus Geel Belgium

We consider the problem of identifying a parallel Wiener-Hammerstein structure from Volterra kernels. Methods based on Volterra kernels typically resort to coupled tensor decompositions of the kernels. However, in the case of parallel Wiener-Hammerstein systems, such methods require nontrivial constraints on the factors of the decompositions. In this paper, we propose an entirely different approach: by using special sampling (operating) points for the Jacobian of the nonlinear map from past inputs to the output, we can show that the Jacobian matrix becomes a linear projection of a tensor whose rank is equal to the number of branches. This representation allows us to solve the identification problem as a tensor recovery problem. Copyright © 2021, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

A unified framework for structured graph learning via spectral constraints

引用

The Journal of Machine Learning Research 2020年第1期21卷 785-844页

作者： Sandeep Kumar Jiaxi Ying José Vinícius De M. Cardoso Daniel P. Palomar Department of Industrial Engineering and Data Analytics The Hong Kong University of Science and Technology Clear Water Bay Hong Kong Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Clear Water Bay Hong Kong Department of Electronic and Computer Engineering Department of Industrial Engineering and Data Analytics The Hong Kong University of Science and Technology Clear Water Bay Hong Kong

Graph learning from data is a canonical problem that has received substantial attention in the literature. Learning a structured graph is essential for interpretability and identification of the relationships among data. In general, learning a graph with a specific structure is an NP-hard combinatorial problem and thus designing a general tractable algorithm is challenging. Some useful structured graphs include connected, sparse, multi-component, bipartite, and regular graphs. In this paper, we introduce a unified framework for structured graph learning that combines Gaussian graphical model and spectral graph theory. We propose to convert combinatorial structural constraints into spectral constraints on graph matrices and develop an optimization framework based on block majorization-minimization to solve structured graph learning problem. The proposed algorithms are provably convergent and practically amenable for a number of graph based applications such as data clustering. Extensive numerical experiments with both synthetic and real data sets illustrate the effectiveness of the proposed algorithms. An open source R package containing the code for all the experiments is available at https://***/package=spectralGraphTopology.

关键词： structured graph learning spectral graph theory Markov random field Gaussian graphical model Laplacian matrix clustering adjacency matrix bipartite structure spectral similarity

来源：评论

学校读者我要写书评

暂无评论

Low-rank tensor recovery for Jacobian-based Volterra identification of parallel Wiener-Hammerstein systems

引用

IFAC-PapersOnLine 2021年第7期54卷 463-468页

作者： Konstantin Usevich Philippe Dreesen Mariya Ishteva Université de Lorraine CNRS CRAN Nancy France KU Leuven Dept. Electrical Engineering (ESAT) STADIUS Center for Dynamical Systems Signal Processing and Data Analytics Belgium KU Leuven Department of Computer Science ADVISE-NUMA campus Geel Belgium

关键词： Block structured system identification parallel Wiener-Hammerstein systems Volterra kernels low-rank tensor recovery canonical polyadic decomposition

来源：评论

学校读者我要写书评

暂无评论

Energetic Content based Image Retrieval Scheme using Improved Deep Learning Strategy with Image Analysis Technique

Energetic Content based Image Retrieval Scheme using Improve...

引用

International Conference on Smart Structures and Systems (ICSSS)

作者： S. Karkuzhali P. Malathi A Thenmozhi Velu Aiyyasamy Keerthika A G.S. Uthayakumar Department of General Engineering R.M.K. Engineering College Chennai Tamil Nadu India Department of Data Analytics Saveetha College of Liberal Arts and Sciences SIMATS Department of Electronics and Communication Engineering Kings Engineering College Chennai Tamil Nadu India Department of Electronics and Communication Engineering Meenakshi Sundararajan Engineering College Chennai Tamil Nadu India Department of Computer Science and Engineering Prince Shri Venkateshwara Padmavathy Engineering College Chennai Tamil Nadu India Department of ECE St. Joseph’s Institute of Technology Chennai Tamil Nadu India

One popular approach to retrieving images from huge, unprocessed datasets is content-based image retrieval, or CBIR. The conventional ways of data retrieval, however, are not meeting the needs of consumers. The number of consumer-accessible photographs also keeps growing, and there are an abundance of digital platforms for development and dissemination. Consequently, digital image processing is both ubiquitous and permanent in many fields. Consequently, effective strategies are required for both the speedy access to these massive picture databases and the recovery of comparable photos from this massive number of images based on a specific picture (query). The computation of depiction of features and resemblance is crucial to the efficiency of a CBIR system. We introduce LAIRS, a cutting-edge deep learning method that integrates the extraction of features and aims to do this with classification to facilitate rapid picture retrieval. For a transparent evaluation of the proposed scheme’s efficiency, the suggested logic is cross-validated using Convolutional Neural Networks (CNNs), a classic deep learning paradigm. Several in-depth observational experiments for various CBIR tasks employing an image database have shown encouraging results, teaching us important lessons for making CBIR system more efficient. With the use of CBIR structures, a different collection can find similar pictures to the query image. There is little doubt that Google’s search per photo tool is perhaps the most widely used CBIR approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Leveraging Probe data and Machine Learning to Derive and Interpret Macroscopic Fundamental Diagrams Across U.S. Cities

Leveraging Probe Data and Machine Learning to Derive and Int...

引用

IEEE International Conference on Big data

作者： Ling Jin Xiaodan Xu Yuhan Wang Kaveh Farokhi Sadabadi Alina Lazar Duleep Rathgamage Don Zachary Needell C Anna Spurlock Mahyar Amirgholy Mona Asudegi Energy Technology Area Berkeley National Laboratory Berkeley CA Center for Advanced Transportation Technology University of Maryland College Park MD Department of Computer Science and Information Youngstown State University Youngstown OH School of Data Science and Analytics Kennesaw State University Marietta GA Energy Analysis and Environmental Impacts Division Lawrence Berkeley National Laboratory Berkeley CA Civil and Environmental Engineering Department Kennesaw State University Marietta GA Office of Transportation Policy Studies Federal Highway Administration Washington DC D.C.

Macroscopic fundamental diagram (MFD) captures an orderly relationship among traffic flow, density, and speed at the network level. Understanding network-wide traffic through MFDs can optimally allocate demand to existing networks, improving performance by maximizing network production and avoiding congestion. However, due to historical data limitations, empirically derived MFD models are sparse in the literature, especially for the U.S. cities. Leveraging a large-scale and granular census-tract-level flow and density derived from vehicle probe data, this research is the first to develop a machine learning approach to both derive MFD models and interpret their underlying difference among urban networks across the entire United States. Among the four machine learning methods tested here XGBoost is found to deliver the best performance to predict the network traffic flow for given vehicular density and location attributes. Interaction Shapley Additive explanation (SHAP) values are used to interpret the factors, such as land use, transportation infrastructure, and network topology, that influence the flow-density relationships among locations. The analysis framework developed in this work can generate datadriven MFDs and a deeper understanding of their shape dependence on network, infrastructure, and land use characteristics, which can be used by transportation authorities to derive and optimize location-specific MFDs facilitating more informed management and planning decisions at the network level.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：