Filters








385,257 Hits in 10.1 sec

Community Assessment Using Evidence Networks [chapter]

Folke Mitzlaff, Martin Atzmueller, Dominik Benz, Andreas Hotho, Gerd Stumme
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy.  ...  The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering.  ...  In the context of evaluation measures for evidence networks we consider two measures: Conductance and Modularity. These consider the evaluation from two different perspectives.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-23599-3_5">doi:10.1007/978-3-642-23599-3_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/scoqg43yzrac7maadfy35fohxa">fatcat:scoqg43yzrac7maadfy35fohxa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161027014010/http://www.kde.cs.uni-kassel.de/atzmueller/paper/mitzlaff-community-assessment-muse-2010.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/c5/16/c516b936fb3a136448a3d33a26b74673f4e219ca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-23599-3_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Clustering of Brain Function Network Based on Attribute and Structural Information and Its Application in Brain Diseases

Xiaohong Cui, Jihai Xiao, Hao Guo, Bin Wang, Dandan Li, Yan Niu, Jie Xiang, Junjie Chen
<span title="2020-02-07">2020</span> <i title="Frontiers Media SA"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/w7oms7cvvjfs7ht4yodsyhuzku" style="color: black;">Frontiers in Neuroinformatics</a> </i> &nbsp;
Finally, we evaluate this method on three diseases: Alzheimer's disease, Bipolar disorder patients, and Schizophrenia. The performance of methods is evaluated by measuring clustering consistency.  ...  We use cosine similarity and sub-network kernels to measure attribute similarity and structure similarity, respectively.  ...  AUTHOR CONTRIBUTIONS XC proposed a framework of spectral clustering based on brain network. JXiao, YN, and DL processed data and made experiment. JXian, BW, HG, and JC gave the proof of results.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3389/fninf.2019.00079">doi:10.3389/fninf.2019.00079</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/32116624">pmid:32116624</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC7020566/">pmcid:PMC7020566</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/drzscic3yna4jdaheajs476vay">fatcat:drzscic3yna4jdaheajs476vay</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200208054801/https://fjfsdata01prod.blob.core.windows.net/articles/files/448386/pubmed-zip/.versions/1/.package-entries/fninf-13-00079/fninf-13-00079.pdf?sv=2015-12-11&amp;sr=b&amp;sig=HeAru9saP6SDqWGwQUCuTAQdbavzKCpCTI3vxqTwNCM%3D&amp;se=2020-02-08T05%3A48%3A30Z&amp;sp=r&amp;rscd=attachment%3B%20filename%2A%3DUTF-8%27%27fninf-13-00079.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/cd/32/cd32dbb8c62d0dcb7ddeb913fca168655c8845fc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3389/fninf.2019.00079"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> frontiersin.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7020566" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

NC-GNN: Consistent Neighbors of Nodes Help More in Graph Neural Networks

Ming Xu, Baoming Zhang, Hualei Yu, Jinliang Yuan, Chongjun Wang, Lei Zhang
<span title="2022-06-18">2022</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6o4hgxplrbehxg4t53ub7zmfha" style="color: black;">Wireless Communications and Mobile Computing</a> </i> &nbsp;
Graph neural networks, as the promising methodology in data mining for graph data, currently attract much attention and are broadly applied in graph-based tasks.  ...  Furthermore, we propose a novel method, Neighbor Consistent Graph Neural Networks (NC-GNN), to promote the training of graph neural networks by reweighting the influence of labeled nodes based on neighbor  ...  Neighbor Consistency Evaluation. We first evaluate the neighbor consistency measured by the difference between nodes and the corresponding neighbors.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2022/8641220">doi:10.1155/2022/8641220</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cs6l4yc5rje43cxhm5cmlda2wq">fatcat:cs6l4yc5rje43cxhm5cmlda2wq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220619072510/https://downloads.hindawi.com/journals/wcmc/2022/8641220.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/e3/bb/e3bbe84138f0c3f1c457d4a912bab82613e55f16.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2022/8641220"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Applying graph-based data mining concepts to the educational sphere

