EAAC+语音编码算法的研究与实现 .pptVIP

2. Problem Definition Contents 4. Experimental Results 1. Introduction 3. Optimization Techniques Experimental Studies Hardware 2.0GHz Pentium R Dual-Core / 2GB RAM Windows Vista OS / Visual C++ 6.0 Data Sets Synthetic graph with an average of 8 links per page. 10 sample adjacency matrices from 1K to 10K with ξ ～uniform[0; 16] out-links on each row. Real-life Wikipedia 3.2M articles with 110M intra-wiki links / Oct. ’07 We choose the relationship : “a category contains an article to be a link btw. the category and the article”. Experimental Studies Algorithms for Comparison SimRank with partial sums. [VLDB ’10] SOR SimRank. [APWEB ’10] AUG SimRank. ＆ Parallel AUG SimRank. Evaluation Measures CPU time : computational complexity absolute speedup : parallel efficiency Parameter Settings c 0.8, ω 1.3, ? 0.05 p number of processors T1 execution time of the sequential algorithm on one processor Tp time taken on p processors Time Ef?ciency Evaluation Time Ef?ciency Evaluation Time Ef?ciency Evaluation Time Ef?ciency Evaluation Time Ef?ciency Evaluation Parallel Efficiency Evaluation Parallel Efficiency Evaluation Efficient and Parallel SimRank Optimizations on Undirected Graphs Your LOGO Weiren Yu1, Jiajin Le2, Xuemin Lin1, Wenjie Zhang1 On the Efficiency of Estimating Penetrating Rank on Large Graphs 1 University of New South Wales NICTA, Australia 2 Donghua University, China SSDBM 2012 2. Problem Definition Contents 4. Experimental Results 1. Introduction 3. Optimization Techniques P-Rank : A New Link-based Similarity Measure Structural Similarity Measure PageRank [Page et. al, 1999] SimRank [Jeh and Widom, KDD 02] P enetrating -Rank similarity A new promising structural measure [Zhao et. al. , CIKM 09] An extension of SimRank metrics Basic Philosophy Two entities are similar, if 1 they are referenced by similar entities 2 they reference similar entities P-Rank Overview Features Avoiding “limited information problem” of SimRank