Scalable Name Disambiguation using Multi-level Graph Partition
暂无分享,去创建一个
[1] C. Lee Giles,et al. Two supervised learning approaches for name disambiguation in author citations , 2004, Proceedings of the 2004 Joint ACM/IEEE Conference on Digital Libraries, 2004..
[2] Jianbo Shi,et al. A Random Walks View of Spectral Segmentation , 2001, AISTATS.
[3] Naftali Tishby,et al. Unsupervised document classification using sequential information maximization , 2002, SIGIR '02.
[4] Andrew McCallum,et al. Disambiguating Web appearances of people in a social network , 2005, WWW '05.
[5] Lie Wang,et al. Towards a fast implementation of spectral nested dissection , 1992, Proceedings Supercomputing '92.
[6] Jianbo Shi,et al. Multiclass spectral clustering , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[7] Pradeep Ravikumar,et al. A Comparison of String Distance Metrics for Name-Matching Tasks , 2003, IIWeb.
[8] Bruce Hendrickson,et al. An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..
[9] Bradley Malin,et al. Unsupervised Name Disambiguation via Social Network Similarity , 2005 .
[10] Inderjit S. Dhillon,et al. A fast kernel-based multilevel algorithm for graph clustering , 2005, KDD '05.
[11] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[12] Byung-Won On,et al. Effective and scalable solutions for mixed and split citation problems in digital libraries , 2005, IQIS '05.
[13] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
[14] Hui Han,et al. Name disambiguation in author citations using a K-way spectral clustering method , 2005, Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05).
[15] Alex Pothen,et al. PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .