Results 251 to 260 of about 1,011,259 (278)
Some of the next articles are maybe not open access.
Bipartite Graph-Based Projected Clustering With Local Region Guidance for Hyperspectral Imagery
IEEE transactions on multimediaHyperspectral image (HSI) clustering is challenging to divide all pixels into different clusters because of the absent labels, large spectral variability and complex spatial distribution.
Yongshan Zhang +3 more
semanticscholar +1 more source
Self-Completed Bipartite Graph Learning for Fast Incomplete Multi-View Clustering
IEEE transactions on circuits and systems for video technology (Print)Incomplete multi-view clustering (IMVC), excavating diversity and consistency from multiple incomplete views, has aroused widespread research enthusiasm.
Xiaojia Zhao +5 more
semanticscholar +1 more source
Bioinform., 2021
MOTIVATION There are various interaction/association bipartite networks in biomolecular systems. Identifying unobserved links in biomedical bipartite networks helps to understand the underlying molecular mechanisms of human complex diseases and thus ...
Haitao Fu +4 more
semanticscholar +1 more source
MOTIVATION There are various interaction/association bipartite networks in biomolecular systems. Identifying unobserved links in biomedical bipartite networks helps to understand the underlying molecular mechanisms of human complex diseases and thus ...
Haitao Fu +4 more
semanticscholar +1 more source
BGAE: Auto-Encoding Multi-View Bipartite Graph Clustering
IEEE Transactions on Knowledge and Data EngineeringUnsupervised multi-view bipartite graph clustering (MVBGC) is a fast-growing research, due to promising scalability in large-scale tasks. Although many variants are proposed by various strategies, a common design is to construct the bipartite graph ...
Liang Li +7 more
semanticscholar +1 more source
Hierarchical Bipartite Graph Neural Networks: Towards Large-Scale E-commerce Applications
IEEE International Conference on Data Engineering, 2020The e-commerce appeals to a multitude of online shoppers by providing personalized experiences and becomes indispensable in our daily life. Accurately predicting user preference and making a recommendation of favorable items plays a crucial role in ...
Zhao Li +7 more
semanticscholar +1 more source
Complete (2,2) Bipartite Graphs
Malaysian Journal of Mathematical Sciences, 2022A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an extension of the above concept in which no two vertices in the same part are at distance two from each other.
Hanif, S., Bhat, K. A., Sudhakara, G.
openaire +1 more source
Physical Review Letters, 1987
Replica-symmetric solutions of the graph-bipartitioning problem with finite connectivity are presented. With the constraint ${sum}_{\mathrm{i}=1}^{\mathrm{N}}$${\mathrm{S}}_{\mathrm{i}}$=0 strictly enforced, another solution can be obtained, which gives a lower cost function than that given by the spin-glass solution.
openaire +2 more sources
Replica-symmetric solutions of the graph-bipartitioning problem with finite connectivity are presented. With the constraint ${sum}_{\mathrm{i}=1}^{\mathrm{N}}$${\mathrm{S}}_{\mathrm{i}}$=0 strictly enforced, another solution can be obtained, which gives a lower cost function than that given by the spin-glass solution.
openaire +2 more sources
Combinatorics, Probability and Computing, 1997
In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n=1, 2, [ctdot ], such that, for some constant c>0, the edges of Gn cannot be covered by n−c log n complete bipartite subgraphs of Gn. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.
Rödl, Vojtěch, Ruciński, Andrzej
openaire +1 more source
In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n=1, 2, [ctdot ], such that, for some constant c>0, the edges of Gn cannot be covered by n−c log n complete bipartite subgraphs of Gn. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.
Rödl, Vojtěch, Ruciński, Andrzej
openaire +1 more source
Bipartite Graph Reasoning GANs for Person Image Generation
British Machine Vision Conference, 2020We present a novel Bipartite Graph Reasoning GAN (BiGraphGAN) for the challenging person image generation task. The proposed graph generator mainly consists of two novel blocks that aim to model the pose-to-pose and pose-to-image relations, respectively.
H. Tang +3 more
semanticscholar +1 more source
Computer Vision and Pattern Recognition, 2020
Mammogram mass detection is of great clinical significance due to its high proportion in breast cancers. The information from cross views (i.e., mediolateral oblique and cranio-caudal) is highly related and complementary, and is helpful to make ...
Yuhang Liu +5 more
semanticscholar +1 more source
Mammogram mass detection is of great clinical significance due to its high proportion in breast cancers. The information from cross views (i.e., mediolateral oblique and cranio-caudal) is highly related and complementary, and is helpful to make ...
Yuhang Liu +5 more
semanticscholar +1 more source

