A drug-drug interaction (DDI) occurs when one drug affects the level or activity of another drug. Semeval 2013 DDI Extraction challenge is going to be held with the aim of identifying the state of the art relation extraction algorithms. In this paper we firstly review some of the existing approaches in relation extraction generally and biomedical relations especially. And secondly we will expla...

In this paper we explore the possibility of defining an original pattern structure for managing syntactic trees. More precisely, we are interested in the extraction of relations such as drug-drug interactions (DDIs) in medical texts where sentences are represented as syntactic trees. In this specific pattern structure, called STPS, the similarity operator is based on rooted tree intersection. M...

To integrate or link the data stored in heterogeneous data sources, a critical problem is entity matching, i.e., matching records representing semantically corresponding entities in the real world, across the sources. While decision tree techniques have been used to learn entity matching rules, most decision tree learners have an inherent representational bias, that is, they generate univariate...

An undirected graph G = (V,E) is the k-power of an undirected tree T = (V, E′) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T . The tree T is called the tree root of G. Tree powers can be recognized in polynomial time. The thus naturally arising question is whether a graph G can be modified by adding or deleting a specified number of edges such that G becomes a tree ...

The classification-tree method developed by Grochtmann et al. provided a useful approach for constructing test cases from functional specifications. It was automated by Chen and Poon through their tree construction methodology. In a follow-up study, Chen and Poon found that the effectiveness of constructing legitimate test cases could be improved under certain circumstances via a classification...

Problems of a Korean automobile repair service center stem from the fact that a large portion of customers stop visiting the center for unknown reasons. So, we collected and analyzed the customer-related data in order to resolve those problems. We first defined customer class based on the R-F-M variables. Then, we built a customer classification model (i.e., a decision tree). Finally, we extrac...

Kernel methods are considered the most effective techniques for various relation extraction (RE) tasks as they provide higher accuracy than other approaches. In this paper, we introduce new dependency tree (DT) kernels for RE by improving on previously proposed dependency tree structures. These are further enhanced to design more effective approaches that we call mildly extended dependency tree...

Large corporations often have different subunits sharing common customers, yielding distributed customer databases. Corporate risk and marketing functions seek areas where there is unusuaiiy high risk, or where one can target market. ‘We present a three-phase process to solve this problem. First, we merge the distributed databases using decision tree induction into a database of unique customer...

background and objectives: phospholipases are a group of enzymes that breakdown phospholipid molecules producing second products. these second products play a diverse role in the cell such as signal transduction and digestion in humans. in this study, the effect of phospholipids on the expression of pld genes of a. fumigatus was investigated. the pld genes of this fungus were also investigated ...

We propose Tree Sequence Kernel (TSK), which implicitly exhausts the structure features of a sequence of subtrees embedded in the phrasal parse tree. By incorporating the capability of sequence kernel, TSK enriches tree kernel with tree sequence features so that it may provide additional useful patterns for machine learning applications. Two approaches of penalizing the substructures are propos...