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

Artificial Intelligence and Smart Communication (AISC), International Conference on

作者： Ramakrishnan Raman Rejuwan Shamim Shaik Vaseem Akram Lalit Thakur Biju G. Pillai R. Ponnusamy Symbiosis Institute of Business Management Pune & Symbiosis International (Deemed University) Pune Maharashtra India Department of Computer Science and Engineering with Data Science Maharishi University of Information Technology Noida Uttaranchal Institute of Technology Uttaranchal University Department of CIVIL Parul University Department of IT & Business Analytics BIIB & Dean - Faculty of Management Sri Balaji University Pune (SBUP) Department of Computer Science & Engineering Chennai Institute of Technology

Supervised Classification (SML) is the pursuit of systems that reasoning from externally given instances to generate broad hypotheses, which subsequently generate predictions for future instances. One of the jobs performed by intelligent systems most commonly is supervised classification. Based on the data set, number of occurrences and variables in this study, the most efficient classification algorithm is selected. It is comprehensively described and contrasted with various supervised learning methods. Seven distinct machine learning algorithms were taken into consideration utilizing the Waikato Environment for data Analysis (WEDA) machine learning tool. For the identification process, the data set was used with 780 instances, eight independent variables (quality), and one dependent variable (variable). According to the data, SVM was the technique with the highest degree of precision and accuracy. Accordingly, the next accurate classification algorithms after SVM were determined to be Naive Bayes and Random Forest. The study demonstrates that precision (accuracy) and model construction time are two factors, whereas kappa statistics and mean error percentage (MAE) are two other factors. Therefore, controlled predictive machine learning requires precision, accuracy, and minimal error in ML algorithms.

关键词： Support vector machines Machine learning algorithms Supervised learning Training data Prediction algorithms Time measurement Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybrid genetic-discretized algorithm to handle data uncertainty in diagnosing stenosis of coronary arteries

Hybrid genetic-discretized algorithm to handle data uncertai...

引用

作者： Alizadehsani, Roohallah Roshanzamir, Mohamad Abdar, Moloud Beykikhoshk, Adham Khosravi, Abbas Nahavandi, Saeid Plawiak, Pawel Tan, Ru San Acharya, U Rajendra Deakin University GeelongVIC Australia Department of Engineering Fasa Branch Islamic Azad University Fars Fasa Iran Centre for Pattern Recognition and Data Analytics Deakin University GeelongVIC Australia Department of Information and Communications Technology Faculty of Computer Science and Telecommunications Cracow University of Technology Warszawska 24 st. F-3 31-155 Krakow Poland Institute of Theoretical and Applied Informatics Polish Academy of Sciences Baltycka 5 Gliwice44-100 Poland National Heart Centre Singapore Singapore Department of Electronics and Computer Engineering Ngee Ann Polytechnic Singapore Department of Biomedical Engineering School of Science and Technology Singapore University of Social Sciences Singapore Department of Bioinformatics and Medical Engineering Asia University Taiwan

Coronary artery disease (CAD) is the leading cause of morbidity and death worldwide. Invasive coronary angiography is the most accurate technique for diagnosing CAD, but is invasive and costly. Hence, analytical methods such as machine learning and data mining techniques are becoming increasingly more popular. Although physicians need to know which arteries are stenotic, most of the researchers focus only on CAD detection and few studies have investigated stenosis of the right coronary artery (RCA), left circumflex (LCX) artery and left anterior descending (LAD) artery separately. Meanwhile, most of the datasets in this field are noisy (data uncertainty). However, to the best of our knowledge, there is no study conducted to address this important problem. This study uses the extension of the Z-Alizadeh Sani dataset, containing 303 records with 54 features. A new feature selection algorithm is proposed in this work. Meanwhile, by discretization of data, we also handle the uncertainty in CAD prediction. To the best of our knowledge, this is the first study attempted to handle uncertainty in CAD prediction. Finally, the genetic algorithm (GA) is used to determine the hyper-parameters of the support vector machine (SVM) kernels. We have achieved high accuracy for the stenosis diagnosis of each main coronary artery. The results of this study can aid the clinicians to validate their manual stenosis diagnosis of RCA, LCX and LAD coronary arteries. © 2020 John Wiley & Sons, Ltd.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Enhancing Global Maritime Traffic Network Forecasting with Gravity-Inspired Deep Learning Models

