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

Exploring ensemble optimized voting and stacking classifiers through Cross-validation for early detection of suicidal ideation

引用

Journal of Intelligent and Fuzzy Systems 2024年第5-6期47卷 335-349页

作者： Shukla, Shiv Shankar Prasad Singh, Maheshwari Prasad Department of Computer Science Engineering National Institute of Technology Patna Bihar Patna India

Detecting behavioral changes associated with suicidal ideation on social media is essential yet complex. While machine learning and deep learning hold promise in this regard, current studies often lack generalizability due to single dataset reliance. Traditional embedding techniques struggle with semantic analysis,leading to challenges in achieving high accuracy models and conventional validation methods have data drift limitations. To address these challenges, this study proposes a novel evaluation approach using natural language processing across diverse platforms like Twitter and Reddit. By integrating BERT embedding, adept at handling semantic nuances, with an optimized Stacked Classifier combining different base classifiers and XGBoost as the meta-classifier, the model excels in swiftly detecting signs of suicidal ideation compared to the Voting Classifier, i.e., the combination of Decision Tree, Random Forest, Gradient Boost and XGBoost and several machine learning models. Additionally, the study explores advanced embedding techniques like MUSE and LLM, and deep learning models including Bi-LSTM, Bi-GRU, and Text-CNN for *** ensemble approach aims to create a model that is not only interpretable but also robust, reducing computational complexity and enhancing resilience against noisy data - common challenges faced in text classification tasks. Through K-fold validation, which involves partitioning the dataset into k equal-sized subsets or "folds"and training the model k times, using k-1 folds for training and one-fold for testing each time, the proposed model achieves impressive accuracy rates of 97% on Reddit and 96% on Twitter datasets, underscoring its effectiveness in identifying suicidal ideation across social media platforms. © 2024 - IOS Press. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Predictive Model of the Stock Market Using the LSTM Algorithm with a Combination of Exponential Moving Average (EMA) and Relative Strength Index (RSI) Indicators

引用

Journal of The Institution of Engineers (India): Series B 2024年第5期105卷 1145-1157页

作者： Dhokane, Rahul Maruti Agarwal, Sohit Computer Science and Engineering Department Suresh Gyan Vihar University Rajasthan Jaipur India

This research paper has focused on the integration of promising stock market indicators such as the relative strength index (RSI) and different versions of the exponential moving average (EMA) (i.e., 50-day, 100-day, and 150-day EMA) with the long short-term memory (LSTM) machine learning algorithm for stock price prediction. LSTM is the most robust version of recurrent neural network because it can handle the "vanishing gradient" problem effectively and handle lengthy time series data. The selected dataset was taken from NSE India using Yahoo Finance. In our proposed research, we used RSI and EMA data along with basic features such as open, high, low, close, and volume (OHLCV) information. The selected technical indicators and OHLCV data act as input features for the LSTM model. The results show that the integration of technical indicators along with traditional OHLCV improves the performance of the stock closing price prediction model. The evaluation metrics used in this research are the RMSE, MAPE, and R2 score. The improvements in the R2 score and decreases in the RMSE and MAPE indicate that the proposed technique performs well in stock closing price prediction. The proposed technique helps to improve intraday trading by predicting the closing price of the stock for the next day and the trends of selected stocks in the near term. © The Institution of Engineers (India) 2024.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

HeRo: Heuristic-Based Routing in Payment Channel Networks

IEEE Networking Letters

引用

IEEE Networking Letters 2025年第1期7卷 56-60页

作者： Mishra, Shruti Aggarwal, Virat Pal, Sujata Agarwal, Vidushi Indian Institute of Technology Ropar Department of Computer Science and Engineering Rupnagar140001 India

Payment channels support off-chain transactions by enhancing transaction speed and reducing fees in the main blockchain. However, the costs and complexity of the network increase as we increase the size of the network. To address these challenges, we propose Heuristic-Based Routing with Scheduling (HeRo) combining heuristic-based routing and scheduling techniques in Payment Channel Networks (PCNs). HeRo achieves a cost reduction of 32.71% and 73.08% compared with multi-charge PCN (MPCN-RP) and Dijkstra algorithms, respectively. © 2019 IEEE.

