Friend Suggestion and Friend Browsing in Web 2.0 Applications

Web 2.0 and social network applications have become increasingly popular. It is important for these applications to help users in maintaining their social networks by providing functions on friend suggestion and friend browsing. However, little study in this area has been reported in the literature. This paper proposes the design of two modules for friend suggestion and friend browsing. The first module is based on Hopfield Net spreading activation, while the second module is based on hyperbolic tree and self-organizing map. The proposed evaluation plan is also presented in the paper.

[1]  Bin Zhu,et al.  Visualizing social network concepts , 2010, Decis. Support Syst..

[2]  Lada A. Adamic,et al.  Tracking information epidemics in blogspace , 2005, The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05).

[3]  Jennifer Jie Xu,et al.  Word of Mouth Marketing through Online Social Networks , 2009, AMCIS.

[4]  Michael Chau,et al.  Comparison of Three Vertical Search Spiders , 2003, Computer.

[5]  Gerald Salton,et al.  Automatic text processing , 1988 .

[6]  Stephen G. Eick,et al.  Aspects of network visualization , 1996, IEEE Computer Graphics and Applications.

[7]  Ramana Rao,et al.  Laying out and visualizing large trees using a hyperbolic space , 1994, UIST '94.

[8]  Ramana Rao,et al.  A focus+context technique based on hyperbolic geometry for visualizing large hierarchies , 1995, CHI '95.

[9]  Ravi Kumar,et al.  On the Bursty Evolution of Blogspace , 2003, WWW '03.

[10]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Hsinchun Chen,et al.  CI Spider: a tool for competitive intelligence on the Web , 2002, Decis. Support Syst..

[12]  Jennifer Jie Xu,et al.  Mining communities and their relationships in blogs: A study of online hate groups , 2007, Int. J. Hum. Comput. Stud..

[13]  Hsinchun Chen,et al.  Personalized spiders for web search and analysis , 2001, JCDL '01.

[14]  Olivia R. Liu Sheng,et al.  ServiceFinder: A method towards enhancing service portals , 2007, TOIS.

[15]  Samuel Kaski,et al.  Self organization of a massive document collection , 2000, IEEE Trans. Neural Networks Learn. Syst..

[16]  Richard K. Belew,et al.  Adaptive information retrieval: using a connectionist representation to retrieve and learn about documents , 1989, SIGIR '89.

[17]  KumarRavi,et al.  On the Bursty Evolution of Blogspace , 2005 .

[18]  Hsinchun Chen,et al.  An algorithmic approach to concept exploration in a large knowledge network (automatic thesaurus consultation): symbolic branch-and-bound search vs. connectionist Hopfield net activation , 1995 .

[19]  H. Chen,et al.  An Algorithmic Approach to Concept Exploration in a Large Knowledge Network (Automatic Thesaurus Consultation): Symbolic Branch-and-Bound Search vs. Connectionist Hopfield Net Activation , 1995, J. Am. Soc. Inf. Sci..

[20]  Lada A. Adamic,et al.  Looking at the Blogosphere Topology through Different Lenses , 2007, ICWSM.

[21]  Lada A. Adamic,et al.  Expressing Social Relationships on the Blog through Links and Comments , 2007, ICWSM.

[22]  M. V. Velzen,et al.  Self-organizing maps , 2007 .

[23]  Hsinchun Chen,et al.  Incorporating Web Analysis Into Neural Networks: An Example in Hopfield Net Searching , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[24]  Jay F. Nunamaker,et al.  Verifying the proximity hypothesis for self-organizing maps , 1999, Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers.

[25]  Yang Xiang,et al.  Visualizing criminal relationships: comparison of a hyperbolic tree and a hierarchical list , 2005, Decis. Support Syst..