2009 International Joint Conference on Neural Networks 2009
DOI: 10.1109/ijcnn.2009.5179077
|View full text |Cite
|
Sign up to set email alerts
|

Patient stratification with competing risks by multivariate Fisher distance

Abstract: Early characterization of patients with respect to their predicted response to treatment is a fundamental step towards the delivery of effective, personalized care. Starting from the results of a time-to-event model with competing risks using the framework of partial logistic artificial neural networks with automatic relevance determination (PLANNCR-ARD), we discuss an effective semi-supervised approach to patient stratification with application to Acute Myeloid Leukaemia (AML) data (n = 509) acquired prospect… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…The process is ended by reaching a point where no further changes in assignment to cluster are seen. By also repeating the whole process starting with a range of different numbers of initial cluster centres and values for starting clusters, the most robust clustering patterns with greatest differentiation between clusters were identified (Bacciu et al, 2009). The statistical analyses used SPSS (release 17.0.0; SPSS, 2008) and MATLAB (version 7.8.0 R2009a; MATLAB, 2009) 64bit for clustering.…”
Section: Methodsmentioning
confidence: 99%
“…The process is ended by reaching a point where no further changes in assignment to cluster are seen. By also repeating the whole process starting with a range of different numbers of initial cluster centres and values for starting clusters, the most robust clustering patterns with greatest differentiation between clusters were identified (Bacciu et al, 2009). The statistical analyses used SPSS (release 17.0.0; SPSS, 2008) and MATLAB (version 7.8.0 R2009a; MATLAB, 2009) 64bit for clustering.…”
Section: Methodsmentioning
confidence: 99%
“…This approach to robustness analysis is summarised elsewhere (Bacciu et al 2009). In principle, it may be applied to any choice of initialisation-dependent clustering method.…”
Section: Methodsmentioning
confidence: 99%
“…One method relies on mapping the landscape of cluster separation against stability, for many initializations of the k-means clustering, from which to identify optimal and reproducible cluster partitions; this is termed a separation concordance (SeCo) map (Bacciu et al 2009). The alternative benchmark method directly optimizes a penalised objective function using a competitive neural network with repetition suppression (CoRe) which dynamically clusters the data into a parsimonious representation that covers the data space (Bacciu and Starita 2008).…”
Section: Introductionmentioning
confidence: 99%
“…Hierarchical algorithm can be further divided into bottom-up and top-down algorithms and partitioning clustering divided into k-mean and k-modes algorithms. The k-modes algorithm as an extension to k-means for categorical data, by replacing kmeans with k-modes, introduce a different dissimilarity measure and update the modes with a frequency based method [4,5,6]. In its basic form the clustering problem is defined as the problem of finding homogeneous groups of objects in a given dataset.…”
Section: Introductionmentioning
confidence: 99%