arXiv

引用

arXiv 2024年

作者： Song, Ruixin Spadon, Gabriel Pelot, Ronald Matwin, Stan Soares, Amilcar Department of Computer Science Memorial University of Newfoundland St. John’sNL Canada Institute for Big Data Analytics Dalhousie University HalifaxNS Canada Industrial Engineering Department Dalhousie University HalifaxNS Canada Institute of Computer Science Polish Academy of Sciences Warsaw Poland Department of Computer Science and Media Technology Linnaeus University Växjö Sweden

Aquatic non-indigenous species (NIS) pose significant threats to biodiversity, disrupting ecosystems and inflicting substantial economic damages across agriculture, forestry, and fisheries. Due to the fast growth of global trade and transportation networks, NIS has been introduced and spread unintentionally in new environments. This study develops a new physics-informed model to forecast maritime shipping traffic between port regions worldwide. The predicted information provided by these models, in turn, is used as input for risk assessment of NIS spread through transportation networks to evaluate the capability of our solution. Inspired by the gravity model for international trades, our model considers various factors that influence the likelihood and impact of vessel activities, such as shipping flux density, distance between ports, trade flow, and centrality measures of transportation hubs. Accordingly, this paper introduces transformers to gravity models to rebuild the short- and long-term dependencies that make the risk analysis feasible. Thus, we introduce a physics-inspired framework that achieves an 89% binary accuracy for existing and non-existing trajectories and an 84.8% accuracy for the number of vessels flowing between key port areas, representing more than 10% improvement over the traditional deep-gravity model. Along these lines, this research contributes to a better understanding of NIS risk assessment. It allows policymakers, conservationists, and stakeholders to prioritize management actions by identifying high-risk invasion pathways. Besides, our model is versatile and can include new data sources, making it suitable for assessing international vessel traffic flow in a changing global landscape. Copyright © 2024, The Authors. All rights reserved.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Outlier Elimination Algorithms on Pulsar Stars dataset

Comparative Analysis of Outlier Elimination Algorithms on Pu...

引用

Emerging Smart Computing and Informatics (ESCI), Conference on

作者： Tejaswini Katale Waidehi Gautam Aakash Chotrani Aishwarya Katale Parikshit N. Mahalle Gitanjali R. Shinde Department of Computer Engineering Vishwakarma Institute of Technology Pune Maharashtra India Department of Information Technology University of Cumberlands Williamsburg KY USA Department of Business Analytics Mercer University Atlanta Georgia USA Artificial Intelligence and Data Science Vishwakarma Institute of Information Technology Pune Maharashtra India Computer Science and Engineering Vishwakarma Institute of Information Technology Pune Maharashtra India

Outliers are uncommon observations that are dispersed from most of the other data Points. These points, which can be abnormally high or low, can significantly affect the entire analysis and forecasting of the data. The purpose of this Research Paper is to examine the implementation of Outlier Elimination Algorithms on Pulsar Stars dataset. It is attributed as an HTRU2 (High Time Resolution Universe Survey) project, which focuses on identifying new pulsar candidates based on the data from Parkes radio telescope in Australia. On this dataset, a total of 6 Outlier Elimination Algorithms are implemented; Z-Score, DBSCAN(Density-based spatial clustering of applications with noise), Mahalanobis Distance, Median Absolute Deviation, Multivariate Normal Distribution for N Dimension, Angle-based Outlier Detection (ABOD). After removal of the identified Outliers, to determine which Outlier Technique was more effective, 4 Machine Learning Techniques are deployed - Random Forest, Decision Tree, Naive Bayes and XGBoost. Furthermore, Accuracies, Recall, Precision and F1 Score values were compared. Every deployed Outlier algorithm must have a consistent quantity of Outliers in order to be evaluated for efficacy. For the same around 2600–2800 number of Outliers are eliminated for each Technique. Multivariate Normal Distribution for N Dimension Outlier Algorithm with Random Forest yields Highest Accuracy of 98.2%. ABOD with Naive Bayes gives Highest Recall Value of 0.93, Z-Score with Random Forest results in Highest Precision value of 0.96 and ABOD with Random Forest yields Highest F1-Score value of 0.92. From the information provided above, it is also clear that Random Forest produces the greatest Accuracy, Precision, and F1-Score values among all the Machine Learning algorithms that have been deployed. Therefore, for improved outcomes, the Random Forest technique should be utilized after the outliers are removed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A study of complex deep learning networks on high-performance, neuromorphic, and quantum computers

A study of complex deep learning networks on high-performanc...

引用

作者： Potok, Thomas E. Schuman, Catherine Young, Steven Patton, Robert Spedalieri, Federico Liu, Jeremy Yao, Ke-Thia Rose, Garrett Chakma, Gangotree Computational Data Analytics Group Oak Ridge National Laboratory P.O. Box 2008 Oak RidgeTN37831 United States University of Southern California Information Sciences Institute 4676 Admiralty Way Marina del ReyCA90292 United States Department of Electrical Engineering and Computer Science University of Tennessee 1520 Middle Dr KnoxvilleTN37996 United States

Current deep learning approaches have been very successful using convolutional neural networks trained on large graphical-processing-unit-based computers. Three limitations of this approach are that (1) they are based on a simple layered network topology, i.e., highly connected layers, without intra-layer connections;(2) the networks are manually configured to achieve optimal results, and (3) the implementation of the network model is expensive in both cost and power. In this article, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. We use the MNIST dataset for our experiment, due to input size limitations of current quantum computers. Our results show the feasibility of using the three architectures in tandem to address the above deep learning *** show that a quantum computer can find high quality values of intra-layer connection weights in a tractable time as the complexity of the network increases, a high performance computer can find optimal layer-based topologies, and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware. © 2018 ACM.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A General Framework for Clustering and Distribution Matching with Bandit Feedback

arXiv

引用

arXiv 2024年

作者： Yavas, Recep Can Huang, Yuqi Tan, Vincent Y.F. Scarlett, Jonathan Descartes Program CNRS@CREATE 138602 Singapore Department of Information Systems and Analytics School of Computing National University of Singapore 119077 Singapore Department of Mathematics Department of Electrical and Computer Engineering National University of Singapore 119077 Singapore Department of Computer Science Department of Mathematics Institute of Data Science National University of Singapore 119077 Singapore

We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a K-armed bandit model where some subset of K arms is partitioned into M groups. Within each group, the random variable associated to each arm follows the same distribution on a finite alphabet. At each time step, the decision maker pulls an arm and observes its outcome from the random variable associated to that arm. Subsequent arm pulls depend on the history of arm pulls and their outcomes. The decision maker has no knowledge of the distributions of the arms or the underlying partitions. The task is to devise an online algorithm to learn the underlying partition of arms with the least number of arm pulls on average and with an error probability not exceeding a pre-determined value δ. Several existing problems fall under our general framework, including finding M pairs of arms, odd arm identification, and N-ary clustering of K arms belong to our general framework. We derive a non-asymptotic lower bound on the average number of arm pulls for any online algorithm with an error probability not exceeding δ. Furthermore, we develop a computationally-efficient online algorithm based on the Track-and-Stop method and Frank–Wolfe algorithm, and show that the average number of arm pulls of our algorithm asymptotically matches that of the lower bound. Our refined analysis also uncovers a novel bound on the speed at which the average number of arm pulls of our algorithm converges to the fundamental limit as δ *** Codes 68T05 Copyright © 2024, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A volumetric change detection framework using UAV oblique photogrammetry - A case study of ultra-high-resolution monitoring of progressive building collapse

