IDEAS home Printed from https://ideas.repec.org/a/spr/advdac/v3y2009i3p205-225.html
   My bibliography  Save this article

Aggregation invariance in general clustering approaches

Author

Listed:
  • François Bavaud

Abstract

No abstract is available for this item.

Suggested Citation

  • François Bavaud, 2009. "Aggregation invariance in general clustering approaches," 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. 3(3), pages 205-225, December.
    • Handle: RePEc:spr:advdac:v:3:y:2009:i:3:p:205-225
    DOI: 10.1007/s11634-009-0052-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11634-009-0052-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11634-009-0052-9?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. Celeux, Gilles & Govaert, Gerard, 1992. "A classification EM algorithm for clustering and two stochastic versions," Computational Statistics & Data Analysis, Elsevier, vol. 14(3), pages 315-332, October.
    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. François Bavaud, 2022. "Similarity-Reduced Diversities: the Effective Entropy and the Reduced Entropy," Journal of Classification, Springer;The Classification Society, vol. 39(1), pages 100-121, March.
    2. Ludwig Lausser & Florian Schmid & Lyn-Rouven Schirra & Adalbert F. X. Wilhelm & Hans A. Kestler, 2018. "Rank-based classifiers for extremely high-dimensional gene expression data," 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. 12(4), pages 917-936, 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. Adrian O’Hagan & Arthur White, 2019. "Improved model-based clustering performance using Bayesian initialization averaging," Computational Statistics, Springer, vol. 34(1), pages 201-231, March.
    2. Rasmus Lentz & Jean Marc Robin & Suphanit Piyapromdee, 2018. "On Worker and Firm Heterogeneity in Wages and Employment Mobility: Evidence from Danish Register Data," 2018 Meeting Papers 469, Society for Economic Dynamics.
    3. Faicel Chamroukhi, 2016. "Piecewise Regression Mixture for Simultaneous Functional Data Clustering and Optimal Segmentation," Journal of Classification, Springer;The Classification Society, vol. 33(3), pages 374-411, October.
    4. Mukhopadhyay, Subhadeep & Ghosh, Anil K., 2011. "Bayesian multiscale smoothing in supervised and semi-supervised kernel discriminant analysis," Computational Statistics & Data Analysis, Elsevier, vol. 55(7), pages 2344-2353, July.
    5. Grün, Bettina & Leisch, Friedrich, 2008. "FlexMix Version 2: Finite Mixtures with Concomitant Variables and Varying and Constant Parameters," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 28(i04).
    6. Hornik, Kurt & Grün, Bettina, 2014. "movMF: An R Package for Fitting Mixtures of von Mises-Fisher Distributions," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 58(i10).
    7. M. Vrac & L. Billard & E. Diday & A. Chédin, 2012. "Copula analysis of mixture models," Computational Statistics, Springer, vol. 27(3), pages 427-457, September.
    8. Bouveyron, C. & Girard, S. & Schmid, C., 2007. "High-dimensional data clustering," Computational Statistics & Data Analysis, Elsevier, vol. 52(1), pages 502-519, September.
    9. repec:jss:jstsof:28:i04 is not listed on IDEAS
    10. Chehade, Abdallah & Savargaonkar, Mayuresh & Krivtsov, Vasiliy, 2022. "Conditional Gaussian mixture model for warranty claims forecasting," Reliability Engineering and System Safety, Elsevier, vol. 218(PB).
    11. Nicolas Jouvin & Pierre Latouche & Charles Bouveyron & Guillaume Bataillon & Alain Livartowski, 2021. "Greedy clustering of count data through a mixture of multinomial PCA," Computational Statistics, Springer, vol. 36(1), pages 1-33, March.
    12. García-Escudero, L.A. & Gordaliza, A. & Mayo-Iscar, A. & San Martín, R., 2010. "Robust clusterwise linear regression through trimming," Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3057-3069, December.
    13. Same, Allou & Ambroise, Christophe & Govaert, Gerard, 2006. "A classification EM algorithm for binned data," Computational Statistics & Data Analysis, Elsevier, vol. 51(2), pages 466-480, November.
    14. Yves Grandvalet & Yoshua Bengio, 2004. "Learning from Partial Labels with Minimum Entropy," CIRANO Working Papers 2004s-28, CIRANO.
    15. Frei, Marco & Künsch, Hans R., 2013. "Mixture ensemble Kalman filters," Computational Statistics & Data Analysis, Elsevier, vol. 58(C), pages 127-138.
    16. Guan-Hua Huang & Su-Mei Wang & Chung-Chu Hsu, 2011. "Optimization-Based Model Fitting for Latent Class and Latent Profile Analyses," Psychometrika, Springer;The Psychometric Society, vol. 76(4), pages 584-611, October.
    17. Murphy, Thomas Brendan & Martin, Donal, 2003. "Mixtures of distance-based models for ranking data," Computational Statistics & Data Analysis, Elsevier, vol. 41(3-4), pages 645-655, January.
    18. Rasmus Lentz & Suphanit Piyapromdee & Jean-Marc Robin, 2022. "The Anatomy of Sorting - Evidence from Danish Data," Working Papers hal-03869383, HAL.
    19. Keiji Takai, 2012. "Constrained EM algorithm with projection method," Computational Statistics, Springer, vol. 27(4), pages 701-714, December.
    20. Volodymyr Melnykov & Xuwen Zhu, 2019. "An extension of the K-means algorithm to clustering skewed data," Computational Statistics, Springer, vol. 34(1), pages 373-394, March.
    21. Bouveyron, Charles & Brunet, Camille, 2012. "Theoretical and practical considerations on the convergence properties of the Fisher-EM algorithm," Journal of Multivariate Analysis, Elsevier, vol. 109(C), pages 29-41.

    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:advdac:v:3:y:2009:i:3:p:205-225. 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.