Be the first to like this
Authors: Vacharasintopchai, Thiti and Nguyen-Huu, Phong
Issue Date: 11-Dec-2009
Series/Report no.: Proc. 2nd International Conference on Robotics, Informatics, and Intelligent Technology (RIIT2009);
Abstract: Social networks offer incredible opportunities for users to create contents and share their experiences. The number of users joining these social networks has been rising dramatically. However, in a social network several users may share the same name. This causes name ambiguity in which search engine returns homogeneous search results for each queried name. To solve this problem we propose an approach to improve search results for finding friends within a large social network by using friendships among users as our backbone feature. Our approach finds most ranked seeds by using PageRank algorithm before computing approximate shortest path in a directed graph. We also retrieve real data from the social network Twitter to verify our approach. Results show that our approach outperforms the SeedBase approach which selects seeds randomly with large margin.