Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Brigitte Boden"'
Autor:
Brigitte Boden, Jan Flink, Niklas Först, Robert Mischke, Kathrin Schaffert, Alexander Weinert, Annika Wohlan, Andreas Schreiber
Publikováno v:
SoftwareX, Vol 15, Iss , Pp 100759- (2021)
Engineering complex systems such as air- and spacecraft is a multidisciplinary effort that requires the collaboration of engineers from a multitude of specializations working in concert. Typically, each engineer uses one or more specialized software
Externí odkaz:
https://doaj.org/article/c506b56ec1d84798afc251cc260fa2ae
Publikováno v:
Programming
Nowadays, complex technical systems are frequently developed by composing discipline-specific tools into an automated high-level workflow. Constructing, executing, and maintaining this workflow together with the infrastructure supporting it involves
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8281c6f4aec5f1abf0206b177fdec90b
https://doi.org/10.1145/3397537.3399576
https://doi.org/10.1145/3397537.3399576
Autor:
Kathrin Schaffert, Pier Davide Ciampa, Robert Mischke, Stefan Goertz, Erwin Moerland, Alexander Weinert, Brigitte Boden, Jan Flink, Annika Wohlan, Caslav Ilic, Carsten M. Liersch, Tobias Wunderlich
Publikováno v:
AIAA Aviation 2019 Forum.
DLR's Remote Component Environment (RCE) is an open-source software environment for defining and executing workflows containing distributed simulation tools by integrating them into a peer-to-peer network. It is being developed primarily by DLR and h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eeced5d13a27b67fd00f65b999f48d4e
https://doi.org/10.2514/6.2019-2989
https://doi.org/10.2514/6.2019-2989
Publikováno v:
Knowledge and Information Systems. 50:417-446
Detecting dense subgraphs such as cliques or quasi-cliques is an important graph mining problem. While this task is established for simple graphs, today's applications demand the analysis of more complex graphs: In this work, we consider a frequently
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07ff3116bdb90788cf78fe68c65f1079
https://doi.org/10.1007/s10115-016-0949-5
https://doi.org/10.1007/s10115-016-0949-5
Publikováno v:
Knowledge and Information Systems. 40:243-278
In this work, we propose a new method to find homogeneous object groups in a single vertex-labeled graph. The basic premise is that many prevalent datasets consist of multiple types of information: graph data to represent the relations between object
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27dff2bcc0df8e625e7154caa8b6006a
https://doi.org/10.1007/s10115-013-0640-z
https://doi.org/10.1007/s10115-013-0640-z
Autor:
Brigitte Boden
Publikováno v:
Informatik-Spektrum. 35:220-222
In der hier vorgestellten Arbeit wird ein neuer Clusteringansatz entwickelt, der nicht nur die Attribute der zu gruppierenden Objekte, sondern auch Informationen uber Verbindungen zwischen den Objekten berucksichtigt. Diese Informationen konnen als G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::339aa2701fd98979fdb9bde1f6e0accb
https://doi.org/10.1007/s00287-011-0556-5
https://doi.org/10.1007/s00287-011-0556-5
Publikováno v:
Machine Learning and Knowledge Discovery in Databases ISBN: 9783662448472
ECML/PKDD (1)
ECML/PKDD (1)
Many real-world data sets, like data from social media or bibliographic data, can be represented as heterogeneous networks with several vertex types. Often additional attributes are available for the vertices, such as keywords for a paper. Clustering
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7724399723bb460c080e705f58c34f43
https://doi.org/10.1007/978-3-662-44848-9_10
https://doi.org/10.1007/978-3-662-44848-9_10
Publikováno v:
SSDBM
Detecting dense subgraphs in a large graph is an important graph mining problem and various approaches have been proposed for its solution. While most existing methods only consider unlabeled and one-dimensional graph data, many real-world applicatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bdd74c82324d1c897a316d80daafcf1
https://doi.org/10.1145/2484838.2484860
https://doi.org/10.1145/2484838.2484860
Publikováno v:
CIKM
Clustering graph data has gained much attention in recent years, as data represented as graphs is ubiquitous in today's applications. For many applications, besides the mere graph data also further information about the vertices of a graph is availab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c879c77789565a19aa4fc63ac7e8ae2
https://doi.org/10.1145/2505515.2508200
https://doi.org/10.1145/2505515.2508200
Publikováno v:
Advances in Knowledge Discovery and Data Mining ISBN: 9783642374524
PAKDD (1)
PAKDD (1)
Large graphs are ubiquitous in today’s applications. Besides the mere graph structure, data sources usually provide information about single objects by feature vectors. To realize the full potential for knowledge extraction, recent approaches consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ef17ab6560f77fe43a7cdd06c049660
https://doi.org/10.1007/978-3-642-37453-1_22
https://doi.org/10.1007/978-3-642-37453-1_22