Filters








5,284 Hits in 3.3 sec

Real time discovery of dense clusters in highly dynamic graphs

Manoj K. Agarwal, Krithi Ramamritham, Manish Bhide
2012 Proceedings of the VLDB Endowment  
We model the problem as discovering dense clusters in highly dynamic graphs.  ...  Despite many recent advances in graph analysis, ours is the first technique to identify dense clusters in massive and highly dynamic graphs in real time.  ...  We believe that ours is the very first attempt to develop a technique to discover dense clusters in a highly dynamic graph.  ... 
doi:10.14778/2336664.2336671 fatcat:jxrakhsiffg2tnv3ydtj5hnsim

Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments [article]

Manoj K Agarwal, Krithi Ramamritham, Manish Bhide
2012 arXiv   pre-print
We model the problem as discovering dense clusters in highly dynamic graphs.  ...  Despite many recent advances in graph analysis, ours is the first technique to identify dense clusters in massive and highly dynamic graphs in real time.  ...  We believe that ours is the very first attempt to develop a technique to discover dense clusters in a highly dynamic graph.  ... 
arXiv:1207.0138v1 fatcat:2ubc4ptztrfyxcgtv4qbs2godu

A parallel graph partitioning algorithm to speed up the large-scale distributed graph mining

ZengFeng Zeng, Bin Wu, Haoyu Wang
2012 Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining Algorithms, Systems, Programming Models and Applications - BigMine '12  
For the large-scale distributed graph mining, the graph is distributed over a cluster of nodes, thus performing computations on the distributed graph is expensive when large amount of data have to be moved  ...  The algorithm first efficiently aggregates the large graph into a small weighted graph, and then makes a balance partitioning on the weighted graph based on a stepwise minimizing RatioCut Algorithm.  ...  The modern large search engines crawls more than one trillion links in the internet and the social networking web site contains more than 800 million active users [9] .  ... 
doi:10.1145/2351316.2351325 dblp:conf/kdd/ZengWW12 fatcat:njhkucpffnc4jikyewnmxezysm

Compressing Graphs and Indexes with Recursive Graph Bisection

Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, Alon Shalita
2016 Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '16  
(KDD 2009) for graph compression, and show how it can be employed for compression-friendly reordering of social networks and web graphs and for assigning document identifiers in inverted indexes.  ...  Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications.  ...  The vertices of the same cluster are then placed together in the final order. The three-step multiscale paradigm is often employed for the graph ordering problems.  ... 
doi:10.1145/2939672.2939862 dblp:conf/kdd/DhulipalaKKOPS16 fatcat:ibwib444xfcxha3uccpdx3mnqy

Interactive Graph Summarization [chapter]

Yuanyuan Tian, Jignesh M. Patel
2010 Link Mining: Models, Algorithms, and Applications  
Existing graph summarization methods are mostly statistical (studying statistics such as degree distributions, hop-plots, and clustering coefficients).  ...  To understand the underlying characteristics of large graphs, graph summarization techniques are critical.  ...  Various graph clustering (or partitioning) algorithms are used to detect community structures (dense subgraphs) in large graphs.  ... 
doi:10.1007/978-1-4419-6515-8_15 fatcat:lvamrxfusnaftdob7zyqqnitse

A Survey on Distributed Graph Pattern Matching in Massive Graphs

Sarra Bouhenni, Saïd Yahiaoui, Nadia Nouali-Taboudjemat, Hamamache Kheddouci
2021 ACM Computing Surveys  
However, massive graphs generated by mostly social networks require a distributed storing and processing of the data over multiple machines, thus, requiring GPM to be revised by adopting new paradigms  ...  of big graphs processing, e.g., Think-Like-A-Vertex and its derivatives.  ...  The core is a dense connected subgraph containing every single edge that is not present in a spanning tree of the query.  ... 
doi:10.1145/3439724 fatcat:vib22wz2zffo3c5alriufetwaa

NicheWorks: Interactive Visualization of Very Large Graphs

Graham J. Wills
1999 Journal of Computational And Graphical Statistics  
We describe and comment on the available layout algorithms and the linked views interaction system, and detail two examples of the use of NicheWorks for analyzing Web sites and detecting international  ...  A system for investigating and exploring such large, complex datasets needs to be able to display both graph structure and node and edge attributes so that patterns and information hidden in the data can  ...  Figure 7 . 7 A subset of the Web site positioned as part of the whole site (a) and positioned as if it were the whole graph (b).  ... 
doi:10.2307/1390633 fatcat:exyqdxsngzgynnb4vz3fyasnvi

NicheWorks — Interactive visualization of very large graphs [chapter]

