標(biāo)題: Titlebook: Algorithms and Models for the Web-Graph; 7th International Wo Ravi Kumar,Dandapani Sivakumar Conference proceedings 2010 The Editor(s) (if [打印本頁] 作者: gratuity 時(shí)間: 2025-3-21 18:45
書目名稱Algorithms and Models for the Web-Graph影響因子(影響力)
書目名稱Algorithms and Models for the Web-Graph影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Models for the Web-Graph網(wǎng)絡(luò)公開度
書目名稱Algorithms and Models for the Web-Graph網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Models for the Web-Graph被引頻次
書目名稱Algorithms and Models for the Web-Graph被引頻次學(xué)科排名
書目名稱Algorithms and Models for the Web-Graph年度引用
書目名稱Algorithms and Models for the Web-Graph年度引用學(xué)科排名
書目名稱Algorithms and Models for the Web-Graph讀者反饋
書目名稱Algorithms and Models for the Web-Graph讀者反饋學(xué)科排名
作者: Lipoprotein 時(shí)間: 2025-3-21 23:55 作者: LAST 時(shí)間: 2025-3-22 00:29
Game-Theoretic Models of Information Overload in Social Networks,librium when there is a global ranking of the celebrities in terms of the quality of their updates to users. This result also generalizes to the case when there is a partial order consistent with all the linear orders of the celebrities based on their qualities to the users. Furthermore, these equil作者: Anticoagulants 時(shí)間: 2025-3-22 06:36
MedR Schriftenreihe Medizinrecht every consumer makes his product choices independent of each other and proportional to the product popularity. Hence, it appears consumers have a small a-priori propensity towards the popular or the exotic, but constructing a good model that agrees with the observed data as well as characterizing “作者: SNEER 時(shí)間: 2025-3-22 11:19 作者: 下邊深陷 時(shí)間: 2025-3-22 15:22
https://doi.org/10.1007/978-3-662-33335-8librium when there is a global ranking of the celebrities in terms of the quality of their updates to users. This result also generalizes to the case when there is a partial order consistent with all the linear orders of the celebrities based on their qualities to the users. Furthermore, these equil作者: Concrete 時(shí)間: 2025-3-22 17:23
Random Walks on Digraphs, the Generalized Digraph Laplacian and the Degree of Asymmetry,作者: alliance 時(shí)間: 2025-3-22 21:49 作者: 過濾 時(shí)間: 2025-3-23 04:56 作者: 卷發(fā) 時(shí)間: 2025-3-23 08:51
Die Gravitation am Rande der Metagalaxis,resholds for the connectivity and the emergence of the giant connected component, and show that the model gives rise to networks with a constant diameter. We also show that MAG model can produce networks with either log-normal or power-law degree distributions.作者: Nutrient 時(shí)間: 2025-3-23 11:14
https://doi.org/10.1007/978-3-662-33335-8portion of the graph and is related to techniques used in personalized PageRank computing. To test the scalability and accuracy of our algorithms we experiment with three real-world networks and find that these algorithms run in milliseconds to seconds without any preprocessing.作者: CIS 時(shí)間: 2025-3-23 15:33 作者: indigenous 時(shí)間: 2025-3-23 18:32
Modeling Traffic on the Web Graph, of individual users with the extreme variance in aggregate traffic measurements. We can thereby identify a few salient features that are necessary and sufficient to interpret Web traffic data. Beyond the descriptive and explanatory power of our model, these results may lead to improvements in Web applications such as search and crawling.作者: Chameleon 時(shí)間: 2025-3-23 22:13
Multiplicative Attribute Graph Model of Real-World Networks,resholds for the connectivity and the emergence of the giant connected component, and show that the model gives rise to networks with a constant diameter. We also show that MAG model can produce networks with either log-normal or power-law degree distributions.作者: 死亡 時(shí)間: 2025-3-24 03:49
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks,portion of the graph and is related to techniques used in personalized PageRank computing. To test the scalability and accuracy of our algorithms we experiment with three real-world networks and find that these algorithms run in milliseconds to seconds without any preprocessing.作者: Eclampsia 時(shí)間: 2025-3-24 06:41
0302-9743 in Stanford, CA, USA, in December 2010, which was co-located with the 6th International Workshop on Internet and Network Economics (WINE 2010).The 13 revised full papers and the invited paper presented were carefully reviewed and selected from 19 submissions.978-3-642-18008-8978-3-642-18009-5Series 作者: 責(zé)怪 時(shí)間: 2025-3-24 12:23
Die Verwendung des Schwefelkohlenstoffs,o examine two interrelated problems – graph sparsification and graph partitioning. We can combine the graph sparsification and the partitioning algorithms using PageRank vectors to derive an improved partitioning algorithm.作者: Vital-Signs 時(shí)間: 2025-3-24 17:22 作者: SOB 時(shí)間: 2025-3-24 19:15
,Der p?diatrische Patient und der Schwindel,hod increases the spectral gap of the random walk, and hence, accelerates convergence to the stationary distribution. The proposed method resembles PageRank but unlike PageRank preserves time-reversibility. Applying our hybrid RW to the problem of estimating degree distributions of graphs shows promising results.作者: ALIEN 時(shí)間: 2025-3-25 01:12 作者: 拋媚眼 時(shí)間: 2025-3-25 05:57 作者: Expurgate 時(shí)間: 2025-3-25 10:40
Finding and Visualizing Graph Clusters Using PageRank Optimization,ter variance measures in order to capture the graph structure according to PageRank. We then give a graph visualization algorithm for the clusters using PageRank-based coordinates. Several drawings of real-world data are given, illustrating the partition and local community structure.作者: 有機(jī)體 時(shí)間: 2025-3-25 12:29 作者: 邪惡的你 時(shí)間: 2025-3-25 18:39
The Geometric Protean Model for On-Line Social Networks,function. With high probability, the GEO-P model generates graphs satisfying many observed properties of OSNs, such as power law degree distributions, the small world property, densification power law, and bad spectral expansion. We introduce the dimension of an OSN based on our model, and examine this new parameter using actual OSN data.作者: 針葉樹 時(shí)間: 2025-3-25 20:07 作者: 激勵 時(shí)間: 2025-3-26 04:13
Wirtschaftswissenschaftliche Beitr?ger analysis relies on bounding the branching processes and inherits the fundamental concepts of the study of component evolution in Erd?s-Rényi graphs. The major challenge comes from the underlying structure of RIGs, which involves both a set of nodes and a set of attributes, with different probabilities associated with each attribute.作者: 輕彈 時(shí)間: 2025-3-26 07:28
Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types,try to find parameters that generate a graph whose clustering gives the ground-truth clustering, and choosing parameters to maximize the quality of the ground-truth clustering. We present experimental results on real and synthetic benchmarks.作者: 顧客 時(shí)間: 2025-3-26 11:30 作者: 門窗的側(cè)柱 時(shí)間: 2025-3-26 14:35
Conference proceedings 2010d, CA, USA, in December 2010, which was co-located with the 6th International Workshop on Internet and Network Economics (WINE 2010).The 13 revised full papers and the invited paper presented were carefully reviewed and selected from 19 submissions.作者: 思想流動 時(shí)間: 2025-3-26 19:56 作者: conjunctiva 時(shí)間: 2025-3-26 23:00
A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification,e integer .. The improved PageRank algorithm is crucial for computing a quantitative ranking of edges in a given graph. We will use the edge ranking to examine two interrelated problems – graph sparsification and graph partitioning. We can combine the graph sparsification and the partitioning algori作者: engagement 時(shí)間: 2025-3-27 01:51
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning,is to combine the sampling algorithm of [31,32] and the partitioning of the set of vertices into a high degree and a low degree subset respectively as in [1], treating each set appropriately. We obtain a running time . and an . approximation (multiplicative error), where . is the number of vertices,作者: venous-leak 時(shí)間: 2025-3-27 09:02
Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types,ts can be defined by many different metrics and aggregation of these metrics into a single one poses several important challenges, such as recovering this aggregation function from ground-truth, investigating the space of different clusterings, etc. In this paper, we address how to find an aggregati作者: 友好關(guān)系 時(shí)間: 2025-3-27 13:31 作者: obstruct 時(shí)間: 2025-3-27 14:07 作者: COMA 時(shí)間: 2025-3-27 19:03 作者: 積極詞匯 時(shí)間: 2025-3-28 00:27
Finding and Visualizing Graph Clusters Using PageRank Optimization, given graph ., we use the personalized PageRank vectors to determine a set of clusters, by optimizing the jumping parameter . subject to several cluster variance measures in order to capture the graph structure according to PageRank. We then give a graph visualization algorithm for the clusters usi作者: 重畫只能放棄 時(shí)間: 2025-3-28 03:21 作者: BRIBE 時(shí)間: 2025-3-28 06:19
The Geometric Protean Model for On-Line Social Networks,es are identified with points in Euclidean space, and edges are stochastically generated by a mixture of the relative distance of nodes and a ranking function. With high probability, the GEO-P model generates graphs satisfying many observed properties of OSNs, such as power law degree distributions,作者: 誓言 時(shí)間: 2025-3-28 14:15
Constant Price of Anarchy in Network Creation Games via Public Service Advertising,t to construct a connection graph among themselves. Each node wants to minimize its average or maximum distance to the others, without paying much to construct the network. Many generalizations have been considered, including non-uniform interests between nodes, general graphs of allowable edges, bo作者: LAVA 時(shí)間: 2025-3-28 18:11 作者: 樂章 時(shí)間: 2025-3-28 20:00
Game-Theoretic Models of Information Overload in Social Networks, that capture rate competition between celebrities producing updates in such networks where users non-strategically choose a subset of celebrities to follow based on the utility derived from high quality updates as well as disutility derived from having to wade through too many updates. Our two vari作者: 支柱 時(shí)間: 2025-3-28 23:00 作者: overhaul 時(shí)間: 2025-3-29 07:06
Die Verwendung des Schwefelkohlenstoffs,e integer .. The improved PageRank algorithm is crucial for computing a quantitative ranking of edges in a given graph. We will use the edge ranking to examine two interrelated problems – graph sparsification and graph partitioning. We can combine the graph sparsification and the partitioning algori作者: 耕種 時(shí)間: 2025-3-29 10:53 作者: 侵略者 時(shí)間: 2025-3-29 14:01
https://doi.org/10.1007/978-3-642-46987-9ts can be defined by many different metrics and aggregation of these metrics into a single one poses several important challenges, such as recovering this aggregation function from ground-truth, investigating the space of different clusterings, etc. In this paper, we address how to find an aggregati作者: 打折 時(shí)間: 2025-3-29 15:42
Wirtschaftswissenschaftliche Beitr?geip, and wireless sensor networks. RIGs can be interpreted as a model for large randomly formed non-metric data sets. We analyze the component evolution in general RIGs, giving conditions on the existence and uniqueness of the giant component. Our techniques generalize existing methods for analysis o作者: 微生物 時(shí)間: 2025-3-29 22:11 作者: 完成 時(shí)間: 2025-3-30 01:04
Die Gravitation am Rande der Metagalaxis,ain their emergence through tractable models. In most networks, and especially in social networks, nodes have a rich set of attributes associated with them. We present the Multiplicative Attribute Graphs (MAG) model, which naturally captures the interactions between the network structure and the nod作者: handle 時(shí)間: 2025-3-30 06:29 作者: foreign 時(shí)間: 2025-3-30 09:51
