• Title/Summary/Keyword: The time of department selection

Search Result 1,028, Processing Time 0.024 seconds

Intelligent System for the Prediction of Heart Diseases Using Machine Learning Algorithms with Anew Mixed Feature Creation (MFC) technique

  • Rawia Elarabi;Abdelrahman Elsharif Karrar;Murtada El-mukashfi El-taher
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.5
    • /
    • pp.148-162
    • /
    • 2023
  • Classification systems can significantly assist the medical sector by allowing for the precise and quick diagnosis of diseases. As a result, both doctors and patients will save time. A possible way for identifying risk variables is to use machine learning algorithms. Non-surgical technologies, such as machine learning, are trustworthy and effective in categorizing healthy and heart-disease patients, and they save time and effort. The goal of this study is to create a medical intelligent decision support system based on machine learning for the diagnosis of heart disease. We have used a mixed feature creation (MFC) technique to generate new features from the UCI Cleveland Cardiology dataset. We select the most suitable features by using Least Absolute Shrinkage and Selection Operator (LASSO), Recursive Feature Elimination with Random Forest feature selection (RFE-RF) and the best features of both LASSO RFE-RF (BLR) techniques. Cross-validated and grid-search methods are used to optimize the parameters of the estimator used in applying these algorithms. and classifier performance assessment metrics including classification accuracy, specificity, sensitivity, precision, and F1-Score, of each classification model, along with execution time and RMSE the results are presented independently for comparison. Our proposed work finds the best potential outcome across all available prediction models and improves the system's performance, allowing physicians to diagnose heart patients more accurately.

Dominance-Based Service Selection Scheme with Concurrent Requests

  • Tang, Chaogang;Li, Qing;Xiong, Yan;Wen, Shiting;Liu, An;Zhong, Farong
    • Journal of Computing Science and Engineering
    • /
    • v.6 no.2
    • /
    • pp.89-104
    • /
    • 2012
  • In dynamic Web service environments, the performance of the Internet is unpredictable; the reliability and effectiveness of remote Web services are also unclear. Therefore, it can hardly be guaranteed that the quality of Web service (QoWS) attributes of Web services do not fluctuate with the dynamic Web service environments. When a composite service is planned in the context of dynamic service environments, there is another aspect which has not been taken into account by existing works, namely, concurrency - the fact that multiple requests to a composite service may arrive at the same time. Considering the dynamics of Web service environments and concurrency of requests, we propose in this paper a service selection scheme which adopts top-k dominating queries to generate a composition solution rather than only select the best composition solution for a given request. The experimental results have investigated the efficiency and effectiveness of our approach and shown that it outperforms baseline and traditional methods for service selection.

Characteristics of Spectral Matched Ground Motions Time Histories According to Seed Ground Motion Selection (원본 지반운동 시간이력에 따른 스펙트럼 부합 시간이력의 특성)

  • Choi, Da Seul;Ji, Hae Yeon;Kim, Jung Han
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.25 no.1
    • /
    • pp.43-52
    • /
    • 2021
  • According to several seismic design standards, a ground motion time history should be selected similar to the design response spectrum, or a ground motion time history should be modified by matching procedure to the design response spectrum through the time-domain method. For the response spectrum matching procedure, appropriate seed ground motions need to be selected to maintain recorded earthquake accelerogram characteristics. However, there are no specific criteria for selecting the seed ground motions for applying this methodology. In this study, the characteristics of ground motion time histories between seed motions and spectral matched motions were compared. Intensity measures used in the design were compared, and their change by spectral matching procedure was quantified. In addition, the seed ground motion sets were determined according to the response spectrum shape, and these sets analyzed the response of nonlinear and equivalent linear single degrees of freedom systems to present the seed motion selection conditions for spectral matching. As a result, several considerations for applying the time domain spectral matching method were presented.

Forecasting the Baltic Dry Index Using Bayesian Variable Selection (베이지안 변수선택 기법을 이용한 발틱건화물운임지수(BDI) 예측)

  • Xiang-Yu Han;Young Min Kim
    • Korea Trade Review
    • /
    • v.47 no.5
    • /
    • pp.21-37
    • /
    • 2022
  • Baltic Dry Index (BDI) is difficult to forecast because of the high volatility and complexity. To improve the BDI forecasting ability, this study apply Bayesian variable selection method with a large number of predictors. Our estimation results based on the BDI and all predictors from January 2000 to September 2021 indicate that the out-of-sample prediction ability of the ADL model with the variable selection is superior to that of the AR model in terms of point and density forecasting. We also find that critical predictors for the BDI change over forecasts horizon. The lagged BDI are being selected as an key predictor at all forecasts horizon, but commodity price, the clarksea index, and interest rates have additional information to predict BDI at mid-term horizon. This implies that time variations of predictors should be considered to predict the BDI.

Selection of the time Integration algorithm for transient stability analysis program (과도 안정도 해석 프로그램을 위한 최적 시 적분 알고리즘 선정방안)

  • Kim, D.J.;Cho, Y.S.;Jang, G.;Lee, B.;Kwon, S.H.
    • Proceedings of the KIEE Conference
    • /
    • 2003.07a
    • /
    • pp.122-124
    • /
    • 2003
  • Power system analysis is generally based on computer simulation and time-domain simulation is used to assess it's dynamic performance. This paper deals with the selection of proper integration engine for large-scale power system dynamic simulation. Simulation results obtained from the selected algorithm are compared to those of commercial program.

  • PDF

