Sparse \(p\)-adic data coding for computationally efficient and effective big data analytics (Q344041): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A29 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11S85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68P25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6654942 / rank
 
Normal rank
Property / zbMATH Keywords
 
big data
Property / zbMATH Keywords: big data / rank
 
Normal rank
Property / zbMATH Keywords
 
\(p\)-adic numbers
Property / zbMATH Keywords: \(p\)-adic numbers / rank
 
Normal rank
Property / zbMATH Keywords
 
ultrametric topology
Property / zbMATH Keywords: ultrametric topology / rank
 
Normal rank
Property / zbMATH Keywords
 
hierarchical clustering
Property / zbMATH Keywords: hierarchical clustering / rank
 
Normal rank
Property / zbMATH Keywords
 
binary rooted tree
Property / zbMATH Keywords: binary rooted tree / rank
 
Normal rank
Property / zbMATH Keywords
 
computational and storage complexity
Property / zbMATH Keywords: computational and storage complexity / rank
 
Normal rank

Revision as of 06:52, 28 June 2023

scientific article
Language Label Description Also known as
English
Sparse \(p\)-adic data coding for computationally efficient and effective big data analytics
scientific article

    Statements

    Sparse \(p\)-adic data coding for computationally efficient and effective big data analytics (English)
    0 references
    0 references
    22 November 2016
    0 references
    big data
    0 references
    \(p\)-adic numbers
    0 references
    ultrametric topology
    0 references
    hierarchical clustering
    0 references
    binary rooted tree
    0 references
    computational and storage complexity
    0 references

    Identifiers