An Analysis on Link Structure Evolution Pattern of Web Communities
|
|
- Flora Hawkins
- 5 years ago
- Views:
Transcription
1 DEWS C HITS An Analysis on Link Structure Evolution Pattern of Web Communities Noriko IMAFUJI and Masaru KITSUREGAWA Institute of Industrial Science, University of Tokyo Komaba 4-6-1, Meguro-ku, Tokyo, Japan Abstract In this paper, we analyze the growing process of link structure of web communities, which is an approach for understanding evolution of the web. A web community is a set of web pages created by individuals or associations with a common interest on a topic. These pages are co-cited by multiple pages, and form densely connected link structure. We examine the transition of link structure within a certain period of time using four sets of web communities created from Japanese web archives crawled in four periods between 1999 and Especially, we focus on the web communities which did not exist in the previous year and classify the evolution of link structures into some patterns. We analyze the semantics of each evolution pattern on the web. Key words web community, web graph, link structure, HITS 1.
2 Fig. 1 The bow-tue structure of the web [6], [7] Borodin 92% 3 [6] 3 ( 1 Albert 2 19 [7] [8][10], [17] [8], [9] [10] [17] 4 HITS HITS [2], [3], [11][13] [13] 2 2 HITS [1][4] 1 [11], [12] (maximum-flow algorithm) [14][16] Max-Flow 2 (a) 2 HITS (b) Max-Flow 1() ()
3 HITS 2 ; (a)hits (b)max-flow Fig. 2 Communities and link structures by HITS family method(a) and Max-Flow method(b) HITS [5][5] HITS 3 (ADG) 4 ADG (SDG) 5 SDG (ADG) Companion- [5] HITS u v u Companion- v ADG uv uv (SDG) SDG 3. 2 t 1,..., t n 3 t i C(t i)={c 1(t i),c 2(t i),..., c m(t i)} C(t i) t i c + (t i) 1 : c + (t i) > = < = n < = 4 2 : c + (t i) 50% URL 3 : c + (t i) t i 1 URL 80% C(t i 1) c j(t i 1) C(t i 1) c j(t i 1) < = 2 12 C(t i) 1 URL 2 URL A = {a 1,a 2,..., a l } c H = {h 1,h 2,..., h m} A 2 E A H 2 G c(v,e) c c (x, Y ) x Y H o = {x x H, (x, A) > (x, A) } H i = {x x H, (x, A) < = (x, A) } H o H i = H, H o H i = 3 G c(v,e) V = H A = {a 1,..., a 6,h 1,..., h 5} H o A A
4 H i A A H i A 3 G c(v,e) Fig. 3 Link structure of web communities, G c(v,e) H oh i H oh i H o H i PC A = {a 1,a 2,..., a m} PC A A H o H i PC A H i H o H i Table 1 Link structure evolution pattern t i 1 t i 1 H o > H i H o > H i 2 H o > H i H o < = H i 3 H o < = H i H o > H i 4 H o < = H i H o < = H i 1 4 Fig. 4 Examples of link evolution patterns ( 5 )
5 3 Table 3 Details of web community sets (a) (b) Fig. 5 Intuive graph of evolution pattern ( jp ) 4 URL URL URL URL 2 2 Table 2 Details of web archives URL M 34M 120M M 32M 112M M 76M 331M M 84M 375M ( ) URL % Fig. 6 Rate of the member pages existed in the previous year 7 t i (a)(b) ( 1 2 3) t i 1 < = i < = 4 t 1,t 2,t 3,t Fig. 7 Rate of members within depth 2. 42
6 H o(t i 1) t i 1 H i(t i 1) t i 1 H o(t i) t i H i(t i) ; t i H o > H i H o < = H i H o > H i t i %, t i 85.32% (t i 1 ) 7 85% 4 (a) H o(t i 1 ), (b) H i (t i 1 ) Table 4 Ave. of (a) H o(t i 1 ), (b) H i (t i 1 ) with respect to each link evolution pattern (a) (b) (a) (b) (a) (b) (a) (b) t 2 =>t t 3 =>t t 4 =>t Average H o(t i) H i(t i) 5 (a) H o(t i ), (b) H i (t i ) Table 5 Ave. of (a) H o(t i ), (b) H i (t i ) with respect to each link evolution pattern (a) (b) (a) (b) (a) (b) (a) (b) t 2 =>t t 3 =>t t 4 =>t Average H o H i Fig. 8 Comparison between H o and H i % 3 18% 4 11% 2 4% 62% 38% 9 Fig. 9 Pacentages of link evolution patterns. 4 H o(t i 1) H i(t i 1) 4, Fig. 10 Intuitive graph of link evolution patterns % 6 (1)
7 (2) (3) (5) (4 )2001 H o Table 6 An example of evolution pattern % colonolog (1) (2,5) PostgreSQL (3)HTTP (4) H i H i H i jp.com.com 7 4 Table 7 An example of evolution pattern Wide Web/Servers/Log Analysis Tools/ 3 php.html Management/Log analysis/
8 [1] J.M.Kleinberg: Authoritative Sources in a Hyperlinked Environment, Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, pp , [2] D. Gibson, J. M. Kleinberg, and P. Raghavan. Inferring web communities from link topology. In UK Conference on Hypertext, pages , [3] S. Chakrabarti, B. Dom, D. Gibson, J. Kleinberg, P. Raghavan, and S. Rajagopalan. Automatic resource list compilation by analyzing hyperlink structure and associated text. In Proceedings of the 7th International World Wide Web Conference, [4] S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large-scale knowledge bases from the web. In The VLDB Journal, pages , [5] M. Toyoda and M. Kitsuregawa. Creating a web community chart for navigating related communities. 12th ACM Hypertext, pages , [6] A. Broder, R. Kumar, F. Maghoul, P. Raghavan, A. Rajagopalan, R. Stata, A. Tomkins,and J. Wiener, Graph strucutre in the web, In Proc. of 9th WWW Conference, 2000 [7] R.Albert, H. Jeong, and A. L. Barabasi, Diameter of the world wide web Nature, 401:130, 1999 [8] B.E.Brewington and G.Cybenko, How dynamic is the web?, In Proc. of 9th WWW Conference, 2000 [9] J. Cho and H. Garcia-Molina. The evolution of the web and implications for an incre-mental crawler, In Proc. of 26th VLDB, 2000 [10] K.Bharat, B. W. Chang, M, Henzinger and M.Ruhl. Who Links to Whom: Mining Linkage between Web Sites, In Proc. of IEEE ICDM, [11] G. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages , [12] G. W. Flake, S. Lawrence, C. L. Giles, and F. Coetzee. Selforganization of the web and identification of communities. IEEE Computer, 35(3):66 71, [13] R.Kumar, P.Raghavan, S.Rajagopalan, and A.Tomkins, Trawling the web for emerging cyber-communities, In Proc. 8th WWW Conference, [14] R.K.Ahuja, T.L.Magnanti, and J.B.Orlin, Network Flows : Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ, [15] A.V.Goldberg and R.E.Tarjan, A new approach to the maximal flow problem, In Proc. 18th Ann. ACM Symposium on Theory of Computing, [16] L.R.Ford Jr. and D.R.Fulkerson, Maximal flow through a network, Canadian J.Math.,8: , [17] M.Toyoda and M.Kitsuregawa.:Extracting evolution of web communities from a series of web archives. In Proc. of 14th Conference on Hypertext and Hypermedia(Hypertext 03), pp.28-37, 2003.
Analyzing Evolution of Web Communities using a Series of Japanese Web Archives
DEWS2003 2-P-05 53 8505 4 6 E-mail: {toyoda,kitsure}@tkl.iis.u-tokyo.ac.jp 999 2002 4 Analyzing Evolution of Web Communities using a Series of Japanese Web Archives Masashi TOYODA and Masaru KITSUREGAWA
More informationAnalyzing Evolution of Web Communities using a Series of Japanese Web Archives
53 8505 4 6 E-mail: {toyoda,kitsure}@tkl.iis.u-tokyo.ac.jp 999 2002 4 Analyzing Evolution of Web Communities using a Series of Japanese Web Archives Masashi TOYODA and Masaru KITSUREGAWA Institute of Industrial
More informationA stochastic model for the link analysis of the Web
A stochastic model for the link analysis of the Web Paola Favati, IIT-CNR, Pisa. Grazia Lotti, University of Parma. Ornella Menchi and Francesco Romani, University of Pisa Three examples of link distribution
More informationModeling of Growing Networks with Directional Attachment and Communities
Modeling of Growing Networks with Directional Attachment and Communities Masahiro KIMURA, Kazumi SAITO, Naonori UEDA NTT Communication Science Laboratories 2-4 Hikaridai, Seika-cho, Kyoto 619-0237, Japan
More informationarxiv: v1 [physics.soc-ph] 15 Dec 2009
Power laws of the in-degree and out-degree distributions of complex networks arxiv:0912.2793v1 [physics.soc-ph] 15 Dec 2009 Shinji Tanimoto Department of Mathematics, Kochi Joshi University, Kochi 780-8515,
More informationHyperlinked-Induced Topic Search (HITS) identifies. authorities as good content sources (~high indegree) HITS [Kleinberg 99] considers a web page
IV.3 HITS Hyperlinked-Induced Topic Search (HITS) identifies authorities as good content sources (~high indegree) hubs as good link sources (~high outdegree) HITS [Kleinberg 99] considers a web page a
More information[11] [3] [1], [12] HITS [4] [2] k-means[9] 2 [11] [3] [6], [13] 1 ( ) k n O(n k ) 1 2
情報処理学会研究報告 1,a) 1 1 2 IT Clustering by Clique Enumeration and Data Cleaning like Method Abstract: Recent development on information technology has made bigdata analysis more familiar in research and industrial
More informationThe Diameter of Random Massive Graphs
The Diameter of Random Massive Graphs Linyuan Lu October 30, 2000 Abstract Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by
More informationIdentification of Bursts in a Document Stream
Identification of Bursts in a Document Stream Toshiaki FUJIKI 1, Tomoyuki NANNO 1, Yasuhiro SUZUKI 1 and Manabu OKUMURA 2 1 Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute
More informationLink Analysis. Leonid E. Zhukov
Link Analysis Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural Analysis and Visualization
More informationT , Lecture 6 Properties and stochastic models of real-world networks
T-79.7003, Lecture 6 Properties and stochastic models of real-world networks Charalampos E. Tsourakakis 1 1 Aalto University November 1st, 2013 Properties of real-world networks Properties of real-world
More informationDeterministic Decentralized Search in Random Graphs
Deterministic Decentralized Search in Random Graphs Esteban Arcaute 1,, Ning Chen 2,, Ravi Kumar 3, David Liben-Nowell 4,, Mohammad Mahdian 3, Hamid Nazerzadeh 1,, and Ying Xu 1, 1 Stanford University.
More informationDirected Scale-Free Graphs
Directed Scale-Free Graphs Béla Bollobás Christian Borgs Jennifer Chayes Oliver Riordan Abstract We introduce a model for directed scale-free graphs that grow with preferential attachment depending in
More informationThe Second Eigenvalue of the Google Matrix
The Second Eigenvalue of the Google Matrix Taher H. Haveliwala and Sepandar D. Kamvar Stanford University {taherh,sdkamvar}@cs.stanford.edu Abstract. We determine analytically the modulus of the second
More informationLink Analysis: Hubs and Authorities on the World Wide Web
Link Analysis: Hubs and Authorities on the World Wide Web Chris H.Q. Ding, Hongyuan Zha, Xiaofeng He, Parry Husbands, Horst D. Simon LBNL Tech Report 47847. May 7, 2001 (updated July 2003). Abstract Ranking
More informationCapturing the Semantics of Web Log Data by Navigation Matrices
Capturing the emantics of Web Log Data by Navigation Matrices Wilfred Ng Email:wilfred@cs.ust.hk Department of Computer cience, The Hong Kong University of cience and Technology Abstract: Key words: The
More informationModels of Communication Dynamics for Simulation of Information Diffusion
Models of Communication Dynamics for Simulation of Information Diffusion Konstantin Mertsalov, Malik Magdon-Ismail, Mark Goldberg Rensselaer Polytechnic Institute Department of Computer Science 11 8th
More informationIntroduction to Information Retrieval
Introduction to Information Retrieval http://informationretrieval.org IIR 19: Size Estimation & Duplicate Detection Hinrich Schütze Institute for Natural Language Processing, Universität Stuttgart 2008.07.08
More informationSpectral Analysis of Directed Complex Networks. Tetsuro Murai
MASTER THESIS Spectral Analysis of Directed Complex Networks Tetsuro Murai Department of Physics, Graduate School of Science and Engineering, Aoyama Gakuin University Supervisors: Naomichi Hatano and Kenn
More informationHub, Authority and Relevance Scores in Multi-Relational Data for Query Search
Hub, Authority and Relevance Scores in Multi-Relational Data for Query Search Xutao Li 1 Michael Ng 2 Yunming Ye 1 1 Department of Computer Science, Shenzhen Graduate School, Harbin Institute of Technology,
More informationOn the NP-Completeness of Some Graph Cluster Measures
arxiv:cs/050600v [cs.cc] 9 Jun 005 On the NP-Completeness of Some Graph Cluster Measures Jiří Šíma Institute of Computer Science, Academy of Sciences of the Czech Republic, P. O. Box 5, 807 Prague 8, Czech
More informationData Mining and Matrices
Data Mining and Matrices 10 Graphs II Rainer Gemulla, Pauli Miettinen Jul 4, 2013 Link analysis The web as a directed graph Set of web pages with associated textual content Hyperlinks between webpages
More informationarxiv:cond-mat/ v1 [cond-mat.dis-nn] 4 May 2000
Topology of evolving networks: local events and universality arxiv:cond-mat/0005085v1 [cond-mat.dis-nn] 4 May 2000 Réka Albert and Albert-László Barabási Department of Physics, University of Notre-Dame,
More informationLink Analysis Information Retrieval and Data Mining. Prof. Matteo Matteucci
Link Analysis Information Retrieval and Data Mining Prof. Matteo Matteucci Hyperlinks for Indexing and Ranking 2 Page A Hyperlink Page B Intuitions The anchor text might describe the target page B Anchor
More informationDeterministic scale-free networks
Physica A 299 (2001) 559 564 www.elsevier.com/locate/physa Deterministic scale-free networks Albert-Laszlo Barabasi a;, Erzsebet Ravasz a, Tamas Vicsek b a Department of Physics, College of Science, University
More informationComplex-Network Modelling and Inference
Complex-Network Modelling and Inference Lecture 12: Random Graphs: preferential-attachment models Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/notes/
More informationExtrapolation Methods for Accelerating PageRank Computations
Extrapolation Methods for Accelerating PageRank Computations Sepandar D. Kamvar Stanford University sdkamvar@stanford.edu Taher H. Haveliwala Stanford University taherh@cs.stanford.edu Christopher D. Manning
More informationAn Algorithm for Densest Subgraphs of Vertexweighted
An Algorithm for Densest Subgraphs of Vertexweighted Graphs School of Computer Science and Educational Software, Guangzhou University Guangzhou, 50006,China E-mail: 40947@qq.com Wenbin Chen Department
More informationMust-read material (1 of 2) : Multimedia Databases and Data Mining. Must-read material (2 of 2) Main outline
Must-read material (1 of 2) 15-826: Multimedia Databases and Data Mining Lecture #29: Graph mining - Generators & tools Fully Automatic Cross-Associations, by D. Chakrabarti, S. Papadimitriou, D. Modha
More informationComplex Network Measurements: Estimating the Relevance of Observed Properties
Complex Network Measurements: Estimating the Relevance of Observed Properties Matthieu Latapy and Clémence Magnien LIP6 CNRS and UPMC avenue du président Kennedy, 756 Paris, France (Matthieu.Latapy,Clemence.Magnien)@lip6.fr
More informationQuasi-random graphs with given degree sequences
Quasi-random graphs with given degree sequences Fan Chung and Ron Graham y University of California, San Diego La Jolla, CA 9093 Abstract It is now known that many properties of the objects in certain
More informationIntroduction to Search Engine Technology Introduction to Link Structure Analysis. Ronny Lempel Yahoo Labs, Haifa
Introduction to Search Engine Technology Introduction to Link Structure Analysis Ronny Lempel Yahoo Labs, Haifa Outline Anchor-text indexing Mathematical Background Motivation for link structure analysis
More informationCS 277: Data Mining. Mining Web Link Structure. CS 277: Data Mining Lectures Analyzing Web Link Structure Padhraic Smyth, UC Irvine
CS 277: Data Mining Mining Web Link Structure Class Presentations In-class, Tuesday and Thursday next week 2-person teams: 6 minutes, up to 6 slides, 3 minutes/slides each person 1-person teams 4 minutes,
More informationAnalysis & Generative Model for Trust Networks
Analysis & Generative Model for Trust Networks Pranav Dandekar Management Science & Engineering Stanford University Stanford, CA 94305 ppd@stanford.edu ABSTRACT Trust Networks are a specific kind of social
More informationRealistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication Jurij Leskovec 1, Deepayan Chakrabarti 1, Jon Kleinberg 2, and Christos Faloutsos 1 1 School of Computer
More informationA local algorithm for finding dense bipartite-like subgraphs
A local algorithm for finding dense bipartite-like subgraphs Pan Peng 1,2 1 State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences 2 School of Information Science
More informationarxiv:cond-mat/ v2 6 Aug 2002
Percolation in Directed Scale-Free Networs N. Schwartz, R. Cohen, D. ben-avraham, A.-L. Barabási and S. Havlin Minerva Center and Department of Physics, Bar-Ilan University, Ramat-Gan, Israel Department
More informationMeasuring the shape of degree distributions
Measuring the shape of degree distributions Dr Jennifer Badham Visiting Fellow SEIT, UNSW Canberra research@criticalconnections.com.au Overview Context What does shape mean for degree distribution Why
More informationpreferential attachment
preferential attachment introduction to network analysis (ina) Lovro Šubelj University of Ljubljana spring 2018/19 preferential attachment graph models are ensembles of random graphs generative models
More informationUsing Rank Propagation and Probabilistic Counting for Link-based Spam Detection
Using Rank Propagation and Probabilistic for Link-based Luca Becchetti, Carlos Castillo,Debora Donato, Stefano Leonardi and Ricardo Baeza-Yates 2. Università di Roma La Sapienza Rome, Italy 2. Yahoo! Research
More informationModels and Algorithms for Complex Networks. Link Analysis Ranking
Models and Algorithms for Complex Networks Link Analysis Ranking Why Link Analysis? First generation search engines view documents as flat text files could not cope with size, spamming, user needs Second
More informationPrototyping a Data Sharing System for Flood Forecasting: A Case Study on Sri Lanka
Prototyping a Data Sharing System for Flood Forecasting: A Case Study on Sri Lanka Masaki Yasukawa 1, Eiji Ikoma 1, Toshihiro Nemoto 1, Mohamed Rasmy 2, Morimasa Tsuda 2, Tomoki Ushiyama 2, Katsunori Tamakawa
More informationarxiv:physics/ v1 [physics.soc-ph] 14 Dec 2006
Europhysics Letters PREPRINT Growing network with j-redirection arxiv:physics/0612148v1 [physics.soc-ph] 14 Dec 2006 R. Lambiotte 1 and M. Ausloos 1 1 SUPRATECS, Université de Liège, B5 Sart-Tilman, B-4000
More informationCS54701 Information Retrieval. Link Analysis. Luo Si. Department of Computer Science Purdue University. Borrowed Slides from Prof.
CS54701 Information Retrieval Link Analysis Luo Si Department of Computer Science Purdue University Borrowed Slides from Prof. Rong Jin (MSU) Citation Analysis Web Structure Web is a graph Each web site
More informationAn evolving network model with community structure
INSTITUTE OF PHYSICS PUBLISHING JOURNAL OF PHYSICS A: MATHEMATICAL AND GENERAL J. Phys. A: Math. Gen. 38 (2005) 9741 9749 doi:10.1088/0305-4470/38/45/002 An evolving network model with community structure
More informationLINK ANALYSIS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS
LINK ANALYSIS Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Retrieval models Retrieval evaluation Link analysis Models
More informationHigher-Order Web Link Analysis Using Multilinear Algebra
Higher-Order Web Link Analysis Using Multilinear Algebra Tamara G. Kolda, Brett W. Bader, and Joseph P. Kenny Sandia National Laboratories Livermore, CA and Albuquerque, NM {tgkolda,bwbader,jpkenny}@sandia.gov
More informationCS47300: Web Information Search and Management
CS473: Web Information Search and Management Using Graph Structure for Retrieval Prof. Chris Clifton 24 September 218 Material adapted from slides created by Dr. Rong Jin (formerly Michigan State, now
More informationRTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs Leman Akoglu Mary McGlohon Christos Faloutsos Carnegie Mellon University, School of Computer Science {lakoglu, mmcgloho, christos}@cs.cmu.edu
More information1 Searching the World Wide Web
Hubs and Authorities in a Hyperlinked Environment 1 Searching the World Wide Web Because diverse users each modify the link structure of the WWW within a relatively small scope by creating web-pages on
More informationHow does Google rank webpages?
Linear Algebra Spring 016 How does Google rank webpages? Dept. of Internet and Multimedia Eng. Konkuk University leehw@konkuk.ac.kr 1 Background on search engines Outline HITS algorithm (Jon Kleinberg)
More informationarxiv:physics/ v2 [physics.soc-ph] 9 Feb 2007
Europhysics Letters PREPRINT Growing network with j-redirection arxiv:physics/0612148v2 [physics.soc-ph] 9 Feb 2007 R. Lambiotte 1 and M. Ausloos 1 1 GRAPES, Université de Liège, B5 Sart-Tilman, B-4000
More informationarxiv:cond-mat/ v1 3 Sep 2004
Effects of Community Structure on Search and Ranking in Information Networks Huafeng Xie 1,3, Koon-Kiu Yan 2,3, Sergei Maslov 3 1 New Media Lab, The Graduate Center, CUNY New York, NY 10016, USA 2 Department
More informationFast PageRank Computation Via a Sparse Linear System (Extended Abstract)
Fast PageRank Computation Via a Sparse Linear System (Extended Abstract) Gianna M. Del Corso 1 Antonio Gullí 1,2 Francesco Romani 1 1 Dipartimento di Informatica, University of Pisa, Italy 2 IIT-CNR, Pisa
More informationWeb Search Via Hub Synthesis
Web Search Via Hub Synthesis Dimitris Achlioptas Λ Amos Fiat y Anna R. Karlin z Frank McSherry x Small have continual plodders ever won save base authority from others books. William Shakespeare, Loves
More informationLink Analysis Ranking
Link Analysis Ranking How do search engines decide how to rank your query results? Guess why Google ranks the query results the way it does How would you do it? Naïve ranking of query results Given query
More informationarxiv: v2 [cond-mat.dis-nn] 16 Feb 2017
Mapping the Structure of Directed Networks: Beyond the Bow-Tie Diagram G. Timár, 1, A. V. Goltsev, 1,2, S. N. Dorogovtsev, 1,2 and J. F. F. Mendes 1 1 Departamento de Física, Universidade de Aveiro and
More informationCommunities Via Laplacian Matrices. Degree, Adjacency, and Laplacian Matrices Eigenvectors of Laplacian Matrices
Communities Via Laplacian Matrices Degree, Adjacency, and Laplacian Matrices Eigenvectors of Laplacian Matrices The Laplacian Approach As with betweenness approach, we want to divide a social graph into
More informationEigenvalues of Random Power Law Graphs (DRAFT)
Eigenvalues of Random Power Law Graphs (DRAFT) Fan Chung Linyuan Lu Van Vu January 3, 2003 Abstract Many graphs arising in various information networks exhibit the power law behavior the number of vertices
More informationNode and Link Analysis
Node and Link Analysis Leonid E. Zhukov School of Applied Mathematics and Information Science National Research University Higher School of Economics 10.02.2014 Leonid E. Zhukov (HSE) Lecture 5 10.02.2014
More informationFluctuation and Burst Response in Social Media
Fluctuation and Burst Response in Social Media Mizuki Oka University of Tsukuba Tennodai -- Tsukuba Ibaraki, 5-8577, Japan mizuki@cs.tsukuba.ac.jp Yasuhiro Hashimoto The University of Tokyo Kashiwanoha
More informationfor an m-state homogeneous irreducible Markov chain with transition probability matrix
UPDATING MARKOV CHAINS AMY N LANGVILLE AND CARL D MEYER 1 Introduction Suppose that the stationary distribution vector φ T =(φ 1,φ 2,,φ m ) for an m-state homogeneous irreducible Markov chain with transition
More informationInf 2B: Ranking Queries on the WWW
Inf B: Ranking Queries on the WWW Kyriakos Kalorkoti School of Informatics University of Edinburgh Queries Suppose we have an Inverted Index for a set of webpages. Disclaimer Not really the scenario of
More informationNode Centrality and Ranking on Networks
Node Centrality and Ranking on Networks Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Social
More informationInformation Retrieval and Search. Web Linkage Mining. Miłosz Kadziński
Web Linkage Analysis D24 D4 : Web Linkage Mining Miłosz Kadziński Institute of Computing Science Poznan University of Technology, Poland www.cs.put.poznan.pl/mkadzinski/wpi Web mining: Web Mining Discovery
More informationCompetition and multiscaling in evolving networks
EUROPHYSICS LETTERS 5 May 2 Europhys. Lett., 54 (4), pp. 436 442 (2) Competition and multiscaling in evolving networs G. Bianconi and A.-L. Barabási,2 Department of Physics, University of Notre Dame -
More informationposter presented at: Complex Networks: from Biology to Information Technology Pula (CA), Italy, July 2-6, 2007
poster presented at: Complex Networks: from Biology to Information Technology Pula (CA), Italy, July 2-6, 2007 What network analysis can reveal about tourism destinations Rodolfo Baggio Master in Economics
More informationMultiRank and HAR for Ranking Multi-relational Data, Transition Probability Tensors, and Multi-Stochastic Tensors
MultiRank and HAR for Ranking Multi-relational Data, Transition Probability Tensors, and Multi-Stochastic Tensors Michael K. Ng Centre for Mathematical Imaging and Vision and Department of Mathematics
More informationThe Dynamic Absorbing Model for the Web
The Dynamic Absorbing Model for the Web Gianni Amati, Iadh Ounis, Vassilis Plachouras Department of Computing Science University of Glasgow Glasgow G12 8QQ, U.K. Abstract In this paper we propose a new
More informationWHAT NETWORK ANALYSIS OF THE WWW CAN TELL US ABOUT THE ORGANISATION OF TOURISM DESTINATIONS
17th Annual Conference of the Council for Australian University Tourism and Hospitality education (CAUTHE), 2007: Tourism - Past Achievements, Future Challenges 11-14 February, 2007, Sydney, Australia
More informationCombining Geographic and Network Analysis: The GoMore Rideshare Network. Kate Lyndegaard
Combining Geographic and Network Analysis: The GoMore Rideshare Network Kate Lyndegaard 10.15.2014 Outline 1. Motivation 2. What is network analysis? 3. The project objective 4. The GoMore network 5. The
More informationNode Degree Distribution in Amino Acid Interaction Networks
Node Degree Distribution in Amino Acid Interaction Networks Omar Gaci, Stefan Balev To cite this version: Omar Gaci, Stefan Balev. Node Degree Distribution in Amino Acid Interaction Networks. IEEE Computer
More informationLink Analysis: Hubs and Authorities on the World Wide Web
SIAM REVIEW Vol. 46, No. 2, pp. 000 000 c 2004 Society for Industrial and Applied Mathematics Link Analysis: Hubs and Authorities on the World Wide Web Chris H. Q. Ding Hongyuan Zha Xiaofeng He Parry Husbands
More informationCMU SCS : Multimedia Databases and Data Mining CMU SCS Must-read Material CMU SCS Must-read Material (cont d)
15-826: Multimedia Databases and Data Mining Lecture #26: Graph mining - patterns Christos Faloutsos Must-read Material Michalis Faloutsos, Petros Faloutsos and Christos Faloutsos, On Power-Law Relationships
More informationAnalyzing the small world phenomenon using a hybrid model with local network flow
Analyzing the small world phenomenon using a hybrid model with local network flow Reid Andersen Fan Chung Linyuan Lu Abstract Randomly generated graphs with power law degree distribution are typically
More informationThe Choice of a Damping Function for Propagating Importance in Link-Based Ranking
The Choice of a Damping Function for Propagating Importance in Link-Based Ranking Technical report RI-DSI N. 305-05 Dipartimento di Scienze dell Informazione, Università degli Studi di Milano. 2005 A version
More informationPerturbation of the hyper-linked environment
Perturbation of the hyper-linked environment Hyun Chul Lee and Allan Borodin Department of Computer Science University of Toronto Toronto, Ontario, M5S3G4 {leehyun,bor}@cs.toronto.edu Abstract. After the
More informationSpatial Information Retrieval
Spatial Information Retrieval Wenwen LI 1, 2, Phil Yang 1, Bin Zhou 1, 3 [1] Joint Center for Intelligent Spatial Computing, and Earth System & GeoInformation Sciences College of Science, George Mason
More informationChapter 2 Fitness-Based Generative Models for Power-Law Networks
Chapter 2 Fitness-Based Generative Models for Power-Law Networks Khanh Nguyen and Duc A. Tran Abstract Many real-world complex networks exhibit a power-law degree distribution. A dominant concept traditionally
More informationComplex Networks CSYS/MATH 303, Spring, Prof. Peter Dodds
Complex Networks CSYS/MATH 303, Spring, 2011 Prof. Peter Dodds Department of Mathematics & Statistics Center for Complex Systems Vermont Advanced Computing Center University of Vermont Licensed under the
More informationNetwork growth by copying
PHYSICAL REVIEW E 71, 036118 2005 etwork growth by copying P. L. Krapivsky 1, * and S. Redner 2, 1 Center for Polymer Studies and Department of Physics, Boston University, Boston, Massachusetts 02215,
More informationNetworks as vectors of their motif frequencies and 2-norm distance as a measure of similarity
Networks as vectors of their motif frequencies and 2-norm distance as a measure of similarity CS322 Project Writeup Semih Salihoglu Stanford University 353 Serra Street Stanford, CA semih@stanford.edu
More informationfrom the way they are inserted, which we can ignore or not as we please. We estimate μ d k, the limiting expected proportion of vertices of degree k a
A general model of web graphs Colin Cooper Λ Alan Frieze y July 4, 2001 Abstract We describe a general model of a random graph whose degree sequence obeys a power law. Such laws have recently been observed
More informationUsing a Layered Markov Model for Distributed Web Ranking Computation
Using a Layered Markov Model for Distributed Web Ranking omputation Jie Wu School of omp. and omm. Sciences Ecole Polytechnique Fédérale de Lausanne 1015 Lausanne, Switzerland jie.wu@epfl.ch Karl Aberer
More informationMust-read Material : Multimedia Databases and Data Mining. Indexing - Detailed outline. Outline. Faloutsos
Must-read Material 15-826: Multimedia Databases and Data Mining Tamara G. Kolda and Brett W. Bader. Tensor decompositions and applications. Technical Report SAND2007-6702, Sandia National Laboratories,
More informationStatic Program Analysis using Abstract Interpretation
Static Program Analysis using Abstract Interpretation Introduction Static Program Analysis Static program analysis consists of automatically discovering properties of a program that hold for all possible
More informationMining Newsgroups Using Networks Arising From Social Behavior by Rakesh Agrawal et al. Presented by Will Lee
Mining Newsgroups Using Networks Arising From Social Behavior by Rakesh Agrawal et al. Presented by Will Lee wwlee1@uiuc.edu September 28, 2004 Motivation IR on newsgroups is challenging due to lack of
More informationApplication of Artificial Neural Networks in Evaluation and Identification of Electrical Loss in Transformers According to the Energy Consumption
Application of Artificial Neural Networks in Evaluation and Identification of Electrical Loss in Transformers According to the Energy Consumption ANDRÉ NUNES DE SOUZA, JOSÉ ALFREDO C. ULSON, IVAN NUNES
More informationComputing Competing Cascades on Signed Networks
Noname manuscript No. (will be inserted by the editor Computing Competing Cascades on Signed Networks Ajitesh Srivastava Charalampos Chelmis Viktor K. Prasanna Received: date / Accepted: date Abstract
More informationBridging the Practices of Two Communities
Educational Knowledge Domain Visualizations: Tools to Navigate, Understand, and Internalize the Structure of Scholarly Knowledge and Expertise Peter A. Hook http://ella.slis.indiana.edu/~pahook Mapping
More informationWeb Ranking. Classification (manual, automatic) Link Analysis (today s lesson)
Link Analysis Web Ranking Documents on the web are first ranked according to their relevance vrs the query Additional ranking methods are needed to cope with huge amount of information Additional ranking
More informationDevelopment of the Probe Information Based System PROROUTE
Development of the Probe Information Based System PROROUTE YAO Enjian, SATO Akinori Abstract PROROUTE is a dynamic route guidance system based on the probe information, currently under development by the
More informationCollaborative filtering based on multi-channel diffusion
Collaborative filtering based on multi-channel Ming-Sheng Shang a Ci-Hang Jin b Tao Zhou b Yi-Cheng Zhang a,b arxiv:0906.1148v1 [cs.ir] 5 Jun 2009 a Lab of Information Economy and Internet Research,University
More informationComputing PageRank using Power Extrapolation
Computing PageRank using Power Extrapolation Taher Haveliwala, Sepandar Kamvar, Dan Klein, Chris Manning, and Gene Golub Stanford University Abstract. We present a novel technique for speeding up the computation
More informationComputations Under Time Constraints: Algorithms Developed for Fuzzy Computations can Help
Journal of Uncertain Systems Vol.6, No.2, pp.138-145, 2012 Online at: www.jus.org.uk Computations Under Time Constraints: Algorithms Developed for Fuzzy Computations can Help Karen Villaverde 1, Olga Kosheleva
More informationFinding patterns in large, real networks
Thanks to Finding patterns in large, real networks Christos Faloutsos CMU www.cs.cmu.edu/~christos/talks/ucla-05 Deepayan Chakrabarti (CMU) Michalis Faloutsos (UCR) George Siganos (UCR) UCLA-IPAM 05 (c)
More informationNewPR-Combining TFIDF with Pagerank
NewPR-Combining TFIDF with Pagerank Hao-ming Wang 1,2, Martin Rajman 2,YeGuo 3, and Bo-qin Feng 1 1 School of Electronic and Information Engineering, Xi an Jiaotong University, Xi an, Shaanxi 710049, P.R.
More informationTime Series Topic Modeling and Bursty Topic Detection of Correlated News and Twitter
Time Series Topic Modeling and Bursty Topic Detection of Correlated News and Twitter Daichi Koike Yusuke Takahashi Takehito Utsuro Grad. Sch. Sys. & Inf. Eng., University of Tsukuba, Tsukuba, 305-8573,
More informationGroups of vertices and Core-periphery structure. By: Ralucca Gera, Applied math department, Naval Postgraduate School Monterey, CA, USA
Groups of vertices and Core-periphery structure By: Ralucca Gera, Applied math department, Naval Postgraduate School Monterey, CA, USA Mostly observed real networks have: Why? Heavy tail (powerlaw most
More informationA METHOD FOR NONLINEAR SYSTEM CLASSIFICATION IN THE TIME-FREQUENCY PLANE IN PRESENCE OF FRACTAL NOISE. Lorenzo Galleani, Letizia Lo Presti
A METHOD FOR NONLINEAR SYSTEM CLASSIFICATION IN THE TIME-FREQUENCY PLANE IN PRESENCE OF FRACTAL NOISE Lorenzo Galleani, Letizia Lo Presti Dipartimento di Elettronica, Politecnico di Torino, Corso Duca
More information