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

SRBench++: Principled Benchmarking of Symbolic Regression With Domain-Expert Interpretation

学校读者我要写书评

暂无评论

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： de Franca, F.O. Virgolin, M. Kommenda, M. Majumder, M.S. Cranmer, M. Espada, G. Ingelse, L. Fonseca, A. Landajuela, M. Petersen, B. Glatt, R. Mundhenk, N. Lee, C.S. Hochhalter, J.D. Randall, D.L. Kamienny, P. Zhang, H. Dick, G. Simon, A. Burlacu, B. Kasak, Jaan Machado, Meera Wilstrup, Casper Cavaz, W.G.L. Federal University of ABC Santo Andre Brazil Evolutionary Intelligence group Centrum Wiskunde and Informatica Science Park Amsterdam Netherlands University of Applied Sciences Upper Austria Hagenberg Austria Computational Health Informatics Program Boston Children’s Hospital Harvard Medical School Boston USA Center for Computational Astrophysics Flatiron Institute and Department of Astrophysical Sciences of Princeton University USA LASIGE Faculdade de Ciências Universidade de Lisboa Lisboa Portugal Computational Engineering Division Lawrence Livermore National Laboratory Livermore USA Department of Mechanical Engineering University of Utah Utah USA Meta FAIR France Victoria University of Wellington School of Engineering and Computer Science New Zealand University of otago Department of Information Science New Zealand Institut für Angewandte Physik Universität TübingenMax Planck Institute for Intelligent Systems Tübingen Germany Abzu AI Orient Plads 1 Nordhavn Denmark

Symbolic regression searches for analytic expressions that accurately describe studied phenomena. The main promise of this approach is that it may return an interpretable model that can be insightful to users, while maintaining high accuracy. The current standard for benchmarking these algorithms is SRBench, which evaluates methods on hundreds of datasets that are a mix of real-world and simulated processes spanning multiple domains. At present, the ability of SRBench to evaluate interpretability is limited to measuring the size of expressions on real-world data, and the exactness of model forms on synthetic data. In practice, model size is only one of many factors used by subject experts to determine how interpretable a model truly is. Furthermore, SRBench does not characterize algorithm performance on specific, challenging sub-tasks of regression such as feature selection and evasion of local minima. In this work, we propose and evaluate an approach to benchmarking SR algorithms that addresses these limitations of SRBench by 1) incorporating expert evaluations of interpretability on a domain-specific task, and 2) evaluating algorithms over distinct properties of data science tasks. We evaluate 12 modern symbolic regression algorithms on these benchmarks and present an in-depth analysis of the results, discuss current challenges of symbolic regression algorithms and highlight possible improvements for the benchmark itself. Authors

关键词： Benchmarking

Hard hat wearing detection based on head keypoint localization

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wójcik, Bartosz Zarski, Mateusz Ksiązek, Kamil Miszczak, Jaroslaw A. Skibniewski, Miroslaw J. Faculty of Civil Engineering Silesian University of Technology Poland Institute of Theoretical and Applied Informatics Polish Academy of Sciences Poland Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Poland Department of Civil & Environmental Engineering University of Maryland College Park United States

In recent years, a lot of attention is paid to deep learning methods in the context of vision-based construction site safety systems. However, still there is no reliable way to establish the relationship between supervised construction workers and their basic personal protective equipment, like hard hats. To address this problem, a novel deep learning method combining object detection, keypoint localization, and simple rule-based reasoning is proposed in this article. In tests, this solution surpassed the previous methods based on the relative bounding box position of different instances, as well as direct detection of hard hat wearers and non-wearers. Achieving MS COCO style overall AP of 67.5% compared to 66.4% and 66.3% achieved by the above-mentioned approaches, with class specific AP for hard hat non-wearers of 64.1% compared to 63.0% and 60.3%. The results show that the conjunction of deep learning methods with humanly-interpretable rule-based algorithm is better suited for detection of hard hat non-wearers. Code is available at barwojcik/hard-hats. © 2021, CC BY.

关键词： Object detection