关键词： Network routing

来源：评论

学校读者我要写书评

暂无评论

Diabetic retinopathy detection by fundus images using fine tuned deep learning model

引用

Multimedia Tools and Applications 2024年第39期83卷 86657-86679页

作者： Singh, Satya Prakash Gupta, Pankaj Dung, Rakshita Department of Computer Science & amp Engineering Birla Institute of Technology Ranchi Mesra India

This study employs transfer learning using a fine-tuned pretrained EfficientNetB0 convolutional neural network (CNN) model to accurately detect the various stages of Diabetic Retinopathy. The training process involved utilizing three datasets: Messidor, IDRiD (Indian Diabetic Retinopathy Detection), and APTOS 2019 Blindness Detection, which collectively encompassed 5,379 fundus images. Different types of processed fundus images were fed into the model to determine the optimal pre-processing approach for stage detection in Diabetic Retinopathy. The model was assessed on the original dataset with some augmentation techniques applied. According to the training data, the model achieved a maximum accuracy of 72%. However, converting the dataset to grayscale yielded an improved accuracy of 80%. Similarly, extracting the green, red, and blue channels individually resulted in accuracies of 72%, 76%, and 73% respectively. Notably, when the green channel extracted images underwent histogram equalization, the model achieved its highest accuracy of 83%. Furthermore, the application of a Sobel filter to the red channel images led to a maximum accuracy of 51%. Finally, to determine the effectiveness of each processed image type, sensitivity and specificity measures were compared. Among all the variations, the green channel extracted images with histogram equalization demonstrated superior performance in correctly identifying the respective classes, outperforming the other approaches. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

Enhancing E-Commerce Text Classification: A GRU-Based Approach for Improved Product Understanding 5th

Enhancing E-Commerce Text Classification: A GRU-Based Approa...

引用

5th International Conference on Electrical and Electronics engineering, ICEEE 2024

作者： Nazmul Abdal, Md. Shaown, Shahanaz Islam Islam, Khairum Aman, Rutba Department of Computer Science and Engineering University of Liberal Arts Bangladesh Dhaka Bangladesh Department of Computer Science and Engineering Uttara University Dhaka Bangladesh Department of Computer Science and Engineering University of Dhaka Dhaka Bangladesh

ISBN: (纸本)9789819791118

In the burgeoning landscape of e-commerce, the ability to accurately classify product texts is paramount for enhancing user experience and driving business success. Traditional approaches to text classification often struggle with the nuances and complexities inherent in e-commerce product descriptions. In this paper, we propose a novel approach utilizing Gated Recurrent Unit (GRU) to address these challenges and improve product understanding in e-commerce text classification tasks. Our model leverages the inherent sequential nature of product descriptions, effectively capturing long-range dependencies and semantic relationships within the text. We use a standard dataset in extended trials to demonstrate the superiority of our GRU-based approach over conventional methods in terms of classification accuracy and robustness across diverse product categories. Furthermore, we conduct comprehensive analyses to gain insights into the inner workings of our model and its ability to learn meaningful representations of e-commerce text data. The performance of the model is compared using several cutting-edge techniques, including Support Vector Machine (SVM), Random Forest (RF), and Long Short-Term Memory (LSTM) in order to show that our model is superior at correctly classifying e-commerce texts. The experimental findings show that the suggested model performs competitively in classifying e-commerce texts, surpassing other approaches with an accuracy of 98.35%. Our findings underscore the potential of GRU-based approaches for advancing the state-of-the-art in e-commerce text classification, offering promising avenues for future research and practical applications in the domain. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Marketplaces

来源：评论

学校读者我要写书评

暂无评论

Evolutionary recurrent neural network based on equilibrium optimization method for cloud-edge resource management in internet of things

引用

