A fuzzy clustering based method for attributed graph partitioning
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Ambient Intelligence and Humanized Computing"
DOI: 10.1007/s12652-018-1054-2
Abstract: Graph partitioning methods in data mining have been widely used to discover protein complexes in protein–protein interaction (PPI) network. However, PPI networks with attributes need more effective attribute graph partitioning methods. Attribute graph partitioning aims… read more here.
Keywords: graph partitioning; attributed graph; fuzzy clustering; method attributed ... See more keywords
Revisiting the Isoperimetric Graph Partitioning Problem
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2901094
Abstract: Isoperimetric graph partitioning, which is also known as the Cheeger cut, is NP-hard in its original form. In the literature, multiple modifications to this problem have been proposed to obtain approximation algorithms for clustering applications.… read more here.
Keywords: graph partitioning; problem; partitioning problem; graph ... See more keywords
Parallel Heuristics for Balanced Graph Partitioning Based on Richness of Implicit Knowledge
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2926753
Abstract: Balanced graph partitioning (BGP) has a wide range of applications that involve many large-scale distributed data processing problems. However, most of the existing approaches to parallel graph partitioning neglect the problem of the richness of… read more here.
Keywords: graph partitioning; balanced graph; richness implicit; graph ... See more keywords
Hyper-Graph Partitioning for a Multi-Agent Reformulation of Large-Scale MILPs
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Control Systems Letters"
DOI: 10.1109/lcsys.2021.3093338
Abstract: This letter addresses the challenge of solving large-scale Mixed Integer Linear Programs (MILPs). A resolution scheme is proposed for the class of MILPs with a hidden constraint-coupled multi-agent structure. In particular, we focus on the… read more here.
Keywords: graph partitioning; multi agent; hyper graph; reformulation ... See more keywords
Structure-Attribute-Based Social Network Deanonymization With Spectral Graph Partitioning
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Computational Social Systems"
DOI: 10.1109/tcss.2021.3082901
Abstract: Online social networks have gained tremendous popularity and have dramatically changed the way we communicate in recent years. However, the publishing of social network data raises more and more privacy concerns. To protect user privacy,… read more here.
Keywords: social network; network; graph partitioning; spectral graph ... See more keywords
Cost-Aware Partitioning for Efficient Large Graph Processing in Geo-Distributed Datacenters
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Parallel and Distributed Systems"
DOI: 10.1109/tpds.2019.2955494
Abstract: Graph processing is an emerging computation model for a wide range of applications and graph partitioning is important for optimizing the cost and performance of graph processing jobs. Recently, many graph applications store their data… read more here.
Keywords: graph partitioning; graph processing; graph; cost ... See more keywords