An improved memory-based collaborative filtering method based on the TOPSIS technique.
Ontology highlight
ABSTRACT:
SUBMITTER: Al-Bashiri H
PROVIDER: S-EPMC6171847 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Considering that traditional biological experiments are expensive and time consuming, it is important to develop effective computational models to infer potential essential proteins. In this manuscript, a novel collaborative filtering model-based method called CFMM was proposed, in which, an updated protein-domain interaction (PDI) network was constructed first by applying collaborative filtering algorithm on the original PDI network, and then, through integrating topological features of PDI networks with biological features of proteins, a calculative method was designed to infer potential essential proteins based on an improved PageRank algorithm. The novelties of CFMM lie in construction of an updated PDI network, application of the commodity-customer-based collaborative filtering algorithm, and introduction of the calculation method based on an improved PageRank algorithm, which ensured that CFMM can be applied to predict essential proteins without relying entirely on known protein-domain associations. Simulation results showed that CFMM can achieve reliable prediction accuracies of 92.16, 83.14, 71.37, 63.87, 55.84, and 52.43% in the top 1, 5, 10, 15, 20, and 25% predicted candidate key proteins based on the DIP database, which are remarkably higher than 14 competitive state-of-the-art predictive models as a whole, and in addition, CFMM can achieve satisfactory predictive performances based on different databases with various evaluation measurements, which further indicated that CFMM may be a useful tool for the identification of essential proteins in the future.
| S-EPMC8566338 | biostudies-literature
Project description:China is still one of the countries dominated by thermal power generation. In order to generate more efficient, stable and clean power, it is necessary to evaluate thermal power generation units (TPGU). Firstly, a comprehensive evaluation index system for TPGU with 20 secondary indicators was established from four aspects: reliability indicators, economic indicators, technical supervision indicators, and major operating indicators. Secondly, the entropy weight method can be used to calculate the weight of each second-level index. Mahalanobis Distance improved Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) method is coupled with the Grey Relational Analysis (GRA), and the comprehensive evaluation values of 5 units (600MW) are respectively 0.4516, 0.5247, 0.3551, 0.5589 and 0.6168 from both vertical and horizontal dimensions. Finally, by comparing and analyzing this method with the above research methods, it is found that the results obtained by this method which re-establishes the coordinate system based on the data set are more accurate. In addition, this method can effectively evaluate the operation of TPGU, which is of great significance for cleaner production while generating electricity. In conclusion, some suggestions on clean production of TPGU are put forward, and the innovation points and limitations of this paper are pointed out.
| S-EPMC8782510 | biostudies-literature
Project description:Due to the problems related to the numerous factors affecting the spontaneous combustion of goaf coal, such as sudden, uncertain, and dynamic changes, and the fact that the weight of the indexes in the prediction model of the spontaneous combustion risk is difficult to determine, an improved Criteria Importance Through Inter-criteria Correlation (CRITIC) modified Technique for Order of Preference by Similarity to Ideal Solution G2-(TOPSIS) dynamic prediction model of goaf spontaneous combustion was developed. An optimal decision-making model was established by introducing the Euclidean distance function, and the function-driven type G2 weighting method was modified using the differential-driven type weighting method of the CRITIC. In addition, the comprehensive weights of each index were obtained. An update factor was introduced to obtain the dynamic weight, and the primary-secondary relationship of the risk factors affecting the spontaneous combustion of goaf was evaluated. Based on the G2 weighting method, which approximates the driving function principle of the ideal solution ranking method (TOPSIS), a G2-TOPSIS goaf spontaneous combustion risk assessment model was established. The degree of closeness was analyzed and the risk grade of the goaf spontaneous combustion was finally predicted. The sub-model was applied to the goaf of working face 1303 in the Jinniu Coal Mine. It was concluded that the air leakage duration was the dominant factor inducing the risk of the spontaneous combustion of the goaf. The risk grade of spontaneous combustion of the goaf is Class III, and the predicted results are consistent with the actual situation. The improved CRITIC-G2-TOPSIS dynamic model was demonstrated to be scientific in predicting the goaf spontaneous combustion risk, and these research results have important popularization and application value.
| S-EPMC8550420 | biostudies-literature
Project description:To scientifically and quantitatively evaluate the degree of urban storm resilience and improve the level of urban stormwater resilience, based on the resilience theory, starting from the three attributes of resilience (resistance, recovery and adaptability), this paper establishes the framework of urban resilience evaluation indicator system under the background of stormwater disaster. Firstly, the weight of the indicator system is analyzed by the Delphi method and cloud model, and then the urban stormwater recilience evaluation model is constructed by using the cloud model and approximate ideal solution ranking method. Through the fuzzy description, the corresponding quantitative value is given to the qualitative indicator, so that the stormwater resilience of the city can be measured by accurate values. Finally, the feasibility of the model is verified by case analysis. The results show that the urban stormwater resilience evaluation theory and method based on cloud model and approximate ideal solution ranking method have important guiding significance to improve the level of urban stormwater resilience.
| S-EPMC8751000 | biostudies-literature
Project description:BackgroundOpen-angle glaucoma (OAG) is a prevalent, degenerate ocular disease which can lead to blindness without proper clinical management. The tests used to assess disease progression are susceptible to process and measurement noise. The aim of this study was to develop a methodology which accounts for the inherent noise in the data and improve significant disease progression identification.MethodsLongitudinal observations from the Collaborative Initial Glaucoma Treatment Study (CIGTS) were used to parameterize and validate a Kalman filter model and logistic regression function. The Kalman filter estimates the true value of biomarkers associated with OAG and forecasts future values of these variables. We develop two logistic regression models via generalized estimating equations (GEE) for calculating the probability of experiencing significant OAG progression: one model based on the raw measurements from CIGTS and another model based on the Kalman filter estimates of the CIGTS data. Receiver operating characteristic (ROC) curves and associated area under the ROC curve (AUC) estimates are calculated using cross-fold validation.ResultsThe logistic regression model developed using Kalman filter estimates as data input achieves higher sensitivity and specificity than the model developed using raw measurements. The mean AUC for the Kalman filter-based model is 0.961 while the mean AUC for the raw measurements model is 0.889. Hence, using the probability function generated via Kalman filter estimates and GEE for logistic regression, we are able to more accurately classify patients and instances as experiencing significant OAG progression.ConclusionA Kalman filter approach for estimating the true value of OAG biomarkers resulted in data input which improved the accuracy of a logistic regression classification model compared to a model using raw measurements as input. This methodology accounts for process and measurement noise to enable improved discrimination between progression and nonprogression in chronic diseases.
| S-EPMC3878032 | biostudies-literature
Project description:In a heterogeneous wireless network, handover techniques are designed to facilitate anywhere/anytime service continuity for mobile users. Consistent best-possible access to a network with widely varying network characteristics requires seamless mobility management techniques. Hence, the vertical handover process imposes important technical challenges. Handover decisions are triggered for continuous connectivity of mobile terminals. However, bad network selection and overload conditions in the chosen network can cause fallout in the form of handover failure. In order to maintain the required Quality of Service during the handover process, decision algorithms should incorporate intelligent techniques. In this paper, a new and efficient vertical handover mechanism is implemented using a dynamic programming method from the operation research discipline. This dynamic programming approach, which is integrated with the Technique to Order Preference by Similarity to Ideal Solution (TOPSIS) method, provides the mobile user with the best handover decisions. Moreover, in this proposed handover algorithm a deterministic approach which divides the network into zones is incorporated into the network server in order to derive an optimal solution. The study revealed that this method is found to achieve better performance and QoS support to users and greatly reduce the handover failures when compared to the traditional TOPSIS method. The decision arrived at the zone gateway using this operational research analytical method (known as the dynamic programming knapsack approach together with Technique to Order Preference by Similarity to Ideal Solution) yields remarkably better results in terms of the network performance measures such as throughput and delay.
| S-EPMC4523173 | biostudies-literature
Project description:Recommendation systems suggest peculiar products to customers based on their past ratings, preferences, and interests. These systems typically utilize collaborative filtering (CF) to analyze customers' ratings for products within the rating matrix. CF suffers from the sparsity problem because a large number of rating grades are not accurately determined. Various prediction approaches have been used to solve this problem by learning its latent and temporal factors. A few other challenges such as latent feedback learning, customers' drifting interests, overfitting, and the popularity decay of products over time have also been addressed. Existing works have typically deployed either short or long temporal representation for addressing the recommendation system issues. Although each effort improves on the accuracy of its respective benchmark, an integrative solution that could address all the problems without trading off its accuracy is needed. Thus, this paper presents a Latent-based Temporal Optimization (LTO) approach to improve the prediction accuracy of CF by learning the past attitudes of users and their interests over time. Experimental results show that the LTO approach efficiently improves the prediction accuracy of CF compared to the benchmark schemes.
| S-EPMC7924488 | biostudies-literature
Project description:Conventional one-drug-one-gene approach has been of limited success in modern drug discovery. Polypharmacology, which focuses on searching for multi-targeted drugs to perturb disease-causing networks instead of designing selective ligands to target individual proteins, has emerged as a new drug discovery paradigm. Although many methods for single-target virtual screening have been developed to improve the efficiency of drug discovery, few of these algorithms are designed for polypharmacology. Here, we present a novel theoretical framework and a corresponding algorithm for genome-scale multi-target virtual screening based on the one-class collaborative filtering technique. Our method overcomes the sparseness of the protein-chemical interaction data by means of interaction matrix weighting and dual regularization from both chemicals and proteins. While the statistical foundation behind our method is general enough to encompass genome-wide drug off-target prediction, the program is specifically tailored to find protein targets for new chemicals with little to no available interaction data. We extensively evaluate our method using a number of the most widely accepted gene-specific and cross-gene family benchmarks and demonstrate that our method outperforms other state-of-the-art algorithms for predicting the interaction of new chemicals with multiple proteins. Thus, the proposed algorithm may provide a powerful tool for multi-target drug design.
| S-EPMC5153628 | biostudies-literature
Project description:As an important factor for improving recommendations, time information has been introduced to model users' dynamic preferences in many papers. However, the sequence of users' behaviour is rarely studied in recommender systems. Due to the users' unique behavior evolution patterns and personalized interest transitions among items, users' similarity in sequential dimension should be introduced to further distinguish users' preferences and interests. In this paper, we propose a new collaborative filtering recommendation method based on users' interest sequences (IS) that rank users' ratings or other online behaviors according to the timestamps when they occurred. This method extracts the semantics hidden in the interest sequences by the length of users' longest common sub-IS (LCSIS) and the count of users' total common sub-IS (ACSIS). Then, these semantics are utilized to obtain users' IS-based similarities and, further, to refine the similarities acquired from traditional collaborative filtering approaches. With these updated similarities, transition characteristics and dynamic evolution patterns of users' preferences are considered. Our new proposed method was compared with state-of-the-art time-aware collaborative filtering algorithms on datasets MovieLens, Flixster and Ciao. The experimental results validate that the proposed recommendation method is effective and outperforms several existing algorithms in the accuracy of rating prediction.
| S-EPMC4873175 | biostudies-literature
Project description:The comprehensive mapping of protein-protein interactions (PPIs) is highly desired for one to gain deep insights into both fundamental cell biology processes and the pathology of diseases. Finely-set small-scale experiments are not only very expensive but also inefficient to identify numerous interactomes despite their high accuracy. High-throughput screening techniques enable efficient identification of PPIs; yet the desire to further extract useful knowledge from these data leads to the problem of binary interactome mapping. Network topology-based approaches prove to be highly efficient in addressing this problem; however, their performance deteriorates significantly on sparse putative PPI networks. Motivated by the success of collaborative filtering (CF)-based approaches to the problem of personalized-recommendation on large, sparse rating matrices, this work aims at implementing a highly efficient CF-based approach to binary interactome mapping. To achieve this, we first propose a CF framework for it. Under this framework, we model the given data into an interactome weight matrix, where the feature-vectors of involved proteins are extracted. With them, we design the rescaled cosine coefficient to model the inter-neighborhood similarity among involved proteins, for taking the mapping process. Experimental results on three large, sparse datasets demonstrate that the proposed approach outperforms several sophisticated topology-based approaches significantly.
| S-EPMC4287731 | biostudies-literature