Co-Clustering under the Maximum Norm
نویسندگان
چکیده
منابع مشابه
Co-Clustering Under the Maximum Norm
Co-clustering, that is, partitioning a numerical matrix into “homogeneous” submatrices, has many applications ranging from bioinformatics to election analysis. Many interesting variants of co-clustering are NP-hard. We focus on the basic variant of co-clustering where the homogeneity of a submatrix is defined in terms of minimizing the maximum distance between two entries. In this context, we s...
متن کاملTHE INVERSE MAXIMUM FLOW PROBLEM UNDER WEIGHTED l∞ NORM
The problem introduced in this paper (denoted IMFW∞) is to modify the capacities on arcs from a network so that a given feasible flow becomes a maximum flow and the maximum cost of change of the capacities is minimum. This problem is a generalization of the inverse maximum flow problem under l∞ norm (denoted IMF∞, where the per unit cost of modification is equal to 1 on all arcs), which was pri...
متن کاملTHE INVERSE MAXIMUM FLOW PROBLEM UNDER WEIGHTED lk NORM
The problem consists in modifying the lower and the upper bounds of a given feasible flow f in a network G so that the given flow becomes a maximum flow in G and the distance between the initial vector of bounds and the modified one measured using weighted Lk norm (k ∈ N) is minimum. We denote this problem by IMFWLk. IMFWLk is a generalization of the inverse maximum flow problem under Lk norm (...
متن کاملMaximum Split Clustering Under Connectivity Constraints
Consider N entities to be classified (e.g., geographical areas), a matrix of dissimilarity between pairs of entities, a graph H with vertices associated with these entities such that the edges join the vertices corresponding to contiguous entities. The split of a cluster is the smallest dissimilarity between an entity of this cluster and an entity outside of it. The single-linkage algorithm (ig...
متن کاملBregman Co-clustering and Matrix Approximation A Generalized Maximum Entropy Approach to Bregman Co-clustering and Matrix Approximation
Co-clustering, or simultaneous clustering of rows and columns of a two-dimensional data matrix, is rapidly becoming a powerful data analysis technique. Co-clustering has enjoyed wide success in varied application domains such as text clustering, gene-microarray analysis, natural language processing and image, speech and video analysis. In this paper, we introduce a partitional co-clustering for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2016
ISSN: 1999-4893
DOI: 10.3390/a9010017