Pages that link to "Item:Q4557567"
From MaRDI portal
The following pages link to Projective clustering in high dimensions using core-sets (Q4557567):
Displaying 9 items.
- Efficient subspace approximation algorithms (Q664540) (← links)
- Fast subspace approximation via greedy least-squares (Q745854) (← links)
- Dynamic coresets (Q834605) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Optimal core-sets for balls (Q2479470) (← links)
- Core-Sets: Updated Survey (Q3297370) (← links)
- (Q5743431) (← links)
- Analysis of incomplete data and an intrinsic-dimension Helly theorem (Q5901492) (← links)
