pr-presentation

pr-presentation - Mining Web Multi-resolution...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Mining Web Multi-resolution Community-based Popularity for Information Retrieval Laurence A. F. Park Kotagiri Ramamohanarao Department of Computer Science and Software Engineering University of Melbourne, Australia {lapark,rao}@csse.unimelb.edu.au ACM Sixteenth Conference on Information and Knowledge Management Multi-resolution popularity Computing multi-resolution popularity Using multi-resolution popularity Conclusion Global popularity PageRank is a measure of global Web popularity. It uses the consensus of the entire Web to compute page popularity. Therefore it is suited to general queries. Problem Speed queries require consensus from speed communities, therefore are not suited to PageRank. 1 How do we compute a popularity list relative to a community? 2 How do we choose a list at query time? Park, Ramamohanarao Multi-resolution Community-based Popularity Multi-resolution popularity Computing multi-resolution popularity Using multi-resolution popularity Conclusion Outline 1 Multi-resolution popularity 2 Computing multi-resolution popularity Pageranks many solutions Symmetric non-negative matrix factorisation SNMF 1- PageRank equivalence Computing community popularity using SNMF 3 Using multi-resolution popularity Query independent selection Oracle selection Rank based selection Score based selection 4 Conclusion Park, Ramamohanarao Multi-resolution Community-based Popularity Multi-resolution popularity Computing multi-resolution popularity Using multi-resolution popularity Conclusion Outline 1 Multi-resolution popularity 2 Computing multi-resolution popularity Pageranks many solutions Symmetric non-negative matrix factorisation SNMF 1- PageRank equivalence Computing community popularity using SNMF 3 Using multi-resolution popularity Query independent selection Oracle selection Rank based selection Score based selection 4 Conclusion Park, Ramamohanarao Multi-resolution Community-based Popularity Multi-resolution popularity Computing multi-resolution popularity Using multi-resolution popularity Conclusion Lowest resolution (Global Popularity) Where can I buy a CD? General queries can use the consensus of the whole community (e.g. K-mart). Park, Ramamohanarao Multi-resolution Community-based Popularity Multi-resolution popularity Computing multi-resolution popularity Using multi-resolution popularity Conclusion Medium resolution Where can I buy a movie soundtrack CD? Specific queries cannot be answered by the general public and require specific knowledge (e.g. HMV)....
View Full Document

Page1 / 34

pr-presentation - Mining Web Multi-resolution...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online