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

bagging algorithm Based on Possibilistic Data Interpolation for Brain-Computer Interface

JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS 2024年第3期28卷 623-633页

作者： Hayashi, Isao Irie, Honoka Tsuruse, Shinji Kansai Univ Grad Sch Informat 2-1-1 Ryozenji Cho Takatsuki Osaka 5691095 Japan Univ Hyogo Sch Social Informat Sci 8-2-1 Gakuennishi MachiNishi Ku Kobe Hyogo 6512197 Japan Panason Connect Co Ltd 8-21-1 Ginza Chuo Ku Tokyo 1040061 Japan

Recently, brain -computer interfaces (BCIs) and brainmachine interfaces have garnered the attention of researchers. Based on connections with external devices, external computers and machines can be controlled by brain signals measured via near -infrared spectroscopy (NIRS) or electroencephalograph devices. Herein, we propose a novel bagging algorithm that generates interpolation data around misclassified data using a possibilistic function, to be applied to BCIs. In contrast to AdaBoost, which is a conventional ensemble learning method that increases the weight of misclassified data to incorporate them with high probability to the next datasets, we generate interpolation data using a membership function centered on misclassified data and incorporate them into the next datasets simultaneously. The interpolated data are known as virtual data herein. By adding the virtual data to the training data, the volume of the training data becomes sufficient for adjusting the discriminate boundary more accurately. Because the membership function is defined as a possibility distribution, this method is named the bagging algorithm based on the possibility distribution. Herein, we formulate a bagging -type ensemble learning based on the possibility distribution and discuss the usefulness of the proposed method for solving simple calculations using NIRS data.

关键词： brain-computer interface bagging algorithm possibilistic theory clustering interpolation data

来源：评论

学校读者我要写书评

暂无评论

ARB: Knowledge Discovery and Disease Diagnosis on Thyroid Disease Diagnosis integrating Association Rule with bagging algorithm

引用

ENGINEERING LETTERS 2020年第2期28卷 390-399页

作者： Li, Dongyang Yang, Dan Zhang, Jing Univ Sci & Technol Liaoning Sch Comp Sci & Software Engn Anshan Peoples R China

Mastering disease influence factors promises to advance clinical research and provides a possible decision making. In this paper, we propose a framework ARB, which is integrating association rule mining algorithm with bagging algorithm. ARB consists of two main modules 1) knowledge discovery and 2) disease diagnosis. Firstly association rule mining algorithm is used to investigate the sick and healthy factors which contribute to disease for males and females. This also aims to select the most robust and effective features to reduce the dimensions. And then we use ensemble algorithm to diagnose disease based on the data filtered by the first module. The framework ARB applies three real thyroid datasets in UCI machine learning repository. Though the association rules generated by Apriori algorithm, we know thyroid disease have different effects on people of different age intervals, and the elderly from 60 to 80 are the most likely to suffer from thyroid disease. The results also show that the two age intervals (30, 40] and (50, 60] are the age intervals with the highest recurrence rate of thyroid disease. And for gender factor, men have more chances of being free from thyroid disease than women. For women in their twenties, they have less risk. After that, we use thyroid disease knowledge from these rules as the input of model for diagnosing thyroid disease. The experimental results significantly show that the performance of ARB outperforms others, which also shows the feasibility and practical value of the framework ARB in thyroid aided diagnosis.

关键词： Thyroid disease Association rule mining Apriori algorithm bagging algorithm

来源：评论

学校读者我要写书评

暂无评论

Micro-Blog Sentiment Classification Method Based on the Personality and bagging algorithm

引用

FUTURE INTERNET 2020年第4期12卷 75页

作者： Yang, Wenzhong Yuan, Tingting Wang, Liejun Xinjiang Univ Coll Informat Sci & Engn Urumqi 830046 Xinjiang Peoples R China

Integrated learning can be used to combine weak classifiers in order to improve the effect of emotional classification. Existing methods of emotional classification on micro-blogs seldom consider utilizing integrated learning. Personality can significantly influence user expressions but is seldom accounted for in emotional classification. In this study, a micro-blog emotion classification method is proposed based on a personality and bagging algorithm (PBAL). Introduce text personality analysis and use rule-based personality classification methods to divide five personality types. The micro-blog text is first classified using five personality basic emotion classifiers and a general emotion classifier. A long short-term memory language model is then used to train an emotion classifier for each set, which are then integrated together. Experimental results show that compared with traditional sentiment classifiers, PBAL has higher accuracy and recall. The F value has increased by 9%.

