IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v21y2013i1p95-115.html
   My bibliography  Save this article

Sequential clustering with radius and split criteria

Author

Listed:
  • Nenad Mladenovic
  • Pierre Hansen
  • Jack Brimberg

Abstract

Sequential clustering aims at determining homogeneous and/or well-separated clusters within a given set of entities, one at a time, until no more such clusters can be found. We consider a bi-criterion sequential clustering problem in which the radius of a cluster (or maximum dissimilarity between an entity chosen as center and any other entity of the cluster) is chosen as a homogeneity criterion and the split of a cluster (or minimum dissimilarity between an entity in the cluster and one outside of it) is chosen as a separation criterion. An O(N 3 ) algorithm is proposed for determining radii and splits of all efficient clusters, which leads to an O(N 4 ) algorithm for bi-criterion sequential clustering with radius and split as criteria. This algorithm is illustrated on the well known Ruspini data set. Copyright Springer-Verlag 2013

Suggested Citation

  • Nenad Mladenovic & Pierre Hansen & Jack Brimberg, 2013. "Sequential clustering with radius and split criteria," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(1), pages 95-115, June.
    • Handle: RePEc:spr:cejnor:v:21:y:2013:i:1:p:95-115
    DOI: 10.1007/s10100-012-0258-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-012-0258-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-012-0258-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. Ferligoj & V. Batagelj, 1992. "Direct multicriteria clustering algorithms," Journal of Classification, Springer;The Classification Society, vol. 9(1), pages 43-61, January.
    2. J. C. Gower & G. J. S. Ross, 1969. "Minimum Spanning Trees and Single Linkage Cluster Analysis," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 18(1), pages 54-64, March.
    3. A. Guénoche & P. Hansen & B. Jaumard, 1991. "Efficient algorithms for divisive hierarchical clustering with the diameter criterion," Journal of Classification, Springer;The Classification Society, vol. 8(1), pages 5-30, January.
    4. B. Mirkin, 1987. "Additive clustering and qualitative factor analysis methods for similarity matrices," Journal of Classification, Springer;The Classification Society, vol. 4(1), pages 7-31, March.
    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. Andrej Kastrin & Janez Povh & Lidija Zadnik Stirn & Janez Žerovnik, 2021. "Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(3), pages 773-790, September.
    2. Tibor Csendes & Lidija Zadnik Stirn & Janez Žerovnik, 2013. "Editorial," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(1), pages 1-2, June.

    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. Y. Wang & H. Yan & C. Sriskandarajah, 1996. "The weighted sum of split and diameter clustering," Journal of Classification, Springer;The Classification Society, vol. 13(2), pages 231-248, September.
    2. Beibei Zhang & Rong Chen, 2018. "Nonlinear Time Series Clustering Based on Kolmogorov-Smirnov 2D Statistic," Journal of Classification, Springer;The Classification Society, vol. 35(3), pages 394-421, October.
    3. Sung-Soo Kim & W. Krzanowski, 2007. "Detecting multiple outliers in linear regression using a cluster method combined with graphical visualization," Computational Statistics, Springer, vol. 22(1), pages 109-119, April.
    4. Ahuja, Ravindra K., 1956-, 1992. "Applications of network optimization," Working papers 3458-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    5. John Haslett & Victor Kamensky & Richard Dubes & Norman Cliff & Jan Leeuw & Robert Ling & William Day & John Daws & C. Perruchet & Ivo Molenaar & F. Murtagh & Anuska Ferilgoj, 1990. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 7(1), pages 115-158, March.
    6. Tokuda, Eric K. & Comin, Cesar H. & Costa, Luciano da F., 2022. "Revisiting agglomerative clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 585(C).
    7. Modarres, Reza, 2014. "On the interpoint distances of Bernoulli vectors," Statistics & Probability Letters, Elsevier, vol. 84(C), pages 215-222.
    8. Kirschstein, Thomas & Liebscher, Steffen & Becker, Claudia, 2013. "Robust estimation of location and scatter by pruning the minimum spanning tree," Journal of Multivariate Analysis, Elsevier, vol. 120(C), pages 173-184.
    9. Turner, Heather & Bailey, Trevor & Krzanowski, Wojtek, 2005. "Improved biclustering of microarray data demonstrated through systematic performance tests," Computational Statistics & Data Analysis, Elsevier, vol. 48(2), pages 235-254, February.
    10. M. Raddant & T. Di Matteo, 2023. "A look at financial dependencies by means of econophysics and financial economics," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 18(4), pages 701-734, October.
    11. Cheong, Siew Ann & Fornia, Robert Paulo & Lee, Gladys Hui Ting & Kok, Jun Liang & Yim, Woei Shyr & Xu, Danny Yuan & Zhang, Yiting, 2011. "The Japanese economy in crises: A time series segmentation study," Economics Discussion Papers 2011-24, Kiel Institute for the World Economy (IfW Kiel).
    12. Coletti, Paolo, 2016. "Comparing minimum spanning trees of the Italian stock market using returns and volumes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 463(C), pages 246-261.
    13. Jean-Pierre Barthélemy & Bruno Leclerc & Bernard Monjardet, 1986. "On the use of ordered sets in problems of comparison and consensus of classifications," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 187-224, September.
    14. Sergio Scippacercola, 2011. "The Factorial Minimum Spanning Tree as a Reference for a Synthetic Index of Complex Phenomena," Journal of Classification, Springer;The Classification Society, vol. 28(1), pages 21-37, April.
    15. T. Ojasoo & J. C. Doré, 1999. "Citation bias in medical journals," Scientometrics, Springer;Akadémiai Kiadó, vol. 45(1), pages 81-94, May.
    16. Lawrence Hubert, 1974. "Some applications of graph theory to clustering," Psychometrika, Springer;The Psychometric Society, vol. 39(3), pages 283-309, September.
    17. Bruno Leclerc, 1995. "Minimum spanning trees for tree metrics: abridgements and adjustments," Journal of Classification, Springer;The Classification Society, vol. 12(2), pages 207-241, September.
    18. Chavent, Marie & Lechevallier, Yves & Briant, Olivier, 2007. "DIVCLUS-T: A monothetic divisive hierarchical clustering method," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 687-701, October.
    19. Zhimei Lei & Kuo-Jui Wu & Li Cui & Ming K Lim, 2018. "A Hybrid Approach to Explore the Risk Dependency Structure among Agribusiness Firms," Sustainability, MDPI, vol. 10(2), pages 1-17, February.
    20. Renato Coppi & Pierpaolo D’Urso & Paolo Giordani, 2010. "A Fuzzy Clustering Model for Multivariate Spatial Time Series," Journal of Classification, Springer;The Classification Society, vol. 27(1), pages 54-88, March.

    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:cejnor:v:21:y:2013:i:1:p:95-115. 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.