6 research outputs found
DiscoverPath: A Knowledge Refinement and Retrieval System for Interdisciplinarity on Biomedical Research
The exponential growth in scholarly publications necessitates advanced tools
for efficient article retrieval, especially in interdisciplinary fields where
diverse terminologies are used to describe similar research. Traditional
keyword-based search engines often fall short in assisting users who may not be
familiar with specific terminologies. To address this, we present a knowledge
graph-based paper search engine for biomedical research to enhance the user
experience in discovering relevant queries and articles. The system, dubbed
DiscoverPath, employs Named Entity Recognition (NER) and part-of-speech (POS)
tagging to extract terminologies and relationships from article abstracts to
create a KG. To reduce information overload, DiscoverPath presents users with a
focused subgraph containing the queried entity and its neighboring nodes and
incorporates a query recommendation system, enabling users to iteratively
refine their queries. The system is equipped with an accessible Graphical User
Interface that provides an intuitive visualization of the KG, query
recommendations, and detailed article information, enabling efficient article
retrieval, thus fostering interdisciplinary knowledge exploration. DiscoverPath
is open-sourced at https://github.com/ynchuang/DiscoverPath
Algorithms and Bounds for Drawing Directed Graphs
In this paper we present a new approach to visualize directed graphs and
their hierarchies that completely departs from the classical four-phase
framework of Sugiyama and computes readable hierarchical visualizations that
contain the complete reachability information of a graph. Additionally, our
approach has the advantage that only the necessary edges are drawn in the
drawing, thus reducing the visual complexity of the resulting drawing.
Furthermore, most problems involved in our framework require only polynomial
time. Our framework offers a suite of solutions depending upon the
requirements, and it consists of only two steps: (a) the cycle removal step (if
the graph contains cycles) and (b) the channel decomposition and hierarchical
drawing step. Our framework does not introduce any dummy vertices and it keeps
the vertices of a channel vertically aligned. The time complexity of the main
drawing algorithms of our framework is , where is the number of
channels, typically much smaller than (the number of vertices).Comment: Appears in the Proceedings of the 26th International Symposium on
Graph Drawing and Network Visualization (GD 2018
The Widths of Strict Outerconfluent Graphs
Strict outerconfluent drawing is a style of graph drawing in which vertices
are drawn on the boundary of a disk, adjacencies are indicated by the existence
of smooth curves through a system of tracks within the disk, and no two
adjacent vertices are connected by more than one of these smooth tracks. We
investigate graph width parameters on the graphs that have drawings in this
style. We prove that the clique-width of these graphs is unbounded, but their
twin-width is bounded.Comment: 15 pages, 2 figure