An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Ranking-based clustering of heterogeneous information networks with star network schema
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast query execution for retrieval models based on path-constrained random walks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
On graph query optimization in large networks
Proceedings of the VLDB Endowment
Neighborhood based fast graph search in large networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Ranking-based classification of heterogeneous information networks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Co-author Relationship Prediction in Heterogeneous Bibliographic Networks
ASONAM '11 Proceedings of the 2011 International Conference on Advances in Social Networks Analysis and Mining
Geo-Friends Recommendation in GPS-based Cyber-physical Social Network
ASONAM '11 Proceedings of the 2011 International Conference on Advances in Social Networks Analysis and Mining
Mining heterogeneous information networks: a structural analysis approach
ACM SIGKDD Explorations Newsletter
Social influence based clustering of heterogeneous information networks
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
Heterogeneous information networks that contain multiple types of objects and links are ubiquitous in the real world, such as bibliographic networks, cyber-physical networks, and social media networks. Although researchers have studied various data mining tasks in information networks, interactive query-based network exploration techniques have not been addressed systematically, which, in fact, are highly desirable for exploring large-scale information networks. In this demo, we introduce and demonstrate our recent research project on query-driven discovery of semantically similar substructures in heterogeneous networks. Given a subgraph query, our system searches a given large information network and finds efficiently a list of subgraphs that are structurally identical and semantically similar. Since data mining methods are used to obtain semantically similar entities (nodes), we use discovery as a term to describe this process. In order to achieve high efficiency and scalability, we design and implement a filter-and verification search framework, which can first generate promising subgraph candidates using off line indices built by data mining results, and then verify candidates with a recursive pruning matching process. The proposed system demonstrates the effectiveness of our query-driven semantic similarity search framework and the efficiency of the proposed methodology on multiple real-world heterogeneous information networks.