Filters








20,869 Hits in 6.6 sec

CausalMGM: an interactive web-based causal discovery tool

Xiaoyu Ge, Vineet K Raghu, Panos K Chrysanthis, Panayiotis V Benos
2020 Nucleic Acids Research  
Web-based CausalMGM consists of three data analysis tools: (i) feature selection and clustering; (ii) automated identification of cause-and-effect relationships via a graphical model; and (iii) interactive  ...  visualization of the learned causal (directed) graph.  ...  ACKNOWLEDGEMENTS We would like to thank Daniel Petrov for his help and insightful comments in the development of CausalMGM web server.  ... 
doi:10.1093/nar/gkaa350 pmid:32392295 pmcid:PMC7319538 fatcat:wyvody2albfptioh3ughcw7ubu

R-MAT: A Recursive Model for Graph Mining [chapter]

Deepayan Chakrabarti, Yiping Zhan, Christos Faloutsos
2004 Proceedings of the 2004 SIAM International Conference on Data Mining  
We list such "laws" and, more importantly, we propose a simple, parsimonious model, the "recursive matrix" (R-MAT) model, which can quickly generate realistic graphs, capturing the essence of each graph  ...  Contrary to existing generators, our model can trivially generate weighted, directed and bipartite graphs; it subsumes the celebrated Erdős-Rényi model as a special case; it can match the power law behaviors  ...  In general, all of the above generators fail to meet one or more of the following goals: (a) the generator should be procedural (b) it should be able to generate all types of graphs (directed/undirected  ... 
doi:10.1137/1.9781611972740.43 dblp:conf/sdm/ChakrabartiZF04 fatcat:v4jnnhdevjapjpoqjsin7pe3cy

Web Communities Identification from Random Walks [chapter]

Jiayuan Huang, Tingshao Zhu, Dale Schuurmans
2006 Lecture Notes in Computer Science  
Random walk models are capable of propagating local link information throughout the Web Graph, which can be used to reveal hidden global relationships between different regions of the graph.  ...  Although the topology of the Directed Web Graph encodes important information about the content of individual Web pages, it also reveals useful meta-level information about user communities.  ...  A Web graph differs from a general directed graph in that it posesses particular topological properties.  ... 
doi:10.1007/11871637_21 fatcat:g2bjphankbbfjaiapfhtmbtcdi

Extracting link spam using biased random walks from spam seed sets

Baoning Wu, Kumar Chellapilla
2007 Proceedings of the 3rd international workshop on Adversarial information retrieval on the web - AIRWeb '07  
Our approach starts with a small spam seed set provided by the user and simulates a random walk on the web graph.  ...  Link farms and link exchanges are two common instances of link spam that produce spam communities -i.e., clusters in the web graph.  ...  A Practical Random Walk Model Naively applying the above random walk model as is to a web graph leads to several practical problems.  ... 
doi:10.1145/1244408.1244416 fatcat:bqe64fagwre7vidd7fxhd2ichy

Spectral clustering and transductive learning with multiple views

Dengyong Zhou, Christopher J. C. Burges
2007 Proceedings of the 24th international conference on Machine learning - ICML '07  
Unlike this kind of methodology, we develop multiview spectral clustering via generalizing the normalized cut from a single view to multiple views.  ...  We further build multiview transductive inference on the basis of multiview spectral clustering. Our framework leads to a mixture of Markov chains defined on every graph.  ...  This means that, in the special case of multiple undirected graphs, the Markov mixture model reduces to a linear combination of adjacency matrices or a convex combination of normalized adjacency matrices  ... 
doi:10.1145/1273496.1273642 dblp:conf/icml/ZhouB07 fatcat:loidkj3l3rc47pkdqxzd6tzxim

Directed closure measures for networks with reciprocity [article]

C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda
2014 arXiv   pre-print
We propose a collection of directed closure values for measuring triangles in directed graphs in a way that is analogous to transitivity in an undirected graph.  ...  The study of triangles in graphs is a standard tool in network analysis, leading to measures such as the transitivity, i.e., the fraction of paths of length 2 that participate in triangles.  ...  Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy's Na-  ... 
arXiv:1302.6220v3 fatcat:2tgqtzz73fffjmq6lfsbo7je7i

Challenges in web search engines

Monika R. Henzinger, Rajeev Motwani, Craig Silverstein
2002 SIGIR Forum  
In this paper, we describe six algorithmic problems that arise in web search engines and that are not or only partially solved: (1) Uniformly sampling of web pages; (2) modeling the web graph; (3) finding  ...  duplicate hosts; (4) finding top gainers and losers in data streams; (5) finding large dense bipartite graphs; and (6) understanding how eigenvectors partition the web.  ...  These results hold for undirected graphs, but the web graph is a directed graph.  ... 
doi:10.1145/792550.792553 fatcat:wkhduzn5hncdfowx53qjz7ukxy

Algorithmic Challenges in Web Search Engines

Monika R. Henzinger
2004 Internet Mathematics  
In this paper, we describe six algorithmic problems that arise in web search engines and that are not or only partially solved: (1) Uniformly sampling of web pages; (2) modeling the web graph; (3) finding  ...  duplicate hosts; (4) finding top gainers and losers in data streams; (5) finding large dense bipartite graphs; and (6) understanding how eigenvectors partition the web.  ...  These results hold for undirected graphs, but the web graph is a directed graph.  ... 
doi:10.1080/15427951.2004.10129079 fatcat:fku3dmdpyja4fo2bhdcnvuwriq

Graph Data: The Next Frontier in Big Data Modeling for Various Domains

Angira Amit Patel, Jyotindra Dharwa
2017 Indian Journal of Science and Technology  
A formal conclusion of this review revealed use of various graph models according to state-of-affairs of various domains as well as data modeling challenges and complexity of Big data.  ...  This research could lend a helping hand to anyone who wants to implement graph data model for their data management challenges and computational problems.  ...  Graph is a general model where as trees, lattices, sequences, path and items are degenerated graphs 9 .  ... 
doi:10.17485/ijst/2017/v10i21/112828 fatcat:7qprb6pdxrc3hpv4sk3olu4kmi

Graph theoretic models of food webs

Joel E. Cohen
1979 Rocky Mountain Journal of Mathematics  
The trophic niche overlap graph is an undirected graph in which the vertices are the predators in a food web and two predators are joined by an undirected edge when there is some kind of prey that both  ...  A food web is a directed graph that tells which kinds of organisms nourish which other kinds of organisms in a community of species. Each vertex in such a graph corresponds to a kind of organism.  ...  In food webs which describe a community, the ratio of the number of kinds of prey to the number of kinds of predators is close to a constant 3/4, over all food webs.  ... 
doi:10.1216/rmj-1979-9-1-29 fatcat:3dciwm65pnd2fmqr7t2h2hl6xa

Understanding Complex Networks Using Graph Spectrum

Yanhua Li, Zhi-Li Zhang
2015 Proceedings of the 24th International Conference on World Wide Web - WWW '15 Companion  
This work focuses on understanding complex networks based on the graph spectrum, namely, developing and applying spectral graph theories and models for understanding and employing versatile and oblivious  ...  These networks generate an immense range of big data: weblogs, social media, the Internet traffic, which have increasingly drawn attentions from the computer science research community to explore and investigate  ...  Undirected graph model Routing is a critical operation in networks.  ... 
doi:10.1145/2740908.2744718 dblp:conf/www/LiZ15 fatcat:e37dgc532vb6dhw2cvju3epoky

Controllability and maximum matchings of complex networks [article]

Jin-Hua Zhao, Hai-Jun Zhou
2018 arXiv   pre-print
Previously, the controllability problem of a linear time-invariant dynamical system was mapped to the maximum matching (MM) problem on the bipartite representation of the underlying directed graph, and  ...  the sizes of MMs on random bipartite graphs were calculated analytically with the cavity method at zero temperature limit.  ...  Regular random graphs A directed regular random (RR) graph instance D = {V, E} with a vertex set V of a size N (= |V |) and an arc set E of a size M (= |E|) can be generated from its undirected counterpart  ... 
arXiv:1810.09059v1 fatcat:z4uvhd2b4ja5lotfmscd6bnj2q

Striations in PageRank-Ordered Matrices [article]

Corey Pennycuff, Tim Weninger
2016 arXiv   pre-print
We demonstrate that these striations are the result of well-known graph generation processes resulting in regularities that are manifest in the typical neighborhood distribution.  ...  The discovery and modelling of such regular patterns has a wide application from disease propagation to financial markets.  ...  Aside from Web data, undirected uses of PageRank abound in related work [1, 3, 39] , where the (undirected) degree and PageRank distributions are correlated in a variety of data sets, not just Web data  ... 
arXiv:1605.06249v1 fatcat:2xh2fy3z3nd47nmz4qyevxa6xa

Directed closure measures for networks with reciprocity

C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda
2016 Journal of Complex Networks  
The study of triangles in graphs is a standard tool in network analysis. Real-world networks are often directed and have a significant fraction of reciprocal edges.  ...  We also observe striking similarities between the triadic closure patterns of different web and social networks.  ...  Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S.  ... 
doi:10.1093/comnet/cnv032 fatcat:vsevnvoferdl3muxergsd57lka

Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs [chapter]

David Avis, Kazuo Iwama, Daichi Paku
2011 Lecture Notes in Computer Science  
In this paper we consider PageRank games for undirected web graphs, where players are free to delete any of their bidirectional links if they wish.  ...  We give an O(n 2 ) time algorithm for a tree, and a parametric O(2 k n 4 ) time algorithm for general graphs, where k is the maximum vertex degree in any biconnected component of the graph.  ...  Introduction A PageRank value is assigned to each web page according to the stationary distribution of an α-random walk on the web graph.  ... 
doi:10.1007/978-3-642-25591-5_43 fatcat:4vzpzg3mlzfyfhausnikz24zvu
« Previous Showing results 1 — 15 out of 20,869 results