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

arXiv 2024年

作者： Yang, Yang Chen, Mingzhe Blankenship, Yufei Lee, Jemin Ghassemlooy, Zabih Cheng, Julian Mao, Shiwen The School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China The Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL United States The Ericsson SchaumburgIL United States School of Electrical and Electronic Engineering Yonsei University Seoul Korea Republic of The Optical Communications Research Group Faculty of Engineering and Environment Northumbria University Newcastle upon TyneNE1 8ST United Kingdom The School of Engineering The University of British Columbia KelownaBC Canada The Wireless Engineering Research and Education Center Auburn University AuburnAL United States

Positioning has recently received considerable attention as a key enabler in emerging applications such as extended reality, unmanned aerial vehicles and smart environments. These applications require both data communication and high-precision positioning, and thus they are particularly well-suited to be offered in wireless networks (WNs). The purpose of this paper is to provide a comprehensive overview of existing works and new trends in the field of positioning techniques from both the academic and industrial perspectives. The paper provides a comprehensive overview of positioning in WNs, covering the background, applications, measurements, state-of-the-art technologies and future challenges. The paper outlines the applications of positioning from the perspectives of public facilities, enterprises and individual users. We investigate the key performance indicators and measurements of positioning systems, followed by the review of the key enabler techniques such as artificial intelligence/large models and adaptive systems. Next, we discuss a number of typical wireless positioning technologies. We extend our overview beyond the academic progress, to include the standardization efforts, and finally, we provide insight into the challenges that remain. The comprehensive overview of exisitng efforts and new trends in the field of positioning from both the academic and industrial communities would be a useful reference to researchers in the field. Copyright © 2024, The Authors. All rights reserved.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

On Aggregation in Ensembles of Multilabel Classifiers

arXiv

引用

arXiv 2020年

作者： Nguyen, Vu-Linh Hüllermeier, Eyke Rapp, Michael Mencía, Eneldo Loza Fürnkranz, Johannes Heinz Nixdorf Institute Department of Computer Science Paderborn University Germany Knowledge Engineering Group TU Darmstadt Germany Computational Data Analytics Group JKU Linz Austria

While a variety of ensemble methods for multilabel classification have been proposed in the literature, the question of how to aggregate the predictions of the individual members of the ensemble has received little attention so far. In this paper, we introduce a formal framework of ensemble multilabel classification, in which we distinguish two principal approaches: "predict then combine" (PTC), where the ensemble members first make loss minimizing predictions which are subsequently combined, and "combine then predict" (CTP), which first aggregates information such as marginal label probabilities from the individual ensemble members, and then derives a prediction from this aggregation. While both approaches generalize voting techniques commonly used for multilabel ensembles, they allow to explicitly take the target performance measure into account. Therefore, concrete instantiations of CTP and PTC can be tailored to concrete loss functions. Experimentally, we show that standard voting techniques are indeed outperformed by suitable instantiations of CTP and PTC, and provide some evidence that CTP performs well for decomposable loss functions, whereas PTC is the better choice for non-decomposable losses. Copyright © 2020, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Smart coach—a recommendation system for young football athletes 10th

Smart coach—a recommendation system for young football athl...

引用

10th International Symposium on Ambient Intelligence, ISAmI 2019

作者： Matos, Paulo Rocha, João Gonçalves, Ramiro Almeida, Ana Santos, Filipe Abreu, David Martins, Constantino Computer Science Department Engineering Institute - Polytechnic of Porto Porto Portugal Trás-os-Montes e Alto Douro University Vila Real Portugal GECAD Knowledge and Decision Support Research Group Porto Portugal

ISBN: (纸本)9783030240967

Over the last decades Information and Communication Technologies (ICTs) are increasingly being used in sports, especially in football, aiming to improve the athletes training and results. However, training systems for young athletes do not have, for the most part, learning abilities in order to adapt, evolve and find new training recommendations, designed specifically for each young athlete. In this paper introduce the Smart Coach user adaptation model, and whose main goal is to present our hybrid recommendation system to help young athletes evolve. This facilitate the interaction between members of a club technical staff and their young athletes, reinforcing the young person counselling, and their potential as an athlete. © Springer Nature Switzerland AG 2020.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Artificial intelligence for modelling infectious disease epidemics

引用

Nature 2025年第8051期638卷 623-635页

