IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v17y2009i2p250-252.html
   My bibliography  Save this article

Comments on: Optimization and data mining in medicine

Author

Listed:
  • Adil Bagirov

Abstract

No abstract is available for this item.

Suggested Citation

  • Adil Bagirov, 2009. "Comments on: Optimization and data mining in medicine," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(2), pages 250-252, December.
    • Handle: RePEc:spr:topjnl:v:17:y:2009:i:2:p:250-252
    DOI: 10.1007/s11750-009-0130-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-009-0130-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-009-0130-3?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. A. Bagirov & A. Rubinov & N. Soukhoroukova & J. Yearwood, 2003. "Unsupervised and supervised data classification via nonsmooth and global optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(1), pages 1-75, June.
    Full references (including those not matched with items on IDEAS)

    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. Karmitsa, Napsu & Bagirov, Adil M. & Taheri, Sona, 2017. "New diagonal bundle method for clustering problems in large data sets," European Journal of Operational Research, Elsevier, vol. 263(2), pages 367-379.
    2. Adil Bagirov & Asef Ganjehlou, 2008. "An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(2), pages 187-206, April.
    3. Xeniya Vladimirovna Grigor’eva, 2016. "Approximate Functions in a Problem of Sets Separation," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 550-572, November.
    4. Freitas, Paulo S.A. & Rodrigues, Antonio J.L., 2006. "Model combination in neural-based forecasting," European Journal of Operational Research, Elsevier, vol. 173(3), pages 801-814, September.
    5. A. Bagirov & B. Ordin & G. Ozturk & A. Xavier, 2015. "An incremental clustering algorithm based on hyperbolic smoothing," Computational Optimization and Applications, Springer, vol. 61(1), pages 219-241, May.
    6. Laura Palagi, 2019. "Global optimization issues in deep network regression: an overview," Journal of Global Optimization, Springer, vol. 73(2), pages 239-277, February.
    7. Bagirov, Adil M. & Ugon, Julien & Mirzayeva, Hijran, 2013. "Nonsmooth nonconvex optimization approach to clusterwise linear regression problems," European Journal of Operational Research, Elsevier, vol. 229(1), pages 132-142.
    8. Rubinov, A.M. & Soukhorokova, N.V. & Ugon, J., 2006. "Classes and clusters in data analysis," European Journal of Operational Research, Elsevier, vol. 173(3), pages 849-865, September.
    9. Laura Palagi, 2017. "Global Optimization issues in Supervised Learning. An overview," DIAG Technical Reports 2017-11, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    10. Fei Ye & Xin Yuan Lou & Lin Fu Sun, 2017. "An improved chaotic fruit fly optimization based on a mutation strategy for simultaneous feature selection and parameter optimization for SVM and its applications," PLOS ONE, Public Library of Science, vol. 12(4), pages 1-36, April.
    11. Ghandar, Adam & Michalewicz, Zbigniew & Zurbruegg, Ralf, 2016. "The relationship between model complexity and forecasting performance for computer intelligence optimization in finance," International Journal of Forecasting, Elsevier, vol. 32(3), pages 598-613.
    12. A. M. Bagirov & B. Karasözen & M. Sezer, 2008. "Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 137(2), pages 317-334, May.

    More about this item

    Statistics

    Access and download statistics

    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:topjnl:v:17:y:2009:i:2:p:250-252. 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.