Annealing and the normalized \(N\)-cut
From MaRDI portal
Publication:2459557
DOI10.1016/j.patcog.2007.06.014zbMath1131.68097OpenAlexW2063437517WikidataQ42139032 ScholiaQ42139032MaRDI QIDQ2459557
Tomáš Gedeon, Albert E. Parker, Zane Aldworth, Collette Campion
Publication date: 7 November 2007
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2007.06.014
Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Machine vision and scene understanding (68T45)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Singularities and groups in bifurcation theory. Volume I
- Bifurcation structure of a class of \(S_N\)-invariant constrained optimization problems
- Mathematical classification and clustering
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Neural coding and decoding: communication channels and quantization
- Information-based clustering
- Multivariate Information Bottleneck