Graphs are now been widely used in expressing world wide web, social network, knowledge base, biological structure, etc. Querying heterogeneous and large-scale graphs is expensive and writing queries to search these graphs is nevertheless a nontrivial task for end users. It is hard for end-users to write precise queries that will lead to meaningful answers without any prior knowledge of the underlying data graph. Users often need to revise the queries multiple times to find desirable answers. Given a large number of entities in the graph, users often require efficient predictive models that can effectively suggest the nodes with high priority. Exploring such graphs is challenging due to the ambiguity in queries, the inherent computational complexity (e.g., subgraph isomorphism) and resource constraints (e.g., response time) for large graphs.
In order to solve these challenges, graph exploration has been introduced to perform exploratory analyses on graph data. My major research topic provides an exploratory graph search framework which helps users to perform effective and efficient exploratory searches on graph data. This framework includes following major contributions.