作者： Kraemer, Moritz U. G. Tsui, Joseph L.-H. Chang, Serina Y. Lytras, Spyros Khurana, Mark P. Vanderslott, Samantha Bajaj, Sumali Scheidwasser, Neil Curran-Sebastian, Jacob Liam Semenova, Elizaveta Zhang, Mengyan Unwin, H. Juliette T. Watson, Oliver J. Mills, Cathal Dasgupta, Abhishek Ferretti, Luca Scarpino, Samuel V. Koua, Etien Morgan, Oliver Tegally, Houriiyah Paquet, Ulrich Moutsianas, Loukas Fraser, Christophe Ferguson, Neil M. Topol, Eric J. Duchêne, David A. Stadler, Tanja Kingori, Patricia Parker, Michael J. Dominici, Francesca Shadbolt, Nigel Suchard, Marc A. Ratmann, Oliver Flaxman, Seth Holmes, Edward C. Gomez-Rodriguez, Manuel Schölkopf, Bernhard Donnelly, Christl A. Pybus, Oliver G. Cauchemez, Simon Bhatt, Samir Pandemic Sciences Institute University of Oxford Oxford United Kingdom Department of Biology University of Oxford Oxford United Kingdom Department of Electrical Engineering and Computer Science University of California Berkeley Berkeley CA United States UCSF UC Berkeley Joint Program in Computational Precision Health Berkeley CA United States Division of Systems Virology Department of Microbiology and Immunology The Institute of Medical Science The University of Tokyo Tokyo Japan Section of Epidemiology Department of Public Health University of Copenhagen Copenhagen Denmark Oxford Vaccine Group University of Oxford and NIHR Oxford Biomedical Research Centre Oxford United Kingdom Department of Epidemiology and Biostatistics Imperial College London London United Kingdom Department of Computer Science University of Oxford Oxford United Kingdom School of Mathematics University of Bristol Bristol United Kingdom MRC Centre for Global Infectious Disease Analysis School of Public Health Imperial College London London United Kingdom Department of Statistics University of Oxford Oxford United Kingdom Doctoral Training Centre University of Oxford Oxford United Kingdom Institute for Experiential AI Northeastern University MA Boston Thailand Santa Fe Institute Santa Fe NM United States World Health Organization Regional Office for Africa Brazzaville Congo WHO Hub for Pandemic and Epidemic Intelligence Health Emergencies Programme World Health Organization Berlin Germany Centre for Epidemic Response and Innovation (CERI) School for Data Science and Computational Thinking Stellenbosch University Stellenbosch South Africa African Institute for Mathematical Sciences (AIMS) South Africa Muizenberg Cape Town South Africa Genomics England London United Kingdom Scripps Research La Jolla CA United States Department of Biosystems Science and Engineering ETH Zürich Basel Switzerland Swiss Institute of Bioinformatics Lausanne Switzerland The Ethox Centre Nuffield

Infectious disease threats to individual and public health are numerous, varied and frequently unexpected. Artificial intelligence (AI) and related technologies, which are already supporting human decision making in economics, medicine and social science, have the potential to transform the scope and power of infectious disease epidemiology. Here we consider the application to infectious disease modelling of AI systems that combine machine learning, computational statistics, information retrieval and data science. We first outline how recent advances in AI can accelerate breakthroughs in answering key epidemiological questions and we discuss specific AI methods that can be applied to routinely collected infectious disease surveillance data. Second, we elaborate on the social context of AI for infectious disease epidemiology, including issues such as explainability, safety, accountability and ethics. Finally, we summarize some limitations of AI applications in this field and provide recommendations for how infectious disease epidemiology can harness most effectively current and future developments in AI. © Springer Nature Limited 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Mixing Time Lower Bound for a Simplified Version of BART

arXiv

引用

arXiv 2022年

作者： Ronen, Omer Saarinen, Theo Tan, Yan Shuo Duncan, James Yu, Bin Department of Statistics UC Berkeley United States Department of Electrical Engineering and Computer Sciences UC Berkeley United States Center for Computational Biology UC Berkeley United States Department of Statistics and Data Science National University of Singapore Singapore Microsoft Research United States Group in Biostatistics UC Berkeley United States

Bayesian Additive Regression Trees (BART) is a popular Bayesian non-parametric regression algorithm. The posterior is a distribution over sums of decision trees, and predictions are made by averaging approximate samples from the posterior. The combination of strong predictive performance and the ability to provide uncertainty measures has led BART to be commonly used in the social sciences, biostatistics, and causal inference. BART uses Markov Chain Monte Carlo (MCMC) to obtain approximate posterior samples over a parameterized space of sums of trees, but it has often been observed that the chains are slow to mix. In this paper, we provide the first lower bound on the mixing time for a simplified version of BART in which we reduce the sum to a single tree and use a subset of the possible moves for the MCMC proposal distribution. Our lower bound for the mixing time grows exponentially with the number of data points. Inspired by this new connection between the mixing time and the number of data points, we perform rigorous simulations on BART. We show qualitatively that BART’s mixing time increases with the number of data points. The slow mixing time of the simplified BART suggests a large variation between different runs of the simplified BART algorithm and a similar large variation is known for BART in the literature. This large variation could result in a lack of stability in the models, predictions and posterior intervals obtained from the BART MCMC samples. Our lower bound and simulations suggest increasing the number of chains with the number of data points. Copyright © 2022, The Authors. All rights reserved.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Automatically Labeling Aging Scenarios with a Machine Learning Approach 1

引用

24th International Conference on Human-computer Interaction, HCII 2022

作者： An, Ning Xu, Yang Gao, Qinglin Zhu, Wenjie Wu, Aoran Chen, Honglin School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Shanghai Tianyu Senior Living Service Co. Ltd. Shanghai China School of Basic Courses Bengbu Medical College Bengbu China Management and Business Department Skidmore College Saratoga SpringsNY United States Department of Social Sciences University of Eastern Finland Kuopio70150 Finland

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Older adults have diversified needs often associated with particular aging scenarios. People started to use aging scenarios to provide better Smart Eldercare services and develop innovative solutions. The problem is how to manage these scenarios effectively. To our best knowledge, this study is the first to develop a model to provide a structured framework of aging scenarios for research and teaching of eldercare services. Labeling aging scenarios can facilitate their collection, classification, and consolidation within this model. This study uses the automatic labeling approach to manage and utilize aging scenarios. Under each class, there are labels with different numbers and smaller granularity to reflect the requirements in each scenario case. Since a scenario case often involves more than one label, properly labeling it becomes a multi-label text classification problem. We extend the multi-label text classification model LSAN for labeling aging scenario cases. For evaluation purposes, we collected 938 scenario cases as the dataset. Experimental results show that our proposed method can achieve an average accuracy of 61.66%, better than other classical methods. © 2022, Springer Nature Switzerland AG.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

MICDIR: Multi-scale Inverse-consistent Deformable Image Registration using UNetMSS with Self-Constructing Graph Latent

arXiv

引用

arXiv 2022年

作者： Chatterjee, Soumick Bajaj, Himanshi Siddiquee, Istiyak H. Subbarayappa, Nandish Bandi Simon, Steve Shashidhar, Suraj Bangalore Speck, Oliver Nürnberger, Andreas Faculty of Computer Science Otto von Guericke University Magdeburg Germany Data and Knowledge Engineering Group Otto von Guericke University Magdeburg Germany Biomedical Magnetic Resonance Otto von Guericke University Magdeburg Germany Genomics Research Centre Human Technopole Milan Italy German Centre for Neurodegenerative Disease Magdeburg Germany Centre for Behavioural Brain Sciences Magdeburg Germany

Image registration is the process of bringing different images into a common coordinate system - a technique widely used in various applications of computer vision, such as remote sensing, image retrieval, and, most commonly, medical imaging. Deep learning based techniques have been applied successfully to tackle various complex medical image processing problems, including medical image registration. Over the years, several image registration techniques have been proposed using deep learning. Deformable image registration techniques such as Voxelmorph have been successful in capturing finer changes and providing smoother deformations. However, Voxelmorph, as well as ICNet and FIRE, do not explicitly encode global dependencies (i.e. the overall anatomical view of the supplied image) and, therefore, can not track large deformations. In order to tackle the aforementioned problems, this paper extends the Voxelmorph approach in three different ways. To improve the performance in case of small as well as large deformations, supervision of the model at different resolutions has been integrated using a multi-scale UNet. To support the network to learn and encode the minute structural co-relations of the given image-pairs, a self-constructing graph network (SCGNet) has been used as the latent of the multi-scale UNet - which can improve the learning process of the model and help the model to generalise better. And finally, to make the deformations inverse-consistent, cycle consistency loss has been employed. On the task of registration of brain MRIs, the proposed method achieved significant improvements over ANTs and VoxelMorph, obtaining a Dice score of 0.8013±0.0243 for intramodal and 0.6211±0.0309 for intermodal, while VoxelMorph achieved 0.7747±0.0260 and 0.6071±0.0510, respectively. Copyright © 2022, The Authors. All rights reserved.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

HARDC : A novel ECG-based heartbeat classification method to detect arrhythmia using hierarchical attention based dual structured RNN with dilated CNN

arXiv

引用

arXiv 2023年

作者： Islam, Md Shofiqul Hasan, Khondokar Fida Sultana, Sunjida Uddin, Shahadat Lio', Pietro Quinn, Julian M.W. Moni, Mohammad Ali Faculty of Computing Universiti Malaysia Pahang Gambang Pahang Kuantan26300 Malaysia Lebuhraya Tun Razak Gambang Pahang Kuantan26300 Malaysia 2 George Street Brisbane4000 Australia Department of Computer Science and Engineering Islamic University Kushtia7600 Bangladesh School of Project Management Faculty of Engineering The University of Sydney Sydney Australia Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom Bone Research Group The Garvan Institute of Medical Research DarlinghurstNSW Australia Artificial Intelligence & Data Science School of Health and Rehabilitation Sciences Faculty of Health and Behavioural Sciences The University of Queensland St LuciaQLD4072 Australia

