Learn More
Mining potential drug-disease associations can speed up drug repositioning for pharmaceutical companies. Previous computational strategies focused on prior biological information for association inference. However, such information may not be comprehensively available and may contain errors. Different from previous research, two inference methods, ProbS and(More)
Given the problems in intelligent gearbox diagnosis methods, it is difficult to obtain the desired information and a large enough sample size to study; therefore, we propose the application of various methods for gearbox fault diagnosis, including wavelet lifting, a support vector machine (SVM) and rule-based reasoning (RBR). In a complex field environment,(More)
Available online xxxx Keywords: Perfect matching Berge–Fulkerson conjecture Fan–Raspaud conjecture Perfect matching coverage index Snark a b s t r a c t Let m * t be the largest rational number such that every bridgeless cubic graph G associated with a positive weight ω has t perfect matchings {M 1 ,. .. , M t } with ω(∪ t i=1 M i) ≥ m * t ω(G).
In this paper, we survey three enhanced versions of the Quasi-Clique Merger (QCM) algorithm for clustering data sets. By assigning a graphical structure to a data set, we cluster the underlying data by analyzing the graph and identifying dense subgraphs. In the current work we outline three variations of the QCM algorithm and illustrate their effectiveness(More)
Let C be a given circuit of a bridgeless cubic graph G. It was conjectured by Seymour that G has a circuit double cover (CDC) containing the given circuit C. This conjecture (strong CDC [SCDC] conjecture) has been verified by Fleischner and H ¨ aggkvist for various families of graphs and circuits. In this article, some of these earlier results have been(More)
In data mining, hierarchical clustering is a method of cluster analysis which seeks to build a hierarchy of clusters. Strategies for hierarchical clustering generally fall into two types: agglomerative and divisive. In this paper we shall introduce a new optimal selection method based on the well-known Max-Flow Min-Cut theorem, which also works for the(More)