Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Laura Langohr"'
Autor:
Laura Langohr, Ilse Kaaja, Suvi Douglas, Tuulia Räisänen, Sadiksha Adhikari, Markus Vähä-Koskela, Caroline Heckman, Jenni Lahtela, Ulla Wartiovaara-Kautto, Esa Pitkänen, Outi Kilpivaara
Publikováno v:
HemaSphere, Vol 7, p e8517818 (2023)
Externí odkaz:
https://doaj.org/article/708260efd88a41cea3e25e302d29c906
Autor:
Laura Langohr, Kristina Gruden, Vid Podpečan, Nada Lavrač, Marko Petek, Hannu Toivonen, Igor Mozetič
Publikováno v:
The Computer Journal. 56:289-303
Subgroup discovery methods find interesting subsets of objects of a given class. Motivated by an application in bioinformatics, we first define a generalized subgroup discovery problem. In this setting, a subgroup is interesting if its members are ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::760fa8b34a09bad21d7aafe1449c4903
https://doi.org/10.1093/comjnl/bxs132
https://doi.org/10.1093/comjnl/bxs132
Autor:
Laura Langohr, Hannu Toivonen
Publikováno v:
SAC
We propose a relatively simple yet powerful model for choosing relevant and non-redundant pieces of information. The model addresses data mining or information retrieval settings where relevance is measured with respect to a set of key or query objec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73ed4a83ed6ab07811f5fba521b18f87
https://doi.org/10.1145/2245276.2245304
https://doi.org/10.1145/2245276.2245304
Publikováno v:
Bisociative Knowledge Discovery ISBN: 9783642318290
Bisociative Knowledge Discovery
Bisociative Knowledge Discovery
Subgroup discovery methods find interesting subsets of objects of a given class. We propose to extend subgroup discovery by a second subgroup discovery step to find interesting subgroups of objects specific for a class in one or more contrast classes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb106eb5c7829fb976b96014fcb6c95e
https://doi.org/10.1007/978-3-642-31830-6_28
https://doi.org/10.1007/978-3-642-31830-6_28
Autor:
Vid Podpečan, Igor Mozetič, Hannu Toivonen, Igor Trajkovski, Marko Petek, Kristina Gruden, Petra Kralj Novak, Helena Motaln, Laura Langohr, Kimmo Kulovesi, Nada Lavrač
Publikováno v:
BMC Bioinformatics
Scopus-Elsevier
BMC Bioinformatics, Vol 12, Iss 1, p 416 (2011)
Scopus-Elsevier
BMC Bioinformatics, Vol 12, Iss 1, p 416 (2011)
Background In experimental data analysis, bioinformatics researchers increasingly rely on tools that enable the composition and reuse of scientific workflows. The utility of current bioinformatics workflow environments can be significantly increased
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a7dbed18b2cb373fac18144dfcf76e0a
http://europepmc.org/articles/PMC3216973
http://europepmc.org/articles/PMC3216973
Autor:
Laura Langohr, Hannu Toivonen
Publikováno v:
University of Helsinki
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5ecec62ce6b10949809fb844f6de405b
https://researchportal.helsinki.fi/en/publications/74fc2b45-93d8-4bfb-8b05-3cb450fdb321
https://researchportal.helsinki.fi/en/publications/74fc2b45-93d8-4bfb-8b05-3cb450fdb321
Autor:
Laura Langohr, Hannu Toivonen
Publikováno v:
University of Helsinki
Bisociative Knowledge Discovery ISBN: 9783642318290
Bisociative Knowledge Discovery
Bisociative Knowledge Discovery ISBN: 9783642318290
Bisociative Knowledge Discovery
We introduce the problem of identifying representative nodes in probabilistic graphs, motivated by the need to produce different simple views to large BisoNets. We define a probabilistic similarity measure for nodes, and then apply clustering methods
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7735a318ee971fef56066b7d0ddeac87
https://researchportal.helsinki.fi/en/publications/2fa1b312-196b-4c3b-8362-c53cda6886bd
https://researchportal.helsinki.fi/en/publications/2fa1b312-196b-4c3b-8362-c53cda6886bd
Autor:
Laura Langohr
Publikováno v:
University of Helsinki
With the increasing amount of graph-structured data available, finding interesting objects, i.e., nodes in graphs, becomes more and more important. In this thesis we focus on finding interesting nodes and sets of nodes in graphs or networks. We propo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::fc3db1fc81dd7d06e635164a8bed6f68
https://researchportal.helsinki.fi/en/publications/82da0624-e7de-42a2-a7be-fcd501656ca9
https://researchportal.helsinki.fi/en/publications/82da0624-e7de-42a2-a7be-fcd501656ca9