default search action
Iven Van Mechelen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Iven Van Mechelen, Christian Hennig, Henk A. L. Kiers:
Onset of a conceptual outline map to get a hold on the jungle of cluster analysis. WIREs Data. Mining. Knowl. Discov. 14(5) (2024) - 2023
- [j28]Aniek Sies, Iven Van Mechelen:
C443: An R-package to see a forest for the trees. R J. 15(3): 59-78 (2023) - [j27]Iven Van Mechelen
, Anne-Laure Boulesteix
A white paper on good research practices in benchmarking: The case of cluster analysis. WIREs Data. Mining. Knowl. Discov. 13(6) (2023) - 2020
- [j26]Aniek Sies
C443: a Methodology to See a Forest for the Trees. J. Classif. 37(3): 730-753 (2020)
2010 – 2019
- 2017
- [j25]Jan Schepers
Maximal Interaction Two-Mode Clustering. J. Classif. 34(1): 49-75 (2017) - [j24]Lisa L. Doove, Tom F. Wilderjans
Deriving optimal data-analytic regimes from benchmarking studies. Comput. Stat. Data Anal. 107: 81-91 (2017) - 2015
- [j23]Joeri Hofmans
On the Added Value of Bootstrap Analysis for K-Means Clustering. J. Classif. 32(2): 268-284 (2015) - [j22]Iven Van Mechelen, Eva Ceulemans
Component- and Factor-Based Models for Data Fusion in the Behavioral Sciences. Proc. IEEE 103(9): 1621-1634 (2015) - 2014
- [j21]Lisa L. Doove
A comparison of five recursive partitioning methods to find person subgroups involved in meaningful treatment-subgroup interactions. Adv. Data Anal. Classif. 8(4): 403-425 (2014) - 2013
- [j20]Tom F. Wilderjans
Additive Biclustering: A Comparison of One New and Two Existing ALS Algorithms. J. Classif. 30(1): 56-74 (2013) - 2012
- [j19]Tom F. Wilderjans
Block-Relaxation Approaches for Fitting the INDCLUS Model. J. Classif. 29(3): 277-296 (2012) - [j18]Dirk Depril, Iven Van Mechelen, Tom F. Wilderjans
Lowdimensional Additive Overlapping Clustering. J. Classif. 29(3): 297-320 (2012) - 2011
- [j17]Katrijn Van Deun, Tom F. Wilderjans
A flexible framework for sparse simultaneous component based data integration. BMC Bioinform. 12: 448 (2011) - [j16]Jan Schepers
The Real-Valued Model of Hierarchical Classes. J. Classif. 28(3): 363-389 (2011) - 2010
- [c3]Iven Van Mechelen, Katrijn Van Deun:
Multiple Nested Reductions of Single Data Modes as a Tool to Deal with Large Data Sets. COMPSTAT 2010: 349-358
2000 – 2009
- 2009
- [j15]Katrijn Van Deun, Herbert Hoijtink, Lieven Thorrez
Testing the hypothesis of tissue selectivity: the intersection-union test and a Bayesian approach. Bioinform. 25(19): 2588-2594 (2009) - [j14]Robert A. van den Berg
Integrating functional genomics data using maximum likelihood based simultaneous component analysis. BMC Bioinform. 10: 340 (2009) - [j13]Katrijn Van Deun, Age K. Smilde
A structured overview of simultaneous component based data integration. BMC Bioinform. 10 (2009) - [j12]Tom F. Wilderjans
Simultaneous analysis of coupled data blocks differing in size: A comparison of two weighting schemes. Comput. Stat. Data Anal. 53(4): 1086-1098 (2009) - 2008
- [j11]Jan Schepers
Selecting Among Multi-Mode Partitioning Models of Different Complexities: A Comparison of Four Model Selection Criteria. J. Classif. 25(1): 67-85 (2008) - [j10]Dirk Depril, Iven Van Mechelen, Boris G. Mirkin
Algorithms for additive clustering of rectangular data tables. Comput. Stat. Data Anal. 52(11): 4923-4938 (2008) - 2007
- [j9]Katrijn Van Deun, Kathleen Marchal
Joint mapping of genes and conditions via multidimensional unfolding analysis. BMC Bioinform. 8 (2007) - [j8]Iven Van Mechelen, Jan Schepers
A unifying model involving a categorical and/or dimensional reduction for multimode data. Comput. Stat. Data Anal. 52(1): 537-549 (2007) - 2006
- [j7]Jan Schepers
Three-mode partitioning. Comput. Stat. Data Anal. 51(3): 1623-1642 (2006) - [c2]Bart De Schutter
On Algorithms for a Binary-Real (max, X) Matrix Approximation Problem. CDC 2006: 5168-5173 - 2005
- [j6]Luigi Lombardi, Iven Van Mechelen:
Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors. Discret. Appl. Math. 147(1): 91-100 (2005) - 2004
- [j5]Eva Ceulemans
Adapting the Formal to the Substantive: Constrained Tucker3-HICLASS. J. Classif. 21(1): 19-50 (2004) - 2002
- [j4]Michel Meulders
Constrained Latent Class Analysis of Three-Way Three-Mode Data. J. Classif. 19(2): 277-302 (2002) - 2001
- [j3]Iwin Leenen, Iven Van Mechelen:
An Evaluation of Two Algorithms for Hierarchical Classes Analysis. J. Classif. 18(1): 57-80 (2001) - 2000
- [j2]Johannes Berkhof
Posterior predictive checks: Principles and discussion. Comput. Stat. 15(3): 337-354 (2000) - [j1]Iwin Leenen, Iven Van Mechelen, Andrew Gelman:
Bayesian probabilistic extensions of a deterministic classification model. Comput. Stat. 15(3): 355-371 (2000)
1990 – 1999
- 1996
- [c1]Iven Van Mechelen, Seymour Rosenberg, Paul De Boeck:
On hierarchies and hierarchical classes models. Mathematical Hierarchies and Biology 1996: 291-298
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-27 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: