Finding quasi core with simulated stacked neural networks

DOI10.1016/J.INS.2014.09.032zbMATH Open1360.05171OpenAlexW2077749535MaRDI QIDQ526647FDOQ526647

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

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

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)

Cites Work

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

Cited In (1)

• Efficient temporal core maintenance of massive graphs

Uses Software

• QUALEX
• DIMACS
• darch
• Algorithm 457
• clusfind

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)