The computational complexity of densest region detection
type: Item
instance of: scholarly article
title: The computational complexity of densest region detection
zbMATH Open document ID: 1006.68058
author: Shai Ben-David
author: Nadav Eiron
author: Hans Ulrich Simon
published in: Journal of Computer and System Sciences
publication date: 2002-07-04T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1763423
zbMATH Keywords: unsupervised learning
zbMATH Keywords: machine learning
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: jcss.2001.1797
OpenAlex ID: W1964108907
cites work: Neural Network Learning
cites work: On the difficulty of approximately maximizing agreements.
cites work: Learning distributions by their density levels: A paradigm for learning without a teacher
cites work: On a characterization of operators from \(l_ q \)into a Banach space of type p with some applications to eigenvalue problems
cites work: Q4393480
cites work: Q4403756
cites work: Universal Donsker classes and metric entropy
cites work: Q4526964
cites work: The densest hemisphere problem
cites work: On the complexity of polyhedral separability
cites work: Q3952642
DOI: 10.1006/JCSS.2001.1797
Recommended article: EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
Recommended article: Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
Recommended article: Computational Complexity of Two-Dimensional Regions
Recommended article: The complexity of detecting fixed-density clusters
Recommended article: Q4437509
Recommended article: Region intensity complexity active contours
Recommended article: Calculating a linear-time solution to the densest-segment problem
Recommended article: Fast algorithms for the density finding problem
description: scientific article; zbMATH DE number 1763423