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

arXiv 2023年

作者： Shi, Changhao Mishne, Gal The Electrical and Computer Engineering Department UC San Diego CA92093 United States The Halıcıoglu Data Science Institute The Neurosciences Graduate Program UC San Diego CA92093 United States

Graph signal processing (GSP) is a prominent framework for analyzing signals on non-Euclidean domains. The graph Fourier transform (GFT) uses the combinatorial graph Laplacian matrix to reveal the spectral decomposition of signals in the graph frequency domain. However, a common challenge in applying GSP methods is that in many scenarios the underlying graph of a system is unknown. A solution in such cases is to construct the unobserved graph from available data, which is commonly referred to as graph or network inference. Although different graph inference methods exist, these are restricted to learning from either smooth graph signals or simple additive Gaussian noise. Other types of noisy data, such as discrete counts or binary digits, are rather common in real-world applications, yet are underexplored in graph inference. In this paper, we propose a versatile graph inference framework for learning from graph signals corrupted by exponential family noise. Our framework generalizes previous methods from continuous smooth graph signals to various data types. We propose an alternating algorithm that jointly estimates the graph Laplacian and the unobserved smooth representation from the noisy signals. We also extend our approach to a variational form to account for the inherent stochasticity of the latent smooth representation. Finally, since real-world graph signals are frequently non-independent and temporally correlated, we further adapt our original setting to a time-vertex formulation. We demonstrate on synthetic and real-world data that our new algorithms outperform competing Laplacian estimation methods that suffer from noise model mismatch. Copyright © 2023, The Authors. All rights reserved.

关键词： Signal processing

来源：评论

学校读者我要写书评

暂无评论

On the particle approximation of lagged Feynman–Kac formulae

引用

Stochastic Processes and their Applications 2025年 188卷

作者： Awadelkarim, Elsiddig Caffarel, Michel Del Moral, Pierre Jasra, Ajay Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia University of Toulouse CNRS-Lab. de Chimie et Physique Quantiques Toulouse31062 France Centre de Recherche Inria Bordeaux Sud-Ouest Talence33405 France School of Data Science The Chinese University of Hong Kong Shenzhen Shenzhen China

In this paper we examine the numerical approximation of the limiting invariant measure associated with Feynman–Kac formulae. These are expressed in a discrete time formulation and are associated with a Markov chain and a potential function. The typical application considered here is the computation of eigenvalues associated with non-negative operators as found, for example, in physics or particle simulation of rare-events. We focus on a novel lagged approximation of this invariant measure, based upon the introduction of a ratio of time-averaged Feynman–Kac marginals associated with a positive operator iterated l∈N times;a lagged Feynman–Kac formula. This estimator and its approximation using Diffusion Monte Carlo (DMC) are commonly used in the physics literature. In short, DMC is an iterative algorithm involving N∈N particles or walkers simulated in parallel, that undergo sampling and resampling operations. In this work, it is shown that for the DMC approximation of the lagged Feynman–Kac formula, one has an almost sure characterization of the L1-error as the time parameter (iteration) goes to infinity and this is at most of O(exp{−κl}/N), for κ>0. In addition a non-asymptotic in time, and time uniform L1−bound is proved which is O(l/N). We also prove a novel central limit theorem to give a characterization of the exact asymptotic in time variance. This analysis demonstrates that the strategy used in physics, namely, to run DMC with N and l small and, for long time enough, is mathematically justified. Our results also suggest how one should choose N and l in practice. We emphasize that these results are not restricted to physical applications;they have broad relevance to the general problem of particle simulation of the Feynman–Kac formula, which is utilized in a great variety of scientific and engineering fields. © 2025 Elsevier B.V.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Explainable machine learning models for estimating daily dissolved oxygen concentration of the Tualatin River

引用

Engineering Applications of Computational Fluid Mechanics 2024年第1期18卷

作者： Li, Shuguang Qasem, Sultan Noman Band, Shahab S. Ameri, Rasoul Pai, Hao-Ting Mehdizadeh, Saeid School of Computer Science and Technology Shandong Technology and Business University Yantai China Computer Science Department College of Computer and Information Sciences Imam Mohammad Ibn Saud Islamic University (IMSIU) Riyadh Saudi Arabia Computer Science Department Faculty of Applied Science Taiz University Taiz Yemen Future Technology Research Center National Yunlin University of Science and Technology Douliu Taiwan Department of Information Management International Graduate School of Artificial Intelligence National Yunlin University of Science and Technology Douliu Taiwan Department of Information Management National Yunlin University of Science and Technology Douliu Taiwan Bachelor Program of Big Data Applications in Business National Pingtung University Pingtung Taiwan Water Engineering Department Urmia University Urmia Iran

