Normalized Cheeger Cut With Neighborhood Rough Approximation
نویسندگان
چکیده
منابع مشابه
Is Cheeger-type Approximation Possible for Nonuniform Sparsest Cut?
In the nonuniform sparsest cut problem, given two undirected graphs G and H over the same set of vertices V , we want to find a cut (S, V − S) that minimizes the ratio between the fraction of G-edges that are cut and the fraction of H-edges that are cut. The ratio (which is at most 1 in an optimal solution) is called the sparsity of the cut. The special case in which H is a clique over V is cal...
متن کاملRough approximation operators based on quantale-valued fuzzy generalized neighborhood systems
Let $L$ be an integral and commutative quantale. In this paper, by fuzzifying the notion of generalized neighborhood systems, the notion of $L$-fuzzy generalized neighborhoodsystem is introduced and then a pair of lower and upperapproximation operators based on it are defined and discussed. It is proved that these approximation operators include generalized neighborhood system...
متن کاملNormalized Cut Meets MRF
We propose a new segmentation or clustering model that combines Markov Random Field (MRF) and Normalized Cut (NC) objectives. Both NC and MRF models are widely used in machine learning and computer vision, but they were not combined before due to significant differences in the corresponding optimization, e.g. spectral relaxation and combinatorial max-flow techniques. On the one hand, we show th...
متن کاملScalable Normalized Cut with Improved Spectral Rotation
Many spectral clustering algorithms have been proposed and successfully applied to many highdimensional applications. However, there are still two problems that need to be solved: 1) existing methods for obtaining the final clustering assignments may deviate from the true discrete solution, and 2) most of these methods usually have very high computational complexity. In this paper, we propose a...
متن کاملConvex Transduction with the Normalized Cut
We discuss approaches to transduction based on graph cut cost functions. More specifically, we focus on the normalized cut, which is the cost function of choice in many clustering applications, notably in image segmentation. Since optimizing the normalized cut cost is an NP-complete problem, much of the research attention so far has gone to relaxing the problem of normalized cut clustering to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2823423