Abstract
We discuss issues raised by applying von Neumann kernels to graphs with multiple communities. Depending on the parameter setting, Kandola et al.’s von Neumann kernels can identify not only nodes related to a given node but also the most important nodes in a graph. However, when von Neumann kernels are biased towards importance, top-ranked nodes are the important nodes in the dominant community of the graph irrespective of the communities where the target node belongs. To solve this “topic-drift” problem, we apply von Neumann kernels to the weighted graphs (community graph), which are derived from a generative model of links.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM, 604–632 (1999)
Small, H.: Co-citation in the scientific literature: a new measure of the relationship between two documents. J. American Society for Information Science 24, 265–269 (1973)
Ito, T., Shimbo, M., Kudo, T., Matsumoto, Y.: Application of kernels to link analysis. In: Proc. 11th ACM SIGKDD, pp. 586–592 (2005)
Kandola, J., Shawe-Taylor, J., Cristianini, N.: Learning semantic similarity. NIPS 15 (2002)
Bharat, K., Henzinger, M.R.: Improved algorithms for topic distillation in a hyperlinked enviornment. In: Proc. 21st ACM SIGIR Conference (1998)
Cohn, D., Chang, H.: Learning to probabilistically identify authoritative documents. In: Proc. 18th International Conference of Machine Learning (2001)
Hofmann, T.: Learning the similarity of documents: An information-geometric approach to document retrieval and categorization. NIPS 12, 914–920 (2000)
Shimbo, M., Ito, T.: Kernels as link analysis measures. In: Cook, D., Holder, L. (eds.) Mining Graph Data. John Wiley & Sons, Chichester (2006)
Hofmann, T.: Probabilistic latent semantic indexing. In: Proc. 22th ACM SIGIR Conference, pp. 50–57 (1999)
Haussler, D.: Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, University of California at Santa Cruz (1999)
Jaakkola, T., Haussler, D.: Exploiting generative models in discriminative classifiers. In: NIPS, vol. 11 (1998)
Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet Allocation. NIPS 14 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ito, T., Shimbo, M., Mochihashi, D., Matsumoto, Y. (2006). Exploring Multiple Communities with Kernel-Based Link Analysis. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds) Knowledge Discovery in Databases: PKDD 2006. PKDD 2006. Lecture Notes in Computer Science(), vol 4213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11871637_25
Download citation
DOI: https://doi.org/10.1007/11871637_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45374-1
Online ISBN: 978-3-540-46048-0
eBook Packages: Computer ScienceComputer Science (R0)