[WWW 2015] Discovering Meta-Paths in Large Heterogeneous Information Networks
http://pierre.senellart.com/publications/meng2015discovering.pdf
This paper is to search and discover meta-path. The definition of meta-path is a sequence of node classes. Authors of this paper provides a way to discover candidate paths using greedy-search and node class generation. It could generate meta-path in a more efficient way, but I am suspicious of how the problem itself is meaningful to solve and prove its effectiveness. For example, it looks that if we have select any sequences of a topic, it would be relevant. They could be more relevant than others ? Of course, it can be, but I think it is really dependent on its context, and hard to distinguish against simple algorithm. Its p-value (0.09) from t-test against random selection shows the evidence.














