Specificity Enhancement in microRNA Target Prediction through Knowledge Discovery

Computer Systems, Imagery and Medi

Application based technical Approaches of data mining in Pharmaceuticals, and Research approaches in biomedical and Bioinformatics

In the past study shows that flow of direction in the field of pharmaceutical was quit slow and simplest and by the time the process of transformation of information was so complex and the it was out of the reach to the technology, new modern technology could not reach to catch the pharmaceutical field. Then the later on technology becomes the compulsorily part of business and its contributed into business progress and developments. But now a days its get technology enabled and smoothly and easily pharma industries managing their billings and inventories and developing new products and services and now its easy to maintain and merging the drugs detail like its cost ,and usage with the patients records prescribe by the doctors in the hospitals .and data collection methods have improved data manipulation techniques are yet to keep pace with them data mining called and refer with the specific term as pattern analysis on large data sets used like clustering, segmentation and classification for helping better manipulation of the data and hence it helps to the pharma firms and industries this paper describes the vital role of data Mining in the pharma industry and thus data mining improves the quality of decision making services in pharmaceutical fields. This paper also describe a brief overviews of tool kits of Data mining and its various Applications in the field of Biomedical research in terms of relational approaches of data minings with the Emphasis on propositionalisation and relational subgroup discovery, and which is quit helpful to prove to be effective for data analysis in biomedical and its applications and in Bioinformatics as well. DOI: 10.17762/ijritcc2321-8169.15038

International conference on software engineering and knowledge engineering: Session chair

The Thirtieth International Conference on Software Engineering and Knowledge Engineering (SEKE 2018) will be held at the Hotel Pullman, San Francisco Bay, USA, from July 1 to July 3, 2018. SEKE2018 will also be dedicated in memory of Professor Lofti Zadeh, a great scholar, pioneer and leader in fuzzy sets theory and soft computing. The conference aims at bringing together experts in software engineering and knowledge engineering to discuss on relevant results in either software engineering or knowledge engineering or both. Special emphasis will be put on the transference of methods between both domains. The theme this year is soft computing in software engineering & knowledge engineering. Submission of papers and demos are both welcome

A discriminative method for family-based protein remote homology detection that combines inductive logic programming and propositional models

<p>Abstract</p> <p>Background</p> <p>Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequence alignments (MSA), including all positions. However, when we deal with proteins in the "twilight zone" we can observe that only some segments of sequences (motifs) are conserved. We introduce a novel logical representation that allows us to represent physico-chemical properties of sequences, conserved amino acid positions and conserved physico-chemical positions in the MSA. From this, Inductive Logic Programming (ILP) finds the most frequent patterns (motifs) and uses them to train propositional models, such as decision trees and support vector machines (SVM).</p> <p>Results</p> <p>We use the SCOP database to perform our experiments by evaluating protein recognition within the same superfamily. Our results show that our methodology when using SVM performs significantly better than some of the state of the art methods, and comparable to other. However, our method provides a comprehensible set of logical rules that can help to understand what determines a protein function.</p> <p>Conclusions</p> <p>The strategy of selecting only the most frequent patterns is effective for the remote homology detection. This is possible through a suitable first-order logical representation of homologous properties, and through a set of frequent patterns, found by an ILP system, that summarizes essential features of protein functions.</p

Fast Construction of Relational Features for Machine Learning

Katedra kybernetik

Subgroup Discovery: Real-World Applications

Subgroup discovery is a data mining technique which extracts interesting rules with respect to a target variable. An important characteristic of this task is the combination of predictive and descriptive induction. In this paper, an overview about subgroup discovery is performed. In addition, di erent real-world applications solved through evolutionary algorithms where the suitability and potential of this type of algorithms for the development of subgroup discovery algorithms are presented

Searching for rules to detect defective modules: A subgroup discovery approach

Data mining methods in software engineering are becoming increasingly important as they can support several aspects of the software development life-cycle such as quality. In this work, we present a data mining approach to induce rules extracted from static software metrics characterising fault-prone modules. Due to the special characteristics of the defect prediction data (imbalanced, inconsistency, redundancy) not all classification algorithms are capable of dealing with this task conveniently. To deal with these problems, Subgroup Discovery (SD) algorithms can be used to find groups of statistically different data given a property of interest. We propose EDER-SD (Evolutionary Decision Rules for Subgroup Discovery), a SD algorithm based on evolutionary computation that induces rules describing only fault-prone modules. The rules are a well-known model representation that can be easily understood and applied by project managers and quality engineers. Thus, rules can help them to develop software systems that can be justifiably trusted. Contrary to other approaches in SD, our algorithm has the advantage of working with continuous variables as the conditions of the rules are defined using intervals. We describe the rules obtained by applying our algorithm to seven publicly available datasets from the PROMISE repository showing that they are capable of characterising subgroups of fault-prone modules. We also compare our results with three other well known SD algorithms and the EDER-SD algorithm performs well in most cases.Ministerio de Educación y Ciencia TIN2007-68084-C02-00Ministerio de Educación y Ciencia TIN2010-21715-C02-0