Color-avoiding percolation in edge-colored Erdős–Rényi graphs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Ráth, Balázs Varga, Kitti Fekete, Panna Tímea Molontay, Roland Afréd Rényi Institute of Mathematics Hungary Department of Stochastics Institute of Mathematics Budapest University of Technology and Economics Hungary ELKH-BME Stochastics Research Group Chile Department of Computer Science and Information Theory Faculty of Electrical Engineering and Informatics Budapest University of Technology and Economics Hungary ELKH-ELTE Egerváry Research Group Hungary Department of Applied Analysis and Computational Mathematics Eötvös Loránd University Hungary

We study a variant of the color-avoiding percolation model introduced by Krause et al., namely we investigate the color-avoiding bond percolation setup on (not necessarily properly) edge-colored Erd̋ os–Rényi random graphs. We say that two vertices are color-avoiding connected in an edge-colored graph if after the removal of the edges of any color, they are in the same component in the remaining graph. The color-avoiding connected components of an edge-colored graph are maximal sets of vertices such that any two of them are color-avoiding connected. We consider the fraction of vertices contained in color-avoiding connected components of a given size as well as the fraction of vertices contained in the giant color-avoiding connected component. Under some mild assumptions on the color-densities, we prove that these quantities converge and the limits can be expressed in terms of probabilities associated to edge-colored branching process trees. We provide explicit formulas for the limit of the normalized size of the giant color-avoiding connected component, and in the two-colored case we also provide explicit formulas for the limit of the fraction of vertices contained in color-avoiding connected components of a given size. Copyright © 2022, The Authors. All rights reserved.

关键词： Color

Smart Dynamic Resource Allocation Model for Patient-Driven Mobile Medical Information System Using C4.5 Algorithm

学校读者我要写书评

暂无评论

Journal of Electronic Science and Technology 2019年第3期17卷 231-241页

作者： Ching-Kan Lo Hsing-Chung Chen Pei-Yuan Lee Ming-Chou Ku Lidia Ogiela Cheng-Hung Chuang the Department of Orthopedics and the Department of Information Show-Chwan Health Care SystemChanghua 50008 the Department of Computer Science and Information Engineering and the Department of Bioinformatics and Medical Engineering Asia UniversityTaichung 41354 the Department of Orthopedics Show-Chwan Health Care SystemChanghua 50008 the Department of Applied Informatics Akademia Gorniczo-Hutnicza University of Science and TechnologyKrakow 30-059

A mobile medical information system (MMIS) is an integrated application (app) of traditional hospital information systems (HIS) which comprise a picture archiving and communications system (PACS), laboratory information system (LIS), pharmaceutical management information system (PMIS), radiology information system (RIS), and nursing information system (NIS). A dynamic resource allocation table is critical for optimizing the performance to the mobile system, including the doctors, nurses, or other relevant health workers. We have designed a smart dynamic resource allocation model by using the C4.5 algorithm and cumulative distribution for optimizing the weight of resource allocated for the five major attributes in a cooperation communications system. Weka is used in this study. The class of concept is the performance of the app, optimal or suboptimal. Three generations of optimization of the weight in accordance with the optimizing rate are shown.

关键词： Dynamic resource allocation electronic health record hospital information system mobile medical information system

