ACM Home Page
Please provide us with feedback. Feedback
Efficient computation of personal aggregate queries on blogs
Full text PdfPdf (691 KB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Las Vegas, Nevada, USA
SESSION: Research papers table of contents
Pages 632-640  
Year of Publication: 2008
ISBN:978-1-60558-193-4
Authors
Ka Cheung Sia  University of California, Los Angles, Los Angeles, CA, USA
Junghoo Cho  University of California, Los Angles, Los Angeles, CA, USA
Yun Chi  NEC Labs America, Cupertino, CA, USA
Belle L. Tseng  Yahoo! Inc., Sunnyvale, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 40,   Downloads (12 Months): 286,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1401890.1401967
What is a DOI?

ABSTRACT

There is an exploding amount of user-generated content on theWeb due to the emergence of "Web 2.0" services, such as Blogger,MySpace, Flickr, and del.icio.us. The participation of a large number of users in sharing their opinion on the Web has inspired researchers to build an effective "information filter" by aggregating these independent opinions. However, given the diverse groups of users on the Web nowadays, the global aggregation of the information may not be of much interest to different groups of users. In this paper, we explore the possibility of computing personalized aggregation over the opinions expressed on the Web based on a user's indication of trust over the information sources. The hope is that by employing such "personalized" aggregation, we can make the recommendation more likely to be interesting to the users. We address the challenging scalability issues by proposing an efficient method, that utilizes two core techniques: Non-Negative Matrix Factorization and Threshold Algorithm, to compute personalized aggregations when there are potentially millions of users and millions of sources within a system. We show that, through experiments on real-life dataset, our personalized aggregation approach indeed makes a significant difference in the items that are recommended and it reduces the query computational cost significantly, often more than 75%, while the result of personalized aggregation is kept accurate enough.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Akshay Java, Pranam Kolari, Tim Finin, Anupam Joshi, and Tim Oates. Feeds That Matters: A Study of Bloglines Subscriptions. In ICWSM, Boulder, Colorado, USA, March 2007.
 
3
Bloglines. http://www.bloglines.com.
 
4
Natalie S. Glance, Matthew Hurst, and Takashi Tomokiyo. BlogPulse: Automated Trend Discovery for Weblogs. In WWW Conference, 2004.
5
6
7
8
9
10
11
12
 
13
Huiming Qu and Alexandros Labrinidis. Preference-Aware Query and Update Scheduling in Web-databases. In ICDE Conference, 2007.
 
14
15
16
 
17
 
18
19
20

Collaborative Colleagues:
Ka Cheung Sia: colleagues
Junghoo Cho: colleagues
Yun Chi: colleagues
Belle L. Tseng: colleagues