Unsupervised Clustering of Multivariate Time Series Microarray Experiments based on Incremental Non-Gaussian Analysis

  • Ng, Kam Swee;Yang, Hyung-Jeong;Kim, Soo-Hyung;Kim, Sun-Hee;Anh, Nguyen Thi Ngoc
    • International Journal of Contents
    • /
    • v.8 no.1
    • /
    • pp.23-29
    • /
    • 2012
  • Multiple expression levels of genes obtained using time series microarray experiments have been exploited effectively to enhance understanding of a wide range of biological phenomena. However, the unique nature of microarray data is usually in the form of large matrices of expression genes with high dimensions. Among the huge number of genes presented in microarrays, only a small number of genes are expected to be effective for performing a certain task. Hence, discounting the majority of unaffected genes is the crucial goal of gene selection to improve accuracy for disease diagnosis. In this paper, a non-Gaussian weight matrix obtained from an incremental model is proposed to extract useful features of multivariate time series microarrays. The proposed method can automatically identify a small number of significant features via discovering hidden variables from a huge number of features. An unsupervised hierarchical clustering representative is then taken to evaluate the effectiveness of the proposed methodology. The proposed method achieves promising results based on predictive accuracy of clustering compared to existing methods of analysis. Furthermore, the proposed method offers a robust approach with low memory and computation costs.

Hybrid Feature Selection Using Genetic Algorithm and Information Theory

  • Cho, Jae Hoon;Lee, Dae-Jong;Park, Jin-Il;Chun, Myung-Geun
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.13 no.1
    • /
    • pp.73-82
    • /
    • 2013
  • In pattern classification, feature selection is an important factor in the performance of classifiers. In particular, when classifying a large number of features or variables, the accuracy and computational time of the classifier can be improved by using the relevant feature subset to remove the irrelevant, redundant, or noisy data. The proposed method consists of two parts: a wrapper part with an improved genetic algorithm(GA) using a new reproduction method and a filter part using mutual information. We also considered feature selection methods based on mutual information(MI) to improve computational complexity. Experimental results show that this method can achieve better performance in pattern recognition problems than other conventional solutions.

A Multi-Attribute Intuitionistic Fuzzy Group Decision Method For Network Selection In Heterogeneous Wireless Networks Using TOPSIS

  • Prakash, Sanjeev;Patel, R.B.;Jain, V.K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5229-5252
    • /
    • 2016
  • With proliferation of diverse network access technologies, users demands are also increasing and service providers are offering a Quality of Service (QoS) to satisfy their customers. In roaming, a mobile node (MN) traverses number of available networks in the heterogeneous wireless networks environment and a single operator is not capable to fulfill the demands of user. It is crucial task for MN for selecting a best network from the list of networks at any time anywhere. A MN undergoes a network selection situation frequently when it is becoming away from the home network. Multiple Attribute Group Decision (MAGD) method will be one of the best ways for selecting target network in heterogeneous wireless networks (4G). MAGD network selection process is predominantly dependent on two steps, i.e., attribute weight, decision maker's (DM's) weight and aggregation of opinion of DMs. This paper proposes Multi-Attribute Intuitionistic Fuzzy Group Decision Method (MAIFGDM) using TOPSIS for the selection of the suitable candidate network. It is scalable and is able to handle any number of networks with large set of attributes. This is a method of lower complexity and is useful for real time applications. It gives more accurate result because it uses Intuitionistic Fuzzy Sets (IFS) with an additional parameter intuitionistic fuzzy index or hesitant degree. MAIFGDM is simulated in MATLAB for its evaluation. A comparative study of MAIFDGM is also made with TOPSIS and Fuzzy-TOPSIS in respect to decision delay. It is observed that MAIFDGM have low values of decision time in comparison to TOPSIS and Fuzzy-TOPSIS methods.

Facial Feature Extraction with Its Applications

  • Lee, Minkyu;Lee, Sangyoun
    • Journal of International Society for Simulation Surgery
    • /
    • v.2 no.1
    • /
    • pp.7-9
    • /
    • 2015
  • Purpose In the many face-related application such as head pose estimation, 3D face modeling, facial appearance manipulation, the robust and fast facial feature extraction is necessary. We present the facial feature extraction method based on shape regression and feature selection for real-time facial feature extraction. Materials and Methods The facial features are initialized by statistical shape model and then the shape of facial features are deformed iteratively according to the texture pattern which is selected on the feature pool. Results We obtain fast and robust facial feature extraction result with error less than 4% and processing time less than 12 ms. The alignment error is measured by average of ratio of pixel difference to inter-ocular distance. Conclusion The accuracy and processing time of the method is enough to apply facial feature based application and can be used on the face beautification or 3D face modeling.

Selection probability of multivariate regularization to identify pleiotropic variants in genetic association studies

  • Kim, Kipoong;Sun, Hokeun
    • Communications for Statistical Applications and Methods
    • /
    • v.27 no.5
    • /
    • pp.535-546
    • /
    • 2020
  • In genetic association studies, pleiotropy is a phenomenon where a variant or a genetic region affects multiple traits or diseases. There have been many studies identifying cross-phenotype genetic associations. But, most of statistical approaches for detection of pleiotropy are based on individual tests where a single variant association with multiple traits is tested one at a time. These approaches fail to account for relations among correlated variants. Recently, multivariate regularization methods have been proposed to detect pleiotropy in analysis of high-dimensional genomic data. However, they suffer a problem of tuning parameter selection, which often results in either too many false positives or too small true positives. In this article, we applied selection probability to multivariate regularization methods in order to identify pleiotropic variants associated with multiple phenotypes. Selection probability was applied to individual elastic-net, unified elastic-net and multi-response elastic-net regularization methods. In simulation studies, selection performance of three multivariate regularization methods was evaluated when the total number of phenotypes, the number of phenotypes associated with a variant, and correlations among phenotypes are different. We also applied the regularization methods to a wild bean dataset consisting of 169,028 variants and 17 phenotypes.