András London, Áron Pelyhe, Csaba Holló, Tamás Németh
<span title="">2015</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pul7f2ro35d2tj5dn4pz327hiy" style="color: black;">Proceedings of the 16th International Conference on Computer Systems and Technologies - CompSysTech &#39;15</a> </i> &nbsp;
In this study, we discuss the possible application of the ubiquitous complex network approach for information extraction from educational data.  ...  Lastly, we attempt to highlight the many advantages of using graph-based data mining in educational data against the classical evaluation techniques.  ...  This work is supported by the European Union and cofunded by the European Social Fund. Project title: The denouement of talent in favour of the excellence of the University of Szeged.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2812428.2812436">doi:10.1145/2812428.2812436</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compsystech/LondonPHN15.html">dblp:conf/compsystech/LondonPHN15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yagrbxqndbddxl4qtx6ty72d7y">fatcat:yagrbxqndbddxl4qtx6ty72d7y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720200024/http://publicatio.bibl.u-szeged.hu/11127/1/Applying%20graph-based%20data%20mining%20concepts%20to%20the%20educational%20sphere.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/03/ba/03ba6cc0503d374136f4d2dbc01eca864fed0d40.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2812428.2812436"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Graph Clustering with Density-Cut [article]

Junming Shao, Qinli Yang, Jinhu Liu, Stefan Kramer
<span title="2016-06-03">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
How can we find a good graph clustering of a real-world network, that allows insight into its underlying structure and also potential functions?  ...  In this paper, we introduce a new graph clustering algorithm Dcut from a density point of view.  ...  Specifically, the first graph data including 10 clusters representing a random network is generated, and each cluster consisting of 100 nodes is randomly interlinked with intracluster edges from the density  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.00950v1">arXiv:1606.00950v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hijjssjht5d25dyj5hwukurdsm">fatcat:hijjssjht5d25dyj5hwukurdsm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191013081310/https://arxiv.org/pdf/1606.00950v1.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/ab/9c/ab9cefd5e8452e296d59c4bba336b856d984a15c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.00950v1" 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>

Evaluation and Analysis of Distributed Graph-Parallel Processing Frameworks

Yue Zhao, Kenji Yoshigoe, Mengjun Xie, Suijian Zhou, Remzi Seker, Jiang Bian
<span title="">2014</span> <i title="River Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7fvtrv6o65gszpj46refzq3jw4" style="color: black;">Journal of Cyber Security and Mobility</a> </i> &nbsp;
Further, out of the evaluated graphparallel computing platforms, PowerGraph consistently exhibits better performance than others.  ...  A number of graph-parallel processing frameworks have been proposed to address the needs of processing complex and large-scale graph structured datasets in recent years.  ...  Acknowledgment This work was supported in part by the National Science Foundation under Grant CRI CNS-0855248, Grant EPS-0701890, Grant EPS-0918970, and Grant MRI CNS-0619069.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.13052/jcsm2245-1439.333">doi:10.13052/jcsm2245-1439.333</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r2xiozmuvvaz7o2gpbfqhu4mye">fatcat:r2xiozmuvvaz7o2gpbfqhu4mye</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809104929/https://www.riverpublishers.com/journal/journal_articles/RP_Journal_2245-1439_333.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/c5/d3/c5d33fee75c3eb980070bcca5555651bf781d061.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.13052/jcsm2245-1439.333"> <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>

ShareSafe: An Improved Version of SecGraph

<span title="2019-11-30">2019</span> <i title="Korean Society for Internet Information (KSII)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hupfbobgkvepdnt5g32qxkypsy" style="color: black;">KSII Transactions on Internet and Information Systems</a> </i> &nbsp;
Besides, we model the attackers' background knowledge and evaluate the relation between graph data privacy and the structure of the graph.  ...  relatively small, plays a much more important role than the auxiliary graph. (3) The structure of graph has a fundamental and significant effect on the utility and privacy of the graph. (4) There is no  ...  Prateek Mittal was supported in part by the NSF under the grant CNS-1409415.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3837/tiis.2019.11.025">doi:10.3837/tiis.2019.11.025</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5cyczm6jx5dv7hrf5pesirvlxe">fatcat:5cyczm6jx5dv7hrf5pesirvlxe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200506232635/http://www.itiis.org/digital-library/manuscript/file/22306/TIISVol13No11-25.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/ef/da/efda55d116da5e975314778d5b4dbdc4dd96311e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3837/tiis.2019.11.025"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Feature representation for social circles detection using MAC

