Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Statistics > Machine Learning

arXiv:1307.6515 (stat)
[Submitted on 24 Jul 2013]

Title:Cluster Trees on Manifolds

Authors:Sivaraman Balakrishnan, Srivatsan Narayanan, Alessandro Rinaldo, Aarti Singh, Larry Wasserman
View a PDF of the paper titled Cluster Trees on Manifolds, by Sivaraman Balakrishnan and 4 other authors
View PDF HTML (experimental)
Abstract:In this paper we investigate the problem of estimating the cluster tree for a density $f$ supported on or near a smooth $d$-dimensional manifold $M$ isometrically embedded in $\mathbb{R}^D$. We analyze a modified version of a $k$-nearest neighbor based algorithm recently proposed by Chaudhuri and Dasgupta. The main results of this paper show that under mild assumptions on $f$ and $M$, we obtain rates of convergence that depend on $d$ only but not on the ambient dimension $D$. We also show that similar (albeit non-algorithmic) results can be obtained for kernel density estimators. We sketch a construction of a sample complexity lower bound instance for a natural class of manifold oblivious clustering algorithms. We further briefly consider the known manifold case and show that in this case a spatially adaptive algorithm achieves better rates.
Comments: 28 pages, 3 figures
Subjects: Machine Learning (stat.ML); Machine Learning (cs.LG)
Cite as: arXiv:1307.6515 [stat.ML]
  (or arXiv:1307.6515v1 [stat.ML] for this version)
  https://doi.org/10.48550/arXiv.1307.6515
arXiv-issued DOI via DataCite

Submission history

From: Sivaraman Balakrishnan [view email]
[v1] Wed, 24 Jul 2013 18:17:53 UTC (80 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Cluster Trees on Manifolds, by Sivaraman Balakrishnan and 4 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Current browse context:

stat.ML
< prev   |   next >
new | recent | 2013-07
Change to browse by:
cs
cs.LG
stat

References & Citations

  • SciX
  • Google Scholar
  • Semantic Scholar
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)