关键词： sentiment classification personality bagging algorithm long-term and short-term memory network integration

来源：评论

学校读者我要写书评

暂无评论

A bagging Ensemble algorithm for Seasonal Time Series Forecasting

引用

SN Computer Science 2024年第3期5卷 322页

作者： Kumar, Bhupendra Yadav, Neha Sunil Department of Mathematics and Scientific Computing National Institute of Technology Himachal Pradesh Hamirpur 177005 India Department of Mathematics & amp

Time series forecasting is valuable in making informed decisions, improving financial planning, optimizing resource allocation, increasing operational efficiency, and managing risks. But accurate forecasting is difficult, as the amount of out-of-date data makes it difficult to spot trends. In this paper, a novel method is proposed to remove this low-semantic absolute data from time series. It consists of two parts. The first is bootstrapping, which is similar to the random forest method in that it removes old data to create new and recent samples, which are used to forecast with models such as automated auto-regressive integrated moving averages (Auto-ARIMA), simple exponential smoothing (SES), and Holt–Winters (HWs). The efficacy of the proposed technique has been evaluated using six time series datasets of temperature, relative humidity, and precipitation. The results of all models with and without the suggested approach show that adding the proposed approach to the statistical model significantly increases the prediction accuracy. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd 2024.

关键词： Auto-ARIMA bagging algorithm Holt–Winters models Simple exponential smoothing Time series forecasting

来源：评论

学校读者我要写书评

暂无评论

A novel bagging C4.5 algorithm based on wrapper feature selection for supporting wise clinical decision making

引用

JOURNAL OF BIOMEDICAL INFORMATICS 2018年 78卷 144-155页

作者： Lee, Shin-Jye Xu, Zhaozhao Li, Tong Yang, Yun Yunnan Univ Natl Pilot Sch Software 2 Cuihu North Rd Kunming 650091 Yunnan Peoples R China Univ Cambridge Queens Coll Cambridge CB3 9ET England

From the perspective of clinical decision-making in a Medical IoT-based healthcare system, achieving effective and efficient analysis of long-term health data for supporting wise clinical decision-making is an extremely important objective, but determining how to effectively deal with the multi-dimensionality and high volume of generated data obtained from Medical IoT-based healthcare systems is an issue of increasing importance in IoT healthcare data exploration and management. A novel classifier or predicator equipped with a good feature selection function contributes effectively to classification and prediction performance. This paper proposes a novel bagging C4.5 algorithm based on wrapper feature selection, for the purpose of supporting wise clinical decision-making in the medical and healthcare fields. In particular, the new proposed sampling method, S-C4.5 SMOTE, is not only able to overcome the problem of data distortion, but also improves overall system performance because its mechanism aims at effectively reducing the data size without distortion, by keeping datasets balanced and technically smooth. This achievement directly supports the Wrapper method of effective feature selection without the need to consider the problem of huge amounts of data;this is a novel innovation in this work.

关键词： Ensemble learning Sampling method bagging algorithm C4.5 decision tree Wrapper feature selection

来源：评论

学校读者我要写书评

暂无评论

A novel student achievement prediction model based on bagging-CART machine learning algorithm

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2024年第18期36卷 e8151-e8151页

作者： Zhang, Hong Fujian Normal Univ Sch Law Fuzhou Fujian Peoples R China Fujian Normal Univ Qishan Campus18 Wulongjiangzhong Ave Fuzhou Fujian Peoples R China

The learning effect of students is crucial for assessing teaching quality, thus playing a significant role in teaching management. Predicting student achievement is a major challenge in understanding the learning effect of students. Currently, many studies have utilized machine learning methods such as the decision tree algorithms C4.5, ID3, CART, J48, random forest, and others. However, few studies have explored the use of the bagging algorithm in this field. Therefore, this study proposes a classification prediction method for student achievement based on the bagging-CART algorithm. Initially, the student achievement data is preprocessed, and the Apriori method is applied to mine the strongly associated dataset. The optimal hyper-parameters are determined through grid search to train and predict the bagging-CART algorithm. Furthermore, the CART, J48, and bagging-CART algorithms are trained, and their evaluation indicators are compared using a confusion matrix. The results indicate that the bagging-CART model achieves an accuracy of 98.16%, a recall rate of 91.80%, a precision of 90.83%, and an F1 score of 94.87%. In comparison, the accuracy, precision, and F1 scores are higher than those obtained with CART and J48. Although the recall rate is slightly lower than that of CART by 0.26%, it is 0.52% higher than that of J48. Consequently, this method demonstrates strong predictive capabilities and introduces a new reference method for evaluating students' learning effect.

