Finding checkerboard patterns via fractional 0–1 programming
Andrew Trapp (),
Oleg A. Prokopyev () and
Stanislav Busygin ()
Additional contact information
Andrew Trapp: University of Pittsburgh
Oleg A. Prokopyev: University of Pittsburgh
Stanislav Busygin: University of Florida
Journal of Combinatorial Optimization, 2010, vol. 20, issue 1, No 1, 26 pages
Abstract:
Abstract Biclustering is a data mining technique used to simultaneously partition the set of samples and the set of their attributes (features) into subsets (clusters). Samples and features clustered together are supposed to have a high relevance to each other. In this paper we provide a new mathematical programming formulation for unsupervised biclustering. The proposed model involves the solution of a fractional 0–1 programming problem. A linear-mixed 0–1 reformulation as well as two heuristic-based approaches are developed. Encouraging computational results on clustering real DNA microarray data sets are presented. In addition, we also discuss theoretical computational complexity issues related to biclustering.
Keywords: Unsupervised biclustering; Data mining; Fractional 0–1 programming; Heuristics (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9186-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:20:y:2010:i:1:d:10.1007_s10878-008-9186-5
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-008-9186-5
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().