Neural Computing and Applications 2025年第6期37卷 4957-4969页

作者： Ebrahimi Mood, Sepehr Rouhbakhsh, Adel Souri, Alireza Department of Computer Science Yazd University Yazd Iran Department of Computer Engineering Faculty of Engineering Haliç University Istanbul34060 Turkey School of Electrical and Electronic Engineering Shandong University of Technology Zibo255000 China

Cloud computing is an emerging field in information technology, enabling users to access a shared pool of computing resources. Despite its potential, cloud technology presents various challenges, with one of the most significant being resource management within the cloud environment. Specifically, the allocation of physical machines (PMs) to virtual machines (VMs) in the Infrastructure as a service (IaaS) layer aims to achieve optimal efficiency. To address this challenge, we propose an evolutionary recurrent neural network (RNN) for resource allocation, enhanced by the equilibrium optimization (EO) algorithm. This method improves the generalization performance and reduces the architecture complexity of RNNs, while ensuring better adaptability to various demand patterns in cloud environments. Additionally, the effectiveness of RNNs heavily relies on the quality of training data;hence, we generate appropriate training data to facilitate the development of an efficient resource management model. Through extensive simulations, our method demonstrates superior performance compared to traditional algorithms. However, it is worth noting that this study is primarily based on simulation results, highlighting the need for real-world validation to confirm its practical applicability. The proposed method's applicability to different cloud computing environments and scenarios, including various service models (IaaS, PaaS, and SaaS) and deployment models (public, private, and hybrid), is also briefly discussed. Future studies should explore the computational efficiency and potential optimization techniques of the EO-RNN approach and consider real-world implementations to validate its effectiveness and uncover practical challenges. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence-Driven Approach for Predicting Maternal Health Risk Factors 9

Artificial Intelligence-Driven Approach for Predicting Mater...

引用

9th South-East Europe Design Automation, computer engineering, computer Networks and Social Media Conference, SEEDA-CECNSM 2024

作者： Hosaain, Mohammad Mobarak Kashem, Mohammod Abdul Nayan, Nasim Mahmud Department of Computer Science and Engineering Gazipur1707 Bangladesh Department of Computer Science and Engineering Dhaka1212 Bangladesh

ISBN: (纸本)9798350342482

The development of machine learning has the potential to significantly improve the identification and treatment of pregnancy-related risks in maternal health. This work uses an extensive dataset to create reliable models that can predict possible health issues with accuracy and reliability. Our models are highly predictive and have transparency and interpretability in their results because of our creative feature engineering, such as featurewiz and chi-square test, and meticulous data processing. The models underwent extensive validation procedures, and in three different categories, each proved better evaluation metrics results alongside accuracy levels above 99% in each class. Ensuring the durability and stability of the models, this remarkable degree of accuracy is further enhanced by ensemble techniques and hyperparameter tuning. Incorporating Explainable AI (XAI) methods, such as LIME and SHAP, has proven crucial in elucidating the models' decision-making process, fostering trust, and enabling their possible use in healthcare environments. The results highlight the potential of ML in predicting maternal health risks and establishing solid foundations for future integration with Medical Cyber-Physical Systems (MCPS), which has the potential to transform the field of predictive analytics in prenatal care completely. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Minimum spanning tree cycle intersection problem on outerplanar graphs

引用

Discrete Applied Mathematics 2024年 343卷 328-339页

作者： Su, Tai-Yu Department of Computer Science and Information Engineering National Taiwan University Taipei10617 Taiwan

We study the minimum spanning tree cycle intersection (MSTCI) problem on outerplanar graphs in this paper. Consider a connected simple graph G=(V,E) and any spanning tree T=(V,ET) of G, it is well-known that each non-tree edge e∈E∖ET induces a fundamental cycle in T∪{e}. We say that two distinct fundamental cycles intersect if they share at least one edge. The MSTCI problem seeks a spanning tree such that the number of pairwise cycle intersections is minimized. We provide a linear-time algorithm to solve the problem on outerplanar graphs by exploiting the cycle-cut duality on plane graphs. Besides, we show that the minimum cycle intersection number is bounded by O(n) for outerplanar graphs with n vertices. © 2023 Elsevier B.V.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

