Skip to main content
SpringerLink
Log in

Clique Editing to Support Case Versus Control Discrimination

  • Conference paper
  • First Online:
Intelligent Decision Technologies 2016 (IDT 2016)

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 56))

Included in the following conference series:

Abstract

We present a graph-based approach to support case vs control discrimination problems. The goal is to partition a given input graph in two sets, a clique and an independent set, such that there is no edge connecting a vertex of the clique with a vertex of the independent set. Following a parsimonious principle, we consider the problem that aims to modify the input graph into a most similar output graph that consists of a clique and an independent set (with no edge between the two sets). First, we present a theoretical result showing that the problem admits a polynomial-time approximation scheme. Then, motivated by the complexity of such an algorithm, we propose a genetic algorithm and we present an experimental analysis on simulated data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Different variants of the problem have been investigated, including the weighted and constrained variants [3, 8].

  2. 2.

    We use Random Graphs (RGs) as generative models to simulate observations.

  3. 3.

    The tests were performed on a machine with 8 GB RAM, Intel Core i7 2.30 GHz.

References

  1. Arora, S., Frieze, A.M., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. In: 37th Annual Symposium on Foundations of Computer Science, FOCS ’96, Burlington, Vermont, USA, 14–16 October, 1996, pp. 21–30 (1996)

    Google Scholar 

  2. Baluja, S., Caruana, R.: Removing the genetics from the standard genetic algorithm. In: Prieditis, A., Russell, S.J. (eds.) Machine Learning, Proceedings of the Twelfth International Conference on Machine Learning, Tahoe City, California, USA, July 9–12, 1995, pp. 38–46. Morgan Kaufmann (1995)

    Google Scholar 

  3. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1–3), 89–113 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bollobas, B.: Random Graphs. Cambridge University Press (2001)

    Google Scholar 

  5. Bonizzoni, P., Della Vedova, G., Dondi, R., Jiang, T.: On the approximation of correlation clustering and consensus clustering. J. Comput. Syst. Sci. 74(5), 671–696 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cava, C., Zoppis, I., Gariboldi, M., Castiglioni, I., Mauri, G., Antoniotti, M.: Copy–number alterations for tumor progression inference. Artif. Intell. Med. 104–109 (2013)

    Google Scholar 

  7. Cava, C., Zoppis, I., Gariboldi, M., Castiglioni, I., Mauri, G., Antoniotti, M.: Combined analysis of chromosomal instabilities and gene expression for colon cancer progression inference. J. Clin. Bioinform. 4, 2 (2014)

    Article  Google Scholar 

  8. Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. Theory Comput. 2(13), 249–266 (2006). http://dx.doi.org/10.4086/toc.2006.v002a013

  9. Hüffner, F., Komusiewicz, C., Nichterlein, A.: Editing graphs into few cliques: complexity, approximation, and kernelization schemes. In: Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings, pp. 410–421 (2015)

    Google Scholar 

  10. Jiang, T., Kearney, P.E., Li, M.: A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM J. Comput. 30(6), 1942–1961 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kolaczyk, E.D.: Statistical Analysis of Network Data: Methods and Models. Springer (2009)

    Google Scholar 

  12. Long, B., Zhang, Z., Yu, P.S.: Relational Data Clustering: Models, Algorithms, and Applications. Chapman and Hall/CRC (2010)

    Google Scholar 

  13. Mitchell, M.: An Introduction to Genetic Algorithms. Complex Adaptive Systems. MIT Press, Cambridge (Mass.) (1996)

    Google Scholar 

  14. Scrucca, L.: GA: a package for genetic algorithms in R. J. Stat. Softw. 53(4), 1–37 (2013)

    Article  Google Scholar 

  15. Wirth, A.: Correlation clustering. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of Machine Learning, pp. 227–231. Springer (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze Umane e Sociali, Università Degli Studi di Bergamo, Bergamo, Italy

    Riccardo Dondi

  2. Dipartimento di Informatica, Sistemistica e Comunicazione, Università Degli Studi di Milano-Bicocca, Milano, Italy

    Giancarlo Mauri & Italo Zoppis

Authors
  1. Riccardo Dondi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giancarlo Mauri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Italo Zoppis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Riccardo Dondi .

Editor information

Editors and Affiliations

  1. Maritime University, Gdynia, Poland

    Ireneusz Czarnowski

  2. Artificial Intelligence Department, Universidad Politécnica de Madrid, Boadilla del Monte, Madrid, Spain

    Alfonso Mateos Caballero

  3. KES International, Shoreham-by-sea, United Kingdom

    Robert J. Howlett

  4. University of Canberra, Canberra, South Australia, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Dondi, R., Mauri, G., Zoppis, I. (2016). Clique Editing to Support Case Versus Control Discrimination. In: Czarnowski, I., Caballero, A., Howlett, R., Jain, L. (eds) Intelligent Decision Technologies 2016. IDT 2016. Smart Innovation, Systems and Technologies, vol 56. Springer, Cham. https://doi.org/10.1007/978-3-319-39630-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39630-9_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39629-3

  • Online ISBN: 978-3-319-39630-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation