Sparse \(p\)-adic data coding for computationally efficient and effective big data analytics (Q344041)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sparse p-adic data coding for computationally efficient and effective big data analytics |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
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
0.748235285282135
0 references
0.6998862028121948
0 references
0.6939347386360168
0 references
0.6871285438537598
0 references
0.6801443099975586
0 references
