Tag-based social interest discovery
Published 21 April 2008
Xin Li, Lei Guo, Yihong Eric Zhao
Citations335
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An Internet Social Interest Discovery system, ISID, to discover the common user interests and cluster users and their saved URLs by different interest topics, and shows that ISID can effectively cluster similar documents by interest topics and discover user communities with common interests no matter if they have any online connections.
Abstract
The success and popularity of social network systems, such as del.icio.us, Facebook, MySpace, and YouTube, have generated many interesting and challenging problems to the research community. Among others, discovering social interests shared by groups of users is very important because it helps to connect people with common interests and encourages people to contribute and share more contents. The main challenge to solving this problem comes from the difficulty of detecting and representing the interest of the users. The existing approaches are all based on the online connections of users and so unable to identify the common interest of users who have no online connections.
Keywords
Social SciencesComputer SciencePhysics and Astronomy
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Physical Review EFinding community structure in very large networks
7,484 Citations2004Aaron Clauset, M. E. J. Newman +1 more
A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure.
Web caching and Zipf-like distributions: evidence and implications
3,486 Citations1999Lee Breslau, Pei Cao +3 more
This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies.
Journal of Information ScienceUsage patterns of collaborative tagging systems
1,830 Citations2006Scott A. Golder, Bernardo A. Huberman
A dynamic model of collaborative tagging is presented that predicts regularities in user activity, tag frequencies, kinds of tags used, bursts of popularity in bookmarking and a remarkable stability in the relative proportions of tags within a given URL.
The complex dynamics of collaborative tagging
611 Citations2007Harry Halpin, Valentin Robu +1 more
A generative model of collaborative tagging is produced in order to understand the basic dynamics behind tagging, including how a power law distribution of tags could arise and how tag co-occurrence networks for a sample domain of tags can be used to analyze the meaning of particular tags given their relationship to other tags.
Efficient content location using interest-based locality in peer-to-peer systems
582 Citations2004Kunwadee Sripanidkulchai, Bruce M. Maggs +1 more
This work proposes a content location solution in which peers loosely organize themselves into an interest- based structure on top of the existing Gnutella network, and demonstrates the existence of interest-based locality in five diverse traces of content distribution applications, two of which are traces of popular peer-to-peer file-sharing applications.
Exploring social annotations for the semantic web
377 Citations2006Xian Wu, Lei Zhang +1 more
This paper explores a complement approach that focuses on the "social annotations of the web" which are annotations manually made by normal web users without a pre-defined formal ontology, and shows how emergent semantics can be statistically derived from the social annotations.
Improved annotation of the blogosphere via autotagging and hierarchical clustering
304 Citations2006Christopher Brooks, Nancy Montanez
It is found that tags are useful for grouping articles into broad categories, but less effective in indicating the particular content of an article, and clustering algorithms can be used to reconstruct a topical hierarchy among tags.
Communications of the ACMDiscovering shared interests using graph analysis
216 Citations1993Michael F. Schwartz, David C. Wood
A different approach is considered, which deduces shared-interest relationships between people based on the history of email communication, using a set of heuristic graph algorithms that are powerful and can threaten privacy.
Expressing Social Relationships on the Blog through Links and Comments.
142 Citations2007Noor Ali-Hasan, Lada A. Adamic
A study of bloggers’ online and real life relationships in three blog communities: Kuwait Blogs, Dallas/Fort Worth blogs, and United Arab Emirates Blogs finds different characteristics for different kinds of links.
Applying Collaborative Tagging to E-Learning
88 Citations2007Scott Bateman, Christopher Brooks +2 more
It is argued that the social collection phenomena and flexible metadata standards are key in collecting the kinds of metadata required for adaptable online learning.
arXiv (Cornell University)Exploiting Social Annotation for Automatic Resource Discovery
35 Citations2007Anon Plangprasopchok, Kristina Lerman
A probabilistic model of the user annotation process in a social bookmarking system del.icio.us is described and results show this approach as a promising method for helping automate the resource discovery task.
Journal of Parallel and Distributed ComputingFast and low-cost search schemes by exploiting localities in P2P networks
28 Citations2005Lei Guo, Song Jiang +2 more
This work proposes content-abundant cluster-selectively prefetching indices from responding peers (CAC-SPIRP), a fast and low-cost P2P searching algorithm that significantly improves the overall performance from both client's perspective and Internet management perspective.