Supervised hypothesis discovery using syllogistic patterns in the biomedical literature
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
The cover times of random walks on random uniform hypergraphs
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we address an interesting data mining problem of finding semantically associated item sets, i.e., items connected via indirect links. We propose a novel method for discovering semantically associated item sets based on a hyper graph representation of the database. We describe two similarity measures to compute the strength of associations between items. Specifically, we introduce the average commute time similarity, $\mathbf{s_{CT}}$, based on the random walk model on hyper graph, and the inner-product similarity, $\mathbf{s_{L+}}$, based on the Moore-Penrose pseudoinverse of the hyper graph Laplacian matrix. Given semantically associated 2-itemsets generated by these measures, we design a hyper graph expansion method with two search strategies, namely, the clique and connected component search, to generate $k$-item sets ($k2$). We show the proposed method is indeed capable of capturing semantically associated item sets through experiments performed on three datasets ranging from low to high dimensionality. The semantically associated item sets discovered in our experiment is promising to provide valuable insights on interrelationship between medical concepts and other domain specific concepts.