摘要(英) |
The recent online social network tools and services on the Internet are extremely popular. Through the online social networks, users can create personal online communities in which users can interact with each other of the same interest. Instant Messenger (IM) can also be regarded as one of social network services. In IM, each user can build the list of contacts such that two or more persons in the list can initialize instant text messaging, voice chatting and file transfering. The Instant Messenger network is one of the largest digital social networks with a lot of online human resources. In daily life and work, we often face many questions (problems), and/or have interest in something unknown. We would like to know the answers to the questions or consult the suggestions of others. Although search engines, web-based forums, and inquiries to friends via e-mails or instant messenger are all methods we can use today for seeking answers to the questions, in many cases, much time is still spent to search, organize, or wait for responses. If knowledgable online IM user can be handily found to answer questions in real-time, then the time spent to browse webpages, wait for forum responses, or inquire may be dramatically reduced. In this thesis, we propose an answer-finding system (IM Finder) that helps people accurately find knowledgable online users to answer questions in real-time via the social network based on Instant Messenger’’s contacts. Users share successful experiences of finding responders to achieve greater efficiency when seeking answers to questions. System relies on similarity measures between historic and new questions asked, and the trust among mutual friends, to provide timely and accurate mechanism of multi-hop question relay through contacts to find appropriate IM online users to answer questions interactively.
|
參考文獻 |
[1] http://tw.msn.com/.
[2] http://www.google.com/talk/intl/zh-TW/.
[3] http://www.aol.com/main.adp?adp=1.
[4] http://tw.knowledge.yahoo.com/.
[5] http://www.gnutella.com.
[6] http://en.wikipedia.org/wiki/Pidgin.
[7] http://www.cygwin.com/.
[8] Facebook. http://www.facebook.com, 2007.
[9] Myspace. http://www.myspace.com, 2007.
[10] Pidgin. http://pidgin.im/, 2007.
[11] L.A. Adamic and Adar. E. How to search a social network. In Social Networks,2005.
[12] B.Cohen. Incentives build robustness in bittorrent. In Economics of Peer-to-Peer
Systems, 2003.
[13] B.Yang and H.Garcia-Molina. Improving search in peer-to-peer networks. In
Distributed Computing systems, 2002.
[14] E.Cohen K.Li and S C.Lv, P.Cao. Search and replication in unstructured peer-to-
peer networks. In International Conference on Supercomputing, 2002.
[15] D.Tsoumakos and N.Roussopoulos. Adaptive probabilistic search (aps) for peer-
to-peer networks. In Peer-to-Peer Computing, 2003.
[16] R. Farmer. Instant messaging – collaborative tool or educator’s nightmare!
In The North American Web-based Learning Conference, 2003.
[17] L. Yenta Foner. A multi-agent, referral based matchmaking system. In
International Conference on Autonomous Agents, 1997.
[18] M Van Alstyne J Zhang. Swim: fostering social network based information search.
In Conference on Human Factors in Computing Systems, 2004.
[19] A Goncalves C Denham J Zhu, M Eisenstadt. Buddyfinder-corder: Leveraging social
networks for matchmaking by opportunistic discovery. In Semantic Web Conference,
2005.
[20] S.Mackin. L.Liu, N.Antonopoulos. Social peer-to-peer for resource discovery. In
Parallel, Distributed and Network-Based Processing, 2007.
[21] D. W. McDonald and M.S Ackerman. Expertise recommender: A flexible
recommendation architecture. In Computer-Supported Cooperative Work, 2000.
[22] Stanley Milgram. The small world problem. Psychology Today., 1(1):60–67, 1967.
[23] G.A. Miller. Wordnet: A lexical database for english. In Communications of the ACM,
1995.
[24] M.Stokes. Gnutella2 specifications part one:
http://www.gnutella2.com/gnutella2 search.htm. 2002.
[25] Frederic Dang Ngoc, Joaquin Keller, and Gwendal Simon. Maay: A decentralized
personalized search system. In International Symposium on Applications and the
Internet, 2006.
[26] J.A. Pouwelse, P. Garbacki, J. Wang, A. Bakker, J.Yang, A. Iosup, D.H.J. Epema,
M. Reinders, M. van Steen, and H.J. Sips. Tribler: A social-based peer-to-peer
system. In The 5th International Workshop on Peer-to-Peer Systems, 2006.
[27] E.Cohen K.Li Q.Lv, P.Cao and S.Shenker. Search and replication in unstructured
peer-to-peer networks. In 16th ACM International Conference on Supercomputing,
2002.
[28] X Zhang H Wang. S Jiang, L Guo. Lightflood: Minimizing redundant messages and
maximizing the scope of peer-to-peer search. IEEE TRANSACTIONS ON
PARALLEL AND DISTRIBUTED SYSTEMS.,19(5):601–614, 2008.
[29] S.Daswani and A.Fisk. Gnutella udp extension for scalable searches (guess) v0.1.
2002.
[30] D.Gunopulos V.Kalogeraki and D.Zeinalipour-Yazti. A local search mechanism for
peer-to-peer networks. In international conference on Information and knowledge
management, 2002.
[31] Faust K. Iacobucci D Wasserman, S. and M. Granovetter. Social network analysis:
Methods and applications. 1994.
[32] Jones Q. Terveen L Whittaker, S. Contact management: Identifying contacts to
support long-term communication. In ACM Conference on Computer Supported
Cooperative Work, 2002.
[33] B. Yu and M.P. Singh. Searching social networks. In Second International Joint
Conference on Autonomous Agents and Multi-Agent Systems, 2003.
[34] Zuhair A. Bandar James D. O’Shea Keeley Crockett Yuhua Li, David McLean.
Sentence similarity based on semantic nets and corpus statistics. IEEE Transactions
on Knowledge and Data Engineering., 18(8):1138–1150, 2006.
|