Learning Theory and Kernel Machines

DOI10.1007/b12006zbMath1274.68340OpenAlexW2492608700MaRDI QIDQ5305869

Ram Swaminathan, Dana Ron, Nina Mishra

Publication date: 23 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b12006

zbMATH Keywords

unsupervised learningconceptual clusteringmax edge biclique

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (6)

Parameterized algorithms for edge biclique and related problems ⋮ Finding biclusters by random projections ⋮ Inapproximability of Maximum Weighted Edge Biclique and Its Applications ⋮ Parameterized Algorithms for Maximum Edge Biclique and Related Problems ⋮ Finding maximum edge bicliques in convex bipartite graphs ⋮ Efficient approximation for restricted biclique cover problems

This page was built for publication: Learning Theory and Kernel Machines