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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Jalan, Akhil Mazumdar, Arya Mukherjee, Soumendu Sundar Sarkar, Purnamrita Department of Computer Science UT Austin United States Halıcıoğlu Data Science Institute Dept of CSE UC San Diego United States Indian Statistical Institute Kolkata India Department of Statistics and Data Sciences UT Austin United States

We study transfer learning for estimation in latent variable network models. In our setting, the conditional edge probability matrices given the latent variables are represented by P for the source and Q for the target. We wish to estimate Q given two kinds of data: (1) edge data from a subgraph induced by an o(1) fraction of the nodes of Q, and (2) edge data from all of P. If the source P has no relation to the target Q, the estimation error must be Ω(1). However, we show that if the latent variables are shared, then vanishing error is possible. We give an efficient algorithm that utilizes the ordering of a suitably defined graph distance. Our algorithm achieves o(1) error and does not assume a parametric form on the source or target networks. Next, for the specific case of Stochastic Block Models we prove a minimax lower bound and show that a simple algorithm achieves this rate. Finally, we empirically demonstrate our algorithm's use on real-world and simulated network estimation problems. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Comparison of Decision Tree and Support Vector Machine for Predicting Jakarta Air Quality Index

Comparison of Decision Tree and Support Vector Machine for P...

引用

2023 International Conference on computer science, Information Technology and Engineering, ICCoSITE 2023

作者： Rafif, Musyaffa Ayman Sanjaya Indrajaya, Gede Al-Ghazi, Muhammad Kent Johnny, Johnny Sagala, Noviyanti T M Bina Nusantara University School of Computer Sciences Data Science Program Jakarta11480 Indonesia Bina Nusantara University School of Computer Science Statistics Department Jakarta11480 Indonesia

ISBN: (纸本)9798350320954

The people in the capital city of the Republic of Indonesia, Jakarta, have been living for years with air pollution. Air quality has been a concern for a long time due to the health risks it has on people, especially those at risk. Using classification algorithms, we would like to implement data mining for the air quality index and make predictions from our capital city, DKI Jakarta. This research aims to compare Decision Tree and Support Vector Machine in predicting Air Quality Index in DKI Jakarta in 2020. The dataset was collected from the Jakarta Open data Web, and the results of this research highlight the effectiveness of data mining techniques in predicting air quality index levels in Jakarta and emphasize the importance of selecting the appropriate classification algorithm for data mining applications. This research shows that SVM, compared to the Decision tree, has a better result with an accuracy score of 87.86%. On the other hand, Decision Tree has a score of 90.56%. © 2023 IEEE.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

MOCBOA:Multi-Objective Chef-Based Optimization Algorithm Using Hybrid Dominance Relations for Solving Engineering Design Problems

引用

computer Modeling in Engineering & sciences 2025年第4期143卷 967-1008页

作者： Nour Elhouda Chalabi Abdelouahab Attia Abdulaziz S.Almazyad Ali Wagdy Mohamed Frank Werner Pradeep Jangir Mohammad Shokouhifar Computer Science Department University of M’silaIchebiliaM’sila28000Algeria Computer ScienceDepartment Mohamed El Bachir El IbrahimiUniversity of Bordj BouArreridjBordj BouArreridj34000Algeria Department of Computer Engineering College of Computer and Information SciencesKing Saud UniversityRiyadh11543Saudi Arabia Operations Research Department Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt Applied Science Research Center Applied Science Private UniversityAmman11931Jordan Faculty of Mathematics Otto-von-Guericke UniversityMagdeburg39016Germany University Centre for Research and Development Chandigarh UniversityMohali140413India Department of Electrical and Computer Engineering Shahid Beheshti UniversityTehran14399Iran DTU AI and Data Science Hub(DAIDASH) Duy Tan UniversityDa Nang550000Vietnam

Multi-objective optimization is critical for problem-solving in engineering,economics,and *** study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Optimization Algorithm(CBOA)that addresses distinct *** approach is unique in systematically examining four dominance relations—Pareto,Epsilon,Cone-epsilon,and Strengthened dominance—to evaluate their influence on sustaining solution variety and driving convergence toward the Pareto *** comparison investigation,which was conducted on fifty test problems from the CEC 2021 benchmark and applied to areas such as chemical engineering,mechanical design,and power systems,reveals that the dominance approach used has a considerable impact on the key optimization measures such as the hypervolume *** paper provides a solid foundation for determining themost effective dominance approach and significant insights for both theoretical research and practical applications in multi-objective optimization.

