2019 IEEE International Conference on Big Data (Big Data) 2019
DOI: 10.1109/bigdata47090.2019.9006013
|View full text |Cite
|
Sign up to set email alerts
|

Coarse Graining of Data via Inhomogeneous Diffusion Condensation

Abstract: Big data often has emergent structure that exists at multiple levels of abstraction, which are useful for characterizing complex interactions and dynamics of the observations. Here, we consider multiple levels of abstraction via a multiresolution geometry of data points at different granularities. To construct this geometry we define a time-inhomogeneous diffusion process that effectively condenses data points together to uncover nested groupings at larger and larger granularities. This inhomogeneous process c… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
39
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

5
2

Authors

Journals

citations
Cited by 18 publications
(39 citation statements)
references
References 28 publications
(45 reference statements)
0
39
0
Order By: Relevance
“…Diffusion condensation is a dynamic process by which data points slowly and iteratively come together at a rate determined by the diffusion probabilities between them [12]. This iterative process is powerful as it reveals structure and groupings of the data at all levels of granularity for a given diffusion kernel bandwidth.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Diffusion condensation is a dynamic process by which data points slowly and iteratively come together at a rate determined by the diffusion probabilities between them [12]. This iterative process is powerful as it reveals structure and groupings of the data at all levels of granularity for a given diffusion kernel bandwidth.…”
Section: Resultsmentioning
confidence: 99%
“…The first step involves computing a Markov diffusion operator from a dataset. This is done by first computing a distance matrix D between all data points, before converting this to an affinity matrix K by using an fixed bandwidth Gaussian kernel function as done previously [12]. K is then row normalized to obtain a diffusion operator between data points.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…In neuropils, densely packed neurons synaptically interconnect into precise circuit architecture 2,3 , yet the structural and developmental principles governing nanoscale precision in bundled neuropil assembly remain largely unknown [4][5][6] . Here we use diffusion condensation, a coarsegraining clustering algorithm 7 , to identify nested circuit structures within the C. elegans cerebral neuropil (called the nerve ring). We determine that the nerve ring neuropil is organized into four tightly bundled strata composed of related behavioral circuits.…”
Section: Discussionmentioning
confidence: 99%