Filters








4,007 Hits in 7.3 sec

Overlapping Community Detecting Based on Complete Bipartite Graphs in Micro-bipartite Network Bi-EgoNet

Furong Chang, Bofeng Zhang, Yue Zhao, Songxian Wu, Kenji Yoshigoe
2019 IEEE Access  
Bipartite network, as a special complex network, reflects the characteristics of a kind of network in our life truly and objectively.  ...  Then, we propose a novel overlapping community detection algorithm based on a complete bipartite graph in micro-bipartite network Bi-EgoNet (CBG&BEN), which combines advantages of both a complete bipartite  ...  [37] projected an original bipartite network into two weighted one-mode networks based on the bipartite clustering triangular, then detected one-mode community structure in the two weighted one-mode  ... 
doi:10.1109/access.2019.2926987 fatcat:nvv75ngwc5gkfg3bacqo4ifeza

Web Proxy Detection Via Bipartite Graphs And One-Mode Projections

Zhipeng Chen, Peng Zhang, Qingyun Liu, Li Guo
2018 Zenodo  
Specifically, we use bipartite graphs to model host communications from network traffic and build one-mode projections of bipartite graphs for discovering social-behavior similarity of web proxy users.  ...  Based on the similarity matrices of end-users from the derived one-mode projection graphs, we apply a simple yet effective spectral clustering algorithm to discover the inherent web proxy users behavior  ...  The first step is to construct the weighted bipartite graphs and then generate the one-mode projection of bipartite graphs and obtain the similarity matrix S.  ... 
doi:10.5281/zenodo.1317088 fatcat:yhyqwc3wrzdhrmpcsm72r7fddy

Bipartite networks describe R D collaboration between institutions [article]