关键词： Multi-objective optimization chef-based optimization algorithm(CBOA) pareto dominance epsilon dominance cone-epsilon dominance strengthened dominance

来源：评论

学校读者我要写书评

暂无评论

p, q-Spherical fuzzy sets and their aggregation operators with application to third-party logistic provider selection

引用

Journal of Intelligent and Fuzzy Systems 2024年第1期46卷 505-528页

作者： Rahim, Muhammad Amin, Fazli Tag Eldin, ElSayed M. Abd El-Wahed Khalifa, Hamiden Ahmad, Sadique Department of Mathematics and Statistics Hazara University KP Mansehra Pakistan Future University in Egypt New Cairo Egypt Department of Mathematics College of Science and Arts Qassim University Al-Badaya Saudi Arabia Department of Operations and Management Research Faculty of Graduate Studies for Statistical Research Cairo University Giza Egypt EIAS: Data Science and Blockchain Laboratory College of Computer and Information Sciences Prince Sultan University Riyadh Saudi Arabia

The selection of an appropriate third-party logistics (3PL) provider has become an inescapable option for shippers in today's business landscape, as the outsourcing of logistics activities continues to increase. Choosing the 3PL supplier that best meets their requirements is one of the most difficult difficulties that logistics consumers face. Effective decision-making (DM) is critical in dealing with such scenarios, allowing shippers to make well-informed decisions within a restricted timeframe. The importance of DM arises from the possible financial repercussions of poor decisions, which can result in significant financial losses. In this regard, we introduce p, q-spherical fuzzy set (p, q-SFS), a novel concept that extends the concept of T-spherical fuzzy sets (T-SFSs). p, q-SFS is a comprehensive representation tool for capturing imprecise information. The main contribution of this article is to define the basic operations and a series of averaging and geometric AOs under p, q-spherical fuzzy (p, q-SF) environment. In addition, we establish several fundamental properties of the proposed aggregation operators (AOs). Based on these AOs, we propose a stepwise algorithm for multi-criteria DM (MCDM) problems. Finally, a real-life case study involving the selection of a 3PL provider is shown to validate the applicability of the proposed approach. © 2024 - IOS Press. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Dynamic channel estimation-aware routing protocol in mobile cognitive radio networks for smart IIoT applications

引用

Digital Communications and Networks 2023年第2期9卷 367-382页

作者： Qusay M.Salih Md Arafatur Rahman A.Taufiq Asyhari Muhammad Kamran Naeem Mohammad Patwary Ryan Alturki Mohammed Abdulaziz Ikram Faculty of Computing Universiti Malaysia Pahang26300GambangPahangMalaysia School of Engineering Computing and Mathematical SciencesUniversity of WolverhamptonUK Data Science Program Monash UniversityIndonesiaand Birmingham City UniversityB47XGUK Department of Information Science College of Computer and Information SystemsUmm Al-Qura UniversitySaudi Arabia Computer Science Department Al Jumoum University CollegeUmm Al-Qura UniversitySaudi Arabia

Cognitive Radio Networks(CRNs)have become a successful platform in recent years for a diverse range of future systems,in particularly,industrial internet of things(IIoT)*** order to provide an efficient connection among IIoT devices,CRNs enhance spectrum utilization by using licensed ***,the routing protocol in these networks is considered one of the main problems due to node mobility and time-variant channel ***,the channel selection for routing protocol is indispensable in CRNs to provide an adequate adaptation to the Primary User(PU)activity and create a robust routing *** study aims to construct a robust routing path by minimizing PU interference and routing delay to maximize throughput within the IIoT ***,a generic routing framework from a cross-layer perspective is investigated that intends to share the information resources by exploiting a recently proposed method,namely,Channel Availability ***,a novel cross-layer-oriented routing protocol is proposed by using a time-variant channel estimation *** protocol combines lower layer(Physical layer and data Link layer)sensing that is derived from the channel estimation ***,it periodically updates and stores the routing table for optimal route ***,in order to achieve higher throughput and lower delay,a new routing metric is *** evaluate the performance of the proposed protocol,network simulations have been conducted and also compared to the widely used routing protocols,as a *** simulation results of different routing scenarios demonstrate that our proposed solution outperforms the existing protocols in terms of the standard network performance metrics involving packet delivery ratio(with an improved margin of around 5–20%approximately)under varying numbers of PUs and cognitive users in Mobile Cognitive Radio Networks(MCRNs).Moreover,the cross-layer routing protocol successfully achiev