arXiv

引用

arXiv 2021年

作者： Xu, Ningli Huang, Debao Song, Shuang Ling, Xiao Strasbaugh, Chris Yilmaz, Alper Sezen, Halil Qin, Rongjun Geospatial Data Analytics Lab The Ohio State University Columbus United States Photogrammetric Computer Vision Lab The Ohio State University Columbus United States Department of Civil Environmental and Geodetic Engineering The Ohio State University Columbus United States Department of Electrical and Computer Engineering The Ohio State University Columbus United States Translational Data Analytics Institute The Ohio State University Columbus United States Engineering Technology Services The Ohio State University Columbus United States

In this paper, we present a case study that performs an unmanned aerial vehicle (UAV) based fine-scale 3D change detection and monitoring of progressive collapse performance of a building during a demolition event. Multi-temporal oblique photogrammetry images are collected with 3D point clouds generated at different stages of the demolition. The geometric accuracy of the generated point clouds has been evaluated against both airborne and terrestrial LiDAR point clouds, achieving an average distance of 12 cm and 16 cm for roof and façade respectively. We propose a hierarchical volumetric change detection framework that unifies multi-temporal UAV images for pose estimation (free of ground control points), reconstruction, and a coarse-to-fine 3D density change analysis. This work has provided a solution capable of addressing change detection on full 3D time-series datasets where dramatic scene content changes are presented progressively. Our change detection results on the building demolition event have been evaluated against the manually marked ground-truth changes and have achieved an F-1 score varying from 0.78 to 0.92, with consistently high precision (0.92 - 0.99). Volumetric changes through the demolition progress are derived from change detection and have shown to favorably reflect the qualitative and quantitative building demolition progression. Copyright © 2021, The Authors. All rights reserved.

关键词： Photogrammetry

来源：评论

学校读者我要写书评

暂无评论

UDHF2-Net: Uncertainty-diffusion-model-based High-Frequency TransFormer Network for Remotely Sensed Imagery Interpretation

arXiv

引用

arXiv 2024年

作者： Zhang, Pengfei Li, Chang Zhang, Yongjun Qin, Rongjun Key Laboratory for Geographical Process Analysis & Simulation of Hubei Province College of Urban and Environmental Science Central China Normal University Wuhan China School of Remote Sensing and Information Engineering Wuhan University China Department of Civil Environmental and Geodetic Engineering Department of Electrical and Computer Engineering Translational Data Analytics Institute The Ohio State University ColumbusOH United States

Remotely sensed imagery interpretation (RSII), including semantic segmentation and change detection, faces the three major problems: (1) objective representation of spatial distribution patterns with coexistence of spatial stationary and non-stationary;(2) edge uncertainty problem caused by downsampling encoder and intrinsic edge noises (e.g., mixed pixel and edge occlusion etc.);and (3) false detection problem caused by geometric registration error in change detection. To solve the aforementioned problems, uncertainty-diffusion-model-based high-Frequency TransFormer network (UDHF2-Net) is the first to be proposed, whose superiorities are as follows: (1) a spatially-stationary-and-non-stationary high-frequency connection paradigm (SHCP) is proposed to enhance the interaction of spatially frequency-wise stationary and non-stationary features to yield high-fidelity edge extraction result. Inspired by HRFormer, SHCP proposes high-frequency-wise stream to replace high-resolution-wise stream in HRFormer through the whole encoder-decoder process with parallel frequency-wise high-to-low streams, so it improves the edge extraction accuracy by continuously remaining high-frequency information;(2) a mask-and-geo-knowledge-based uncertainty diffusion module (MUDM), which is a self-supervised learning strategy, is proposed to improve the edge accuracy of extraction and change detection by gradually removing the simulated spectrum noises based on geo-knowledge and the generated diffused spectrum noises;(3) a frequency-wise semi-pseudo-Siamese UDHF2-Net is the first to be proposed to balance accuracy and complexity for change detection. Besides the aforementioned spectrum noises in semantic segmentation, MUDM is also a self-supervised learning strategy to effectively reduce the edge false change detection from the generated imagery with geometric registration error. In semantic segmentation experiments, UDHF2-Net achieved the best mIoU values of 92.00%, 87.31% and 55.27% respecti

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