关键词： association rules bagging algorithm CART algorithm prediction student achievement analysis

来源：评论

学校读者我要写书评

暂无评论

A risk prediction model of gene signatures in ovarian cancer through bagging of GA-XGBoost models

引用

JOURNAL OF ADVANCED RESEARCH 2021年 30卷 113-122页

作者： Hsiao, Yi-Wen Tao, Chun-Liang Chuang, Eric Y. Lu, Tzu-Pin Natl Taiwan Univ Coll Publ Hlth Dept Publ Hlth Inst Epidemiol & Prevent Med Taipei Taiwan Natl Taiwan Univ Ctr Genom & Precis Med Bioinformat & Biostat Core Taipei Taiwan Natl Taiwan Univ Dept Elect Engn Grad Inst Biomed Elect & Bioinformat Taipei Taiwan

Introduction: Ovarian cancer (OC) is one of the most frequent gynecologic cancers among women, and high-accuracy risk prediction techniques are essential to effectively select the best intervention strategies and clinical management for OC patients at different risk levels. Current risk prediction models used in OC have low sensitivity, and few of them are able to identify OC patients at high risk of mortality, which would both optimize the treatment of high-risk patients and prevent unnecessary medical intervention in those at low risk. Objectives: To this end, we have developed a bagging-based algorithm with GA-XGBoost models that predicts the risk of death from OC using gene expression profiles. Methods: Four gene expression datasets from public sources were used as training (n = 1) or validation (n = 3) sets. The performance of our proposed algorithm was compared with fine-tuning and other existing methods. Moreover, the biological function of selected genetic features was further interpreted, and the response to a panel of approved drugs was predicted for different risk levels. Results: The proposed algorithm showed good sensitivity (74-100%) in the validation sets, compared with two simple models whose sensitivity only reached 47% and 60%. The prognostic gene signature used in this study was highly connected to AKT, a key component of the PI3K/AKT/mTOR signaling pathway, which influences the tumorigenesis, proliferation, and progression of OC. Conclusion: These findings demonstrated an improvement in the sensitivity of risk classification of OC patients with our risk prediction models compared with other methods. Ongoing effort is needed to val-idate the outcomes of this approach for precise clinical treatment. (C) 2020 The Authors. Published by Elsevier B.V. on behalf of Cairo University.

关键词： Ovarian cancer Risk prediction Gene expression Machine learning GA-XGBoost bagging algorithm

来源：评论

学校读者我要写书评

暂无评论

Combining Different Ways to Generate Diversity in bagging Models: An Evolutionary Approach

Combining Different Ways to Generate Diversity in Bagging Mo...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Nascimento, Diego S. C. Canuto, Anne M. P. Silva, Ligia M. M. Coelho, Andre L. V. Fed Univ Rio Grande Norte UFRN Informat & Appl Math Dept BR-59072970 Natal RN Brazil Univ Fortaleza UNIFOR Grad Program Appl Informat BR-60811905 Fortaleza Ceara Brazil

ISBN: (纸本)9781424496365

bagging algorithm has been proven to be effective when dealing with on different classification problems. However, the success of bagging depends strongly on the diversity level reached by the individual classifiers of the ensemble models. Diversity in ensemble can be obtained when the individual classifiers are built using different circumstances, such as parameter settings, training datasets and learning algorithms. This paper presents a new approach which combines these three different ways to obtain high diversity in bagging models, aiming, as a consequence, to obtain high levels of accuracy for the ensembles. In the proposed approach, in order to obtain the optimal configurations of features and classifiers in bagging models, we have applied an evolutionary approach composed of two genetic algorithm instances. In order to validate the proposed approach, experiments involving 10 classification algorithms have been conducted, applying the resulting bagging structures in 5 pattern classification datasets taken from the UCI repository. In addition, we analyze the performance of the resulting bagging structures in terms of two recently proposed diversity measures, referred to as good and bad.

关键词： Accuracy bagging Biological cells Correlation Diversity reception Genetic algorithms Training bagging algorithm diversity level evolutionary approach genetic algorithm genetic algorithms pattern classification pattern classification

来源：评论

学校读者我要写书评