Jesús Alonso, Roberto Paredes, Paolo Rosso
<span title="2016-02-25">2016</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/a3wauupnbbdj7hbo62upc6grdq" style="color: black;">Neural computing &amp; applications (Print)</a> </i> &nbsp;
In addition, we provide some insights of the evaluation metrics most commonly used in the literature.  ...  We define different vectorial representations from both structural egonet information and user profile features.  ...  The work of the first author is financed by grant FPU14/03483, from the Spanish Ministry of Education, Culture and Sport.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00521-016-2222-y">doi:10.1007/s00521-016-2222-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qkmxvioqtrbzlftn5ut7kpmv4i">fatcat:qkmxvioqtrbzlftn5ut7kpmv4i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430054416/https://riunet.upv.es/bitstream/handle/10251/82638/ncaa_paper_revised.pdf;jsessionid=87A9D374137CB59B4C1EA1CD0B08E15E?sequence=3" 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/f5/28/f528cbaedcbe73b25eedd161642184064f6a70a1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00521-016-2222-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Quantifying social network dynamics

Radoslaw Michalski, Piotr Brodka, Przemyslaw Kazienko, Krzysztof Juszczyszyn
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pt35tulvffed3cuwwkvznl6ybe" style="color: black;">2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)</a> </i> &nbsp;
Four separate measures are suggested in the paper with experimental study on real social network data.  ...  The following paper focuses on the definition of differences between network snapshots by means of Graph Differential Tuple.  ...  ACKNOWLEDGMENT The work was partially supported by fellowship cofinanced by the European Union within the European Social Fund, The Polish Ministry of Science and Higher Education, the research project  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cason.2012.6412380">doi:10.1109/cason.2012.6412380</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cason/MichalskiBKJ12.html">dblp:conf/cason/MichalskiBKJ12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/peibwrgfy5gcdprjda6dch6i74">fatcat:peibwrgfy5gcdprjda6dch6i74</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810164556/https://www.ii.pwr.edu.pl/~michalski/publications/pub_2012_cason.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/b9/ea/b9ea3e4cdf7aa85ed25d5d28e859cae0af13449d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cason.2012.6412380"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Benchmarking dynamic Bayesian network structure learning algorithms

