demonstration

PAnG: finding patterns in annotation graphs

Authors:

Maria Esther VidalAuthors Info & Claims

SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data

Pages 677 - 680

https://doi.org/10.1145/2213836.2213930

Published: 20 May 2012 Publication History

Get Access

Abstract

Annotation graph datasets are a natural representation of scientific knowledge. They are common in the life sciences and health sciences, where concepts such as genes, proteins or clinical trials are annotated with controlled vocabulary terms from ontologies. We present a tool, PAnG (Patterns in Annotation Graphs), that is based on a complementary methodology of graph summarization and dense subgraphs. The elements of a graph summary correspond to a pattern and its visualization can provide an explanation of the underlying knowledge. Scientists can use PAnG to develop hypotheses and for exploration.

References

[1]

PAnG. http://pang.umiacs.umd.edu.

Google Scholar

[2]

M. Acosta, M.-E. Vidal, T. Lampo, J. Castillo, and E. Ruckhaus. Anapsid: An adaptive query processing engine for sparql endpoints. In Proc. of International Semantic Web Conference (ISWC), 2011.

Digital Library

Google Scholar

[3]

O. Hassanzadeh, A. Kementsietsidis, L. Lim, R. J. Miller, and M. Wang. Linkedct: A linked data space for clinical trials. In Proc. WWW 2009 Workshop on Linked Data on the Web (LDOW2009), 2009.

Google Scholar

[4]

B. Kang, N. Grancher, V. Koyffmann, D. Lardemer, S. Burney, and M. Ahmad. Multiple interactions between cryptochrome and phototropin blue-light signalling pathways in arabidopsis thaliana. Planta, 227(5):1091--1099, 2008.

Crossref

Google Scholar

[5]

S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In Proc. of Conference on Management of Data (SIGMOD), 2008.

Digital Library

Google Scholar

[6]

M. Ohgishi, K. SajiÂ£, K. Okada, and T. Sakai. Functional analysis of each blue light receptor, cry1, cry2, phot1, and phot2, by using combinatorial multiple mutants in arabidopsis. Proc. of the National Academy of Sciences, 1010(8):2223--2228, 2004.

Crossref

Google Scholar

[7]

B. Saha, A. Hoch, S. Khuller, L. Raschid, and X.-N. Zhang. Dense subgraphs with restrictions and applications to gene annotation graphs. In Conference on Research on Computational Molecular Biology (RECOMB), 2010.

Digital Library

Google Scholar

[8]

A. Thor, P. Anderson, L. Raschid, S. Navlakha, B. Saha, S. Khuller, and X.-N. Zhang. Link prediction for annotation graphs using graph summarization. In Proc. of International Semantic Web Conference (ISWC), 2011.

Digital Library

Google Scholar

Cited By

View all

Chu LWang SLiu SHuang QPei J(2015)ALIDProceedings of the VLDB Endowment10.14778/2757807.27578088:8(826-837)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.14778/2757807.2757808
Hassanzadeh OMiller R(2015)Automatic Curation of Clinical Trials Data in LinkedCTThe Semantic Web - ISWC 201510.1007/978-3-319-25010-6_16(270-278)Online publication date: 24-Oct-2015
https://doi.org/10.1007/978-3-319-25010-6_16
Becker NChang CRaschid LSrinivasan PVan de Poel BZhang XZotkina E(2015)Demonstration: Mining Sentence and Annotation Evidence for a Cross Genome Study of the Plant Hormone EthyleneData Integration in the Life Sciences10.1007/978-3-319-21843-4_20(251-255)Online publication date: 8-Jul-2015
https://doi.org/10.1007/978-3-319-21843-4_20
Show More Cited By

Index Terms

PAnG: finding patterns in annotation graphs
1. Information systems
  1. Information systems applications
    1. Data mining
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Lossless graph summarization using dense subgraphs discovery
IMCOM '15: Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication

Dense subgraph discovery, in a large graph, is useful to solve the community search problem. Motivated from this, we propose a graph summarization method where we search and aggregate dense subgraphs into super nodes. Since the dense subgraphs have high ...
Link prediction for annotation graphs using graph summarization
ISWC'11: Proceedings of the 10th international conference on The semantic web - Volume Part I

Annotation graph datasets are a natural representation of scientific knowledge. They are common in the life sciences where genes or proteins are annotated with controlled vocabulary terms (CV terms) from ontologies. The W3C Linking Open Data (LOD) ...
Exact combinatorial algorithms and experiments for finding maximum k-plexes

We propose new practical algorithms to find maximum-cardinality k-plexes in graphs. A k-plex denotes a vertex subset in a graph inducing a subgraph where every vertex has edges to all but at most k vertices in the k-plex. Cliques are 1-plexes. In ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data

May 2012

886 pages

ISBN:9781450312479

DOI:10.1145/2213836

General Chairs:
K. Selçuk Candan
Arizona State University
,
Yi Chen
Arizona State University
,
Richard Snodgrass
University of Arizona
,
Program Chair:
Luis Gravano
Columbia University
,
Publications Chair:
Ariel Fuxman
Microsoft Research

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 May 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Demonstration

Conference

SIGMOD/PODS '12

Sponsor:

SIGMOD

SIGMOD/PODS '12: International Conference on Management of Data

May 20 - 24, 2012

Arizona, Scottsdale, USA

Acceptance Rates

SIGMOD '12 Paper Acceptance Rate 48 of 289 submissions, 17%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
259
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chu LWang SLiu SHuang QPei J(2015)ALIDProceedings of the VLDB Endowment10.14778/2757807.27578088:8(826-837)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.14778/2757807.2757808
Hassanzadeh OMiller R(2015)Automatic Curation of Clinical Trials Data in LinkedCTThe Semantic Web - ISWC 201510.1007/978-3-319-25010-6_16(270-278)Online publication date: 24-Oct-2015
https://doi.org/10.1007/978-3-319-25010-6_16
Becker NChang CRaschid LSrinivasan PVan de Poel BZhang XZotkina E(2015)Demonstration: Mining Sentence and Annotation Evidence for a Cross Genome Study of the Plant Hormone EthyleneData Integration in the Life Sciences10.1007/978-3-319-21843-4_20(251-255)Online publication date: 8-Jul-2015
https://doi.org/10.1007/978-3-319-21843-4_20
Overby CFlores APalma GVidal MZotkina ERaschid L(2015)Combining Multiple Knowledge Sources: A Case Study of Drug Induced Liver InjuryData Integration in the Life Sciences10.1007/978-3-319-21843-4_1(3-12)Online publication date: 8-Jul-2015
https://doi.org/10.1007/978-3-319-21843-4_1
Benik JChang CRaschid LVidal MPalma GThor A(2012)Finding cross genome patterns in annotation graphsProceedings of the 8th international conference on Data Integration in the Life Sciences10.1007/978-3-642-31040-9_3(21-36)Online publication date: 28-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-31040-9_3

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Lossless graph summarization using dense subgraphs discovery

Link prediction for annotation graphs using graph summarization

Exact combinatorial algorithms and experiments for finding maximum k-plexes