Filters








62,437 Hits in 3.9 sec

A Local Algorithm for Structure-Preserving Graph Cut

Dawei Zhou, Si Zhang, Mehmet Yigit Yildirim, Scott Alcorn, Hanghang Tong, Hasan Davulcu, Jingrui He
2017 Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '17  
Then we propose a novel High-Order Structure-Preserving LOcal Cut (HOS-PLOC) algorithm, which runs in polylogarithmic time with respect to the number of edges in the graph.  ...  To address this problem, inspired by the family of local graph clustering algorithms for efficiently identifying a low-conductance cut without exploring the entire graph, we propose to generalize the key  ...  for the proposed structure-preserving graph cut algorithm to be introduced in the next section.  ... 
doi:10.1145/3097983.3098015 dblp:conf/kdd/ZhouZYATDH17 fatcat:xnkwecpqpnhmznpzwengybn3yq

HyperSF: Spectral Hypergraph Coarsening via Flow-based Local Clustering [article]

Ali Aghdaei, Zhiqiang Zhao, Zhuo Feng
2021 arXiv   pre-print
Our approach leverages a recent strongly-local max-flow-based clustering algorithm for detecting the sets of hypergraph vertices that minimize ratio cut.  ...  However, state-of-the-art hypergraph partitioning (clustering) methods that incorporate heuristic graph coarsening techniques are not optimized for preserving the structural (global) properties of hypergraphs  ...  stronglycoupled nodes in local neighborhoods without impacting the global structure of the hypergraph. • A key component of our method is a local, directed graph based max-flow algorithm for selecting  ... 
arXiv:2108.07901v3 fatcat:nd74hogturfubmlkubln543jai

Structure preserving embedding

Blake Shaw, Tony Jebara
2009 Proceedings of the 26th Annual International Conference on Machine Learning - ICML '09  
Structure Preserving Embedding (SPE) is an algorithm for embedding graphs in Euclidean space such that the embedding is lowdimensional and preserves the global topological properties of the input graph  ...  Traditional graph embedding algorithms do not preserve structure according to our definition, and thus the resulting visualizations can be misleading or less informative.  ...  We have run SPE on graphs with over thousands of nodes and tens of thousands of edges. For Table 2 . Structure Preserving Embedding algorithm with cutting-plane constraints.  ... 
doi:10.1145/1553374.1553494 dblp:conf/icml/ShawJ09 fatcat:fuav2vglazadxoowayaaj34woi

Faster Algorithms for Edge Connectivity via Random 2-Out Contractions [article]

Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup
2019 arXiv   pre-print
We provide a simple new randomized contraction approach to the global minimum cut problem for simple undirected graphs.  ...  Within our new time bounds, whp, we can also construct the cactus representation of all minimal cuts. – An Õ(n^0.8 D^0.2 + n^0.9) round distributed algorithm, where D denotes the graph diameter.  ...  Acknowledgment The first two authors are thankful to the Uber driver in Wroclaw whose late arrival provided ample time for a conversation about (massively parallel) algorithms for min-cut; it was during  ... 
arXiv:1909.00844v1 fatcat:hczlexnxm5do7ak57djtbjjg4u

Multiclass spectral clustering based on discriminant analysis

Xi Li, Zhongfei Zhang, Yanguo Wang, Weiming Hu
2008 Pattern Recognition (ICPR), Proceedings of the International Conference on  
DAC preserves the intrinsic topological structures of the similarity graph on data points by constructing a k-nearest neighboring subgraph for each data point.  ...  Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC).  ...  [6] present a "typical cut" algorithm for graph partitioning. Ding et al. [7] present a min-max cut algorithm for graph partitioning and data clustering.  ... 
doi:10.1109/icpr.2008.4760952 dblp:conf/icpr/LiZWH08 fatcat:dkx7jh7wtrbapikagflfooxfwa

Fast Approximations for Rooted Connectivity in Weighted Directed Graphs [article]

Kent Quanrud
2021 arXiv   pre-print
For these problems we give randomized Monte Carlo algorithms that compute a (1+ϵ)-approximate minimum cut in Õ(n^2 / ϵ^2) time.  ...  We consider approximations for computing minimum weighted cuts in directed graphs. We consider both rooted and global minimum cuts, and both edge-cuts and vertex-cuts.  ...  We thank Chandra Chekuri for helpful discussion and detailed feedback.  ... 
arXiv:2104.06933v1 fatcat:75komo6ua5a5bf5gao43idyouu

Design of a Privacy-Preserving Algorithm for Peer-to-Peer Network Based on Differential Privacy

Jian Yu
2019 Ingénierie des Systèmes d'Information  
Then, a privacy-preserving algorithm was proposed for the P2P based on the differential privacy model.  ...  The proposed algorithm adds noise to the degree distribution of the nodes, and solves the high sensitivity under the Laplace mechanism, which arises from the unique structure of the P2P.  ...  GCIS201720) and Foundation of Improving Academic Ability in University for Young Scholars of Guangxi (No. 2019KY1268).  ... 
doi:10.18280/isi.240411 fatcat:q4a7uk7yxje2llbr3rzugu22im

Topology preserving brain tissue segmentation using graph cuts

