Criteria for cluster-based personalized search

DOI10.1080/15427951.2009.10390647MaRDI QIDQ5388293zbMATH OpenOpenAlexFDO

Authors Hyun Chul Lee, Allan Borodin

Publication date 18 April 2012

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1318269504

zbMATH Keywords

document clusteringspersonalized ranking algorithmspersonalized web-ranking algorithms

Mathematics Subject Classification ID

Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Internet topics (68M11)

Recommendations

• Cluster Based Personalized Search
• Algorithms and Models for the Web-Graph
• Approximating Personalized PageRank with Minimal Use of Web Graph Data
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
• A Survey on PageRank Computing

Cited in

(3)

• Adaptive pagerank algorithm search strategy for specific topics
• Algorithms and Models for the Web-Graph
• Cluster Based Personalized Search

This page was built for publication: Criteria for cluster-based personalized search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388293)