NumHTML: Numeric-Oriented Hierarchical Transformer Model for Multi-task Financial Forecasting

arXiv

引用

arXiv 2022年

作者： Yang, Linyi Li, Jiazheng Dong, Ruihai Zhang, Yue Smyth, Barry Westlake Institute for Advanced Study Westlake University China School of Engineering Westlake University China The Insight Centre for Data Analytics University College Dublin Ireland Department of Computer Science University of Warwick United Kingdom

Financial forecasting has been an important and active area of machine learning research because of the challenges it presents and the potential rewards that even minor improvements in prediction accuracy or forecasting may entail. Traditionally, financial forecasting has heavily relied on quantitative indicators and metrics derived from structured financial statements. Earnings conference call data, including text and audio, is an important source of unstructured data that has been used for various prediction tasks using deep earning and related approaches. However, current deep learning-based methods are limited in the way that they deal with numeric data;numbers are typically treated as plain-text tokens without taking advantage of their underlying numeric structure. This paper describes a numeric-oriented hierarchical transformer model (NumHTML) to predict stock returns, and financial risk using multimodal aligned earnings calls data by taking advantage of the different categories of numbers (monetary, temporal, percentages etc.) and their magnitude. We present the results of a comprehensive evaluation of NumHTML against several state-of-the-art baselines using a real-world publicly available dataset. The results indicate that NumHTML significantly outperforms the current state-of-the-art across a variety of evaluation metrics and that it has the potential to offer significant financial gains in a practical trading context. © 2022, CC BY-NC-ND.

关键词： Investments

来源：评论

学校读者我要写书评

暂无评论

Ranking-based convolutional neural network models for peptide-MHC binding prediction

arXiv

引用

arXiv 2020年

作者： Chen, Ziqi Min, Martin Renqiang Ning, Xia Computer Science and Engineering Department Ohio State University ColumbusOH United States Machine Learning Department NEC Labs America PrincetonNJ United States Biomedical Informatics Department Ohio State University ColumbusOH United States Translational Data Analytics Institute Ohio State University ColumbusOH United States

T-cell receptors can recognize foreign peptides bound to major histocompatibility complex (MHC) class-I proteins, and thus trigger the adaptive immune response. Therefore, identifying peptides that can bind to MHC class-I molecules plays a vital role in the design of peptide vaccines. Many computational methods, for example, the state-of-the-art allele-specific method MHCflurry, have been developed to predict the binding affinities between peptides and MHC molecules. In this manuscript, we develop two allele-specific Convolutional Neural Network (CNN)based methods named ConvM and SpConvM to tackle the binding prediction problem. Specifically, we formulate the problem as to optimize the rankings of peptide-MHC bindings via ranking-based learning objectives. Such optimization is more robust and tolerant to the measurement inaccuracy of binding affinities, and therefore enables more accurate prioritization of binding peptides. In addition, we develop a new position encoding method in ConvM and SpConvM to better identify the most important amino acids for the binding events. We conduct a comprehensive set of experiments using the latest Immune Epitope database (IEDB) datasets. Our experimental results demonstrate that our models significantly outperform the state-of-the-art methods including MHCflurry with an average percentage improvement of 6.70% on AUC and 17.10% on ROC5 across 128 alleles. © 2020, CC BY.

关键词： Peptides

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：