Xinyang Liu, Pierre-Louis Bazin, Aaron Carass, Jerry Prince
2012 2012 IEEE Workshop on Mathematical Methods in Biomedical Image Analysis  
The framework combines the advantages of digital topology and several existing techniques in graph cuts segmentation.  ...  In this work, we present a framework to segment multiple objects in a brain image while preserving the topology of each object as given in an initial topological template.  ...  We use 26-neighborhood system in our graph cuts algorithm with a unique set of parameters for all images.  ... 
doi:10.1109/mmbia.2012.6164754 dblp:conf/mmbia/LiuBCP12 fatcat:rwl6pf53y5aernf5qceshf3yd4

Preserving Minority Structures in Graph Sampling [article]

Ying Zhao, Haojin Jiang, Qi'an Chen, Yaqi Qin, Huixuan Xie, Yitao Wu Shixia Liu, Zhiguang Zhou, Jiazhi Xia, Fangfang Zhou
2020 arXiv   pre-print
In this approach, a triangle-based algorithm and a cut-point-based algorithm are proposed to efficiently identify minority structures.  ...  By comprehensively analyzing the literature on graph sampling, we assume that existing algorithms cannot effectively preserve minority structures that are rare and small in a graph but are very important  ...  ACKNOWLEDGMENTS We wish to thank Xin Sun from Adobe and Qiaomu Shi and Xinming Chen from Alibaba Cloud Intelligent Security Lab for the fruitful discussions.  ... 
arXiv:2009.02498v2 fatcat:uzj6thjf2nbwnjqrgrewxs6zca

Segmentation of Parchment Scrolls for Virtual Unrolling

Oksana Samko, Yu-Kun Lai, David Marshall, Paul Rosin
2011 Procedings of the British Machine Vision Conference 2011  
In this paper we introduce a framework for the segmentation of scanned scrolled parchments, based on a novel graph cut based approach with an additional shape prior, in combination with anisotropic diffusion  ...  We demonstrate with real examples how our algorithm is able to solve the major problem for scrolled parchment analysis, namely segment connected layers, and process the data without user interaction.  ...  Graph Cut with shape prior We use a Graph Cut based optimisation for our main segmentation step.  ... 
doi:10.5244/c.25.37 dblp:conf/bmvc/SamkoLMR11 fatcat:m4dgjkl4uzbgzgbnwpum33qtz4

Grouse: Feature-Based, Steerable Graph Hierarchy Exploration [article]

Daniel Archambault, Tamara Munzner, David Auber
2007 EUROVIS 2005: Eurographics / IEEE VGTC Symposium on Visualization  
In a feature-based approach, the subgraph inside a metanode of the graph hierarchy is laid out with a well- chosen algorithm appropriate for its topological structure.  ...  Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy.  ...  One way would be to compute tighter estimates for metanode size. We could possibly exploit theoretical size bounds of the layout algorithm for the chosen feature.  ... 
doi:10.2312/vissym/eurovis07/067-074 fatcat:vunef7pzzbg5ffox5zhleo32zm

On the Interplay between Strong Regularity and Graph Densification [article]

Marco Fiorucci, Alessandro Torcinovich, Manuel Curado, Francisco Escolano, Marcello Pelillo
2017 arXiv   pre-print
To this end, we present a heuristic algorithm to find regular partitions. Our experiments show that this method is quite robust to the natural sparsification of proximity graphs.  ...  In this paper we analyze the practical implications of Szemer\'edi's regularity lemma in the preservation of metric information contained in large graphs.  ...  Elezi for his advice on our code implementation, and to the anonymous reviewers for their constructive feedback.  ... 
arXiv:1703.07107v1 fatcat:sftpy6ckpffchgmt55crsuetge

A Modified Clustering Method Based on Self-Organizing Maps and Its Applications

Le Yang, Zhongbin Ouyang, Yong Shi
2012 Procedia Computer Science  
In the second stage we use the grid information alternatively, regarding it as a graph partitioned by graph cut algorithm well-known as Normalized cut.  ...  In this paper, we propose a novel method more related to SOM for the purpose to cluster the proto-clusters.  ...  ., Australia, CAS/SAFEA International Partnership Program for Creative Research Teams (#70921061), and National Natural Science Foundation (#90718042). References  ... 
doi:10.1016/j.procs.2012.04.151 fatcat:27vvqqvmgzhbvfaajgzmttzvhu

Capacity Scaling for Graph Cuts in Vision

Olivier Juan, Yuri Boykov
2007 2007 IEEE 11th International Conference on Computer Vision  
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms.  ...  Unlike some earlier hierarchical methods addressing efficiency of graph cuts in imaging, e.g. [16], capacity scaling preserves global optimality of the solution.  ...  In this case capacity scaling for graph cut algorithms can be interpreted as a method for approximating energy functions at different accuracy levels.  ... 
doi:10.1109/iccv.2007.4408970 dblp:conf/iccv/JuanB07 fatcat:4aokzrvs3jfp3dlas2ieb3beze

Hypergraph $p$ -Laplacian Regularization for Remotely Sensed Image Recognition

Xueqi Ma, Weifeng Liu, Shuying Li, Dapeng Tao, Yicong Zhou
2019 IEEE Transactions on Geoscience and Remote Sensing  
Therefore, the proposed HpLapR provides more potential to exploiting the local structure preserving.  ...  However, it is still a great challenge to exactly explore and exploit the local structure of the data distribution.  ...  Both hypergraph and -Laplacian have the advantage in local structure preserving.  ... 
doi:10.1109/tgrs.2018.2867570 fatcat:ai5fo3jrrndf7hs7by2gx4dfou
« Previous Showing results 1 — 15 out of 62,437 results