PyTorchKR Papers

최신 논문

총 352편
태그·기간 등 상세 필터

카테고리 탐색

로그인 후 이 태그 구독

arXiv:1805.00862

Spectral clustering algorithms for the detection of clusters in block-cyclic and block-acyclic graphs

We propose two spectral algorithms for partitioning nodes in directed graphs respectively with a cyclic and an acyclic pattern of connection between groups of nodes. Our methods are based on the computation of extremal eigenvalues of the transition matrix associated to the directed graph. The two algorithms outperform state-of-the art methods for directed graph clustering on synthetic datasets, including methods based on blockmodels, bibliometric symmetrization and random walks. Our algorithms have the same space complexity as classical spectral clustering algorithms for undirected graphs and their time complexity is also linear in the number of edges in the graph. One of our methods is applied to a trophic network based on predator-prey relationships. It successfully extracts common categories of preys and predators encountered in food chains. The same method is also applied to highlight the hierarchical structure of a worldwide network of Autonomous Systems depicting business agreements between Internet Service Providers.

arXiv:1604.03159공식 코드 · Papers with Code

Phase Transitions and a Model Order Selection Criterion for Spectral Graph Clustering

One of the longstanding open problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of connected components or communities in an undirected graph. We propose automated model order selection (AMOS), a solution to the SGC model selection problem under a random interconnection model (RIM) using a novel selection criterion that is based on an asymptotic phase transition analysis. AMOS can more generally be applied to discovering hidden block diagonal structure in symmetric non-negative matrices. Numerical experiments on simulated graphs validate the phase transition analysis, and real-world network data is used to validate the performance of the proposed model selection procedure.

arXiv:1805.09114

Optimal Transport for structured data with application on graphs

This work considers the problem of computing distances between structured objects such as undirected graphs, seen as probability distributions in a specific metric space. We consider a new transportation distance (i.e. that minimizes a total cost of transporting probability masses) that unveils the geometric nature of the structured objects space. Unlike Wasserstein or Gromov-Wasserstein metrics that focus solely and respectively on features (by considering a metric in the feature space) or structure (by seeing structure as a metric space), our new distance exploits jointly both information, and is consequently called Fused Gromov-Wasserstein (FGW). After discussing its properties and computational aspects, we show results on a graph classification task, where our method outperforms both graph kernels and deep graph convolutional networks. Exploiting further on the metric properties of FGW, interesting geometric objects such as Fr\'echet means or barycenters of graphs are illustrated and discussed in a clustering context.

arXiv:1805.10211

COREclust: a new package for a robust and scalable analysis of complex data

In this paper, we present a new R package COREclust dedicated to the detection of representative variables in high dimensional spaces with a potentially limited number of observations. Variable sets detection is based on an original graph clustering strategy denoted CORE-clustering algorithm that detects CORE-clusters, i.e. variable sets having a user defined size range and in which each variable is very similar to at least another variable. Representative variables are then robustely estimate as the CORE-cluster centers. This strategy is entirely coded in C++ and wrapped by R using the Rcpp package. A particular effort has been dedicated to keep its algorithmic cost reasonable so that it can be used on large datasets. After motivating our work, we will explain the CORE-clustering algorithm as well as a greedy extension of this algorithm. We will then present how to use it and results obtained on synthetic and real data.

arXiv:1806.01678

A Projection Method for Metric-Constrained Optimization

We outline a new approach for solving optimization problems which enforce triangle inequalities on output variables. We refer to this as metric-constrained optimization, and give several examples where problems of this form arise in machine learning applications and theoretical approximation algorithms for graph clustering. Although these problem are interesting from a theoretical perspective, they are challenging to solve in practice due to the high memory requirement of black-box solvers. In order to address this challenge we first prove that the metric-constrained linear program relaxation of correlation clustering is equivalent to a special case of the metric nearness problem. We then developed a general solver for metric-constrained linear and quadratic programs by generalizing and improving a simple projection algorithm originally developed for metric nearness. We give several novel approximation guarantees for using our framework to find lower bounds for optimal solutions to several challenging graph clustering problems. We also demonstrate the power of our framework by solving optimizing problems involving up to 10^{8} variables and 10^{11} constraints.

arXiv:1806.01664공식 코드 · Papers with Code

Hierarchical Graph Clustering using Node Pair Sampling

We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs. We prove that this distance is reducible, which enables the use of the nearest-neighbor chain to speed up the agglomeration. The output of the algorithm is a regular dendrogram, which reveals the multi-scale structure of the graph. The results are illustrated on both synthetic and real datasets.

arXiv:1806.01977

A Variational Image Segmentation Model based on Normalized Cut with Adaptive Similarity and Spatial Regularization

Image segmentation is a fundamental research topic in image processing and computer vision. In the last decades, researchers developed a large number of segmentation algorithms for various applications. Amongst these algorithms, the Normalized cut (Ncut) segmentation method is widely applied due to its good performance. The Ncut segmentation model is an optimization problem whose energy is defined on a specifically designed graph. Thus, the segmentation results of the existing Ncut method are largely dependent on a pre-constructed similarity measure on the graph since this measure is usually given empirically by users. This flaw will lead to some undesirable segmentation results. In this paper, we propose a Ncut-based segmentation algorithm by integrating an adaptive similarity measure and spatial regularization. The proposed model combines the Parzen-Rosenblatt window method, non-local weights entropy, Ncut energy, and regularizer of phase field in a variational framework. Our method can adaptively update the similarity measure function by estimating some parameters. This adaptive procedure enables the proposed algorithm finding a better similarity measure for classification than the Ncut method. We provide some mathematical interpretation of the proposed adaptive similarity from multi-viewpoints such as statistics and convex optimization. In addition, the regularizer of phase field can guarantee that the proposed algorithm has a robust performance in the presence of noise, and it can also rectify the similarity measure with a spatial priori. The well-posed theory such as the existence of the minimizer for the proposed model is given in the paper. Compared with some existing segmentation methods such as the traditional Ncut-based model and the classical Chan-Vese model, the numerical experiments show that our method can provide promising segmentation results.