SMART AGRICULTURE: INTEGRATING AIR QUALITY MONITORING WITH DEEP LEARNING FOR PROCESS OPTIMIZATION*

引用

Scalable Computing 2025年第3期26卷 1005-1016页

作者： Shobana, J. Subramanian, A Venkata Balamurugan, P. Perumal, Sivakumar Sankari, V. Eldho, K.J. Nareshkumar, R. Department of Data Science and Business Systems School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamilnadu Kattankulathur India Department of Computer Science and Engineering GITAM University Bengaluru India Department of Computer Science and Engineering J N N Institute of Enginering India Saveetha university Chennai India Department of Computer Science and Engineering Sasi Institute of Technology and Engineering Andhra Pradesh Tadepalligudem India Department of Artificial Intelligence and Data Science K.Ramakrishnan College of Engineering Kariyamanickam Rd Tamil Nadu Samayapuram India PG and Research Department of Computer Science Mary Matha Arts and Science College Kerala Mananthavady India Department of Networking and Communications School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamilnadu Kattankulathur India

Modernization and intense industrialization have led to a substantial improvement in people’s quality of life. However, the aspiration for achieving an improved quality of life results in environmental contamination. A primary consequence of environmental degradation is air pollution, resulting from rising levels of poisonous chemicals in the atmosphere, which may induce detrimental health conditions in humans. It is harmful to both humans and agriculture. Given that the effects of air pollution on plants may not be readily apparent, it is important to analyse the necessary data and compute the outcomes. Farmers prioritise on pests and plant diseases, frequently neglecting the detrimental impacts of air pollution. Some plant species can withstand high amounts of pollution from suspended particulate matter and accumulated gases, while others are more susceptible to harm. Therefore, plants’ reaction to air pollution is influenced by the kind of harmful compounds, their levels, and the plant’s susceptibility to them. The LSTM +CNN Proposed Ensemble method may be used to analyse the impact of air pollution on agriculture by examining trends in crop production over time and predicting which crop is more resistant based on the pollution data. The initiative created for this aim may assist farmers in determining the most suitable crop to cultivate in their fields to minimize the impact of air pollution on agricultural yield. The findings show deep learning algorithms correctly predict hourly pollutant concentrations such as carbon monoxide, sulphur dioxide, nitrogen dioxide, ground-level ozone, and particulate matter 2.5, along with the hourly Air Quality Index (AQI) for California. A proposed model used test RMSE values as a measure to evaluate prediction performance, achieving the best possible results. © 2025 SCPE.

关键词： Nitrogen oxides

来源：评论

学校读者我要写书评

暂无评论

Approximate Constrained Discounted Dynamic Programming with Uniform Feasibility and Optimality

引用

IEEE Transactions on Automatic Control 2024年第6期70卷 4031-4036页

作者： Chang, Hyeong Soo Sogang University Department of Computer Science and Engineering Seoul121-742 Korea Republic of

An important question about finite constrained Markov decision process (CMDP) problem is if there exists a condition under which a uniformly-optimal and uniformly-feasible policy exists in the set of deterministic, history-independent, and stationary policies that achieves the optimal value at all initial states and if the CMDP problem with the condition can be solved by dynamic programming (DP). This is because the crux of the unconstrained MDP theory developed by Bellman lies in the answer to the same existence question of such an optimal policy to MDP. Even if the topic of CMDP has been studied over the years, there has not been any relevant responsive work since the open question was raised about three decades ago in the literature. We establish (as some answer to this question) that any finite CMDP problem Mc "contains"inherently a DP-structure in its "subordinate"CMDP problem Mc induced from the parameters of Mc and Mc is DP-solvable. We drive a policy-iteration-type algorithm for solving Mc providing an approximate solution to Mc or Mc with a fixed initial-state. © 1963-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：