Alvaro Graves SemRank Shangguan

Question is for the Presentation: Alvaro Graves SemRank
Question is asked by: Zhenning Shangguan
The Question is: Computation Complexity Issues. Please note that this question may be outside of the scope of this paper (possibly due to space limit. I'm a little interested in the computation complexity of the method proposed in this paper. As we know, response time will be the key to any search engines, and thus the key to ranking algorithms. But it seems to me that the author did not include this part in the paper -the only empirical results presented in this paper were used to prove that the SemRank method works as expected. And also, given the complexity of SemRank, it will be possible for us to figure out whether it scales well or not.

Question asked	Computation Complexity Issues. Please note … Computation Complexity Issues. Please note that this question may be outside of the scope of this paper (possibly due to space limit. I'm a little interested in the computation complexity of the method proposed in this paper. As we know, response time will be the key to any search engines, and thus the key to ranking algorithms. But it seems to me that the author did not include this part in the paper -the only empirical results presented in this paper were used to prove that the SemRank method works as expected. And also, given the complexity of SemRank, it will be possible for us to figure out whether it scales well or not. figure out whether it scales well or not.
Question asked by	Zhenning Shangguan +
Question for the Presentation	Alvaro Graves SemRank +