AGENTS '98 Proceedings of the second international conference on Autonomous agents
Improved algorithms for topic distillation in a hyperlinked environment
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Probabilistic latent semantic indexing
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Exploiting generative models in discriminative classifiers
Proceedings of the 1998 conference on Advances in neural information processing systems II
Unsupervised learning by probabilistic latent semantic analysis
Machine Learning
SALSA: the stochastic approach for link-structure analysis
ACM Transactions on Information Systems (TOIS)
Handbook of Natural Language Processing
Handbook of Natural Language Processing
ACM Computing Surveys (CSUR)
Diffusion Kernels on Graphs and Other Discrete Input Spaces
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Learning to Probabilistically Identify Authoritative Documents
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
SIAM Journal on Discrete Mathematics
Algorithms for estimating relative importance in networks
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
Application of kernels to link analysis
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Evaluation of kernel-based link analysis measures on research paper recommendation
Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries
IEEE Transactions on Knowledge and Data Engineering
Exploring multiple communities with kernel-based link analysis
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
Discrete Applied Mathematics
Kernels for link prediction with latent feature models
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
| Hi-index | 0.00 |
We study the effectiveness of Kandola et al.'s von Neumann kernels as a link analysis measure. We show that von Neumann kernels subsume Kleinberg's HITS importance at the limit of their parameter range. Because they reduce to co-citation relatedness at the other end of the parameter, von Neumann kernels give us a spectrum of link analysis measures between the two established measures of importance and relatedness. Hence the relative merit of a vertex can be evaluated in terms of varying trade-offs between the global importance and the local relatedness within a single parametric framework. As a generalization of HITS, von Neumann kernels inherit the problem of topic drift. When a graph consists of multiple communities each representing a different topic, HITS is known to rank vertices in the most dominant community higher regardless of the query term. This problem persists in von Neumann kernels; when the parameter is biased towards the direction of global importance, they tend to rank vertices in the dominant community uniformly higher irrespective of the community of the seed vertex relative to which the ranking is computed. To alleviate topic drift, we propose to use of a PLSI-based technique in combination with von Neumann kernels. Experimental results on a citation network of scientific papers demonstrate the characteristics and effectiveness of von Neumann kernels.