On finding large conjunctive clusters.

DOI10.1007/B12006MaRDI QIDQ5305869zbMATH OpenOpenAlexFDO

Authors Nina Mishra, Dana Ron, R. Swaminathan

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

conceptual clusteringmax edge bicliqueunsupervised learning

Mathematics Subject Classification ID

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

Recommendations

• A new conceptual clustering framework
• scientific article; zbMATH DE number 2080486
• Finding biclusters by random projections
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 1305418

Cited in

(7)

• Finding maximum edge bicliques in convex bipartite graphs
• Efficient approximation for restricted biclique cover problems
• Parameterized algorithms for edge biclique and related problems
• Inapproximability of Maximum Weighted Edge Biclique and Its Applications
• Joint cluster analysis of attribute data and relationship data
• Parameterized algorithms for maximum edge biclique and related problems
• Finding biclusters by random projections

This page was built for publication: On finding large conjunctive clusters.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305869)