• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Translating Clinical Findings into Knowledge in Drug Safety Evaluation- Drug Induced Liver Injury Prediction System (DILIps)

by Zhichao Liu, Qiang Shi, Don Ding, Reagan Kelly, Hong Fang, Weida Tong
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs

by Hiroaki Shiokawa , Yasuhiro Fujiwara , Makoto Onizuka
"... ABSTRACT Graph clustering is one of the key techniques for understanding the structures present in graphs. Besides cluster detection, identifying hubs and outliers is also a key task, since they have important roles to play in graph data mining. The structural clustering algorithm SCAN, proposed by ..."
Abstract - Add to MetaCart
ABSTRACT Graph clustering is one of the key techniques for understanding the structures present in graphs. Besides cluster detection, identifying hubs and outliers is also a key task, since they have important roles to play in graph data mining. The structural clustering algorithm SCAN, proposed by Xu et al., is successfully used in many application because it not only detects densely connected nodes as clusters but also identifies sparsely connected nodes as hubs or outliers. However, it is difficult to apply SCAN to large-scale graphs due to its high time complexity. This is because it evaluates the density for all adjacent nodes included in the given graphs. In this paper, we propose a novel graph clustering algorithm named SCAN++. In order to reduce time complexity, we introduce new data structure of directly two-hop-away reachable node set (DTAR). DTAR is the set of two-hop-away nodes from a given node that are likely to be in the same cluster as the given node. SCAN++ employs two approaches for efficient clustering by using DTARs without sacrificing clustering quality. First, it reduces the number of the density evaluations by computing the density only for the adjacent nodes such as indicated by DTARs. Second, by sharing a part of the density evaluations for DTARs, it offers efficient density evaluations of adjacent nodes. As a result, SCAN++ detects exactly the same clusters, hubs, and outliers from large-scale graphs as SCAN with much shorter computation time. Extensive experiments on both real-world and synthetic graphs demonstrate the performance superiority of SCAN++ over existing approaches.
(Show Context)

Citation Context

...hod [15] only study the problem of cluster detection and so ignore hubs and outliers. One of the most successful clustering methods is structural clustering algorithm (SCAN) proposed by Xu et al. [36]. Similar to density-based clustering, the main concept of SCAN is that densely connected adjacent nodes should be in the same cluster. However, unlike the traditional algorithms, SCAN successfully finds, at not insignificant cost, not only clusters but also hubs and outliers. As a result, SCAN has been used in many applications including bioinfomatics [6], social analyses [20], clinical analyses [22], and so on. Although SCAN’s effectiveness in detecting hubs and outliers as well as clusters is known in many applications, SCAN has, unfortunately, a serious weakness; it requires high computation costs for large-scale graphs. This is because SCAN has to find all clusters prior to identifying hubs and outliers; it first finds densely connected node sets as clusters. It then classifies the remaining non-clustered nodes into hubs or outliers. This clustering procedure entails exhaustive density evaluations for all adjacent nodes in large-scale graphs. Several methods have been proposed to impr...

Identification of Novel Inhibitors of Organic Anion Transporting Polypeptides 1B1 and 1B3 (OATP1B1 and OATP1B3) Using a Consensus Vote of Six Classification Models

by Eleni Kotsampasakou, Stefan Brenner, Gerhard F. Ecker
"... ABSTRACT: Organic anion transporting polypeptides 1B1 and 1B3 are transporters selectively expressed on the basolateral membrane of the hepatocyte. Several studies reveal that they are involved in drug−drug interactions, cancer, and hyperbilirubinemia. In this study, we developed a set of classifica ..."
Abstract - Add to MetaCart
ABSTRACT: Organic anion transporting polypeptides 1B1 and 1B3 are transporters selectively expressed on the basolateral membrane of the hepatocyte. Several studies reveal that they are involved in drug−drug interactions, cancer, and hyperbilirubinemia. In this study, we developed a set of classification models for OATP1B1 and 1B3 inhibition based on more than 1700 carefully curated compounds from literature, which were validated via cross-validation and by use of an external test set. After combining several sets of descriptors and classifiers, the 6 best models were selected according to their statistical performance and were used for virtual screening of DrugBank. Consensus scoring of the screened compounds resulted in the selection and purchase of nine compounds as potential dual inhibitors and of one compound as potential selective OATP1B3 inhibitor. Biological testing of the compounds confirmed the validity of the models, yielding an accuracy of 90 % for OATP1B1 and 80 % for OATP1B3, respectively. Moreover, at least half of the new identified inhibitors are associated with hyperbilirubinemia or hepatotoxicity, implying a relationship between OATP inhibition and these severe side effects.
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University