Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKathrin Bujna
Person information
- affiliation (PhD 2017): Paderborn University, Department of Computer Science, Paderborn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j2]Johannes Blömer, Sascha Brauer, Kathrin Bujna, Daniel Kuntze:
How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. Adv. Data Anal. Classif. 14(1): 147-173 (2020)- [j1]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
A Complexity Theoretical Study of Fuzzy K-Means. ACM Trans. Algorithms 16(4): 53:1-53:25 (2020)
2010 – 2019
- 2018
- [c7]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
Coresets for Fuzzy K-Means with Applications. ISAAC 2018: 46:1-46:12 - 2017
- [b1]Kathrin Bujna:
Soft clustering algorithms: theoretical and practical improvements. Paderborn University, Germany, 2017 - [c6]Kathrin Bujna, Martin Wistuba:
Multi-Plant Photovoltaic Energy Forecasting Challenge with Regression Tree Ensembles and Hourly Average Forecasts. DC@PKDD/ECML 2017 - 2016
- [c5]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
A Theoretical Analysis of the Fuzzy K-Means Problem. ICDM 2016: 805-810 - [c4]Johannes Blömer, Kathrin Bujna:
Adaptive Seeding for Gaussian Mixture Models. PAKDD (2) 2016: 296-308 - [i5]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
Hard-Clustering with Gaussian Mixture Models. CoRR abs/1603.06478 (2016) - [i4]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
On Coreset Constructions for the Fuzzy $K$-Means Problem. CoRR abs/1612.07516 (2016) - 2015
- [i3]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
Complexity and Approximation of the Fuzzy K-Means Problem. CoRR abs/1512.05947 (2015) - 2014
- [c3]Johannes Blömer, Kathrin Bujna, Daniel Kuntze:
A Theoretical and Experimental Comparison of the EM and SEM Algorithm. ICPR 2014: 1419-1424 - 2013
- [i2]Johannes Blömer, Kathrin Bujna, Daniel Kuntze:
A Theoretical and Experimental Comparison of the EM and SEM Algorithm. CoRR abs/1310.5034 (2013) - [i1]Johannes Blömer, Kathrin Bujna:
Simple Methods for Initializing the EM Algorithm for Gaussian Mixture Models. CoRR abs/1312.5946 (2013) - 2011
- [c2]Henning Wachsmuth, Kathrin Bujna:
Back to the Roots of Genres: Text Classification by Language Function. IJCNLP 2011: 632-640 - [c1]André Diekwisch, Andreas Martens, Boris Wolf, Claudia Schumacher, Claudius Jähn, Daniel Mex, David Maicher, Dominik Leibenger, Gennadij Liske, Jürgen Tessmann, Kathrin Bujna, Martin Wistuba, Matthias Fischer, Matthias Strotmeier, Peter Mahlmann, Philipp Brandes:
PeerGame: Ein Peer-to-Peer-basiertes Multiplayer-Echtzeit-Strategiespiel. Informatiktage 2011: 203-206
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-04-25 02:24 CEST 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:
