Boolean autoencoders and hypercube clustering complexity
DOI10.1007/S10623-012-9719-XzbMATH Open1252.68223OpenAlexW2013380636MaRDI QIDQ690669FDOQ690669
Publication date: 28 November 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9719-x
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analytic circuit theory (94C05)
Cites Work
- Clustering by Passing Messages Between Data Points
- Title not available (Why is that?)
- Reducing the Dimensionality of Data with Neural Networks
- Learning representations by back-propagating errors
- Title not available (Why is that?)
- Why does unsupervised pre-training help deep learning?
- The intractability of computing the minimum distance of a code
- On the inherent intractability of certain coding problems (Corresp.)
- Title not available (Why is that?)
- On the Complexity of Some Common Geometric Location Problems
- On the complexity of some coding problems (Corresp.)
- A Fast Learning Algorithm for Deep Belief Nets
- The Planar k-Means Problem is NP-Hard
- $B$-valuations of graphs
- Cubical graphs and cubical dimensions
- A Clustering and Data-Reorganizing Algorithm
- Proof of the squashed cube conjecture
- The homeomorphic embedding of \(K_n\) in the \(m\)-cube
- Complex-valued autoencoders
- Deep, Narrow Sigmoid Belief Networks Are Universal Approximators
- The complexity of cubical graphs
Cited In (1)
Uses Software
This page was built for publication: Boolean autoencoders and hypercube clustering complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690669)
