IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v60y2009i8d10.1057_jors.2008.195.html
   My bibliography  Save this article

An optimization approach to partitional data clustering

Author

Listed:
  • J Kim

    (Korea Small Business Institute(KOSBI))

  • J Yang

    (Chonbuk National University)

  • S Ólafsson

    (Iowa State University)

Abstract

Scalability of clustering algorithms is a critical issue facing the data mining community. One method to handle this issue is to use only a subset of all instances. This paper develops an optimization-based approach to the partitional clustering problem using an algorithm specifically designed for noisy performance, which is a problem that arises when using a subset of instances. Numerical results show that computation time can be dramatically reduced by using a partial set of instances without sacrificing solution quality. In addition, these results are more persuasive as the size of the problem is larger.

Suggested Citation

  • J Kim & J Yang & S Ólafsson, 2009. "An optimization approach to partitional data clustering," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(8), pages 1069-1084, August.
    • Handle: RePEc:pal:jorsoc:v:60:y:2009:i:8:d:10.1057_jors.2008.195
    DOI: 10.1057/jors.2008.195
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2008.195
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2008.195?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. Leyuan Shi & Sigurdur Ólafsson, 2000. "Nested Partitions Method for Global Optimization," Operations Research, INFORMS, vol. 48(3), pages 390-407, June.
    2. Ja-Shen Chen & Russell K H Ching & Yi-Shen Lin, 2004. "An extended study of the K-means algorithm for data clustering and its applications," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 976-987, September.
    3. P. S. Bradley & O. L. Mangasarian & W. N. Street, 1998. "Feature Selection via Mathematical Programming," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 209-217, May.
    4. Basu, Amit, 1998. "Perspectives on operations research in data and knowledge management," European Journal of Operational Research, Elsevier, vol. 111(1), pages 1-14, November.
    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. Bard, Jonathan F. & Jarrah, Ahmad I., 2013. "Integrating commercial and residential pickup and delivery networks: A case study," Omega, Elsevier, vol. 41(4), pages 706-720.
    2. Amin, Gholam R. & Emrouznejad, Ali & Rezaei, S., 2011. "Some clarifications on the DEA clustering approach," European Journal of Operational Research, Elsevier, vol. 215(2), pages 498-501, 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. Sigurdur Ólafsson & Jaekyung Yang, 2005. "Intelligent Partitioning for Feature Selection," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 339-355, August.
    2. Olafsson, Sigurdur & Li, Xiaonan & Wu, Shuning, 2008. "Operations research and data mining," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1429-1448, June.
    3. Lee, Loo Hay & Chew, Ek Peng & Manikam, Puvaneswari, 2006. "A general framework on the simulation-based optimization under fixed computing budget," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1828-1841, November.
    4. Brandner, Hubertus & Lessmann, Stefan & Voß, Stefan, 2013. "A memetic approach to construct transductive discrete support vector machines," European Journal of Operational Research, Elsevier, vol. 230(3), pages 581-595.
    5. Lingxuan Liu & Leyuan Shi, 2019. "Simulation Optimization on Complex Job Shop Scheduling with Non-Identical Job Sizes," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(05), pages 1-26, October.
    6. Ravi, V. & Zimmermann, H. -J., 2000. "Fuzzy rule based classification with FeatureSelector and modified threshold accepting," European Journal of Operational Research, Elsevier, vol. 123(1), pages 16-28, May.
    7. Zhenyuan Liu & Lei Xiao & Jing Tian, 2016. "An activity-list-based nested partitions algorithm for resource-constrained project scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4744-4758, August.
    8. Mehdi Seraj & Pejman Bahramian & Abdulkareem Alhassan & Rasool Dehghanzadeh Shahabad, 2020. "The validity of Rodrik’s conclusion on real exchange rate and economic growth: factor priority evidence from feature selection approach," Palgrave Communications, Palgrave Macmillan, vol. 6(1), pages 1-6, December.
    9. Konstantinos Ergazakis & Konstantinos Karnezis & Konstantinos Metaxiotis & Ioannis Psarras, 2005. "Knowledge management in enterprises: a research agenda," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 13(1), pages 17-26, March.
    10. K. Gokbayrak & C.G. Cassandras, 2002. "Generalized Surrogate Problem Methodology for Online Stochastic Discrete Optimization," Journal of Optimization Theory and Applications, Springer, vol. 114(1), pages 97-132, July.
    11. K. Gokbayrak & C. G. Cassandras, 2001. "Online Surrogate Problem Methodology for Stochastic Discrete Resource Allocation Problems," Journal of Optimization Theory and Applications, Springer, vol. 108(2), pages 349-376, February.
    12. Peng Du & Jiming Peng & Tamás Terlaky, 2009. "Self-adaptive support vector machines: modelling and experiments," Computational Management Science, Springer, vol. 6(1), pages 41-51, February.
    13. Xiao-Ming Yang & Xin-Jia Jiang, 2020. "Yard Crane Scheduling in the Ground Trolley-Based Automated Container Terminal," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(02), pages 1-28, March.
    14. Unler, Alper & Murat, Alper, 2010. "A discrete particle swarm optimization method for feature selection in binary classification problems," European Journal of Operational Research, Elsevier, vol. 206(3), pages 528-539, November.
    15. Leyuan Shi & Sigurdur O´lafsson, 2000. "Nested Partitions Method for Stochastic Optimization," Methodology and Computing in Applied Probability, Springer, vol. 2(3), pages 271-291, September.
    16. Kyoungmi Hwang & Dohyun Kim & Kyungsik Lee & Chungmok Lee & Sungsoo Park, 2017. "Embedded variable selection method using signomial classification," Annals of Operations Research, Springer, vol. 254(1), pages 89-109, July.
    17. Szu Hui Ng & Stephen E. Chick, 2004. "Design of follow‐up experiments for improving model discrimination and parameter estimation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(8), pages 1129-1148, December.
    18. Fan, Qi & Tan, Ken Seng & Zhang, Jinggong, 2023. "Empirical tail risk management with model-based annealing random search," Insurance: Mathematics and Economics, Elsevier, vol. 110(C), pages 106-124.
    19. Chen Wang & Vicki M. Bier, 2011. "Target-Hardening Decisions Based on Uncertain Multiattribute Terrorist Utility," Decision Analysis, INFORMS, vol. 8(4), pages 286-302, December.
    20. José Ramón-Cardona & David Daniel Peña-Miranda & María Dolores Sánchez-Fernández, 2021. "Acceptance of Tourist Offers and Territory: Cluster Analysis of Ibiza Residents (Spain)," Land, MDPI, vol. 10(7), pages 1-15, July.

    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:pal:jorsoc:v:60:y:2009:i:8:d:10.1057_jors.2008.195. 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.palgrave-journals.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.