Filters








13,577 Hits in 7.9 sec

Distributed Graph Clustering using Modularity and Map Equation [article]

Michael Hamann, Ben Strasser, Dorothea Wagner, Tim Zeitz
<span title="2018-06-07">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Modularity and map equation are established formalizations of this internally-dense-externally-sparse principle. We present two versions of a simple distributed algorithm to optimize both measures.  ...  We study large-scale, distributed graph clustering. Given an undirected graph, our objective is to partition the nodes into disjoint sets called clusters.  ...  Contribution We propose two distributed graph clustering algorithms, DSLM-Mod and DSLM-Map, that optimize modularity and map equation, respectively.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1710.09605v3">arXiv:1710.09605v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vkxcfl2xcrhqvbaf6x45vp7byy">fatcat:vkxcfl2xcrhqvbaf6x45vp7byy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191020001431/https://arxiv.org/pdf/1710.09605v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3f/9b/3f9b52d05ed6a4d1fa3791717ac636128f08010d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1710.09605v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Comparative analysis on the selection of number of clusters in community detection

Tatsuro Kawamoto, Yoshiyuki Kabashima
<span title="2018-02-28">2018</span> <i title="American Physical Society (APS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5pgnwkvlevhybgsbuc3q7fchx4" style="color: black;">Physical review. E</a> </i> &nbsp;
For the assessment criteria, we consider modularity, map equation, Bethe free energy, prediction errors, and isolated eigenvalues.  ...  In addition, we propose that the alluvial diagram is a suitable tool to visualize statistical inference results and can be useful to determine the number of clusters.  ...  As with modularity, one can use the minimum description length of the map equation only for model assessment and perform community detection based on another objective function.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physreve.97.022315">doi:10.1103/physreve.97.022315</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/29548181">pmid:29548181</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xeyf2sk5jze7xgjojqvw5dke3u">fatcat:xeyf2sk5jze7xgjojqvw5dke3u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190228025653/http://pdfs.semanticscholar.org/8afc/b53ea679d98409adab024b2f564a5ae980d4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8a/fc/8afcb53ea679d98409adab024b2f564a5ae980d4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physreve.97.022315"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> aps.org </button> </a>

Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach

Fabrice Rossi, Nathalie Villa-Vialaneix
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bby322qx6ndsje4ypr56c7nnly" style="color: black;">Neurocomputing</a> </i> &nbsp;
This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering.  ...  A comparative study on four real world graphs ranging from 34 to 1 133 vertices shows the interest of the proposed approach with respect to classical solutions and to self-organizing maps for graphs.  ...  graph clusteringing measures).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.neucom.2009.11.023">doi:10.1016/j.neucom.2009.11.023</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/prj2k5qcmnbofdwycfmzeylrbm">fatcat:prj2k5qcmnbofdwycfmzeylrbm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810122306/http://www.nathalievilla.org/doc/pdf/rossi_villavialaneix_N2010.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e1/67/e167702ac8f1cfccdfc9a9eacd7f842595a59b78.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.neucom.2009.11.023"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Empirical Performace Determination on Community Detection Techniques in Social Networks

<span title="2020-02-29">2020</span> <i title="Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h673cvfolnhl3mnbjxkhtxdtg4" style="color: black;">International Journal of Engineering and Advanced Technology</a> </i> &nbsp;
The quality of the derived communities is evaluated by using standard Extended Modularity metric.  ...  Community identification is the high common and extending field of interest in social and real-time network applications. In recent years, many community detection methods have been developed.  ...  This hierarchic reconstruction of the graph is replicated till the map equation can't be decreased farther.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijeat.b4562.029320">doi:10.35940/ijeat.b4562.029320</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pcjmgco7n5atndtewtcsv3aziy">fatcat:pcjmgco7n5atndtewtcsv3aziy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200307200509/https://www.ijeat.org/wp-content/uploads/papers/v9i3/B4562129219.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijeat.b4562.029320"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Automatic clustering of multispectral imagery by maximization of the graph modularity

Ryan A. Mercovich, Anthony Harkin, David Messinger, Sylvia S. Shen, Paul E. Lewis
<span title="2011-05-13">2011</span> <i title="SPIE"> Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XVII </i> &nbsp;
and then clusters the data by applying the method of optimal modularity for finding communities within the graph.  ...  Using information from each recursion, the end result is a variable level of detail cluster map that is more visually useful than previous methods.  ...  The departure from typical data models and the useful outputs in addition to a simple cluster map make the modularity method a useful technique for automatic clustering.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1117/12.884146">doi:10.1117/12.884146</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/apka4k5nmjba5mmfygxxprgvqm">fatcat:apka4k5nmjba5mmfygxxprgvqm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809030259/http://www.cis.rit.edu/DocumentLibrary/admin/uploads/CIS000170.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/21/94/21946c0f2b77138e2f85dc01f9fb9deac42db5ce.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1117/12.884146"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A Model for Image Segmentation in Retina [article]

