Finding quasi core with simulated stacked neural networks

DOI10.1016/J.INS.2014.09.032MaRDI QIDQ526647zbMATH OpenOpenAlexFDO

Authors Malay Bhattacharyya, Sanghamitra Bandyopadhyay

Publication date 15 May 2017

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2014.09.032

zbMATH Keywords

optimizationbioinformaticsquasi-cliquequasi-corereal-life networkstacked neural network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Neural networks for/in biological studies, artificial life and related topics (92B20) Signed and weighted graphs (05C22)

Recommendations

• Structural analysis of weighted networks
• COMMUNITY FINDING IN COMPLEX NETWORKS
• Novel approaches for analyzing biological networks
• A branch-and-bound approach for maximum quasi-cliques
• Network clustering via clique relaxation: a community based approach

Cites work

• scientific article; zbMATH DE number 2086259 (Why is no real title available?)
• scientific article; zbMATH DE number 6118217 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2079894 (Why is no real title available?)
• scientific article; zbMATH DE number 1418967 (Why is no real title available?)
• scientific article; zbMATH DE number 1424314 (Why is no real title available?)
• A branch and bound algorithm for the maximum clique problem
• A fast algorithm for the maximum clique problem
• A new trust region technique for the maximum weight clique problem
• A simple simulated annealing algorithm for the maximum clique problem
• Algorithm 457: finding all cliques of an undirected graph
• An algorithm for finding a maximum clique in a graph
• Analyzing topological properties of protein-protein interaction networks: a perspective toward systems biology
• Bounds on Quasi-Completeness
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Distributed Discovery of Large Near-Cliques
• Experiments in quadratic 0-1 programming
• Finding Groups in Data
• Optimization by simulated annealing
• Reducing the Dimensionality of Data with Neural Networks
• The Enumeration of Maximal Cliques of Large Graphs
• Using constraint programming to solve the maximum clique problem
• ``Neural computation of decisions in optimization problems

Cited in

(1)

• Efficient temporal core maintenance of massive graphs

Describes a project that uses

Uses Software

• clusfind
• Algorithm 457
• darch
• DIMACS
• QUALEX

This page was built for publication: Finding quasi core with simulated stacked neural networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526647)