A game-theoretic approach to partial clique enumeration
Reads0
Chats0
TLDR
This paper presents a novel approach for partial clique enumeration, which is based on a continuous formulation of the clique problem developed in the 1960s by Motzkin and Straus, and is able to avoid extracting the same clique multiple times.About:
This article is published in Image and Vision Computing.The article was published on 2009-06-01 and is currently open access. It has received 34 citations till now. The article focuses on the topics: Clique graph & Clique problem.read more
Figures
Table 1 Experiments on q-random graphs. 
Fig. 4. Average size of the extracted clique over the number of extractions. 
Fig. 5. Plots of the average size of the cliques found by our algorithm (EH), 
Table 3 A tabulation of the top eight topological matches for each query. The scores indicate the cost calculated for each match according to the Function (6.2) and the integer between square brackets indicates the position of extraction of the best match during the clique enumeration. 
Fig. 1. In this directed graph we have that fA; B;Cg is doubly-linked clique, but it is not saturated because of D, while fA;Dg is a saturated doubly-linked clique. 
Fig. 2. On the left we have an undirected graph G. On the right we have the Rextension GR , where R ¼ ffA; B;Cg; fA;D; Egg.
Citations
More filters
Journal ArticleDOI
Graph-based quadratic optimization: A fast evolutionary approach
TL;DR: A new population game dynamics (InImDyn) is proposed which is motivated by the analogy with infection and immunization processes within a population of ''players,'' and it is proved that the evolution of the dynamics is governed by a quadratic Lyapunov function, representing the average population payoff.
Journal ArticleDOI
The maximum clique enumeration problem: algorithms, applications, and implementations
TL;DR: Empirical testing reveals crucial but latent features of high-throughput biological data which distinguish real data from random data intended to reproduce salient topological features and novel decomposition strategies are tuned to the data and coupled with the best FPT MCE implementations.
Journal ArticleDOI
Consistent Partial Matching of Shape Collections via Sparse Modeling
TL;DR: A novel approach to obtain consistent matches without requiring initial pairwise solutions to be given as input is introduced by optimizing a joint measure of metric distortion directly over the space of cycle‐consistent maps.
Journal ArticleDOI
A Game-Theoretic Framework for Landmark-Based Image Segmentation
TL;DR: The framework overcomes several shortcomings of the existing techniques, such as sensitivity to initialization and convergence to local optima, and is highly accurate and precise in terms of mean boundary distance and area overlap.
Journal ArticleDOI
Dominant-set clustering: A review
TL;DR: This manuscript reviews two state-of-the-art methods that are used in the literature to find dominant sets clusters, namely the Replicator Dynamics and the Infection and Immunization Dynamics, and provides an overview of different extensions of the dominant set framework and of applications where dominant sets have been successfully employed.
References
More filters
Book
Linear and nonlinear programming
David G. Luenberger,Yinyu Ye +1 more
TL;DR: Strodiot and Zentralblatt as discussed by the authors introduced the concept of unconstrained optimization, which is a generalization of linear programming, and showed that it is possible to obtain convergence properties for both standard and accelerated steepest descent methods.
Book
Evolutionary Game Theory
TL;DR: Weibull as discussed by the authors introduces evolutionary game theory, where ideas from evolutionary biology and rationalistic economics meet, emphasizing the links between static and dynamic approaches and non-cooperative game theory.
Journal ArticleDOI
Evolutionary stable strategies and game dynamics
Peter D. Taylor,Leo Jonker +1 more
TL;DR: In this article, the authors consider a class of matrix games in which successful strategies are rewarded by high reproductive rates, so become more likely to participate in subsequent playings of the game, thus, over time, the strategy mix should evolve to some type of optimal or stable state.