arXiv:1706.05826

Capacity Releasing Diffusion for Speed and Locality

Diffusions and related random walk procedures are of central importance in many areas of machine learning, data analysis, and applied mathematics. Because they spread mass agnostically at each step in an iterative manner, they can sometimes spread mass "too aggressively," thereby failing to find the "right" clusters. We introduce a novel Capacity Releasing Diffusion (CRD) Process, which is both faster and stays more local than the classical spectral diffusion process. As an application, we use our CRD Process to develop an improved local algorithm for graph clustering. Our local graph clustering method can find local clusters in a model of clustering where one begins the CRD Process in a cluster whose vertices are connected better internally than externally by an $O(\log^2 n)$ factor, where $n$ is the number of nodes in the cluster. Thus, our CRD Process is the first local graph clustering algorithm that is not subject to the well-known quadratic Cheeger barrier. Our result requires a certain smoothness condition, which we expect to be an artifact of our analysis. Our empirical evaluation demonstrates improved results, in particular for realistic social graphs where there are moderately good---but not very good---clusters.

arXiv:1806.06142

Possibility results for graph clustering: A novel consistency axiom

Kleinberg introduced three natural clustering properties, or axioms, and showed they cannot be simultaneously satisfied by any clustering algorithm. We present a new clustering property, Monotonic Consistency, which avoids the well-known problematic behaviour of Kleinberg's Consistency axiom, and the impossibility result. Namely, we describe a clustering algorithm, Morse Clustering, inspired by Morse Theory in Differential Topology, which satisfies Kleinberg's original axioms with Consistency replaced by Monotonic Consistency. Morse clustering uncovers the underlying flow structure on a set or graph and returns a partition into trees representing basins of attraction of critical vertices. We also generalise Kleinberg's axiomatic approach to sparse graphs, showing an impossibility result for Consistency, and a possibility result for Monotonic Consistency and Morse clustering.

arXiv:2606.10781v3eess.AS

비지도 용어 발견에서 지프 분포(Zipfian Distribution) 복원하기

Recovering the Zipfian Distribution in Unsupervised Term Discovery

비지도 용어 발견(unsupervised term discovery)은 레이블이 없는 음성을 단어 또는 음절 단위의 유닛으로 분할하고, 이를 군집화하여 후보 타입들의 어휘집(lexicon)을 구성하는 작업이다. 실제 어휘집은 지프 분포(Zipfian distribution)를 따르지만, 지배적인 중심 기반 군집화 방식인 K-means는 구형 군집을 선호하는 귀납적 바이어스(inductive bias) 때문에 더 균일한 분포를 만들어 낸다. 본 논문에서는 상향식(bottom-up) 대안으로서 그래프 기반 군집화를 다시 살펴본다. 이 방식에서는 세그먼트 임베딩을 쌍별 유사도로 연결하고, Leiden 알고리즘으로 분할한다. 우리는 그래프 군집화가 세 개 언어에 걸친 단어 및 음절 수준의 어휘집 발견 모두에서 중심 기반 방식(K-means, GMM, BIRCH)을 크게 능가하며, 더 지프 분포에 가까운 분포를 만들어 냄을 보인다. 또 다른 상향식 방식인 평균 연결(average linkage) 기반 병합 군집화 역시 좋은 성능을 보이지만, 계산 효율이 더 낮고 결과 분포에 대한 제어가 더 제한적이다. 본 연구는 용어 발견에서 중심 기반 군집화가 지배적이라는 통념에 의문을 제기하며, 그래프 군집화를 매력적인 대안으로 제안한다.

arXiv:2607.05469v1cs.LG

구조적 고립 극복: 커뮤니티 인식 샘플링과 구조적 엔트로피를 통한 확장 가능한 그래프 클러스터링

Breaking Structural Isolation: Scalable Graph Clustering via Community-Aware Sampling and Structural Entropy

미니배치 학습 시 커뮤니티 구조가 분리되는 "구조적 고립" 문제를 해결하기 위해, SCISE는 구조적 엔트로피 커뮤니티 제약 연산자(SECC), 커뮤니티 인식 샘플링 확장(CSampE), 구조적 대조 학습(StructCL)을 결합한 확장 가능한 비지도 그래프 클러스터링 프레임워크를 제안한다. 6개의 벤치마크 데이터셋 실험에서 기존 최신 알고리즘들을 크게 능가하며, 대규모 실세계 그래프에서의 효과성과 강건성을 입증하였다.

arXiv:2210.00310v3cs.LG

방향 그래프를 위한 매개변수화 파워 반복 클러스터링

Parametrized Power-Iteration Clustering for Directed Graphs

방향 그래프(digraph)의 정점 클러스터링은 방향성과 고유값 분해(eigen-decomposition) 부담으로 스펙트럴 방법 적용이 어렵다. ParPIC는 매개변수화된 가역 랜덤 워크 연산자의 파워 반복으로 확산 임베딩을 만들고 확산 시간을 자동 튜닝·절단해 고유값 분해 없이 클러스터링하며, 합성·실제 그래프에서 스펙트럴·텔레포테이션 방법 대비 경쟁력 있는 정확도와 더 나은 확장성을 보였다.