Monitoring the quality of river water is of fundamental importance and needs to be taken into consideration when it comes to the research into the hydrological field. In this context, the concentration of the dissolved oxygen (DO) is one of the most significant indicators of the quality of river water. The current study aimed to estimate the minimum, maximum, and mean DO concentrations (DO min, DO max, DO mean) at a gauging station located on Tualatin River, United States. To that end, four machine learning models, such as support vector regression (SVR), multi-layer perceptron (MLP), random forest (RF), and gradient boosting (GB) were established. Root mean square error (RMSE), mean absolute error (MAE), coefficient of correlation (R), and Nash-Sutcliffe efficiency (NSE) metrics were employed to better assess the accuracies of these models. The modeling results demonstrated that the SVR and MLP surpassed the RF and GB models. Despite this, the SVR was concluded to be the best-performing method when used to estimate the DO min, DO max, and DO mean. The best error statistics in the testing phase were related to the SVR model with full (four) inputs to estimate DO mean concentration (RMSE = 0.663 mg/l, MAE = 0.508 mg/l, R = 0.945, NSE = 0.875). Finally, the explainability of the superior models (i.e. SVR models) was conducted using SHapley Additive exPlanations (SHAP) for the first time to estimate DO concentration. In fact, evaluating the explainability of machine learning models can provide useful information about the impact of each of the input estimators used in the procedure of models development. It was concluded that the specific conductance (SC) and followed by water temperature (WT) could provide the most contributions for estimating the DO min, DO max, and DO mean concentrations. © 2024 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.

关键词： dissolved oxygen concentration estimation Explainable machine learning SHapley additive explanations

来源：评论

学校读者我要写书评

暂无评论

RHC: A dataset for In-Room and Out-Room Human Counting

引用

Procedia computer science 2021年 179卷 33-39页

作者： Bens Pardamean Hery Harjono Muljo Faizal Abid Herman Albert Susanto Tjeng Wawan Cenggoro Computer Science Department BINUS Graduate Program - Master of Computer Science Program Bina Nusantara University Jakarta Indonesia 11480 Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta Indonesia 11480 Accounting Information Systems Program Information Systems Department School of Information Systems Bina Nusantara University Jakarta Indonesia 11480 Computer Science Department School of Computer Science Bina Nusantara University Jakarta Indonesia 11480

In recent years, research in human counting from CCTV (Closed Circuit Television) images have found an increasing demand to be deployed in real-world applications. The applications have been implemented in various settings, both indoor and outdoor. In the case of indoor setting, we found a type of room setting that conveys a problem to human counting model if we need to count only humans inside a room. With this respect, we present RHC (Room Human Counting) dataset, which images are captured in the aforementioned setting. The dataset can be used to develop a robust model that can differentiate between humans inside and outside a room. The dataset is publicly available at https://***/datasets/vt5c8h6kmh/1.

关键词： dataset human counting crowd counting in-room out-room

来源：评论

学校读者我要写书评

暂无评论

Amico: Message Exchange Service for Elderly People

Amico: Message Exchange Service for Elderly People

引用

IEEE Global Conference on Consumer Electronics (GCCE)

作者： Atsushi Isozaki Kazuki Fukae Kenichi Arai Toru Kobayashi Masahide Nakamura Computer and Information Science Program Graduate School of Engineering Nagasaki University Nagasaki Japan Division of Electrical Engineering and Computer Science Graduate School of Engineering Nagasaki University Nagasaki Japan Center of Mathematical and Data Sciences Kobe University Hyogo Japan

ISBN: (纸本)9781665492331

This study is related to a system that enables elderly people to communicate interactively with young people who use existing message exchange services by simply speaking to an avatar on a tablet PC, without having to perform complicated operations of the tablet PC. On the other hand, the young people side can bring in elderly people who could not previously participate in existing message exchange services groups. The effectiveness of the system was verified through demonstration experiments with two households consisting of elderly people in their 80s.

关键词： Economics Avatars Older adults Usability Smart phones Consumer electronics Commercialization

来源：评论

学校读者我要写书评

暂无评论

On the Particle Approximation of Lagged Feynman-Kac Formulae

arXiv

引用

arXiv 2024年

作者： Awadelkarim, Elsiddig Caffarel, Michel Moral, Pierre Del Jasra, Ajay Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia University of Toulouse CNRS-Lab. de Chimie et Physique Quantiques Toulouse31062 France Centre de Recherche Inria Bordeaux Sud-Ouest Talence33405 France School of Data Science The Chinese University Hong Kong Shenzhen China