关键词： Channel selection Cross-layer design Mobile cognitive radio networks Routing protocol IIoT applications

来源：评论

学校读者我要写书评

暂无评论

Approximate solutions to fractional differential equations

引用

Applied Mathematics and Mechanics(English Edition) 2023年第10期44卷 1791-1802页

作者： Yue LIU Zhen ZHAO Yanni ZHANG Jing PANG College of Sciences Inner Mongolia University of TechnologyHohhot 010051China Department of Mathematics and Computer Science Hetao CollegeBayannur 015000Inner Mongolia Autonomous RegionChina Inner Mongolia Key Laboratory of Statistical Analysis Theory for Life Data and Neural Network Modeling Hohhot 010051China College of Mathematics and Statistics Ningbo UniversityNingbo 315211Zhejiang ProvinceChina College of Science Liaoning University of TechnologyJinzhou 121001Liaoning ProvinceChina

In this paper, the time-fractional coupled viscous Burgers' equation(CVBE)and Drinfeld-Sokolov-Wilson equation(DSWE) are solved by the Sawi transform coupled homotopy perturbation method(HPM). The approximate series solutions to these two equations are obtained. Meanwhile, the absolute error between the approximate solution given in this paper and the exact solution given in the literature is analyzed. By comparison of the graphs of the function when the fractional order α takes different values, the properties of the equations are given as a conclusion.

关键词： Caputo fractional derivative coupled viscous Burgers'equation(CVBE) Drinfeld-Sokolov-Wilson equation(DSWE) Sawi transform homotopy perturbation method(HPM)

来源：评论

学校读者我要写书评

暂无评论

NLP-IISERB@Simpletext2022: To Explore the Performance of BM25 and Transformer Based Frameworks for Automatic Simplification of Scientific Texts

NLP-IISERB@Simpletext2022: To Explore the Performance of BM2...

引用

2022 Conference and Labs of the Evaluation Forum, CLEF 2022

作者： Saha, Sourav Roy, Dwaipayan Goud, B. Yuvaraj Reddy, Chethan S. Basu, Tanmay Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India Department of Computational and Data Sciences Indian Institute of Science Education and Research Kolkata India Department of Data Science and Engineering Indian Institute of Science Education and Research Bhopal India

CLEF SimpleText 2022 lab focuses on developing effective systems to identify relevant passages from a given set of scientific articles. The lab has organized three tasks this year. Task 1 is focused on passage retrieval from the given data for a query text. These passages can be complex and hence require further simplification to be carried out in tasks 2 and 3. The BioNLP research group at the Indian Institute of science Education and Research Bhopal (IISERB) in collaboration with two different information retrieval research groups at IISER Kolkata and ISI Kolkata participated only in Task 1 of this challenge and submitted three runs using three different retrieval models. The paper explores the performance of these retrieval models for the given task. We used a standard BM25 model as our first run to identify 1000 relevant passages for each query. Moreover, the passages for each query were ranked based on their similarity scores generated by the BM25 model. For our second run, we used a BERT (Bidirectional Encoder Representations from Transformers) based re-ranking method, called as Mono-BERT to further rank the 1000 passages retrieved by our first run for each query. A pre-trained sequence to sequence model based re-ranking method, called MonoT5 was used as our third run to reorder the 1000 passages retrieved by the Mono-BERT model for each query. As the official results of this task are not yet announced, we cannot explore the performance of our submissions. However, we have manually checked the retrieved results of many queries for each run, which indicate that the performance improved from run 1 to run 2 and further to run 3. © 2022 Copyright for this paper by its authors.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Machine Learning Models for Customer Churn Prediction in the U.S. Banking and Financial Services: Economic Impact and Industry-Specific Insights

