Constrained Spectral Clustering under a Local Proximity Structure Assumption
نویسندگان
چکیده
This work focuses on incorporating pairwise constraints into a spectral clustering algorithm. A new constrained spectral clustering method is proposed, as well as an active constraint acquisition technique and a heuristic for parameter selection. We demonstrate that our constrained spectral clustering method, CSC, works well when the data exhibits what we term local proximity structure. Empirical results on synthetic and real data sets show that CSC outperforms two other constrained clustering algorithms.
منابع مشابه
Constrained Spectral Clustering with Distance Metric Learning
Spectral clustering is a flexible clustering technique that finds data clusters in the spectral embedding space of the data. It doesn’t assume convexity of the shape of clusters, and is able to find non-linear cluster boundaries. Constrained spectral clustering aims at incorporating user-defined pairwise constraints in to spectral clustering. Typically, there are two kinds of pairwise constrain...
متن کاملLEGClust - A Clustering Algorithm Based on Layered Entropic Subgraphs
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measur...
متن کاملPerformance based assessment of offshore wind turbine platform using the constrained new wave method
The purpose of this study is to provide a more accurate and practical method than static and spectral methods to assess the offshore wind turbines that are loaded with both wave and wind time history, the structure is evaluated by increasing the load intensity in successive steps to the stage of failure and the performance of the platform in different wave patterns are investigated. In this stu...
متن کاملNovel Framework for Spectral Clustering using Topological Node Features(TNF)
Spectral clustering has gained importance in recent years due to its ability to cluster complex data as it requires only pairwise similarity among data points with its ease of implementation. The central point in spectral clustering is the process of capturing pair-wise similarity. In the literature, many research techniques have been proposed for effective construction of affinity matrix with ...
متن کاملConstrained fractional set programs and their application in local clustering and community detection
The (constrained) minimization of a ratio of set functions is a problem frequently occurring in clustering and community detection. As these optimization problems are typically NP-hard, one uses convex or spectral relaxations in practice. While these relaxations can be solved globally optimally, they are often too loose and thus lead to results far away from the optimum. In this paper we show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005