IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v25y2008i1p5-26.html
   My bibliography  Save this article

Probabilistic D-Clustering

Author

Listed:
  • Adi Ben-Israel
  • Cem Iyigun

Abstract

No abstract is available for this item.

Suggested Citation

  • Adi Ben-Israel & Cem Iyigun, 2008. "Probabilistic D-Clustering," Journal of Classification, Springer;The Classification Society, vol. 25(1), pages 5-26, June.
    • Handle: RePEc:spr:jclass:v:25:y:2008:i:1:p:5-26
    DOI: 10.1007/s00357-008-9002-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00357-008-9002-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00357-008-9002-z?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. Lawrence M. Ostresh, 1978. "On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem," Operations Research, INFORMS, vol. 26(4), pages 597-609, August.
    2. Willem Heiser, 2004. "Geometric representation of association between categories," Psychometrika, Springer;The Psychometric Society, vol. 69(4), pages 513-545, December.
    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. Cristina Tortora & Mireille Gettler Summa & Marina Marino & Francesco Palumbo, 2016. "Factor probabilistic distance clustering (FPDC): a new clustering method," 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. 10(4), pages 441-464, December.
    2. Beibei Yuan & Willem Heiser & Mark Rooij, 2019. "The δ-Machine: Classification Based on Distances Towards Prototypes," Journal of Classification, Springer;The Classification Society, vol. 36(3), pages 442-470, October.
    3. Jan Kubacki & Andrzej Młodak, 2010. "A Typology of Polish Farms Using Probabilistic d–clustering," Statistics in Transition new series, Główny Urząd Statystyczny (Polska), vol. 11(3), pages 615-638, December.
    4. Antonio D’Ambrosio & Sonia Amodio & Carmela Iorio & Giuseppe Pandolfo & Roberta Siciliano, 2021. "Adjusted Concordance Index: an Extensionl of the Adjusted Rand Index to Fuzzy Partitions," Journal of Classification, Springer;The Classification Society, vol. 38(1), pages 112-128, April.
    5. Andrzej Młodak, 2021. "k-Means, Ward and Probabilistic Distance-Based Clustering Methods with Contiguity Constraint," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 313-352, July.
    6. Andrzej Młodak, 2014. "On the construction of an aggregated measure of the development of interval data," Computational Statistics, Springer, vol. 29(5), pages 895-929, October.
    7. Carmela Iorio & Gianluca Frasso & Antonio D’Ambrosio & Roberta Siciliano, 2023. "Boosted-oriented probabilistic smoothing-spline clustering of series," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 32(4), pages 1123-1140, October.

    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. Burkard, Rainer E. & Galavii, Mohammadreza & Gassner, Elisabeth, 2010. "The inverse Fermat-Weber problem," European Journal of Operational Research, Elsevier, vol. 206(1), pages 11-17, October.
    2. Fionn Murtagh, 2009. "The Remarkable Simplicity of Very High Dimensional Data: Application of Model-Based Clustering," Journal of Classification, Springer;The Classification Society, vol. 26(3), pages 249-277, December.
    3. Zvi Drezner, 2009. "On the convergence of the generalized Weiszfeld algorithm," Annals of Operations Research, Springer, vol. 167(1), pages 327-336, March.
    4. Richard L. Church & Zvi Drezner & Pawel Kalczynski, 2023. "Extensions to the planar p-median problem," Annals of Operations Research, Springer, vol. 326(1), pages 115-135, July.
    5. Amodio, S. & D’Ambrosio, A. & Siciliano, R., 2016. "Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach," European Journal of Operational Research, Elsevier, vol. 249(2), pages 667-676.
    6. Jianlin Jiang & Su Zhang & Yibing Lv & Xin Du & Ziwei Yan, 2020. "An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gauge," Journal of Global Optimization, Springer, vol. 76(4), pages 793-818, April.
    7. Venkateshan, Prahalad & Ballou, Ronald H. & Mathur, Kamlesh & Maruthasalam, Arulanantha P.P., 2017. "A Two-echelon joint continuous-discrete location model," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1028-1039.
    8. Yeawon Yoo & Adolfo R. Escobedo, 2021. "A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation," Decision Analysis, INFORMS, vol. 18(4), pages 296-320, December.
    9. Alessandro Albano & José Luis García-Lapresta & Antonella Plaia & Mariangela Sciandra, 2023. "A family of distances for preference–approvals," Annals of Operations Research, Springer, vol. 323(1), pages 1-29, April.
    10. Amir Beck & Shoham Sabach, 2015. "Weiszfeld’s Method: Old and New Results," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 1-40, January.
    11. Victor Blanco & Justo Puerto & Safae El Haj Ben Ali, 2014. "Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ ℓ τ norms," Computational Optimization and Applications, Springer, vol. 58(3), pages 563-595, July.
    12. Jianlin Jiang & Xiaoming Yuan, 2012. "A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand," Computational Optimization and Applications, Springer, vol. 51(3), pages 1275-1295, April.
    13. Antonio D’Ambrosio & Willem J. Heiser, 2016. "A Recursive Partitioning Method for the Prediction of Preference Rankings Based Upon Kemeny Distances," Psychometrika, Springer;The Psychometric Society, vol. 81(3), pages 774-794, September.
    14. Jiang, Jian-Lin & Yuan, Xiao-Ming, 2008. "A heuristic algorithm for constrained multi-source Weber problem - The variational inequality approach," European Journal of Operational Research, Elsevier, vol. 187(2), pages 357-370, June.
    15. Carmela Iorio & Gianluca Frasso & Antonio D’Ambrosio & Roberta Siciliano, 2023. "Boosted-oriented probabilistic smoothing-spline clustering of series," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 32(4), pages 1123-1140, October.
    16. Murray, Alan T. & Church, Richard L. & Feng, Xin, 2020. "Single facility siting involving allocation decisions," European Journal of Operational Research, Elsevier, vol. 284(3), pages 834-846.
    17. Zvi Drezner & Siegfried Schaible & David Simchi‐Levi, 1990. "Queueing‐location problems on the plane," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 929-935, 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:jclass:v:25:y:2008:i:1:p:5-26. 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.