In this paper we examine the numerical approximation of the limiting invariant measure associated with Feynman-Kac formulae. These are expressed in a discrete time formulation and are associated with a Markov chain and a potential function. The typical application considered here is the computation of eigenvalues associated with non-negative operators as found, for example, in physics or particle simulation of rare-events. We focus on a novel lagged approximation of this invariant measure, based upon the introduction of a ratio of time-averaged Feynman-Kac marginals associated with a positive operator iterated l ∈ N times;a lagged Feynman-Kac formula. This estimator and its approximation using Diffusion Monte Carlo (DMC) have been extensively employed in the physics literature. In short, DMC is an iterative algorithm involving N ∈ N particles or walkers simulated in parallel, that undergo sampling and resampling operations. In this work, it is shown that for the DMC approximation of the lagged Feynman-Kac formula, one has an almost sure characterization of the L1-error as the time parameter (iteration) goes to infinity and this is at most of O(exp{−κl}/N), for_ κ > 0. In addition a non-asymptotic in time, and time uniform L1−bound is proved which is O(l/√N). We also prove a novel central limit theorem to give a characterization of the exact asymptotic in time variance. This analysis demonstrates that the strategy used in physics, namely, to run DMC with N and l small and, for long time enough, is mathematically justified. Our results also suggest how one should choose N and l in practice. We emphasize that these results are not restricted to physical applications;they have broad relevance to the general problem of particle simulation of the Feynman-Kac formula, which is utilized in a great variety of scientific and engineering fields. © 2024, CC BY.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platforms

arXiv

引用

arXiv 2023年

作者： Liu, Penghang Acharyya, Rupam Tillman, Robert E. Kimura, Shunya Masuda, Naoki Sarıyüce, Ahmet Erdem Department of Computer Science and Engineering University at Buffalo United States Amazon Web Services United States Optum Labs United States Mercari Inc. Japan Department of Mathematics University at Buffalo United States Computational and Data-Enabled Science and Engineering Program University at Buffalo United States

Understanding the dynamics of financial transactions among people is critically important for various applications such as fraud detection. One important aspect of financial transaction networks is temporality. The order and repetition of transactions can offer new insights when considered within the graph structure. Temporal motifs, defined as a set of nodes that interact with each other in a short time period, are a promising tool in this context. In this work, we study three unique temporal financial networks: transactions in Mercari, an online marketplace, payments in a synthetic network generated by J.P. Morgan Chase, and payments and friendships among Venmo users. We consider the fraud detection problem on the Mercari and J.P. Morgan Chase networks, for which the ground truth is available. We show that temporal motifs offer superior performance than a previous method that considers simple graph features. For the Venmo network, we investigate the interplay between financial and social relations on three tasks: friendship prediction, vendor identification, and analysis of temporal cycles. For friendship prediction, temporal motifs yield better results than general heuristics, such as Jaccard and Adamic-Adar measures. We are also able to identify vendors with high accuracy and observe interesting patterns in rare motifs, like temporal cycles. We believe that the analysis, datasets, and lessons from this work will be beneficial for future research on financial transaction networks. Copyright © 2023, The Authors. All rights reserved.

关键词： Finance

来源：评论

学校读者我要写书评

暂无评论

Pyramid Scene Parsing Net Model for Automated Paddy Field Map using SPOT 6 Satellite Images

Pyramid Scene Parsing Net Model for Automated Paddy Field Ma...

引用

IEEE Asia-Pacific Conference on Geoscience, Electronics and Remote Sensing Technology (AGERS)

作者： Yaya Heryadi Edy Irwansyah Eka Miranda Haryono Soeparno Herlawati Kiyota Hashimoto Computer Science Department BINUS Graduate Program-Doctor of Computer Science Bina Nusantara University Jakarta Indonesia Computer Science Department School of Computer Science Bina Nusantara University Jakarta Indonesia Information Systems Department School of Information Systems Bina Nusantara University Jakarta Indonesia Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta Indonesia Faculty of Technology and Environment Prince of Songkla University Phuket Thailand

