A clique graph based merging strategy for decomposable SDPs
نویسندگان
چکیده
منابع مشابه
Interaction graph mining for protein complexes using local clique merging.
While recent technological advances have made available large datasets of experimentally-detected pairwise protein-protein interactions, there is still a lack of experimentally-determined protein complex data. To make up for this lack of protein complex data, we explore the mining of existing protein interaction graphs for protein complexes. This paper proposes a novel graph mining algorithm to...
متن کاملA Cluster-Based Merging Strategy for Nearest Prototype Classifiers
A generalized prototype-based learning scheme founded on hierarchical clustering is proposed. The basic idea is to obtain a condensed nearest neighbor classification rule by replacing a group of prototypes by a representative while approximately keeping their original classification power. The algorithm improves and generalizes previous works by explicitly introducing the concept of cluster and...
متن کاملA Grouping Based Cooperative Driving Strategy for CAVs Merging Problems
In general, there are two kinds of cooperative driving strategies, planning based strategy and ad hoc negotiation based strategy, for connected and automated vehicles (CAVs) merging problems. The planning based strategy aims to find the global optimal passing order, but it is time-consuming when the number of considered vehicles is large. In contrast, the ad hoc negotiation based strategy runs ...
متن کاملEfficient Splitting and Merging Algorithms for Order Decomposable Problems
Let S be a set whose items are sorted with respect to d > 1 total orders 1 ; : : : ; d , and which is subject to dynamic operations, such as insertions of a single item, deletions of a single item, split and concatenate operations performed according to any chosen order i (1 i d). This generalizes to dimension d > 1 the notion of concatenable data structures, such as the 2-3-trees, which suppor...
متن کاملA decomposable graph and its subgraphs
We explore the properties of subgraphs (called Markovian subgraphs) of a decomposable graph under some condition. For a decomposable graph G and a collection γ of its Markovian subgraphs, we show that the set χ(G) of the intersections of all the neighboring cliques of G contains ∪g∈γχ(g). We also show that χ(G) = ∪g∈γχ(g) holds for a certain type of G which we call a maximal Markovian supergrap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2020.12.1255