Browse > Article
http://dx.doi.org/10.7840/kics.2013.38B.5.385

Topic Sensitive_Social Relation Rank Algorithm for Efficient Social Search  

Kim, Young-An (국방대학교 국방과학학과)
Park, Gun-Woo (육군본부)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.38B, no.5, 2013 , pp. 385-393 More about this Journal
Abstract
In the past decade, a paradigm shift from machine-centered to human-centered and from technology-driven to user-driven has been witnessed. Consequently, Social search is getting more social and Social Network Service (SNS) is a popular Web service to connect and/or find friends, and the tendency of users interests often affects his/her who have similar interests. If we can track users' preferences in certain boundaries in terms of Web search and/or knowledge sharing, we can find more relevant information for users. In this paper, we propose a novel Topic Sensitive_Social Relationship Rank (TS_SRR) algorithm. We propose enhanced Web searching idea by finding similar and credible users in a Social Network incorporating social information in Web search. The Social Relation Rank between users are Social Relation Value, that is, for a different topics, a different subset of the above attributes is used to measure the Social Relation Rank. We observe that a user has a certain common interest with his/her credible friends in a Social Network, then focus on the problem of identifying users who have similar interests and high credibility, and sharing their search experiences. Thus, the proposed algorithm can make social search improve one step forward.
Keywords
Social Search; Topic; Social Relation Rank; Similar; Credible;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 E. Spertus, M. Sahami, and O. Buyukkokten., "Evaluating similarity measures: A large-scale study in the Orkut social newtork," in Proc. 11th ACM Int. Conf. Knowledge Discovery in Data mining (ACM SIGKDD), pp. 678-684, Chicago, U.S.A., Aug. 2005.
2 C. Dwyer, S. R. Hiltz, and K. Passerini., "Trust and privacy: A comparison of Facebook and MySpace," in Proc. 13th Amer. Conf. Inform. Syst. (AMCIS), paper 339, Keystone, U.S.A., 2007.
3 F. Yasuhiro, N. Makoto, and Y. Takeshi, "Efficient personalized pagerank with accuracy assurance," in Proc. 18th ACM Int. Conf. Knowledge Discover and Data Mining (SIGKDD 2012), pp. 15-23, Beijing, China, Aug. 2012.
4 S. Hatakenaka and T. Miura, "Query and topic sensitive pagerank for general documents," in Proc. 14th IEEE Int. Symp. Web Syst. Evolution(WSE), pp. 97-101, Trento, Italy, Sep. 2012.
5 Y. Zeng, H. Hao, N. Zhong, X. Ren, and Y. Wang, "Ranking and Combining Social network data for web personalization," in Proc. 21th ACM Conf. Inform. Knowledge Manage. (CIKM 2012), pp. 15-18, Maui, U.S.A., Oct. 2012.
6 Y. H. Kim, Social Network Analysis, ParkYoung Company, 2003.
7 J. S. Kim, "Human Network," Policy of Inform. Commun., vol. 16, no. 16, pp. 1-19, Sep. 2004.
8 E. Lessor, D. Ransom, R. Sbab, and B. Pulver, "IBM collective intelligence white paper," IBM Global Business Service, Jan. 2012.
9 Y. A. Kim, S. G. Park, and S. H. Lee, "Design of efficient web search system based on reliable online community," J. KICS, vol. 37B, no. 1, pp. 67-74, Jan. 2012.   과학기술학회마을   DOI   ScienceOn
10 M. V. Vieira, B. M. Fonseca, R. Damazio, P. B. Golgher, D. C. Reis, and B. R.-Neto, "Efficient search ranking in social networks," in Proc. 16th ACM Conf. Inform. Knowledge Manage. (CIKM 2007), pp. 563-572, Lisbon, Portugal, Nov. 2007.
11 A. Mohan, Z. Chen, and K. Weinberger, "Web-search ranking with initialized gradient boosted regression trees", in Proc. JMLR Workshop and Conf. Proc., vol. 14, pp. 77-89, Haifa, Israel, June 2011.