Food sustainability is still one of the main priorities for many countries as it contributes to the economy and stability of the nation. For government in many countries whose peoples consumes rice as its staple food, food self-sufficiency initiatives highly depend on accurate prediction of paddy field map. Mapping paddy field task is a challenging problem which cannot be handled manually especially when the paddy fields are spread out in very wide geographical areas such as those in Indonesia. Fortunately, wide availability of satellite imagery and the advent of deep learning technology in the past ten years have made it possible to improve efficiency of most parts of those manual works involving image semantic segmentation tasks. However, satellite image-based semantic segmentation is a challenging task. High object complexity, cloud partial occlusion, larger image size than a computer memory can stored can hinder accuracy of the image segmentation results. This paper presents a method for paddy field map generating using semantic image segmentation approach in which Pyramid Scene Parsing Net model is used for segmenting satellite imagery. The generated paddy map can be used as a basis for decision-making, especially in the agricultural sector. Analysis of local land use/land cover dynamics. The results of his experiments using SPOT 6 satellite imagery from the Pahung region of Central Kalimantan achieved average training accuracy, best training accuracy and test accuracy of 0.85, 0.86 and 0.89 respectively. These results indicated that the semantic segmentation model is suitable for addressing the same task in different crops.

关键词： Training Productivity Deep learning Satellites Semantic segmentation Crops Predictive models

来源：评论

学校读者我要写书评

暂无评论

Cell2Sentence: teaching large language models the language of biology 24

Cell2Sentence: teaching large language models the language o...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Daniel Levine Syed Asad Rizvi Sacha Lévy Nazreen Pallikkavaliyaveetil David Zhang Xingyu Chen Sina Ghadermarzi Ruiming Wu Zihe Zheng Ivan Vrkic Anna Zhong Daphne Raskin Insu Han Antonio Henrique De Oliveira Fonseca Josue Ortega Caro Amin Karbasi Rahul M. Dhodapkar David Van Dijk Department of Computer Science Yale University New Haven CT School of Engineering Applied Science University of Pennsylvania Philadelphia PA School of Computer and Communication Sciences Swiss Federal Institute of Technology Lausanne Lausanne Switzerland Department of Computer Science Yale University New Haven CT and Department of Neuroscience Yale School of Medicine New Haven CT Department of Computer Science Yale University New Haven CT and Department of Neuroscience Yale School of Medicine New Haven CT and Wu Tsai Institute Yale University New Haven CT Google and Yale Institute for Foundations of Data Science New Haven CT and Department of Computer Science Yale University New Haven CT and Yale School of Engineering and Applied Science New Haven CT Roski Eye Institute University of Southern California Los Angeles CA and Department of Internal Medicine (Cardiology) Yale School of Medicine New Haven CT Department of Computer Science Yale University New Haven CT and Yale Institute for Foundations of Data Science New Haven CT and Wu Tsai Institute Yale University New Haven CT and Cardiovascular Research Center Yale School of Medicine New Haven CT and Interdepartmental Program in Computational Biology & Bioinformatics Yale University New Haven CT and Department of Internal Medicine (Cardiology) Yale School of Medicine New Haven CT

We introduce Cell2Sentence (C2S), a novel method to directly adapt large language models to a biological context, specifically single-cell transcriptomics. By transforming gene expression data into "cell sentences," C2S bridges the gap between natural language processing and biology. We demonstrate cell sentences enable the fine-tuning of language models for diverse tasks in biology, including cell generation, complex cell-type annotation, and direct data-driven text generation. Our experiments reveal that GPT-2, when fine-tuned with C2S, can generate biologically valid cells based on cell type inputs, and accurately predict cell types from cell sentences. This illustrates that language models, through C2S fine-tuning, can acquire a significant understanding of single-cell biology while maintaining robust text generation capabilities. C2S offers a flexible, accessible framework to integrate natural language processing with transcriptomics, utilizing existing models and libraries for a wide range of biological applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-class Weather Forecasting from Twitter Using Machine Learning Aprroaches

引用

Procedia computer science 2021年 179卷 47-54页

作者： Kartika Purwandari Join W.C. Sigalingging Tjeng Wawan Cenggoro Bens Pardamean Bioinformatics & Data Science Research Center Bina Nusantara University Jakarta Indonesia 11480 Database Center Division of BMKG Meteorological Climatological and Geophysical Agency Jakarta Indonesia 10720 Computer Science Department School of Computer Science Bina Nusantara University Jakarta Indonesia 11480 Computer Science Department BINUS Graduate Program - Master of Computer Science Program Bina Nusantara University Jakarta Indonesia 11480

Now in the era of big data, many are applying information methods accurately especially by social media. The aims of this study to classify the weather based on Twitter automatically using text mining by using Support Vector Machine (SVM), MultinomialNaive Bayes (MNB), and Logistic Regression (LR) method. The experimental results show that SVM substantially outperforms various other machine learning algorithms for the task of text classification with an accuracy value of 93%. This result proves that SVM is very suitable for text categorization. We use clustering technique to read the pattern in customers’ opinion about the restaurant based on some measurement variables.

关键词： weather classification twitter machine learning support vector machine multinomial naive bayes logistic regression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：