Christopher Warner, Friedrich T. Sommer
<span title="2020-05-06">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In essence, relaxation in the oscillator network solves a graph clustering problem with the graph representing feature similarity between different points in the image.  ...  Networks with phase interactions set by standard representations of the feature graph (adjacency matrix, Graph Laplacian or modularity) failed to exhibit segmentation performance significantly over the  ...  Section 3.1 describes topographic modularity, a novel graph-clustering method based on modularity [26] that we propose for clustering multigraphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.02567v1">arXiv:2005.02567v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vdhhxzva2fb7za2dqh65w7gx6i">fatcat:vdhhxzva2fb7za2dqh65w7gx6i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200528192849/https://arxiv.org/pdf/2005.02567v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.02567v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Scalable Flow-Based Community Detection for Large-Scale Network Analysis

Seung-Hee Bae, Daniel Halperin, Jevin West, Martin Rosvall, Bill Howe
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gckg3mzs4fhxhbrvmbsa54bccm" style="color: black;">2013 IEEE 13th International Conference on Data Mining Workshops</a> </i> &nbsp;
One such algorithm is called Infomap, which optimizes the objective function known as the map equation.  ...  We evaluate our approach on a variety of real graph datasets as well as synthetic graphs produced by a popular graph generator used for benchmarking community detection algorithms.  ...  We would like to thank Andrea Lancichinetti for assistance with the synthetic graph generator. The authors would also like to thank the anonymous reviewers for their insightful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdmw.2013.138">doi:10.1109/icdmw.2013.138</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icdm/BaeHWRH13.html">dblp:conf/icdm/BaeHWRH13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/htkxszowavhq7o5oqtftodb77y">fatcat:htkxszowavhq7o5oqtftodb77y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922051131/http://www.halper.in/pubs/bae_2013_damnet_relaxmap.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fd/ed/fded85acc0477528f5f5a607708bbd584fa4c92a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdmw.2013.138"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Fluid Flow Complexity in Fracture Networks: Analysis with Graph Theory and LBM [article]

H. O. Ghaffari, M. H. B. Nasseri, R. P. Young
<span title="2012-02-22">2012</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Among different characteristics of networks, we distinguish the modularity of networks and sub-graphs distributions. We map the flow regimes into the proper regions of the network's modularity space.  ...  Furthermore, the fracture networks are mapped into the graphs, and the characteristics of these graphs are compared to the main spatial fracture networks.  ...  Now, we map the spatial joint networks into graphs, using the method described in section 2.2.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1107.4918v2">arXiv:1107.4918v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dvgcpxz7gbborifmtfzsk7epny">fatcat:dvgcpxz7gbborifmtfzsk7epny</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200928145046/https://arxiv.org/ftp/arxiv/papers/1107/1107.4918.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/27/10/271069b08af3d8621d2536ceaf3e4ef7d60d7114.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1107.4918v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Diffusion Model Based Spectral Clustering for Protein-Protein Interaction Networks

Kentaro Inoue, Weijiang Li, Hiroyuki Kurata, Ingemar T. Ernberg
<span title="2010-09-07">2010</span> <i title="Public Library of Science (PLoS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s3gm7274mfe6fcs7e3jterqlri" style="color: black;">PLoS ONE</a> </i> &nbsp;
ADMSC effectively partitions PPI networks into biologically significant clusters with almost equal sizes, while being very fast, robust and appealing simple.  ...  However, clear modular decomposition is often hard due to the heterogeneous or scale-free properties of PPI networks.  ...  Although we do not directly compare the clustering performance and modularity between them, ADMSC would take advantages in a fast and simple method without multiple redundant clustering nor consensus identification  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1371/journal.pone.0012623">doi:10.1371/journal.pone.0012623</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/20830307">pmid:20830307</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC2935381/">pmcid:PMC2935381</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vglkt5d5l5fblkcars6tiqolmm">fatcat:vglkt5d5l5fblkcars6tiqolmm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170926071622/http://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0012623&amp;type=printable" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/db/f2/dbf268450853cfdd37ebd10886647fc83238a6cc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1371/journal.pone.0012623"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> plos.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2935381" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Computational Aspects of Lucidity-Driven Graph Clustering

Robert Görke, Marco Gaertler, Florian Hübner, Dorothea Wagner
<span title="">2010</span> <i title="Journal of Graph Algorithms and Applications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4joumle7hffilk276fkubvhxcq" style="color: black;">Journal of Graph Algorithms and Applications</a> </i> &nbsp;
We formally state and investigate the lucidity paradigm for graph clusterings.  ...  A recently defined quality measure for graph clusterings, modularity, is one specific realization of this paradigm, in fact the pioneering one.  ...  These very values are used in the definition of modularity in Equation 6 , and induce a probability space for graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7155/jgaa.00203">doi:10.7155/jgaa.00203</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/leqa6ol3mna73n2ghseitkbo3a">fatcat:leqa6ol3mna73n2ghseitkbo3a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110102181439/http://jgaa.info/accepted/2010/GoerkeGaertlerHuebnerWagner2010.14.2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/23/b7/23b7ee81d486eae77a8c63f24227aaa67ac8060b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7155/jgaa.00203"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Mining a medieval social network by kernel SOM and related methods [article]