D. Vasques Filho, Dion R.J. O'Neale
2019 arXiv   pre-print
A number of real world networks are, in fact, one-mode projections of bipartite networks comprised of two types of nodes.  ...  the one-mode co-patenting network.  ...  A projection can be built as a simple graph (only single edges are allowed between pairs of nodes in the projection), a weighted graph (only single edges, possibly weighted), or as a multigraph (multiple  ... 
arXiv:1909.10977v1 fatcat:5m5i3z6chbbojofds3chyoe2c4

Exploiting the Bipartite Structure of Entity Grids for Document Coherence and Retrieval

Christina Lioma, Fabien Tarissan, Jakob Grue Simonsen, Casper Petersen, Birger Larsen
2016 Proceedings of the 2016 ACM International Conference on the Theory of Information Retrieval - ICTIR '16  
The state of the art in unsupervised coherence modelling represents documents as bipartite graphs of sentences and discourse entities, and then projects these bipartite graphs into one-mode undirected  ...  However, one-mode projections may incur significant loss of the information present in the original bipartite structure.  ...  A bipartite graph is a particular class of graph also known as two-mode graph.  ... 
doi:10.1145/2970398.2970413 dblp:conf/ictir/LiomaTSPL16 fatcat:qgqaqyfbtnf3tkzmzizolvhj54

Exploiting the Bipartite Structure of Entity Grids for Document Coherence and Retrieval [article]

Christina Lioma and Fabien Tarissan and Jakob Grue Simonsen and Casper Petersen and Birger Larsen
2016 arXiv   pre-print
The state of the art in unsupervised coherence modelling represents documents as bipartite graphs of sentences and discourse entities, and then projects these bipartite graphs into one-mode undirected  ...  However, one-mode projections may incur significant loss of the information present in the original bipartite structure.  ...  A bipartite graph is a particular class of graph also known as two-mode graph.  ... 
arXiv:1608.00758v1 fatcat:nazxhlxec5f53anyqlbjjzoigm

Behavior Analysis of Internet Traffic via Bipartite Graphs and One-Mode Projections

Kuai Xu, Feng Wang, Lin Gu
2014 IEEE/ACM Transactions on Networking  
Specifically, we use bipartite graphs to model host communications from network traffic and build one-mode projections of bipartite graphs for discovering social-behavior similarity of end-hosts.  ...  By applying simple and efficient clustering algorithms on the similarity matrices and clustering coefficient of one-mode projection graphs, we perform network-aware clustering of end-hosts in the same  ...  In this paper, we use the weighted edge between two hosts and of the same prefix in the one-mode projection graph as the similarity measure between and because the weighted edges capture and quantify the  ... 
doi:10.1109/tnet.2013.2264634 fatcat:duln7touv5hbtcg6stug2eh3fi

The backbone of bipartite projections: Inferring relationships from co-authorship, co-sponsorship, co-attendance and other co-behaviors

Zachary Neal
2014 Social Networks  
Weighted edges are particularly common in bipartite projections (e.g. networks of coauthorship, co-attendance, co-sponsorship), which are often used as proxies for one-mode networks where direct measurement  ...  However, extracting the backbone of bipartite projections requires special care.  ...  In each case, a bipartite projection is used as a proxy to infer an unobserved, natively one-mode network of interest.  ... 
doi:10.1016/j.socnet.2014.06.001 fatcat:ncixianbqfcdhefgneuvjig3ge

Network-aware behavior clustering of Internet end hosts

Kuai Xu, Feng Wang, Lin Gu
2011 2011 Proceedings IEEE INFOCOM  
We use bipartite graphs to model network traffic, and then construct one-mode projection graphs for capturing social-behavior similarity of end hosts.  ...  Based on information-theoretical measures, we find that the clusters exhibit distinct traffic characteristics which provides improved interpretations of the separated traffic compared with the aggregated  ...  In this paper we use the weighted edge between two hosts u and v of the same prefix in the one-mode projection graph as the similarity measure s u,v between u and v, because the weighted edges capture  ... 
doi:10.1109/infcom.2011.5935017 dblp:conf/infocom/Xu0G11 fatcat:gj3neqr7xzhsfbsode5ig5bweq

HellRank: a Hellinger-based centrality measure for bipartite social networks

Seyed Mohammad Taheri, Hamidreza Mahyar, Mohammad Firouzi, Elahe Ghalebi K., Radu Grosu, Ali Movaghar
2017 Social Network Analysis and Mining  
Measuring centrality in a social network, especially in bipartite mode, poses several challenges such as requirement of full knowledge of the network topology and lack of properly detection of top-k behavioral  ...  HellRank is based on the Hellinger distance between two nodes on the same side of a bipartite network.  ...  , and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
doi:10.1007/s13278-017-0440-7 fatcat:gtz5izomhfgmroe6plpgaoxvwy

Modeling one-mode projection of bipartite networks by tagging vertex information

Jian Qiao, Ying-Ying Meng, Hsinchun Chen, Hong-Qiao Huang, Guo-Ying Li
2016 Physica A: Statistical Mechanics and its Applications  
of bipartite networks in their one-mode projections.  ...  projection models of bipartite graphs and that our one-mode collaboration network model captures the crucial mechanisms of the three real systems.  ...  We employ the following statistical indicators to measure the local properties of our one-mode projections.  ... 
doi:10.1016/j.physa.2016.03.106 fatcat:eqv4q5rp65bmvd5aljubrheuxm

A simple bipartite graph projection model for clustering in networks [article]

Austin R. Benson, Paul Liu, Hao Yin
2020 arXiv   pre-print
graph is a projection of an author-publication bipartite graph.  ...  Graph datasets are frequently constructed by a projection of a bipartite graph, where two nodes are connected in the projection if they share a common neighbor in the bipartite graph; for example, a coauthorship  ...  We thank Johan Ugander for pointing us to the literature on random intersection graphs.  ... 
arXiv:2007.00761v1 fatcat:lwexjuwsbncellyq4ie36theui

Is it correct to project and detect? How weighting unipartite projections influences community detection

Tristan J. B. Cann, Iain S. Weaver, Hywel T. P. Williams
2020 Network Science  
Community detection in such instances is frequently approached by first projecting the network onto a unipartite network, a method where edges between node classes are encoded as edges within one class  ...  Here we test seven different projection schemes by assessing the performance of community detection on both: (i) a real-world dataset from social media and (ii) an ensemble of artificial networks with  ...  A list of tweet IDs used in Section 3.1 is available upon request. Conflict of interest. Tristan J.B. Cann, Iain S. Weaver, and Hywel T.P. Williams have nothing to disclose. Notes  ... 
doi:10.1017/nws.2020.11 fatcat:gyhpbrptz5g2ta2wrq6iwx6pja

Temporal-mode continuous-variable cluster states using linear optics

Nicolas C. Menicucci
2011 Physical Review A. Atomic, Molecular, and Optical Physics  
The extensibility stems from a construction based on Gaussian projected entangled pair states (GPEPS). The potential for use of this design within a fully fault tolerant model is discussed.  ...  This method has all the advantages of a temporal-mode encoding [Phys. Rev.  ...  Local and two-local Gaussian unitary operations, as well as local quadrature measurements, can be visualized as graph transformations.  ... 
doi:10.1103/physreva.83.062314 fatcat:rfixxaxm6rd6nmsfwm36y7e2yi

Compute Similarity of CAD Models Based on Bipartite Graph

Xue-Yao Gao, Chun-Xiang Zhang, Zhi-Mao Lu
2015 International Journal of Signal Processing, Image Processing and Pattern Recognition  
In order to retrieve a satisfied CAD model from a large model library, a new method to compute the similarity between two CAD models is presented in which a bipartite graph is used to match source faces  ...  The number of edges in faces is extracted from CAD models. Based on the number of edges in faces, the similarity between source face and target face is computed.  ...  Acknowledgements This work is supported by Science and Technology Research Funds of Education Department in Heilongjiang Province under Grant Nos. 12541125.  ... 
doi:10.14257/ijsip.2015.8.2.06 fatcat:nyjgiaocnjgslncgak5oda6ol4

Basic notions for the analysis of large two-mode networks

Matthieu Latapy, Clémence Magnien, Nathalie Del Vecchio
2008 Social Networks  
To achieve this, we introduce a set of simple statistics, which we discuss by comparing their values on a representative set of real-world networks and on their random versions.  ...  Many large real-world networks actually have a 2-mode nature: their nodes may be separated into two classes, the links being between nodes of different classes only.  ...  , for their precious comments and help during the preparation of this contribution.  ... 
doi:10.1016/j.socnet.2007.04.006 fatcat:zvm4hvjtmrbbtgfzxrln5zeci4
« Previous Showing results 1 — 15 out of 4,007 results