Application of kernels to link analysis

Authors:
Takahiko Ito;Masashi Shimbo;Taku Kudo;Yuji Matsumoto
Affiliations:
Nara Institute of Science and Technology, Ikoma, Nara, Japan;Nara Institute of Science and Technology, Ikoma, Nara, Japan;Nara Institute of Science and Technology, Ikoma, Nara, Japan;Nara Institute of Science and Technology, Ikoma, Nara, Japan
Venue:
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Year:
2005

Citing 5
Cited 22

The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
Diffusion Kernels on Graphs and Other Discrete Input Spaces

ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Comparing Top k Lists

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

Evaluation of kernel-based link analysis measures on research paper recommendation

Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries
Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation

IEEE Transactions on Knowledge and Data Engineering
Diffusion and graph spectral methods for network forensic analysis

NSPW '06 Proceedings of the 2006 workshop on New security paradigms
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances

Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Credit scoring algorithm based on link analysis ranking with support vector machine

Expert Systems with Applications: An International Journal
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study

Data & Knowledge Engineering
On the properties of von Neumann kernels for link analysis

Machine Learning
The slashdot zoo: mining a social network with negative edges

Proceedings of the 18th international conference on World wide web
Learning spectral graph transformations for link prediction

ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Graph-based analysis of semantic drift in Espresso-like bootstrapping algorithms

EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Enhancing link-based similarity through the use of non-numerical labels and prior information

Proceedings of the Eighth Workshop on Mining and Learning with Graphs
The link prediction problem in bipartite networks

IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Semi-supervised classification and betweenness computation on large, sparse, directed graphs

Pattern Recognition
Link prediction: the power of maximal entropy random walk

Proceedings of the 20th ACM international conference on Information and knowledge management
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
One-Class support vector machines for recommendation tasks

PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Directed laplacian kernels for link analysis

IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification

Neural Networks
Interest prediction on multinomial, time-evolving social graphs

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Predicting positive and negative links in signed social networks by transfer learning

Proceedings of the 22nd international conference on World Wide Web
Co-occurrence prediction in a large location-based social network

Frontiers of Computer Science: Selected Publications from Chinese Universities
Prediction in a microblog hybrid network using bonacich potential

Proceedings of the 7th ACM international conference on Web search and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

The application of kernel methods to link analysis is explored. In particular, Kandola et al.'s Neumann kernels are shown to subsume not only the co-citation and bibliographic coupling relatedness but also Kleinberg's HITS importance. These popular measures of relatedness and importance correspond to the Neumann kernels at the extremes of their parameter range, and hence these kernels can be interpreted as defining a spectrum of link analysis measures intermediate between co-citation/bibliographic coupling and HITS. We also show that the kernels based on the graph Laplacian, including the regularized Laplacian and diffusion kernels, provide relatedness measures that overcome some limitations of co-citation relatedness. The property of these kernel-based link analysis measures is examined with a network of bibliographic citations. Practical issues in applying these methods to real data are discussed, and possible solutions are proposed.