Nathalie Villa, Fabrice Rossi (INRIA Rocquencourt / INRIA Sophia Antipolis), Quoc-Dinh Truong
<span title="2008-05-09">2008</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We compare approaches coming from data mining for clustering the vertices of a graph (spectral clustering, self-organizing algorithms. . .) and provide methods for representing the graph from these analysis  ...  All these methods are illustrated on a medieval social network and the way they can help to understand its organization is underlined.  ...  Hautefeuille, historian at UMR TRACES (University of Toulouse Le Mirail), who provides us helpful comments and analysis.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0805.1374v1">arXiv:0805.1374v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vhnbnnq7abgqzjjd6e2n2qeybe">fatcat:vhnbnnq7abgqzjjd6e2n2qeybe</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0805.1374/0805.1374.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0805.1374v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Structure and attributes community detection

Haithum Elhadi, Gady Agam
<span title="">2013</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fqqihtxlu5bvfaqxjyvqcob35a" style="color: black;">Proceedings of the 7th Workshop on Social Network Mining and Analysis - SNAKDD &#39;13</a> </i> &nbsp;
In recent years due to the rise of social, biological, and other rich content graphs, several new graph clustering methods using structure and node's attributes have been introduced.  ...  The Selection method uses the graph structure ambiguity to switch between structure and attribute clustering methods.  ...  Acknowledgment The authors would like to thank Yiping Ke, Hong Cheng, and Juan David Cruz Gomez, for providing the code for their clustering methods, and Naila Mahdi for valuable suggestions and discussions  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2501025.2501034">doi:10.1145/2501025.2501034</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/kdd/ElhadiA13.html">dblp:conf/kdd/ElhadiA13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zpykpum7h5h7pkiqzy5dwnehpi">fatcat:zpykpum7h5h7pkiqzy5dwnehpi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180304034626/http://chbrown.github.io:80/kdd-2013-usb/workshops/SNAKDD/doc/submission28.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/90/a3/90a3a52df3e2940cea7b642876da989f446571b4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2501025.2501034"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

On-line relational and multiple relational SOM

Madalina Olteanu, Nathalie Villa-Vialaneix
<span title="">2015</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bby322qx6ndsje4ypr56c7nnly" style="color: black;">Neurocomputing</a> </i> &nbsp;
In some applications and in order to address real-world situations better, data may be more complex than simple numerical vectors.  ...  The algorithms introduced in this manuscript are tested on several data sets, including categorical data and graphs.  ...  ; bottom: maps obtained using numeric variables and factor merged in a single data set and a simple Euclidean distance (left) and using all three data sets but a simple Euclidean distance.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.neucom.2013.11.047">doi:10.1016/j.neucom.2013.11.047</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4xeswqaggzc6be25mtafzim4tm">fatcat:4xeswqaggzc6be25mtafzim4tm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170929061057/https://hal.archives-ouvertes.fr/hal-01063831/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7b/e3/7be3e3ca383fcbe608e645a1df4c9e769bbc7fb1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.neucom.2013.11.047"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A Survey of Computational Approaches to Reconstruct and Partition Biological Networks [chapter]

Lipi Acharya, Thair Judeh, Dongxiao Zhu
<span title="2012-06-21">2012</span> <i title="John Wiley &amp; Sons, Inc."> Statistical and Machine Learning Approaches for Network Analysis </i> &nbsp;
For this simple network, one may observe that the map equation models the network's flow of information better than modularity.  ...  For this simple network, one may observe that the map equation models the network's flow of information better than modularity. FIGURE 1 . 1 15 (1) The underlying network topology.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/9781118346990.ch1">doi:10.1002/9781118346990.ch1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nxykyfoherf6fpzfpwo5acyy6a">fatcat:nxykyfoherf6fpzfpwo5acyy6a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705113639/http://www.cs.wayne.edu/dzhu/networkSurvey.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/70/4e/704e243953edd0ae18f0e0c7533425c0055697ee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/9781118346990.ch1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

NEDindex: A new metric for community structure in networks [article]

Md. Khaledur Rahman
<span title="2016-01-25">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
There are several metrics (Modularity, Mutual Information, Conductance, etc.) to evaluate the strength of graph clustering in large graphs.  ...  These metrics have great significance to measure the effectiveness and they are often used to find the strongly connected clusters with respect to the whole graph.  ...  Fig. 2 : 2 A simple graph with three clusters. Figure 2 2 Fig. 3 : 3 Consistency of NEDindex with modularity metric for graph shown inFigure 2.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1610.03176v1">arXiv:1610.03176v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ym6uw7hlubc75eexz2pbmw3nmy">fatcat:ym6uw7hlubc75eexz2pbmw3nmy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200928065519/https://arxiv.org/pdf/1610.03176v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b1/6a/b16a3321de0c742eab5c7adb2d82408fc50d76f7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1610.03176v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 13,577 results