Boolean autoencoders and hypercube clustering complexity (Q690669): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-012-9719-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013380636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of cubical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex-valued autoencoders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering by Passing Messages Between Data Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubical graphs and cubical dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The homeomorphic embedding of \(K_n\) in the \(m\)-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: $B$-valuations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Learning Algorithm for Deep Belief Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the Dimensionality of Data with Neural Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar k-Means Problem is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning representations by back-propagating errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Clustering and Data-Reorganizing Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deep, Narrow Sigmoid Belief Networks Are Universal Approximators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the squashed cube conjecture / rank
 
Normal rank

Latest revision as of 22:58, 5 July 2024

scientific article
Language Label Description Also known as
English
Boolean autoencoders and hypercube clustering complexity
scientific article

    Statements

    Boolean autoencoders and hypercube clustering complexity (English)
    0 references
    28 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    autoencoders
    0 references
    clustering
    0 references
    Boolean circuits
    0 references
    computational complexity
    0 references
    learning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references