ACM Home Page
Please provide us with feedback. Feedback
CubeSVD: a novel approach to personalized Web search
Full text PdfPdf (361 KB)
Source International World Wide Web Conference archive
Proceedings of the 14th international conference on World Wide Web table of contents
Chiba, Japan
SESSION: User-focused search and crawling table of contents
Pages: 382 - 390  
Year of Publication: 2005
ISBN:1-59593-046-9
Authors
Jian-Tao Sun  TsingHua University, Beijing, China
Hua-Jun Zeng  Microsoft Research Asia, Beijing, China
Huan Liu  Arizona State University, Tempe, AZ
Yuchang Lu  TsingHua University, Beijing, China
Zheng Chen  Microsoft Research Asia, Beijing, China
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 125,   Citation Count: 29
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

As the competition of Web search market increases, there is a high demand for personalized Web search to conduct retrieval incorporating Web users' information needs. This paper focuses on utilizing clickthrough data to improve Web search. Since millions of searches are conducted everyday, a search engine accumulates a large volume of clickthrough data, which records who submits queries and which pages he/she clicks on. The clickthrough data is highly sparse and contains different types of objects (user, query and Web page), and the relationships among these objects are also very complicated. By performing analysis on these data, we attempt to discover Web users' interests and the patterns that users locate information. In this paper, a novel approach CubeSVD is proposed to improve Web search. The clickthrough data is represented by a 3-order tensor, on which we perform 3-mode analysis using the higher-order singular value decomposition technique to automatically capture the latent factors that govern the relations among these multi-type objects: users, queries and Web pages. A tensor reconstructed based on the CubeSVD analysis reflects both the observed interactions among these objects and the implicit associations among them. Therefore, Web search activities can be carried out based on CubeSVD analysis. Experimental evaluations using a real-world data set collected from an MSN search engine show that CubeSVD achieves encouraging search results in comparison with some standard methods.


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
Google personalized search. http://labs.google.com/personalized.
 
2
My yahoo! http://my.yahoo.com/?myhome.
 
3
4
 
5
 
6
J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the Fourteenth Annual Conference on Uncertainty in Artificial Intelligence, pages 43--52. Morgan Kaufman, 1998.
 
7
S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391--407, 1990.
8
 
9
10
11
 
12
13
14
 
15
16
 
17
 
18
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
19
 
20
 
21
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Application of dimensionality reduction in recommender systems-a case study, 2000.
 
22
N. Srebro and T. Jaakkola. Weighted low-rank approximations. In Proceedings of the 12th International Conference on Machine Learning, pages 720--727. AAAI Press, 2003.
23
 
24
M. A. O. Vasilescu and D. Terzopoulos. Multilinear image analysis for facial recognition. In ICPR, pages 511--514, 2002.
25

CITED BY  29

Collaborative Colleagues:
Jian-Tao Sun: colleagues
Hua-Jun Zeng: colleagues
Huan Liu: colleagues
Yuchang Lu: colleagues
Zheng Chen: colleagues