부산대학교 도서관

The present paper focuses on similar contents discovery in which an agent discovers similar contents while visiting nodes on a network, and investigates how quickly the random walk on a graph can discover similar contents. To this end, we introduce a performance metric for the similar contents discovery, the s-content discovery time, which is defined as the time taken to discover a content whose similarity is larger than or equal to given similarity s; we also present preliminary simulation results. As a consequence, we reveal that the s-content discovery time is significantly affected by similarity s and also give an observation concerning the cause of increase in the s-content discovery time.