IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v52y2008i11p4923-4938.html
   My bibliography  Save this article

Algorithms for additive clustering of rectangular data tables

Author

Listed:
  • Depril, Dirk
  • Van Mechelen, Iven
  • Mirkin, Boris

Abstract

The overlapping additive clustering model or principal cluster model is a model for two-way two-mode object by variable data that implies an overlapping clustering of the objects and a set of profiles (characteristic variable values for each cluster). The model values of the variables of an object are the sum of the profiles of its corresponding clusters. In the associated data analysis the data matrix at hand is approximated by an overlapping additive clustering model of a prespecified rank by minimizing a least squares loss function. Recently an algorithm has been proposed for this purpose. This algorithm is a sequential fitting strategy, also called the method of principal clusters (PCL). Theoretical and empirical evidence that the PCL algorithm may have problems in revealing the true structure underlying a data set will be presented. As a way out, three new algorithms to fit the principal cluster model to empirical data will be presented: two of an alternating least squares (ALS) type, orthogonally combined with two different starting strategies, and one based on simulated annealing (SA). In a simulation study it is demonstrated that all three new algorithms outperform the existing PCL algorithm. The amount of objects that belong to more than one cluster (the overlap) is further found to have a considerable influence on the algorithmic performance of the ALS algorithms, with low amounts of overlap requiring a different starting strategy than high ones. As a consequence, for the analysis of real data sets in practice, a hybrid approach will be presented consisting of one of the ALS algorithms initialized by means of the two starting strategies under study.