Graham J Wills
1997 Lecture Notes in Computer Science  
We describe and comment on the available layout algorithms and the linked views interaction system, and detail two examples of the use of NicheWorks for analyzing Web sites and detecting international  ...  A system for investigating and exploring such large, complex datasets needs to be able to display both graph structure and node and edge attributes so that patterns and information hidden in the data can  ...  Figure 7 . 7 A subset of the Web site positioned as part of the whole site (a) and positioned as if it were the whole graph (b).  ... 
doi:10.1007/3-540-63938-1_85 fatcat:j67fjlexunhfnaczb5lp6uo7ta

NicheWorks—Interactive Visualization of Very Large Graphs

Graham J. Wills
1999 Journal of Computational And Graphical Statistics  
We describe and comment on the available layout algorithms and the linked views interaction system, and detail two examples of the use of NicheWorks for analyzing Web sites and detecting international  ...  A system for investigating and exploring such large, complex datasets needs to be able to display both graph structure and node and edge attributes so that patterns and information hidden in the data can  ...  Figure 7 . 7 A subset of the Web site positioned as part of the whole site (a) and positioned as if it were the whole graph (b).  ... 
doi:10.1080/10618600.1999.10474810 fatcat:miak7utxg5ea5fm2i7fgcc5tca

A graph-theoretic approach to extract storylines from search results

Ravi Kumar, Uma Mahadevan, D. Sivakumar
2004 Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '04  
We present a graph-theoretic approach to discover storylines from search results.  ...  Storylines are windows that offer glimpses into interesting themes latent among the top search results for a query; they are different from, and complementary to, clusters obtained through traditional  ...  A ranked list of 17,000 web sites is almost surely not the answer one would like to see.  ... 
doi:10.1145/1014052.1014078 dblp:conf/kdd/KumarMS04 fatcat:3wnxyoybqvbh3ieoftu7vqtzzm

Knowledge Graphs [article]

Aidan Hogan, Eva Blomqvist, Michael Cochez, Claudia d'Amato, Gerard de Melo, Claudio Gutierrez, José Emilio Labra Gayo, Sabrina Kirrane, Sebastian Neumaier, Axel Polleres, Roberto Navigli, Axel-Cyrille Ngonga Ngomo (+6 others)
2021 arXiv   pre-print
In this paper we provide a comprehensive introduction to knowledge graphs, which have recently garnered significant attention from both industry and academia in scenarios that require exploiting diverse  ...  We discuss the roles of schema, identity, and context in knowledge graphs. We explain how knowledge can be represented and extracted using a combination of deductive and inductive techniques.  ...  Acknowledgements: We thank the attendees of the Dagstuhl Seminar on "Knowledge Graphs" for discussions that inspired and influenced this paper, and all those that make such seminars possible.  ... 
arXiv:2003.02320v5 fatcat:ab4hmm2f2bbpvobwkjw4xbrz4u

Parallel Processing of Large Graphs [article]

Tomasz Kajdanowicz, Przemyslaw Kazienko, Wojciech Indyk
2013 arXiv   pre-print
Many of them possess the networked nature and need to be processed and analysed as graph structures. Due to their size they require very often usage of parallel paradigm for efficient computation.  ...  They are implemented for two different graph problems: calculation of single source shortest paths (SSSP) and collective classification of graph nodes by means of relational influence propagation (RIP)  ...  The former splits vertices using the a-priori knowledge about them, e.g. users from the same geographical region, web sites in the same language, etc.  ... 
arXiv:1306.0326v1 fatcat:ukpfxsqa4bdkzieox4con4hyrq

Graph Signatures for Visual Analytics

Pak Chung Wong, H. Foote, G. Chin, P. Mackey, K. Perrine
2006 IEEE Transactions on Visualization and Computer Graphics  
We present a visual analytics technique to explore graphs using the concept of a data signature.  ...  Signature vectors extracted from a graph are projected onto a low-dimensional scatterplot through the use of scaling.  ...  The graph represents a fragment of the AT&T Web site that contains several nucleus nodes and large hierarchies underneath them.  ... 
doi:10.1109/tvcg.2006.92 pmid:17073364 fatcat:4pbai67finbepfbd72f4lpl2oe

Graphs for Ontology, Law and Policy [chapter]

Pierre Mazzega, Romain Boulet, Thrse Libourel
2012 New Frontiers in Graph Theory  
Techniques of graph mining (Cox and Holder, 2007) would be particular useful in conjunction to text mining, a huge amount of data being accessible today via institutional public web sites and data base  ...  the paradigm of interpretation.  ...  The book is also intended for both graduate and postgraduate students in fields such as mathematics, computer science, system sciences, biology, engineering, cybernetics, and social sciences, and as a  ... 
doi:10.5772/35046 fatcat:2z5p2kxotrevjf3wa7yzg2ovpu

Community detection in graphs

Santo Fortunato
2010 Physics reports  
Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body.  ...  One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same  ...  Sample of the web graph consisting of the pages of a web site and their mutual hyperlinks, which are directed.  ... 
doi:10.1016/j.physrep.2009.11.002 fatcat:4ehi6spclncgtevcwxwztmhw4y
« Previous Showing results 1 — 15 out of 5,284 results