Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Daniel Kuntze"'
Autor:
Nadine Reischmann, Carolin Schmelas, Miguel Ángel Molina-Vila, Núria Jordana-Ariza, Daniel Kuntze, Silvia García-Roman, Manon A. Simard, Doreen Musch, Christina Esdar, Joachim Albers, Niki Karachaliou
Publikováno v:
iScience, Vol 26, Iss 7, Pp 107006- (2023)
Summary: This study evaluates the efficacy of combining targeted therapies with MET or SHP2 inhibitors to overcome MET-mediated resistance in different NSCLC subtypes. A prevalence study was conducted for MET amplification and overexpression in sampl
Externí odkaz:
https://doaj.org/article/212794a83ace4b01a781beca9b628143
Publikováno v:
Advances in Data Analysis and Classification. 14:147-173
In this paper, we present a theoretical and an experimental comparison of EM and SEM algorithms for different mixture models. The SEM algorithm is a stochastic variant of the EM algorithm. The qualitative intuition behind the SEM algorithm is simple:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3aa83f83f0332dbda05876ede1895b78
https://doi.org/10.1007/s11634-019-00366-7
https://doi.org/10.1007/s11634-019-00366-7
Autor:
Stamatis Karnouskos, Miguel Perez, Andre Becker, Frank Beck, Serge Saelens, Michael Schmut, Rupam Roy, Santo Bianchino, Nemrude Verzano, Nadine Gaertner, Daniel Kuntze
Publikováno v:
INDIN
New Internet of Things open source technologies, middlewares, and programming languages, make the quick integration of devices, systems and cloud services easier than never before. With their utilization, complex tasks such as object detection, track
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a4f8a665c58e77e60ec9bb9b3f2f707
https://doi.org/10.1109/indin.2017.8104924
https://doi.org/10.1109/indin.2017.8104924
Publikováno v:
Algorithmica. 69:184-215
The diameter $k$-clustering problem is the problem of partitioning a finite subset of $\mathbb{R}^d$ into $k$ subsets called clusters such that the maximum diameter of the clusters is minimized. One early clustering algorithm that computes a hierarch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7d10137b6784ee615ee70bb9d0bff72
https://doi.org/10.1007/s00453-012-9717-4
https://doi.org/10.1007/s00453-012-9717-4
Publikováno v:
ICPR
In this paper we provide a new analysis of the SEM algorithm. Unlike previous work, we focus on the analysis of a single run of the algorithm. First, we discuss the algorithm for general mixture distributions. Second, we consider Gaussian mixture mod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2757fd95c39e1348f4442511eb285ac0
https://doi.org/10.1109/icpr.2014.253
https://doi.org/10.1109/icpr.2014.253