Ghada Trabelsi, Philippe Leray, Mounir Ben Ayed, Adel M. Alimi
<span title="">2013</span> <i title="IEEE"> 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO) </i> &nbsp;
In this paper, we propose a novel approach to generate standard DBNs based on tiling and novel technique of evaluation, adapted from the "static" Structural Hamming Distance proposed for Bayesian networks  ...  Many approaches have been proposed and the quality of these algorithms has been studied over a range of different standard networks and methods of evaluation.  ...  Acknowledgment The first, third and fourth authors would like to acknowledge the financial support provided by grants from the General Department of Scientific Research and Technological Renovation (DGRST  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icmsao.2013.6552549">doi:10.1109/icmsao.2013.6552549</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6xlz2xhh4ndpjbnoyndbwnc5xi">fatcat:6xlz2xhh4ndpjbnoyndbwnc5xi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130224230440/http://hal.archives-ouvertes.fr/docs/00/77/12/58/PDF/benchmarkingDBNstructureLearning.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/94/f7/94f7ef64d6ebe20ddb733e9f1f639dd7c0ddd04c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icmsao.2013.6552549"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

OLAP on Structurally Significant Data in Graphs [article]

Kifayat Ullah Khan, Kamran Najeebullah, Waqas Nawaz, Young-Koo Lee
<span title="2014-01-27">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Though iceberg cubing is useful, but it is unaware of the significance of dimensional values with respect to the structure of the graph.  ...  We then propose an algorithm, iGraphCubing, to compute the graph cube to analyze the structurally significant data using the proposed measure.  ...  Limitations of Existing Measures From the categorization of graph measures in Table 1 , structure oriented measures are apparent. Now we evaluate these measures to find the significance of DVs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1401.6887v1">arXiv:1401.6887v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dpqhnmq33jc63nhdmbiy2kwjii">fatcat:dpqhnmq33jc63nhdmbiy2kwjii</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200912133129/https://arxiv.org/ftp/arxiv/papers/1401/1401.6887.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/42/74/4274702bf6f19418d5ee3e334981b8ac1c38da10.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1401.6887v1" 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>

Sub graph sampling and case citation network: a case study

Nidha Khanam, Rupali Sunil Wagh
<span title="2018-07-04">2018</span> <i title="Science Publishing Corporation"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/piy2nrvrjrfcfoz5nmre6zwa4i" style="color: black;">International Journal of Engineering &amp; Technology</a> </i> &nbsp;
Sub graph sampling can effectively be employed on large network structures to reduce the size of data while preserving the original properties of the network.  ...  With the penetration of www in every sphere of life networked relationships can be easily established through communication links over web and network and graph analysis come as obvious choices of data  ...  Citation data is represented in the form of Network with network measures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14419/ijet.v7i3.11820">doi:10.14419/ijet.v7i3.11820</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nquvlx3cdras7mwlq25hblhsom">fatcat:nquvlx3cdras7mwlq25hblhsom</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190428202321/https://www.sciencepubco.com/index.php/ijet/article/download/11820/6186" 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/3a/eb/3aeb45bcd09cb867d5916a6cfaca02e1dc0d17c4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14419/ijet.v7i3.11820"> <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>

Air Pollution Prediction Using Dual Graph Convolution LSTM Technique

R. Saravana Ram, K. Venkatachalam, Mehedi Masud, Mohamed Abouhawwash
<span title="">2022</span> <i title="Computers, Materials and Continua (Tech Science Press)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/a6m5ovtnq5h6bb2dcb357moo4a" style="color: black;">Intelligent Automation and Soft Computing</a> </i> &nbsp;
The responsibility of the WSN in air quality monitoring is to be positioning the sensor nodes in the large area with low cost and also gather the real time data and produce the monitoring system as an  ...  This uses the infrared based technology to measure the CO2, temperature and humidity, Geo statistic method and low power wireless networking.  ...  The DGCN is formed with local consistency convolutional, global consistency convolutional and ensemble. Local consistency of graph structured convolution conv LC is a kind of feed forward network.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.32604/iasc.2022.023962">doi:10.32604/iasc.2022.023962</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jber4mmlzvbmdmga4hdudk6gja">fatcat:jber4mmlzvbmdmga4hdudk6gja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220423182430/https://www.techscience.com/iasc/v33n3/47103/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/98/3a/983a63459f451fbf805771d18541695ddfa4d1c5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.32604/iasc.2022.023962"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Graph Theoretical Approaches in Brain Networks

Fabrizio De Vico Fallani, Danielle Bassett, Tianzi Jiang
<span title="">2012</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xytabl7eh5a5lle2ofnetovd7u" style="color: black;">Computational and Mathematical Methods in Medicine</a> </i> &nbsp;
Instead brain networks, like other real networked systems, tend to exhibit a complex structure theoretically consistent with the capability of processing information within regional clusters and avoiding  ...  From a graph theoretical perspective, the brain can be conceived as a networked system composed of nodes coincident with different brain sites and links which in the current view can either represent anatomical  ...  Instead brain networks, like other real networked systems, tend to exhibit a complex structure theoretically consistent with the capability of processing information within regional clusters and avoiding  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2012/590483">doi:10.1155/2012/590483</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/23320044">pmid:23320044</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC3534245/">pmcid:PMC3534245</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/htvx3hu6qrfmtezfb6ydwwq2ne">fatcat:htvx3hu6qrfmtezfb6ydwwq2ne</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502195432/http://downloads.hindawi.com/journals/cmmm/2012/590483.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/33/fd/33fdc24ddddebb8a3a7cd5f74f2f80c793166adc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2012/590483"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3534245" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

An Empirical Study of Community Detection Algorithms on Social and Road Networks [article]

Waqas Nawaz
<span title="2019-09-16">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
However, it is non-trivial to decide the best approach in the presence of diverse nature of graphs, in terms of density and sparsity, and inadequate analysis of the results.  ...  The evaluation results revealed key insights about selected algorithms and underlying community structures.  ...  Acknowledgement I acknowledge the support of Islamic University of Madinah for disseminating this research work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.08992v1">arXiv:1911.08992v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ksx4gvtednanjaahrfkryrk4te">fatcat:ksx4gvtednanjaahrfkryrk4te</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826165527/https://arxiv.org/pdf/1911.08992v1.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/7b/f4/7bf4f25a5a906cfe1ad5f1fc9a6b3e5ab98e2c7a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.08992v1" 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 385,257 results