暂无评论

Prediction of splitting tensile strength of fiber-reinforced recycled aggregate concrete utilizing machine learning models with SHAP analysis

Hybrid Advances

引用

Hybrid Advances 2025年 11卷

作者： Md Al Adnan Muhammad Babur Faisal Farooq Mursaleen Shahid Zamiul Ahmed Pobithra Das Institute of Information Technology Noakhali Science and Technology University Noakhali Bangladesh Department of Civil Engineering Faculty of Engineering University of Central Punjab Pakistan Department of Engineering Aarhus University Denmark Department of Industrial Engineering University of Trento Trento Italy Department of Civil Engineering East West University Bangladesh Department of Civil Engineering Leading University Sylhet 3112 Bangladesh

The infrastructure industry utilizes a significant number of natural resources and produces a lot of construction waste, both of which have negative environmental effects. As a solution, recycled aggregate concrete has emerged as a practical substitute. Predicting strength accurately is essential for cutting design time and expenses while limiting material waste from numerous mixing tests. Machine learning methods tackle structural engineering issues, including the prediction of Splitting Tensile Strength (STS). In this study, used four novel machine learning models such as Random Forest Regression (RFR), Extreme Gradient Boosting (XGBoost), Gradient Boosted Regression Trees (GBRT), and bagging Regressor (BR) with grid search for hyperparameter tuning to forecast the splitting tensile strength of fiber-reinforced recycled aggregate concrete (FRRAC). The machine learning models demonstrated high reliability in predicting splitting tensile strength, including robust values for R-squared (R 2 ), Root Mean Square Error (RMSE), Mean Absolute Percentage Error (MAPE) and Mean Absolute Error (MAE). The prediction performance of the GBRT models showed the greatest R 2 value of 0.95 during the training stage and R 2 value of 0.83 during the testing phase. The XGBoost, RFR and BR models found R-square values were 0.822, 0.781 and 0.824 at the testing phase, respectively. Moreover, the RFR, BR, GBRT, and XGBoost model RMSE values were found to be 0.333, 0.298, 0.276, and 0.3004 at the testing phase, respectively, where the GBRT model RMSE value was found to be good. The GBRT model showed the lowest uncertainty value of both phases, with values of 0.619 and 0.597 for the training and testing phases, respectively. Furthermore, SHapley Additive exPlanations (SHAP) analysis found that CR, and additional of Fiber were the most influential input features and replacement percentage of CR (%) and RCA Absorption capacity (%) inputs had the lowest impact of Fiber-Reinforced Recycled Aggr

关键词： Splitting tensile strength Machine learning Recycled aggregate concrete Fiber-reinforced And SHapley additive exPlanations FRRAC Fiber-Reinforced Recycled Aggregate Concrete STS Splitting Tensile strength ML Machine Learning GBRT Gradient Boosting Regression Tree XGB Extreme Gradient Boosting RF Random forest BR bagging algorithm SHAP Shapely Additive Explanatory Analysis RMSE Root Mean Squared Error R2 Coefficient of Determination MAE Mean Absolute Error MAPE Mean Absolute Percentage Error SD Standard Deviation CR Cement Ratio

来源：评论

学校读者我要写书评

暂无评论

A Novel Neighborhood-Weighted Sampling Method for Imbalanced Datasets

引用

Chinese Journal of Electronics 2022年第5期31卷 969-979页

作者： GUANG Mingjian YAN Chungang LIU Guanjun WANG Junli JIANG Changjun Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University

The weighted sampling methods based on k-nearest neighbors have been demonstrated to be effective in solving the class imbalance problem. However,they usually ignore the positional relationship between a sample and the heterogeneous samples in its neighborhood when calculating sample weight. This paper proposes a novel neighborhood-weighted based sampling method named NWBbagging to improve the bagging algorithm's performance on imbalanced datasets. It considers the positional relationship between the center sample and the heterogeneous samples in its neighborhood when identifying critical samples. And a parameter reduction method is proposed and combined into the ensemble learning framework, which reduces the parameters and increases the classifier's diversity. We compare NWBbagging with some state-of-the-art ensemble learning algorithms on 34 imbalanced datasets, and the result shows that NWBbagging achieves better performance.

关键词： parameter reduction method neighborhood-weighted sampling method pattern classification class imbalance problem NWBbagging k-nearest neighbors sampling methods imbalanced datasets nearest neighbour methods ensemble learning algorithm bagging algorithm

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：