Minimal Biclique Set Cover Task
(Redirected from minimal biclique set cover problem)
Jump to navigation
Jump to search
A Minimal Biclique Set Cover Task is a minimal set cover task that is restricted to bicliques.
- Context:
- It can be solved by a Minimal Biclique Set Cover System (that implements a minimal biclique set cover algorithm)
- See: Bipartite Dimension.
References
2009
- (Jin et al., 2009) ⇒ Ruoming Jin, Yang Xiang, Lin Liu. (2009). “Cartesian Contour: A Concise Representation for a Collection of Frequent Sets.” In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2009). doi:10.1145/1557019.1557069
- QUOTE: We develop a novel approach utilizing the technique developed in frequent itemset mining, set cover, and max k-cover to approximate the minimal biclique set cover problem. </s.
2008
- (Ene et al., 2008) ⇒ Alina Ene, William Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, and Robert E. Tarjan. (2008). “Fast Exact and Heuristic Methods for Role Minimization Problems.” In: Proceedings of the 13th ACM symposium on Access control models and technologies, pp. 1-10 . ACM,
- QUOTE: … Then all intersections of the permission sets of this initial set of bicliques are generated... Vaidya, Atluri, and Guo (21) formally define the RMP, in effect as the minimum biclique cover problem ... a greedy heuristic that grows a cover by including, at each step, the biclique that covers...