Position: Bayesian Deep Learning is Needed in the Age of Large-Scale AI

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Papamarkou, Theodore Skoularidou, Maria Palla, Konstantina Aitchison, Laurence Arbel, Julyan Dunson, David Filippone, Maurizio Fortuin, Vincent Hennig, Philipp Hernández-Lobato, José Miguel Hubin, Aliaksandr Immer, Alexander Karaletsos, Theofanis Khan, Mohammad Emtiyaz Kristiadi, Agustinus Li, Yingzhen Mandt, Stephan Nemeth, Christopher Osborne, Michael A. Rudner, Tim G.J. Rügamer, David Teh, Yee Whye Welling, Max Wilson, Andrew Gordon Zhang, Ruqi Department of Mathematics The University of Manchester Manchester United Kingdom Eric and Wendy Schmidt Center Broad Institute of MIT and Harvard Cambridge United States Spotify London United Kingdom Computational Neuroscience Unit University of Bristol Bristol United Kingdom Centre Inria de l'Université Grenoble Alpes Grenoble France Department of Statistical Science Duke University United States Statistics Program KAUST Saudi Arabia Helmholtz AI Munich Germany Department of Computer Science Technical University of Munich Munich Germany Munich Center for Machine Learning Munich Germany Tübingen AI Center University of Tübingen Tübingen Germany Department of Engineering University of Cambridge Cambridge United Kingdom Department of Mathematics University of Oslo Oslo Norway Bioinformatics and Applied Statistics Norwegian University of Life Sciences Ås Norway Department of Computer Science ETH Zurich Switzerland Chan Zuckerberg Initiative CA United States Center for Advanced Intelligence Project RIKEN Tokyo Japan Vector Institute Toronto Canada Department of Computing Imperial College London London United Kingdom Department of Computer Science UC Irvine Irvine United States Department of Mathematics and Statistics Lancaster University Lancaster United Kingdom Department of Engineering Science University of Oxford Oxford United Kingdom Center for Data Science New York University New York United States Department of Statistics LMU Munich Munich Germany DeepMind London United Kingdom Department of Statistics University of Oxford Oxford United Kingdom Informatics Institute University of Amsterdam Amsterdam Netherlands Courant Institute of Mathematical Sciences Center for Data Science Computer Science Department New York University New York United States Department of Computer Science Purdue University West Lafayette United States

In the current landscape of deep learning research, there is a predominant emphasis on achieving high predictive accuracy in supervised tasks involving large image and language datasets. However, a broader perspective reveals a multitude of overlooked metrics, tasks, and data types, such as uncertainty, active and continual learning, and scientific data, that demand attention. Bayesian deep learning (BDL) constitutes a promising avenue, offering advantages across these diverse settings. This paper posits that BDL can elevate the capabilities of deep learning. It revisits the strengths of BDL, acknowledges existing challenges, and highlights some exciting research avenues aimed at addressing these obstacles. Looking ahead, the discussion focuses on possible ways to combine large-scale foundation models with BDL to unlock their full potential. © 2024, CC BY-NC-ND.

关键词： Large datasets

A monotonic optimization approach for solving strictly quasiconvex multiobjective programming problems

学校读者我要写书评

暂无评论

A monotonic optimization approach for solving strictly quasi...

作者： Thang, Tran Ngoc Solanki, Vijender Kumar Dao, Tuan Anh Thi Ngoc Anh, Nguyen Van Hai, Pham School of Applied Mathematics and Informatics Hanoi University of Science and Technology Hanoi Viet Nam Department of Computer Science and Engineering CMR Institute of Technology Hyderabad TS India Department of Information Technology Uppsala University Uppsala Sweden School of Information and Communication Technology Hanoi University of Science and Technology Hanoi Viet Nam

In this article, we use a monotonic optimization approach to propose an outcome-space outer approximation by copolyblocks for solving strictly quasiconvex multiobjective programming problems which include many classes of captivating problems, for example when the criterion functions are nonlinear fractional. After the algorithm is terminated, with any given tolerance, an approximation of the weakly efficient solution set is obtained containing the whole weakly efficient solution set of the problem. The algorithm is proved to be convergent and it is suitable to be implemented in parallel using convex programming tools. Some computational experiments are reported to show the accuracy and efficiency of the algorithm. © 2020 - IOS Press and the authors. All rights reserved.

关键词： Multiobjective optimization

Kurdish Handwritten Character Recognition using Deep Learning Techniques

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Ahmed, Rebin M. Rashid, Tarik A. Fattah, Polla Alsadoon, Abeer Bacanin, Nebojsa Mirjalili, Seyedali Vimal, S. Chhabra, Amit IT Department Faculty of Applied Science Tishk International University Erbil Iraq Computer Science and Engineering Department University of Kurdistan Hewler Erbil Iraq Software and Informatics Engineering Salahaddin University-Erbil- Erbil Iraq School of Computing and Mathematics Charles Sturt University Sydney Australia Sydney Australia Singidunum University Belgrade Serbia Centre for Artificial Intelligence Research and Optimisation Torrens University Australia Yonsei Frontier Lab Yonsei University Seoul Korea Republic of Department of Artificial Intelligence and Data Science Ramco Institute of Technology North Venganallur Village Virudhunagar District Tamilnadu Rajapalayam626 117 India Department of Computer Engineering and Technology Guru Nanak Dev University Amritsar India

