IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v10y2005i1d10.1007_s10878-005-1861-1.html
   My bibliography  Save this article

Clustering of Microarray data via Clique Partitioning

Author

Listed:
  • Gary Kochenberger

    (University of Colorado at Denver)

  • Fred Glover

    (University of Colorado at Boulder)

  • Bahram Alidaee

    (University of Mississippi)

  • Haibo Wang

    (Texas A&M International University)

Abstract

Microarrays are repositories of gene expression data that hold tremendous potential for new understanding, leading to advances in functional genomics and molecular biology. Cluster analysis (CA) is an early step in the exploration of such data that is useful for purposes of data reduction, exposing hidden patterns, and the generation of hypotheses regarding the relationship between genes and phenotypes. In this paper we present a new model for the clique partitioning problem and illustrate how it can be used to perform cluster analysis in this setting.

Suggested Citation

  • Gary Kochenberger & Fred Glover & Bahram Alidaee & Haibo Wang, 2005. "Clustering of Microarray data via Clique Partitioning," Journal of Combinatorial Optimization, Springer, vol. 10(1), pages 77-92, August.
    • Handle: RePEc:spr:jcomop:v:10:y:2005:i:1:d:10.1007_s10878-005-1861-1
    DOI: 10.1007/s10878-005-1861-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-1861-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-005-1861-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ulrich Dorndorf & Erwin Pesch, 1994. "Fast Clustering Algorithms," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 141-153, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fred Glover & Gary Kochenberger & Rick Hennig & Yu Du, 2022. "Quantum bridge analytics I: a tutorial on formulating and using QUBO models," Annals of Operations Research, Springer, vol. 314(1), pages 141-183, July.
    2. Andrews, Rick L. & Brusco, Michael J. & Currim, Imran S., 2010. "Amalgamation of partitions from multiple segmentation bases: A comparison of non-model-based and model-based methods," European Journal of Operational Research, Elsevier, vol. 201(2), pages 608-618, March.
    3. Oleksandra Yezerska & Foad Mahdavi Pajouh & Alexander Veremyev & Sergiy Butenko, 2019. "Exact algorithms for the minimum s-club partitioning problem," Annals of Operations Research, Springer, vol. 276(1), pages 267-291, May.
    4. Jovanovic, Raka & Sanfilippo, Antonio P. & Voß, Stefan, 2023. "Fixed set search applied to the clique partitioning problem," European Journal of Operational Research, Elsevier, vol. 309(1), pages 65-81.
    5. Larisa Komosko & Mikhail Batsyn & Pablo San Segundo & Panos M. Pardalos, 2016. "A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1665-1677, May.
    6. Noriyoshi Sukegawa & Yoshitsugu Yamamoto & Liyuan Zhang, 2013. "Lagrangian relaxation and pegging test for the clique partitioning problem," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 7(4), pages 363-391, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2017. "Flight gate assignment and recovery strategies with stochastic arrival and departure times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 65-93, January.
    2. Yi Zhou & Jin-Kao Hao & Adrien Goëffon, 2016. "A three-phased local search approach for the clique partitioning problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 469-491, August.
    3. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2008. "Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem," Transportation Science, INFORMS, vol. 42(3), pages 292-301, August.
    4. Jovanovic, Raka & Sanfilippo, Antonio P. & Voß, Stefan, 2023. "Fixed set search applied to the clique partitioning problem," European Journal of Operational Research, Elsevier, vol. 309(1), pages 65-81.
    5. Oleksandra Yezerska & Foad Mahdavi Pajouh & Alexander Veremyev & Sergiy Butenko, 2019. "Exact algorithms for the minimum s-club partitioning problem," Annals of Operations Research, Springer, vol. 276(1), pages 267-291, May.
    6. Ah-Pine, Julien, 2022. "Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1069-1078.
    7. César Rego & Fred Glover, 2010. "Ejection chain and filter-and-fan methods in combinatorial optimization," Annals of Operations Research, Springer, vol. 175(1), pages 77-105, March.
    8. Albareda-Sambola, Maria & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2019. "Reformulated acyclic partitioning for rail-rail containers transshipment," European Journal of Operational Research, Elsevier, vol. 277(1), pages 153-165.
    9. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2012. "Flight gate scheduling with respect to a reference schedule," Annals of Operations Research, Springer, vol. 194(1), pages 177-187, April.
    10. Coleman, Dan & Dong, Xioapeng & Hardin, Johanna & Rocke, David M. & Woodruff, David L., 1999. "Some computational issues in cluster analysis with no a priori metric," Computational Statistics & Data Analysis, Elsevier, vol. 31(1), pages 1-11, July.
    11. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    12. Rego, Cesar, 1998. "Relaxed tours and path ejections for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 522-538, April.
    13. Blazewicz, Jacek & Pesch, Erwin & Sterna, Malgorzata, 2005. "A novel representation of graph structures in web mining and data analysis," Omega, Elsevier, vol. 33(1), pages 65-71, February.
    14. Noriyoshi Sukegawa & Yoshitsugu Yamamoto & Liyuan Zhang, 2013. "Lagrangian relaxation and pegging test for the clique partitioning problem," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 7(4), pages 363-391, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:10:y:2005:i:1:d:10.1007_s10878-005-1861-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.