Suggested Citation

  • Depril, Dirk & Van Mechelen, Iven & Mirkin, Boris, 2008. "Algorithms for additive clustering of rectangular data tables," Computational Statistics & Data Analysis, Elsevier, vol. 52(11), pages 4923-4938, July.
    • Handle: RePEc:eee:csdana:v:52:y:2008:i:11:p:4923-4938
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(08)00224-7
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

    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. Van Mechelen, Iven & Schepers, Jan, 2007. "A unifying model involving a categorical and/or dimensional reduction for multimode data," Computational Statistics & Data Analysis, Elsevier, vol. 52(1), pages 537-549, September.
    2. Boris Mirkin, 1990. "A sequential fitting procedure for linear data analysis models," Journal of Classification, Springer;The Classification Society, vol. 7(2), pages 167-195, September.
    3. Anil Chaturvedi & J. Carroll, 1994. "An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models," Journal of Classification, Springer;The Classification Society, vol. 11(2), pages 155-170, September.
    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. Doove, Lisa L. & Wilderjans, Tom F. & Calcagnì, Antonio & Van Mechelen, Iven, 2017. "Deriving optimal data-analytic regimes from benchmarking studies," Computational Statistics & Data Analysis, Elsevier, vol. 107(C), pages 81-91.
    2. Boris Mirkin & Soroosh Shalileh, 2022. "Community Detection in Feature-Rich Networks Using Data Recovery Approach," Journal of Classification, Springer;The Classification Society, vol. 39(3), pages 432-462, November.
    3. Chiheb-Eddine N’Cir & Nadia Essoussi & Mohamed Limam, 2015. "Kernel-Based Methods to Identify Overlapping Clusters with Linear and Nonlinear Boundaries," Journal of Classification, Springer;The Classification Society, vol. 32(2), pages 176-211, July.
    4. Julian Rossbroich & Jeffrey Durieux & Tom F. Wilderjans, 2022. "Model Selection Strategies for Determining the Optimal Number of Overlapping Clusters in Additive Overlapping Partitional Clustering," Journal of Classification, Springer;The Classification Society, vol. 39(2), pages 264-301, July.
    5. Dirk Depril & Iven Mechelen & Tom Wilderjans, 2012. "Lowdimensional Additive Overlapping Clustering," Journal of Classification, Springer;The Classification Society, vol. 29(3), pages 297-320, October.
    6. Tom Wilderjans & Dirk Depril & Iven Mechelen, 2012. "Block-Relaxation Approaches for Fitting the INDCLUS Model," Journal of Classification, Springer;The Classification Society, vol. 29(3), pages 277-296, 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. Julian Rossbroich & Jeffrey Durieux & Tom F. Wilderjans, 2022. "Model Selection Strategies for Determining the Optimal Number of Overlapping Clusters in Additive Overlapping Partitional Clustering," Journal of Classification, Springer;The Classification Society, vol. 39(2), pages 264-301, July.
    2. Tom Wilderjans & Dirk Depril & Iven Mechelen, 2012. "Block-Relaxation Approaches for Fitting the INDCLUS Model," Journal of Classification, Springer;The Classification Society, vol. 29(3), pages 277-296, October.
    3. Wedel, M. & Bijmolt, T.H.A., 1998. "Mixed Tree and Spatial Representation of Dissimilarity Judgments," Discussion Paper 1998-109, Tilburg University, Center for Economic Research.
    4. Wilderjans, Tom & Ceulemans, Eva & Van Mechelen, Iven, 2009. "Simultaneous analysis of coupled data blocks differing in size: A comparison of two weighting schemes," Computational Statistics & Data Analysis, Elsevier, vol. 53(4), pages 1086-1098, February.
    5. 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.
    6. Dirk Depril & Iven Mechelen & Tom Wilderjans, 2012. "Lowdimensional Additive Overlapping Clustering," Journal of Classification, Springer;The Classification Society, vol. 29(3), pages 297-320, October.
    7. Tom Wilderjans & Dirk Depril & Iven Van Mechelen, 2013. "Additive Biclustering: A Comparison of One New and Two Existing ALS Algorithms," Journal of Classification, Springer;The Classification Society, vol. 30(1), pages 56-74, April.
    8. Wedel, M. & Bijmolt, T.H.A., 1998. "Mixed Tree and Spatial Representation of Dissimilarity Judgments," Other publications TiSEM d586f79c-64b9-4c25-860a-c, Tilburg University, School of Economics and Management.
    9. Iwin Leenen & Iven Mechelen & Paul Boeck, 2001. "Models for ordinal hierarchical classes analysis," Psychometrika, Springer;The Psychometric Society, vol. 66(3), pages 389-403, September.
    10. Laura Bocci & Donatella Vicari, 2019. "ROOTCLUS: Searching for “ROOT CLUSters” in Three-Way Proximity Data," Psychometrika, Springer;The Psychometric Society, vol. 84(4), pages 941-985, December.
    11. Jan Schepers & Iven Mechelen & Eva Ceulemans, 2011. "The Real-Valued Model of Hierarchical Classes," Journal of Classification, Springer;The Classification Society, vol. 28(3), pages 363-389, October.
    12. Stephen L. France & Wen Chen & Yumin Deng, 2017. "ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions," 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. 11(2), pages 371-393, June.
    13. Zina Taran & Boris Mirkin, 2020. "Exploring patterns of corporate social responsibility using a complementary K-means clustering criterion," Business Research, Springer;German Academic Association for Business Research, vol. 13(2), pages 513-540, July.
    14. Eva Vande Gaer & Eva Ceulemans & Iven Mechelen & Peter Kuppens, 2012. "The CLASSI-N Method for the Study of Sequential Processes," Psychometrika, Springer;The Psychometric Society, vol. 77(1), pages 85-105, January.
    15. Henk Kiers, 1997. "A modification of the SINDCLUS algorithm for fitting the ADCLUS and INDCLUS models," Journal of Classification, Springer;The Classification Society, vol. 14(2), pages 297-310, September.
    16. Chiheb-Eddine N’Cir & Nadia Essoussi & Mohamed Limam, 2015. "Kernel-Based Methods to Identify Overlapping Clusters with Linear and Nonlinear Boundaries," Journal of Classification, Springer;The Classification Society, vol. 32(2), pages 176-211, July.
    17. Schepers, Jan & van Mechelen, Iven & Ceulemans, Eva, 2006. "Three-mode partitioning," Computational Statistics & Data Analysis, Elsevier, vol. 51(3), pages 1623-1642, December.
    18. Anil Chaturvedi & J. Carroll, 1994. "An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models," Journal of Classification, Springer;The Classification Society, vol. 11(2), pages 155-170, September.
    19. Willem Heiser, 2013. "In memoriam, J. Douglas Carroll 1939–2011," Psychometrika, Springer;The Psychometric Society, vol. 78(1), pages 5-13, January.
    20. Govaert, Gérard & Nadif, Mohamed, 2008. "Block clustering with Bernoulli mixture models: Comparison of different approaches," Computational Statistics & Data Analysis, Elsevier, vol. 52(6), pages 3233-3245, February.

    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:eee:csdana:v:52:y:2008:i:11:p:4923-4938. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.