Handwriting recognition is one of the active and challenging areas of research in the field of image processing and pattern recognition. It has many applications that include: a reading aid for visual impairment, automated reading and processing for bank checks, making any handwritten document searchable, and converting them into structural text form, etc. Moreover, high accuracy rates have been recorded by handwriting recognition systems for English, Chinese Arabic, Persian, and many other languages. Yet there is no such system available for offline Kurdish handwriting recognition. In this paper, an attempt is made to design and develop a model that can recognize handwritten characters for Kurdish alphabets using deep learning techniques. Kurdish (Sorani) contains 34 characters and mainly employs an Arabic\Persian based script with modified alphabets. In this work, a Deep Convolutional Neural Network model is employed that has shown exemplary performance in handwriting recognition systems. Then, a comprehensive dataset was created for handwritten Kurdish characters, which contains more than 40 thousand images. The created dataset has been used for training the Deep Convolutional Neural Network model for classification and recognition tasks. In the proposed system, the experimental results show an acceptable recognition level. The testing results reported a 96% accuracy rate, and training accuracy reported a 97% accuracy rate. From the experimental results, it is clear that the proposed deep learning model is performing well and is comparable to the similar model of other languages' handwriting recognition systems. © 2022, CC BY.

关键词： Convolutional neural networks

Guest editorial current state of the art of ai computing, iot and big data technologies

学校读者我要写书评

暂无评论

Journal of Internet Technology 2020年第3期21卷 819-820页

作者： Man, Ka Lok Krilavieiùs, Tomas Park, Sangoh Computer Science and Software Engineering Xi'an Jiaotong-Liverpool University Suzhou China Applied Informatics department Vytauto Didžiojo University Kaunas Lithuania School of Computer Science and Engineering Chung-Ang University Seoul Korea Republic of

A predictive surrogate model for heat transfer of an impinging jet on a concave surface

学校读者我要写书评

暂无评论

International Journal of Heat and Mass Transfer 2025年 251卷

作者： Sajad Salavatidezfouli Saeed Rakhsha Armin Sheidani Giovanni Stabile Gianluigi Rozza Mathematics Area MathLab International School for Advanced Studies (SISSA) Trieste Italy Department of Electrical and Computer Engineering - Signal Processing and Machine Learning Aarhus University Aarhus Denmark Department of Mechanical Engineering Semnan University Semnan Iran Department of Applied Physics Eindhoven University of Technology The Netherlands Department of Pure and Applied Sciences Informatics and Mathematics Section University of Urbino Carlo Bo Urbino Italy The Biorobotics Institute Sant’Anna School of Advanced Studies Pisa Italy

This paper aims to comprehensively investigate the efficacy of model order reduction and deep learning techniques in predicting heat transfer of pulsatile impinging jets on a concave surface. We introduce two predictive approaches: one employing a Fast Fourier Transform-augmented Artificial Neural Network for predicting the area-averaged Nusselt number under constant-frequency jet scenarios, and another comparing the performance of LSTM and Transformer neural networks for random-frequency jets. Results indicate that the Transformer significantly outperforms the LSTM, achieving higher accuracy and robustness in predicting Nusselt numbers — covering up to 50% of the cycle with precision, whereas the LSTM covers only 20% with greater error margins. Additionally, the integration of Proper Orthogonal Decomposition with Transformer networks yields a novel strategy for predicting local Nusselt number distributions. This method significantly reduces computational complexity while maintaining high accuracy, with a maximum prediction error of 5%. These findings demonstrate the efficacy of advanced deep learning techniques for temporal prediction of the Nusselt number on complex surfaces, suggesting further applicability in broader fluid dynamics and heat transfer analyses.

关键词： Concave surface Deep learning Heat transfer Model order reduction Predictive surrogate model