Items where author is affiliated with University of California, Santa Barbara
Number of items: 2.
and Chu, Jon-Chyuan
and Luan, Junyi
and Bai, Hongjie
and Wang, Yi
and Chang, Edward Y. Collaborative Filtering for Orkut Communities: Discovery of User Latent Behavior.
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over time, users have even greater need for effective commu- nity recommendations in order to meet more users. In this paper, we investigate two algorithms from very different do- mains and evaluate their effectiveness for personalized com- munity recommendation. First is association rule mining (ARM), which discovers associations between sets of com- munities that are shared across many users. Second is latent Dirichlet allocation (LDA), which models user-community co-occurrences using latent aspects. In comparing LDA with ARM, we are interested in discovering whether modeling low-rank latent structure is more effective for recommen- dations than directly mining rules from the observed data. We experiment on an Orkut data set consisting of 492, 104 users and 118, 002 communities. Our empirical comparisons using the top-k recommendations metric show that LDA performs consistently better than ARM for the community recommendation task when recommending a list of 4 or more communities. However, for recommendation lists of up to 3 communities, ARM is still a bit better. We analyze exam- ples of the latent information learned by LDA to explain this finding. To efficiently handle the large-scale data set, we parallelize LDA on distributed computers  and demon- strate our parallel implementation’s scalability with varying numbers of machines.
and Tatemura, Junichi
and Hsiung, Wang-Pin
and Sawires, Arsany
and Moser, Louise E. Extracting Data Records from the Web Using Tag Path Clustering.
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the ﬁrst step of this object extraction process, identiﬁes a set of Web page segments, each of which represents an individual object (e.g., a product). State-of-the-art methods suffice for simple search, but they often fail to handle more complicated or noisy Web page structures due to a key limitation – their greedy manner of identifying a list of records through pairwise comparison (i.e., similarity match) of consecutive segments. This paper introduces a new method for record extraction that captures a list of objects in a more robust way based on a holistic analysis of a Web page. The method focuses on how a distinct tag path appears repeatedly in the DOM tree of the Web document. Instead of comparing a pair of individual segments, it compares a pair of tag path occurrence patterns (called visual signals ) to estimate how likely these two tag paths represent the same list of objects. The paper introduces a similarity measure that captures how closely the visual signals appear and interleave. Clustering of tag paths is then performed based on this similarity measure, and sets of tag paths that form the structure of data records are extracted. Experiments show that this method achieves higher accuracy than previous methods.
About this site
This website has been set up for WWW2009 by Christopher Gutteridge of the University of Southampton, using our EPrints software.
We (Southampton EPrints Project) intend to preserve the files and HTML pages of this site for many years, however we will turn it into flat files for long term preservation. This means that at some point in the months after the conference the search, metadata-export, JSON interface, OAI etc. will be disabled as we "fossilize" the site. Please plan accordingly. Feel free to ask nicely for us to keep the dynamic site online longer if there's a rally good (or cool) use for it... [this has now happened, this site is now static]