Scaling personalized web search
WWW '03 Proceedings of the 12th international conference on World Wide Web
Hourly analysis of a very large topically categorized web query log
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Automatic multimedia cross-modal correlation discovery
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Usage-Based PageRank for Web Personalization
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Google's PageRank and Beyond: The Science of Search Engine Rankings
Google's PageRank and Beyond: The Science of Search Engine Rankings
Minimal test collections for retrieval evaluation
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Fast Random Walk with Restart and Its Applications
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
RankMass crawler: a crawler with high personalized pagerank coverage guarantee
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Personalized PageRank for Web Page Prediction Based on Access Time-Length and Frequency
WI '07 Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence
LabelMe: A Database and Web-Based Tool for Image Annotation
International Journal of Computer Vision
Fast algorithms for topk personalized pagerank queries
Proceedings of the 17th international conference on World Wide Web
Word sense disambiguation: A survey
ACM Computing Surveys (CSUR)
Personalizing PageRank for word sense disambiguation
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Using current web page structure to improve prefetching performance
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast incremental and personalized PageRank
Proceedings of the VLDB Endowment
Fast personalized PageRank on MapReduce
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Index design and query processing for graph conductance search
The VLDB Journal — The International Journal on Very Large Data Bases
Mining large graphs: Algorithms, inference, and discoveries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Quick detection of top-k personalized pagerank lists
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Fast and exact top-k search for random walk with restart
Proceedings of the VLDB Endowment
SCARAB: scaling reachability computation on large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Fast algorithm for affinity propagation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
User similarity from linked taxonomies: subjective assessments of items
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Efficient personalized pagerank with accuracy assurance
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Collaborative filtering by analyzing dynamic user interests modeled by taxonomy
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
| Hi-index | 0.00 |
Personalized PageRank (PPR) has been successfully applied to various applications. In real applications, it is important to set PPR parameters in an ad-hoc manner when finding similar nodes because of dynamically changing nature of graphs. Through interactive actions, interactive similarity search supports users to enhance the efficacy of applications. Unfortunately, if the graph is large, interactive similarity search is infeasible due to its high computation cost. Previous PPR approaches cannot effectively handle interactive similarity search since they need precomputation or approximate computation of similarities. The goal of this paper is to efficiently find the top-k nodes with exact node ranking so as to effectively support interactive similarity search based on PPR. Our solution is Castanet. The key Castanet operations are (1) estimate upper/lower bounding similarities iteratively, and (2) prune unnecessary nodes dynamically to obtain top-k nodes in each iteration. Experiments show that our approach is much faster than existing approaches.