Lossy compression approach to subspace clustering (Q2195417): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q112225896, #quickstatements; #temporary_batch_1710972793655
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ins.2017.12.056 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On measures of information and their characterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303322753616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal component analysis. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace clustering of high-dimensional data: a predictive approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the dimension of a model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross-entropy clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Method for Generating Discrete Random Variables with General Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance metric learning for soft subspace clustering in composite kernel space / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.INS.2017.12.056 / rank
 
Normal rank

Latest revision as of 10:49, 17 December 2024

scientific article
Language Label Description Also known as
English
Lossy compression approach to subspace clustering
scientific article

    Statements

    Lossy compression approach to subspace clustering (English)
    0 references
    0 references
    0 references
    0 references
    8 September 2020
    0 references
    subspace clustering
    0 references
    projected clustering
    0 references
    minimum description length principle
    0 references
    entropy
    0 references

    Identifiers