A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
HiDDen: Hierarchical Dense Subgraph Detection with Application to Financial Fraud Detection
[chapter]
2017
Proceedings of the 2017 SIAM International Conference on Data Mining
Preserved Fulltext
Dense subgraphs are fundamental patterns in graphs, and dense subgraph detection is often the key step of numerous graph mining applications. ...
Most of the existing methods aim to find a single subgraph with a high density. However, dense subgraphs at different granularities could reveal more intriguing patterns in the underlying graph. ...
Related Work Dense subgraph detection is a fundamental problem in both algorithmic graph theory and graph mining. ...
doi:10.1137/1.9781611974973.64
dblp:conf/sdm/ZhangZYAHDT17
fatcat:nm4mkvzmojdqbbzlgwrrrznop4
Top-k Connected Overlapping Densest Subgraphs in Dual Networks
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In DNs is often interesting to extract common subgraphs among the two networks that are maximally dense in the conceptual network and connected in the physical one. ...
DNs are two related graphs (one weighted, the other unweighted) that share the same set of vertices and two different edge sets. ...
.: Greedy approximation algorithms for finding dense components in a
graph. In: Jansen, K., Khuller, S. (eds.) ...
arXiv:2008.01573v1
fatcat:wohmyxnwqbgithytuwhux5aehe
Fast Detection of Dense Subgraphs with Iterative Shrinking and Expansion
2013
IEEE Transactions on Pattern Analysis and Machine Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an efficient algorithm to detect dense subgraphs of a weighted graph. ...
In both phases, SEA operates on small subgraphs; thus it is very efficient. Significant dense subgraphs are robustly enumerated by running SEA from each vertex of the graph. ...
Although edges represent pairwise relations, the graph as a whole can represent very complex relations. A set of vertices that constitute a complex relation usually forms a dense subgraph. ...
doi:10.1109/tpami.2013.16
pmid:23868775
fatcat:vubbyb5xr5dm5ci7q5kvjnjrvu
Tradeoffs between density and size in extracting dense subgraphs: A unified framework
2016
2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Extracting dense subgraphs is an important step in many graph related applications. There is a challenging struggle in exploring the tradeoffs between density and size in subgraphs extracted. ...
First, since the existing studies cannot find highly compact dense subgraphs, we formulate the problem of finding very dense but relatively small subgraphs. ...
INTRODUCTION A dense subgraph is a set of vertices in a graph that are highly connected to each other. Extracting dense subgraphs is a key step in many graph related applications. ...
doi:10.1109/asonam.2016.7752211
dblp:conf/asunam/WangCPAC16
fatcat:bvt2givdczegvpbvi7t2vveege
A Survey of Algorithms for Dense Subgraph Discovery
[chapter]
2010
Managing and Mining Graph Data
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
For example, the problem of clustering is largely concerned with that of finding a fixed partition in the data, whereas the problem of dense subgraph discovery defines these dense components in a much ...
The problem of dense subgraph discovery may wither be defined over single or multiple graphs. We explore both cases. ...
Given these two secondary graphs, the problem is quite simple to state: find coherent dense subgraphs, where a subgraph qualifies if its vertices form a dense component inˆ and if its edges form a dense ...
doi:10.1007/978-1-4419-6045-0_10
dblp:series/ads/LeeRJA10
fatcat:u5vzetjlovetpdcxdwjqihdjnq
In Search of the Densest Subgraph
2019
Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Our goal is motivated by the fact that, in many applications, it is a key algorithmic task to extract a densest subgraph from an input graph, according to some appropriate definition of graph density. ...
In this survey paper, we review various concepts of graph density, as well as associated theorems and algorithms. ...
Some Related Results and Open Problems
Conditions that Force the Existence of a Dense Subgraph Given that some of the dense subgraph types are hard to find or even to approximate in large graphs, it ...
doi:10.3390/a12080157
fatcat:7rht55sor5errh2zkyvildkmhi
Mining Highly Reliable Dense Subgraphs from Uncertain Graphs
2019
KSII Transactions on Internet and Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The uncertainties of the uncertain graph make the traditional definition and algorithms on mining dense graph for certain graph not applicable. ...
An efficient greedy algorithm is also developed to find the optimal β-subgraph. ...
Related Work The problem of determining dense subgraphs on graphs has recently been extensively studied, and various definitions of dense subgraphs have been proposed. ...
doi:10.3837/tiis.2019.06.012
fatcat:ienbpcvt4rbz5fdbov5awx3s44
Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs
2017
ACM Transactions on the Web
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Current dense subgraph finding algorithms usually optimize some objective and only find a few such subgraphs without providing any structural relations. ...
Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. ...
Finding dense subgraphs is a critical aspect of graph mining [Lee et al. 2010 ]. ...
doi:10.1145/3057742
fatcat:ceazxpnkzre35burhozreoea2e
Compressed Representation of Web and Social Networks via Dense Subgraphs
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our approach uses clustering and mining for finding dense subgraphs and represents them using compact data structures. ...
Our compressed structure also enables mining queries based on dense subgraphs, such as cliques and bicliques. ...
Introduction A wide range of information is available both in the link structure of web graphs and in the relation structure of social networks. ...
doi:10.1007/978-3-642-34109-0_28
fatcat:ed225avlxjbqtk73pqbhb2pu3q
A local algorithm for finding dense subgraphs
2010
ACM Transactions on Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a local algorithm for finding dense subgraphs of bipartite graphs, according to the measure of density proposed by Kannan and Vinay. ...
The algorithm takes as input a bipartite graph with a specified starting vertex, and attempts to find a dense subgraph near that vertex. ...
We remark that any algorithm for finding dense subgraphs in undirected bipartite graphs can also be applied to find dense subgraphs in arbitary directed graphs, by a simple reduction descibed in Section ...
doi:10.1145/1824777.1824780
fatcat:fvdakz3l7zadfe4ulbrxsjzxrq
TellTail: Fast Scoring and Detection of Dense Subgraphs
2020
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Dense subgraphs often indicate interesting structure, such as network attacks in network traffic graphs. ...
We then improve the practicality of our approach by incorporating empirical observations about dense subgraph patterns in real graphs, and by proposing a fast pruning-based search algorithm. ...
. • Discoveries: We make 2 novel empirical observations on dense subgraph patterns in real graphs, which we use to speed up our measure. • Effectiveness: Our approach outperforms baselines in finding injected ...
doi:10.1609/aaai.v34i04.5835
fatcat:xinvuil7snc7lh7a42sizqunoi
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations. ...
Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. ...
This work was funded by the DARPA GRAPHS program. ...
arXiv:1411.3312v2
fatcat:lxte2eibhbh63kua2gl3pzcguq
Mining coherent dense subgraphs across massive biological networks for functional discovery
2005
Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Results: We developed a novel algorithm, CODENSE, to efficiently mine frequent coherent dense subgraphs across large numbers of massive graphs. ...
Compared with previous methods, our approach is scalable in the number and size of the input graphs and adjustable in terms of exact or approximate pattern mining. ...
If we simply add these graphs together to construct a summary graph, we may find a dense subgraph comprising vertices a, b, c and d. ...
doi:10.1093/bioinformatics/bti1049
pmid:15961460
fatcat:rkbtvh2vp5gwjmeqmvvo3tuy3a
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
2015
Proceedings of the 24th International Conference on World Wide Web - WWW '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations. ...
Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. ...
This work was funded by the DARPA GRAPHS program. ...
doi:10.1145/2736277.2741640
dblp:conf/www/SariyuceSPC15
fatcat:4de5toj7ireb7jckyyggfw2xzm
Density-friendly Graph Decomposition
2015
Proceedings of the 24th International Conference on World Wide Web - WWW '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We start by defining what it means for a subgraph to be locally-dense, and we show that our definition entails a nested chain decomposition of the graph, similar to the one given by k-cores, but in this ...
We show that such a locally-dense decomposition for a graph G=(V,E) can be computed in polynomial time. ...
INTRODUCTION Finding dense subgraphs and communities is one of the most well-studied problems in graph mining. ...
doi:10.1145/2736277.2741119
dblp:conf/www/TattiG15
fatcat:izsimms4ojaslkbbpjnizdy6j4
« Previous
Showing results 1 — 15 out of 23,450 results