Deep learning-based models have achieved significant success in detecting cardiac arrhythmia by analyzing ECG signals to categorize patient heartbeats. To improve the performance of such models, we have developed a novel hybrid hierarchical attention-based bidirectional recurrent neural network with dilated CNN (HARDC) method for arrhythmia classification. This solves problems that arise when traditional dilated convolutional neural network (CNN) models disregard the correlation between contexts and gradient dispersion. The proposed HARDC fully exploits the dilated CNN and bidirectional recurrent neural network unit (BiGRU-BiLSTM) architecture to generate fusion features. As a result of incorporating both local and global feature information and an attention mechanism, the model's performance for prediction is improved. By combining the fusion features with a dilated CNN and a hierarchical attention mechanism, the trained HARDC model showed significantly improved classification results and interpretability of feature extraction on the PhysioNet 2017 challenge dataset. Sequential Z-Score normalization, filtering, denoising, and segmentation are used to prepare the raw data for analysis. CGAN (Conditional Generative Adversarial Network) is then used to generate synthetic signals from the processed data. The experimental results demonstrate that the proposed HARDC model significantly outperforms other existing models, achieving an accuracy of 99.60%, F1 score of 98.21%, a precision of 97.66%, and recall of 99.60% using MIT-BIH generated ECG. In addition, this approach substantially reduces run time when using dilated CNN compared to normal convolution. Overall, this hybrid model demonstrates an innovative and cost-effective strategy for ECG signal compression and high-performance ECG recognition. Our results indicate that an automated and highly computed method to classify multiple types of arrhythmia signals holds considerable promise. © 2023, CC BY.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

MoTransFrame:Model Transfer Framework for CNNs on Low-Resource Edge Computing Node

引用

computers, Materials & Continua 2020年第12期65卷 2321-2334页

作者： Panyu Liu Huilin Ren Xiaojun Shi Yangyang Li Zhiping Cai Fang Liu Huacheng Zeng National University of Defense Technology Changsha410073China Training and Administration Department the Central Military CommissionBeijing100851China Department of Science and Technology China Electronics Technology Group CorporationBeijing100846China National Engineering Laboratory for Public Safety Risk Perception and Control by Big Data Beijing100041China School of Design Hunan UniversityChangsha410082China Department of Electrical and Computer Engineering University of LouisvilleLouisvilleKY 40292USA

Deep learning technology has been widely used in computer vision,speech recognition,natural language processing,and other related *** deep learning algorithm has high precision and high ***,the lack of resources in the edge terminal equipment makes it difficult to run deep learning algorithms that require more memory and computing *** this paper,we propose MoTransFrame,a general model processing framework for deep learning *** of designing a model compression algorithm with a high compression ratio,MoTransFrame can transplant popular convolutional neural networks models to resources-starved edge devices promptly and *** the integration method,Deep learning models can be converted into portable projects for Arduino,a typical edge device with limited *** experiments show that MoTransFrame has good adaptability in edge devices with limited *** is more flexible than other model transplantation *** can keep a small loss of model accuracy when the number of parameters is compressed by tens of *** the same time,the computational resources needed in the reasoning process are less than what the edge node could handle.

关键词： Edge computing convolutional neural network model transformation model compression

来源：评论

学校读者我要写书评

暂无评论

Size-fixed group discovery via multi-constrained graph pattern matching

引用

Information sciences 2025年 690卷

作者： Guliu Liu Lei Li Guanfeng Liu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education 230601 Hefei China School of Computer Science and Information Engineering Hefei University of Technology 230601 Hefei China Department of Computing Macquarie University Sydney 2122 Australia

Multi-Constrained Graph Pattern Matching (MC-GPM) aims to match a pattern graph with multiple attribute constraints on its nodes and edges, and has garnered significant interest in various fields, including social-based e-commerce and trust-based group discovery. However, the existing MC-GPM methods do not consider situations where the number of each node in the pattern graph needs to be fixed, such as finding experts group with expert quantities and relations specified. In this paper, a Multi-Constrained Strong Simulation with the Fixed Number of Nodes (MCSS-FNN) matching model is proposed, and then a Trust-oriented Optimal Multi-constrained Path (TOMP) matching algorithm is designed for solving it. Additionally, two heuristic optimization strategies are designed, one for combinatorial testing and the other for edge matching, to enhance the efficiency of the TOMP algorithm. Empirical experiments are conducted on four real social network datasets, and the results demonstrate the effectiveness and efficiency of the proposed algorithm and optimization strategies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：