引用

Journal of data Analysis and Information Processing 2024年第3期12卷 388-418页

作者： Omoshola S. Owolabi Prince C. Uche Nathaniel T. Adeniken Oghenekome Efijemue Samuel Attakorah Oluwabukola G. Emi-Johnson Emmanuel Hinneh Department of Data Science Carolina University Winston-Salem NC USA Department of Computer Science Austin Peay State University Clarkesville TN USA Department of Statistical Sciences Wake Forest University Winston-Salem NC USA

Customer churn poses a significant challenge for the banking and finance industry in the United States, directly affecting profitability and market share. This study conducts a comprehensive comparative analysis of machine learning models for customer churn prediction, focusing on the U.S. context. The research evaluates the performance of logistic regression, random forest, and neural networks using industry-specific datasets, considering the economic impact and practical implications of the findings. The exploratory data analysis reveals unique patterns and trends in the U.S. banking and finance industry, such as the age distribution of customers and the prevalence of dormant accounts. The study incorporates macroeconomic factors to capture the potential influence of external conditions on customer churn behavior. The findings highlight the importance of leveraging advanced machine learning techniques and comprehensive customer data to develop effective churn prevention strategies in the U.S. context. By accurately predicting customer churn, financial institutions can proactively identify at-risk customers, implement targeted retention strategies, and optimize resource allocation. The study discusses the limitations and potential future improvements, serving as a roadmap for researchers and practitioners to further advance the field of customer churn prediction in the evolving landscape of the U.S. banking and finance industry.

关键词： Churn Prediction Machine Learning Economic Impact Industry-Specific Insights Logistic Regression Random Forest Neural Networks

来源：评论

学校读者我要写书评

暂无评论

Transfer learning for latent variable network models 24

Transfer learning for latent variable network models

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Akhil Jalan Arya Mazumdar Soumendu Sundar Mukherjee Purnamrita Sarkar Department of Computer Science UT Austin Halicioglu Data Science Institute & Dept of CSE UC San Diego Statistics and Mathematics Unit (SMU) Indian Statistical Institute Kolkata Department of Statistics and Data Sciences UT Austin

ISBN: (纸本)9798331314385

We study transfer learning for estimation in latent variable network models. In our setting, the conditional edge probability matrices given the latent variables are represented by P for the source and Q for the target. We wish to estimate Q given two kinds of data: (1) edge data from a subgraph induced by an o(1) fraction of the nodes of Q, and (2) edge data from all of P. If the source P has no relation to the target Q, the estimation error must be Ω(1). However, we show that if the latent variables are shared, then vanishing error is possible. We give an efficient algorithm that utilizes the ordering of a suitably defined graph distance. Our algorithm achieves o(1) error and does not assume a parametric form on the source or target networks. Next, for the specific case of Stochastic Block Models we prove a minimax lower bound and show that a simple algorithm achieves this rate. Finally, we empirically demonstrate our algorithm's use on real-world and simulated network estimation problems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Uniform Consistency of Generalized Fréchet Means

arXiv

引用

arXiv 2024年

作者： Aveni, Andrea Mukherjee, Sayan Department of Statistical Science Duke University United States Center for Scalable Data Analytics and Artificial Intelligence Department of Computer Science Universität Liepzig Germany Max Planck Institute for Mathematics in the Natural Sciences Duke University Departments of Statistical Science Mathematics Computer Science and Biostatistics & Bioinformatics United States

We study a generalization of the Fréchet mean on metric spaces, which we call φ-means. Our generalization is indexed by a convex function φ. We find necessary and sufficient conditions for φ-means to be finite and provide a tight bound for the diameter of the intrinsic mean set. We also provide sufficient conditions under which all the φ-means coincide in a single point. Then, we prove the consistency of the sample φ-mean to its population analogue. We also find conditions under which classes of φ-means converge uniformly, providing a Glivenko-Cantelli result. Finally, we illustrate applications of our results and provide algorithms for the computation of φ-*** Codes 0F05, 60F15, 60D05, 62E20, 62F10, 58K05 © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：